/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:48:06,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:48:06,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:48:06,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:48:06,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:48:06,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:48:06,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:48:06,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:48:06,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:48:06,801 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:48:06,802 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:48:06,803 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:48:06,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:48:06,805 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:48:06,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:48:06,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:48:06,807 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:48:06,808 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:48:06,810 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:48:06,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:48:06,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:48:06,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:48:06,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:48:06,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:48:06,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:48:06,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:48:06,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:48:06,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:48:06,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:48:06,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:48:06,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:48:06,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:48:06,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:48:06,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:48:06,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:48:06,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:48:06,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:48:06,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:48:06,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:48:06,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:48:06,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:48:06,828 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:48:06,842 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:48:06,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:48:06,843 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:48:06,843 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:48:06,843 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:48:06,844 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:48:06,844 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:48:06,844 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:48:06,844 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:48:06,844 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:48:06,845 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:48:06,845 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:48:06,845 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:48:06,845 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:48:06,845 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:48:06,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:48:06,846 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:48:06,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:48:06,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:48:06,846 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:48:06,846 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:48:06,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:48:06,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:48:06,847 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:48:06,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:48:06,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:48:06,847 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:48:06,848 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:48:06,848 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:48:07,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:48:07,024 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:48:07,028 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:48:07,029 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:48:07,029 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:48:07,030 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:48:07,099 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_vL5tbr/tmp/3bc080fcff6c474c96a048ee87b33991/FLAGd032aeebf [2020-07-01 12:48:07,434 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:48:07,435 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:48:07,435 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:48:07,442 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_vL5tbr/tmp/3bc080fcff6c474c96a048ee87b33991/FLAGd032aeebf [2020-07-01 12:48:07,845 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_vL5tbr/tmp/3bc080fcff6c474c96a048ee87b33991 [2020-07-01 12:48:07,856 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:48:07,858 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:48:07,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:48:07,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:48:07,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:48:07,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:48:07" (1/1) ... [2020-07-01 12:48:07,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e2145d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:07, skipping insertion in model container [2020-07-01 12:48:07,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:48:07" (1/1) ... [2020-07-01 12:48:07,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:48:07,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:48:08,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:48:08,126 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:48:08,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:48:08,158 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:48:08,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08 WrapperNode [2020-07-01 12:48:08,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:48:08,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:48:08,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:48:08,160 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:48:08,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,200 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:48:08,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:48:08,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:48:08,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:48:08,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:48:08,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:48:08,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:48:08,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:48:08,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:48:08,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:48:08,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:48:08,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:48:08,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:48:08,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:48:08,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:48:08,690 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:48:08,691 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 12:48:08,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:48:08 BoogieIcfgContainer [2020-07-01 12:48:08,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:48:08,696 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:48:08,696 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:48:08,698 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:48:08,699 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,714 INFO L313 BlockEncoder]: Initial Icfg 52 locations, 55 edges [2020-07-01 12:48:08,716 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:48:08,717 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:48:08,717 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:48:08,717 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:48:08,719 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:48:08,720 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:48:08,720 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:48:08,745 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:48:08,780 INFO L200 BlockEncoder]: SBE split 27 edges [2020-07-01 12:48:08,785 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:48:08,787 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:48:08,808 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-07-01 12:48:08,811 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states [2020-07-01 12:48:08,813 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:48:08,813 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:48:08,813 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:48:08,814 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:48:08,814 INFO L313 BlockEncoder]: Encoded RCFG 44 locations, 77 edges [2020-07-01 12:48:08,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:48:08 BasicIcfg [2020-07-01 12:48:08,815 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:48:08,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:48:08,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:48:08,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:48:08,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:48:07" (1/4) ... [2020-07-01 12:48:08,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2579cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:48:08, skipping insertion in model container [2020-07-01 12:48:08,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (2/4) ... [2020-07-01 12:48:08,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2579cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:48:08, skipping insertion in model container [2020-07-01 12:48:08,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:48:08" (3/4) ... [2020-07-01 12:48:08,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2579cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:48:08, skipping insertion in model container [2020-07-01 12:48:08,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:48:08" (4/4) ... [2020-07-01 12:48:08,823 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:48:08,834 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:48:08,842 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 26 error locations. [2020-07-01 12:48:08,856 INFO L251 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2020-07-01 12:48:08,879 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:48:08,879 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:48:08,879 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:48:08,880 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:48:08,880 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:48:08,880 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:48:08,880 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:48:08,880 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:48:08,895 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-07-01 12:48:08,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:48:08,901 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:08,902 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:48:08,902 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:48:08,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:08,908 INFO L82 PathProgramCache]: Analyzing trace with hash 124290, now seen corresponding path program 1 times [2020-07-01 12:48:08,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:08,919 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035120574] [2020-07-01 12:48:08,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:09,077 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035120574] [2020-07-01 12:48:09,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:09,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:09,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890864470] [2020-07-01 12:48:09,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:09,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:09,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:09,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:09,101 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-07-01 12:48:09,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:09,264 INFO L93 Difference]: Finished difference Result 86 states and 145 transitions. [2020-07-01 12:48:09,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:09,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:48:09,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:09,279 INFO L225 Difference]: With dead ends: 86 [2020-07-01 12:48:09,279 INFO L226 Difference]: Without dead ends: 44 [2020-07-01 12:48:09,282 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:09,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-01 12:48:09,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-01 12:48:09,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-01 12:48:09,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2020-07-01 12:48:09,321 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 70 transitions. Word has length 3 [2020-07-01 12:48:09,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:09,321 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 70 transitions. [2020-07-01 12:48:09,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:09,321 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2020-07-01 12:48:09,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:48:09,322 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:09,322 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:48:09,324 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:48:09,324 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:48:09,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:09,324 INFO L82 PathProgramCache]: Analyzing trace with hash 124352, now seen corresponding path program 1 times [2020-07-01 12:48:09,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:09,325 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56763739] [2020-07-01 12:48:09,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:09,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:09,383 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56763739] [2020-07-01 12:48:09,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:09,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:09,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748615866] [2020-07-01 12:48:09,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:09,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:09,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:09,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:09,386 INFO L87 Difference]: Start difference. First operand 44 states and 70 transitions. Second operand 3 states. [2020-07-01 12:48:09,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:09,497 INFO L93 Difference]: Finished difference Result 44 states and 70 transitions. [2020-07-01 12:48:09,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:09,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:48:09,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:09,499 INFO L225 Difference]: With dead ends: 44 [2020-07-01 12:48:09,499 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 12:48:09,500 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:09,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 12:48:09,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-01 12:48:09,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 12:48:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 66 transitions. [2020-07-01 12:48:09,505 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 66 transitions. Word has length 3 [2020-07-01 12:48:09,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:09,506 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 66 transitions. [2020-07-01 12:48:09,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:09,506 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2020-07-01 12:48:09,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:48:09,506 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:09,507 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:48:09,507 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:48:09,507 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:48:09,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:09,507 INFO L82 PathProgramCache]: Analyzing trace with hash 124354, now seen corresponding path program 1 times [2020-07-01 12:48:09,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:09,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36509231] [2020-07-01 12:48:09,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:09,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:09,541 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36509231] [2020-07-01 12:48:09,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:09,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:09,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310108732] [2020-07-01 12:48:09,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:09,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:09,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:09,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:09,543 INFO L87 Difference]: Start difference. First operand 42 states and 66 transitions. Second operand 3 states. [2020-07-01 12:48:09,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:09,628 INFO L93 Difference]: Finished difference Result 44 states and 66 transitions. [2020-07-01 12:48:09,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:09,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:48:09,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:09,630 INFO L225 Difference]: With dead ends: 44 [2020-07-01 12:48:09,630 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 12:48:09,631 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:09,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 12:48:09,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-01 12:48:09,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 12:48:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 64 transitions. [2020-07-01 12:48:09,636 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 64 transitions. Word has length 3 [2020-07-01 12:48:09,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:09,636 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 64 transitions. [2020-07-01 12:48:09,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 64 transitions. [2020-07-01 12:48:09,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:48:09,637 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:09,637 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:48:09,637 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:48:09,638 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:48:09,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:09,638 INFO L82 PathProgramCache]: Analyzing trace with hash 124355, now seen corresponding path program 1 times [2020-07-01 12:48:09,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:09,639 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127390692] [2020-07-01 12:48:09,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:09,682 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127390692] [2020-07-01 12:48:09,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:09,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:09,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353872422] [2020-07-01 12:48:09,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:09,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:09,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:09,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:09,684 INFO L87 Difference]: Start difference. First operand 42 states and 64 transitions. Second operand 3 states. [2020-07-01 12:48:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:09,779 INFO L93 Difference]: Finished difference Result 42 states and 64 transitions. [2020-07-01 12:48:09,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:09,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:48:09,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:09,781 INFO L225 Difference]: With dead ends: 42 [2020-07-01 12:48:09,781 INFO L226 Difference]: Without dead ends: 40 [2020-07-01 12:48:09,781 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:09,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-01 12:48:09,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-01 12:48:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 12:48:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 62 transitions. [2020-07-01 12:48:09,786 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 62 transitions. Word has length 3 [2020-07-01 12:48:09,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:09,786 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 62 transitions. [2020-07-01 12:48:09,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:09,787 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 62 transitions. [2020-07-01 12:48:09,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:48:09,787 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:09,788 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:48:09,788 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:48:09,788 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:48:09,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:09,788 INFO L82 PathProgramCache]: Analyzing trace with hash 3852509, now seen corresponding path program 1 times [2020-07-01 12:48:09,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:09,789 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036269642] [2020-07-01 12:48:09,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:09,831 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036269642] [2020-07-01 12:48:09,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:09,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:09,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887813009] [2020-07-01 12:48:09,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:09,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:09,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:09,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:09,833 INFO L87 Difference]: Start difference. First operand 40 states and 62 transitions. Second operand 3 states. [2020-07-01 12:48:09,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:09,923 INFO L93 Difference]: Finished difference Result 40 states and 62 transitions. [2020-07-01 12:48:09,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:09,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:48:09,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:09,924 INFO L225 Difference]: With dead ends: 40 [2020-07-01 12:48:09,924 INFO L226 Difference]: Without dead ends: 36 [2020-07-01 12:48:09,925 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:09,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-01 12:48:09,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-01 12:48:09,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-01 12:48:09,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 54 transitions. [2020-07-01 12:48:09,929 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 54 transitions. Word has length 4 [2020-07-01 12:48:09,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:09,929 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 54 transitions. [2020-07-01 12:48:09,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:09,930 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 54 transitions. [2020-07-01 12:48:09,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:48:09,930 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:09,930 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:48:09,930 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:48:09,931 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:48:09,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:09,932 INFO L82 PathProgramCache]: Analyzing trace with hash 3852511, now seen corresponding path program 1 times [2020-07-01 12:48:09,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:09,932 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780633737] [2020-07-01 12:48:09,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:09,980 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780633737] [2020-07-01 12:48:09,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:09,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:09,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131039672] [2020-07-01 12:48:09,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:09,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:09,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:09,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:09,982 INFO L87 Difference]: Start difference. First operand 36 states and 54 transitions. Second operand 3 states. [2020-07-01 12:48:10,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:10,063 INFO L93 Difference]: Finished difference Result 36 states and 54 transitions. [2020-07-01 12:48:10,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:10,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:48:10,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:10,064 INFO L225 Difference]: With dead ends: 36 [2020-07-01 12:48:10,064 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 12:48:10,065 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:10,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 12:48:10,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 12:48:10,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 12:48:10,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2020-07-01 12:48:10,069 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 4 [2020-07-01 12:48:10,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:10,069 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2020-07-01 12:48:10,069 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2020-07-01 12:48:10,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:48:10,070 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:10,070 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:48:10,070 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:48:10,070 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:48:10,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:10,071 INFO L82 PathProgramCache]: Analyzing trace with hash 119426219, now seen corresponding path program 1 times [2020-07-01 12:48:10,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:10,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822513599] [2020-07-01 12:48:10,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:10,099 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822513599] [2020-07-01 12:48:10,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:10,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:10,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387510300] [2020-07-01 12:48:10,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:10,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:10,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:10,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:10,101 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 3 states. [2020-07-01 12:48:10,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:10,159 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2020-07-01 12:48:10,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:10,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:48:10,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:10,160 INFO L225 Difference]: With dead ends: 39 [2020-07-01 12:48:10,160 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 12:48:10,161 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:10,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 12:48:10,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 12:48:10,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 12:48:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-07-01 12:48:10,165 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 5 [2020-07-01 12:48:10,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:10,166 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-07-01 12:48:10,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:10,166 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-07-01 12:48:10,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:48:10,167 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:10,167 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:48:10,167 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:48:10,167 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:48:10,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:10,168 INFO L82 PathProgramCache]: Analyzing trace with hash 119426220, now seen corresponding path program 1 times [2020-07-01 12:48:10,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:10,168 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561619161] [2020-07-01 12:48:10,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:10,213 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561619161] [2020-07-01 12:48:10,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:10,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:10,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289679752] [2020-07-01 12:48:10,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:10,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:10,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:10,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:10,216 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 3 states. [2020-07-01 12:48:10,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:10,271 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2020-07-01 12:48:10,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:10,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:48:10,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:10,272 INFO L225 Difference]: With dead ends: 32 [2020-07-01 12:48:10,273 INFO L226 Difference]: Without dead ends: 25 [2020-07-01 12:48:10,273 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:10,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-01 12:48:10,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-01 12:48:10,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:48:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2020-07-01 12:48:10,276 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 5 [2020-07-01 12:48:10,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:10,276 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-07-01 12:48:10,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:10,277 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2020-07-01 12:48:10,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:48:10,277 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:10,277 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:48:10,277 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:48:10,277 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:48:10,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:10,278 INFO L82 PathProgramCache]: Analyzing trace with hash 119426217, now seen corresponding path program 1 times [2020-07-01 12:48:10,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:10,278 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825465623] [2020-07-01 12:48:10,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:10,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:10,316 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825465623] [2020-07-01 12:48:10,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:10,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:10,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413588667] [2020-07-01 12:48:10,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:10,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:10,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:10,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:10,318 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 3 states. [2020-07-01 12:48:10,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:10,360 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2020-07-01 12:48:10,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:10,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:48:10,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:10,361 INFO L225 Difference]: With dead ends: 25 [2020-07-01 12:48:10,361 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:48:10,362 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:10,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:48:10,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:48:10,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:48:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:48:10,363 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-07-01 12:48:10,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:10,363 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:48:10,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:48:10,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:48:10,363 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:48:10,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:48:10,402 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 12:48:10,402 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 12:48:10,402 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 12:48:10,402 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:48:10,402 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:48:10,402 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:48:10,402 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:48:10,403 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:48:10,403 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:48:10,403 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:48:10,403 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-01 12:48:10,403 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:48:10,403 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:48:10,403 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:48:10,403 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 12:48:10,404 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:48:10,404 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:48:10,404 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:48:10,404 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:48:10,404 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-01 12:48:10,404 INFO L268 CegarLoopResult]: For program point L17-2(lines 17 23) no Hoare annotation was computed. [2020-07-01 12:48:10,404 INFO L268 CegarLoopResult]: For program point L13(lines 13 16) no Hoare annotation was computed. [2020-07-01 12:48:10,405 INFO L264 CegarLoopResult]: At program point L17-4(lines 17 23) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~z_ref~0.base)) (= (select |#valid| ULTIMATE.start_test_fun_~z_ref~0.base) 1) (<= 1 |#StackHeapBarrier|) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= 0 ULTIMATE.start_test_fun_~z_ref~0.offset) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 12:48:10,405 INFO L268 CegarLoopResult]: For program point L17-5(lines 17 23) no Hoare annotation was computed. [2020-07-01 12:48:10,405 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:48:10,405 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 12:48:10,405 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:48:10,405 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:48:10,405 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-07-01 12:48:10,406 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:48:10,406 INFO L268 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2020-07-01 12:48:10,406 INFO L268 CegarLoopResult]: For program point L22-2(line 22) no Hoare annotation was computed. [2020-07-01 12:48:10,406 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:48:10,407 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 12:48:10,407 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:48:10,407 INFO L268 CegarLoopResult]: For program point L18-1(lines 18 21) no Hoare annotation was computed. [2020-07-01 12:48:10,407 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:48:10,407 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:48:10,407 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:48:10,407 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 12:48:10,407 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 12:48:10,407 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:48:10,408 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:48:10,408 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:48:10,411 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:48:10,420 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:10,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:10,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:10,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:10,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:10,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:10,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:10,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:10,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:48:10 BasicIcfg [2020-07-01 12:48:10,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:48:10,433 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:48:10,433 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:48:10,437 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:48:10,437 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:48:10,438 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:48:07" (1/5) ... [2020-07-01 12:48:10,438 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7dd1b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:48:10, skipping insertion in model container [2020-07-01 12:48:10,438 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:48:10,438 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (2/5) ... [2020-07-01 12:48:10,439 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7dd1b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:48:10, skipping insertion in model container [2020-07-01 12:48:10,439 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:48:10,439 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:48:08" (3/5) ... [2020-07-01 12:48:10,439 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7dd1b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:48:10, skipping insertion in model container [2020-07-01 12:48:10,439 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:48:10,439 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:48:08" (4/5) ... [2020-07-01 12:48:10,440 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7dd1b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:48:10, skipping insertion in model container [2020-07-01 12:48:10,440 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:48:10,440 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:48:10" (5/5) ... [2020-07-01 12:48:10,441 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:48:10,464 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:48:10,464 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:48:10,464 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:48:10,464 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:48:10,464 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:48:10,464 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:48:10,464 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:48:10,464 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:48:10,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2020-07-01 12:48:10,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-01 12:48:10,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:48:10,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:48:10,481 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:48:10,481 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:48:10,481 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:48:10,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2020-07-01 12:48:10,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-01 12:48:10,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:48:10,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:48:10,484 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:48:10,484 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:48:10,490 INFO L794 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRYtrue [93] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 17#L-1true [159] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet14_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_1, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_main_#t~ret15=|v_ULTIMATE.start_main_#t~ret15_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_main_#t~ret15, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 19#L10true [83] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 33#L10-1true [114] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 38#L11true [94] L11-->L12: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 22#L12true [105] L12-->L13: Formula: (and (= (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem3_2|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 43#L13true [137] L13-->L17-4: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem3_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 44#L17-4true [2020-07-01 12:48:10,491 INFO L796 eck$LassoCheckResult]: Loop: 44#L17-4true [124] L17-4-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 28#L17-1true [110] L17-1-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_23|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 26#L17-2true [109] L17-2-->L18: Formula: (<= |v_ULTIMATE.start_test_fun_#t~mem6_6| |v_ULTIMATE.start_test_fun_#t~mem5_6|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 11#L18true [75] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (= 1 (select |v_#valid_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 8#L18-1true [149] L18-1-->L22: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem7_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 39#L22true [97] L22-->L22-1: Formula: (and (= (select |v_#valid_33| v_ULTIMATE.start_test_fun_~z_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_11 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~z_ref~0.base_15)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~z_ref~0.base_15) v_ULTIMATE.start_test_fun_~z_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_11)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_33|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 36#L22-1true [90] L22-1-->L22-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) (= 1 (select |v_#valid_35| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 15#L22-2true [223] L22-2-->L17-4: Formula: (and (= |v_#memory_int_21| (store |v_#memory_int_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_27 (store (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_27) v_ULTIMATE.start_test_fun_~z_ref~0.offset_20 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| |v_ULTIMATE.start_test_fun_#t~mem10_6|)))) (= 1 (select |v_#valid_51| v_ULTIMATE.start_test_fun_~z_ref~0.base_27)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_20) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_20 4) (select |v_#length_34| v_ULTIMATE.start_test_fun_~z_ref~0.base_27))) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_27, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_22|, #length=|v_#length_34|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_20} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_27, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_21|, #length=|v_#length_34|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_20} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int, ULTIMATE.start_test_fun_#t~mem9] 44#L17-4true [2020-07-01 12:48:10,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:10,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1281483396, now seen corresponding path program 1 times [2020-07-01 12:48:10,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:10,493 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324232369] [2020-07-01 12:48:10,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:10,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:48:10,515 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324232369] [2020-07-01 12:48:10,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:10,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:10,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250458486] [2020-07-01 12:48:10,517 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:48:10,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:10,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1588196002, now seen corresponding path program 1 times [2020-07-01 12:48:10,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:10,518 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786043365] [2020-07-01 12:48:10,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:48:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:48:10,555 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:48:10,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:10,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:10,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:10,664 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-07-01 12:48:10,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:10,753 INFO L93 Difference]: Finished difference Result 44 states and 70 transitions. [2020-07-01 12:48:10,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:10,756 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:48:10,761 INFO L168 Benchmark]: Toolchain (without parser) took 2902.66 ms. Allocated memory was 649.6 MB in the beginning and 757.6 MB in the end (delta: 108.0 MB). Free memory was 556.0 MB in the beginning and 702.0 MB in the end (delta: -146.0 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:48:10,761 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 577.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:48:10,762 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.42 ms. Allocated memory was 649.6 MB in the beginning and 689.4 MB in the end (delta: 39.8 MB). Free memory was 556.0 MB in the beginning and 651.2 MB in the end (delta: -95.2 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:10,763 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.61 ms. Allocated memory is still 689.4 MB. Free memory was 651.2 MB in the beginning and 649.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:10,763 INFO L168 Benchmark]: Boogie Preprocessor took 24.75 ms. Allocated memory is still 689.4 MB. Free memory was 649.1 MB in the beginning and 648.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:10,764 INFO L168 Benchmark]: RCFGBuilder took 470.01 ms. Allocated memory is still 689.4 MB. Free memory was 648.0 MB in the beginning and 620.4 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:10,764 INFO L168 Benchmark]: BlockEncodingV2 took 119.38 ms. Allocated memory is still 689.4 MB. Free memory was 619.3 MB in the beginning and 608.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:10,765 INFO L168 Benchmark]: TraceAbstraction took 1616.69 ms. Allocated memory is still 689.4 MB. Free memory was 608.5 MB in the beginning and 421.8 MB in the end (delta: 186.8 MB). Peak memory consumption was 186.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:10,765 INFO L168 Benchmark]: BuchiAutomizer took 325.11 ms. Allocated memory was 689.4 MB in the beginning and 757.6 MB in the end (delta: 68.2 MB). Free memory was 420.7 MB in the beginning and 702.0 MB in the end (delta: -281.3 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:48:10,769 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 52 locations, 55 edges - StatisticsResult: Encoded RCFG 44 locations, 77 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 577.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 300.42 ms. Allocated memory was 649.6 MB in the beginning and 689.4 MB in the end (delta: 39.8 MB). Free memory was 556.0 MB in the beginning and 651.2 MB in the end (delta: -95.2 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.61 ms. Allocated memory is still 689.4 MB. Free memory was 651.2 MB in the beginning and 649.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.75 ms. Allocated memory is still 689.4 MB. Free memory was 649.1 MB in the beginning and 648.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 470.01 ms. Allocated memory is still 689.4 MB. Free memory was 648.0 MB in the beginning and 620.4 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 119.38 ms. Allocated memory is still 689.4 MB. Free memory was 619.3 MB in the beginning and 608.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1616.69 ms. Allocated memory is still 689.4 MB. Free memory was 608.5 MB in the beginning and 421.8 MB in the end (delta: 186.8 MB). Peak memory consumption was 186.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 325.11 ms. Allocated memory was 689.4 MB in the beginning and 757.6 MB in the end (delta: 68.2 MB). Free memory was 420.7 MB in the beginning and 702.0 MB in the end (delta: -281.3 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 26 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant [2020-07-01 12:48:10,779 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:10,779 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:10,779 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:10,779 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:10,780 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:10,780 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:10,781 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:10,781 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((1 == \valid[x_ref] && y_ref == 0) && 4 == unknown-#length-unknown[x_ref]) && 4 == unknown-#length-unknown[z_ref]) && \valid[z_ref] == 1) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[y_ref] == 4) && 0 == z_ref) && 1 == \valid[y_ref]) && 0 == x_ref - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 26 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.4s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 60 SDtfs, 426 SDslu, 5 SDs, 0 SdLazy, 394 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 43 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:48:04.531 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_vL5tbr/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:48:11.005 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check