java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:22:38,945 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:22:38,947 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:22:38,959 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:22:38,960 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:22:38,961 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:22:38,962 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:22:38,964 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:22:38,966 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:22:38,966 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:22:38,967 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:22:38,968 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:22:38,969 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:22:38,969 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:22:38,971 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:22:38,971 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:22:38,972 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:22:38,974 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:22:38,977 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:22:38,981 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:22:38,985 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:22:38,986 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:22:38,992 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:22:38,993 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:22:38,993 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:22:38,994 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:22:38,995 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:22:38,995 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:22:38,999 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:22:39,001 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:22:39,002 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:22:39,002 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:22:39,003 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:22:39,004 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:22:39,005 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:22:39,006 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:22:39,006 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:22:39,020 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:22:39,021 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:22:39,022 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:22:39,022 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:22:39,022 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:22:39,023 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:22:39,023 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:22:39,023 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:22:39,023 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:22:39,024 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:22:39,024 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:22:39,024 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:22:39,024 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:22:39,024 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:22:39,025 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:22:39,025 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:22:39,025 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:22:39,025 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:22:39,025 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:22:39,026 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:22:39,026 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:22:39,026 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:22:39,026 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:22:39,026 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:22:39,026 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:22:39,027 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:22:39,027 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:22:39,027 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:22:39,027 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:22:39,028 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:22:39,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:22:39,084 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:22:39,088 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:22:39,090 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:22:39,090 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:22:39,091 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-14 17:22:39,154 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfe5adfde/3de49003283c4b75b6b8e03cfa327df1/FLAG9d40a52da [2018-11-14 17:22:39,625 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:22:39,625 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-14 17:22:39,632 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfe5adfde/3de49003283c4b75b6b8e03cfa327df1/FLAG9d40a52da [2018-11-14 17:22:39,655 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfe5adfde/3de49003283c4b75b6b8e03cfa327df1 [2018-11-14 17:22:39,665 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:22:39,666 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:22:39,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:22:39,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:22:39,672 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:22:39,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:22:39" (1/1) ... [2018-11-14 17:22:39,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@370ba16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:39, skipping insertion in model container [2018-11-14 17:22:39,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:22:39" (1/1) ... [2018-11-14 17:22:39,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:22:39,718 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:22:39,989 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:22:40,003 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:22:40,038 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:22:40,074 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:22:40,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:40 WrapperNode [2018-11-14 17:22:40,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:22:40,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:22:40,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:22:40,076 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:22:40,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:40" (1/1) ... [2018-11-14 17:22:40,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:40" (1/1) ... [2018-11-14 17:22:40,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:40" (1/1) ... [2018-11-14 17:22:40,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:40" (1/1) ... [2018-11-14 17:22:40,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:40" (1/1) ... [2018-11-14 17:22:40,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:40" (1/1) ... [2018-11-14 17:22:40,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:40" (1/1) ... [2018-11-14 17:22:40,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:22:40,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:22:40,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:22:40,155 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:22:40,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:22:40,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:22:40,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:22:40,301 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-11-14 17:22:40,301 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-14 17:22:40,301 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-14 17:22:40,302 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-14 17:22:40,302 INFO L138 BoogieDeclarations]: Found implementation of procedure malloc [2018-11-14 17:22:40,302 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:22:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:22:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-11-14 17:22:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-14 17:22:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 17:22:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:22:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-14 17:22:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 17:22:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-14 17:22:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:22:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 17:22:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:22:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:22:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:22:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:22:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:22:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:22:41,197 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:22:41,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:22:41 BoogieIcfgContainer [2018-11-14 17:22:41,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:22:41,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:22:41,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:22:41,203 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:22:41,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:22:39" (1/3) ... [2018-11-14 17:22:41,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be3a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:22:41, skipping insertion in model container [2018-11-14 17:22:41,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:40" (2/3) ... [2018-11-14 17:22:41,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be3a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:22:41, skipping insertion in model container [2018-11-14 17:22:41,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:22:41" (3/3) ... [2018-11-14 17:22:41,206 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-14 17:22:41,217 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:22:41,225 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:22:41,243 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:22:41,276 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:22:41,277 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:22:41,278 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:22:41,278 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:22:41,278 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:22:41,278 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:22:41,279 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:22:41,279 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:22:41,279 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:22:41,299 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-14 17:22:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 17:22:41,308 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:41,309 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:41,312 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:41,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:41,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1866402238, now seen corresponding path program 1 times [2018-11-14 17:22:41,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:41,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:41,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:41,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:41,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:41,550 INFO L256 TraceCheckUtils]: 0: Hoare triple {54#true} call ULTIMATE.init(); {54#true} is VALID [2018-11-14 17:22:41,554 INFO L273 TraceCheckUtils]: 1: Hoare triple {54#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4);~counter~0 := 1; {54#true} is VALID [2018-11-14 17:22:41,554 INFO L273 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID [2018-11-14 17:22:41,555 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} #109#return; {54#true} is VALID [2018-11-14 17:22:41,555 INFO L256 TraceCheckUtils]: 4: Hoare triple {54#true} call #t~ret9 := main(); {54#true} is VALID [2018-11-14 17:22:41,556 INFO L273 TraceCheckUtils]: 5: Hoare triple {54#true} havoc ~a~0.base, ~a~0.offset;havoc ~b~0.base, ~b~0.offset; {54#true} is VALID [2018-11-14 17:22:41,556 INFO L256 TraceCheckUtils]: 6: Hoare triple {54#true} call init(); {54#true} is VALID [2018-11-14 17:22:41,556 INFO L273 TraceCheckUtils]: 7: Hoare triple {54#true} havoc ~i~0;~i~0 := 0; {54#true} is VALID [2018-11-14 17:22:41,557 INFO L273 TraceCheckUtils]: 8: Hoare triple {54#true} assume !true; {55#false} is VALID [2018-11-14 17:22:41,557 INFO L273 TraceCheckUtils]: 9: Hoare triple {55#false} assume true; {55#false} is VALID [2018-11-14 17:22:41,558 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {55#false} {54#true} #95#return; {55#false} is VALID [2018-11-14 17:22:41,558 INFO L256 TraceCheckUtils]: 11: Hoare triple {55#false} call #t~ret7.base, #t~ret7.offset := malloc(4); {54#true} is VALID [2018-11-14 17:22:41,558 INFO L273 TraceCheckUtils]: 12: Hoare triple {54#true} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {54#true} is VALID [2018-11-14 17:22:41,559 INFO L273 TraceCheckUtils]: 13: Hoare triple {54#true} assume true; {54#true} is VALID [2018-11-14 17:22:41,559 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {54#true} {55#false} #97#return; {55#false} is VALID [2018-11-14 17:22:41,560 INFO L273 TraceCheckUtils]: 15: Hoare triple {55#false} ~a~0.base, ~a~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {55#false} is VALID [2018-11-14 17:22:41,560 INFO L256 TraceCheckUtils]: 16: Hoare triple {55#false} call #t~ret8.base, #t~ret8.offset := malloc(4); {54#true} is VALID [2018-11-14 17:22:41,560 INFO L273 TraceCheckUtils]: 17: Hoare triple {54#true} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {54#true} is VALID [2018-11-14 17:22:41,561 INFO L273 TraceCheckUtils]: 18: Hoare triple {54#true} assume true; {54#true} is VALID [2018-11-14 17:22:41,561 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {54#true} {55#false} #99#return; {55#false} is VALID [2018-11-14 17:22:41,561 INFO L273 TraceCheckUtils]: 20: Hoare triple {55#false} ~b~0.base, ~b~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {55#false} is VALID [2018-11-14 17:22:41,562 INFO L273 TraceCheckUtils]: 21: Hoare triple {55#false} assume !((~a~0.base == 0 && ~a~0.offset == 0) || (~b~0.base == 0 && ~b~0.offset == 0)); {55#false} is VALID [2018-11-14 17:22:41,562 INFO L256 TraceCheckUtils]: 22: Hoare triple {55#false} call f(~a~0.base, ~a~0.offset); {54#true} is VALID [2018-11-14 17:22:41,562 INFO L273 TraceCheckUtils]: 23: Hoare triple {54#true} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {54#true} is VALID [2018-11-14 17:22:41,563 INFO L273 TraceCheckUtils]: 24: Hoare triple {54#true} assume !true; {54#true} is VALID [2018-11-14 17:22:41,563 INFO L273 TraceCheckUtils]: 25: Hoare triple {54#true} assume true; {54#true} is VALID [2018-11-14 17:22:41,563 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {54#true} {55#false} #101#return; {55#false} is VALID [2018-11-14 17:22:41,564 INFO L256 TraceCheckUtils]: 27: Hoare triple {55#false} call f(~b~0.base, ~b~0.offset); {54#true} is VALID [2018-11-14 17:22:41,564 INFO L273 TraceCheckUtils]: 28: Hoare triple {54#true} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {54#true} is VALID [2018-11-14 17:22:41,564 INFO L273 TraceCheckUtils]: 29: Hoare triple {54#true} assume !true; {54#true} is VALID [2018-11-14 17:22:41,565 INFO L273 TraceCheckUtils]: 30: Hoare triple {54#true} assume true; {54#true} is VALID [2018-11-14 17:22:41,565 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {54#true} {55#false} #103#return; {55#false} is VALID [2018-11-14 17:22:41,565 INFO L256 TraceCheckUtils]: 32: Hoare triple {55#false} call g(~a~0.base, ~a~0.offset); {55#false} is VALID [2018-11-14 17:22:41,566 INFO L273 TraceCheckUtils]: 33: Hoare triple {55#false} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~2;~i~2 := 0; {55#false} is VALID [2018-11-14 17:22:41,566 INFO L273 TraceCheckUtils]: 34: Hoare triple {55#false} assume true; {55#false} is VALID [2018-11-14 17:22:41,566 INFO L273 TraceCheckUtils]: 35: Hoare triple {55#false} assume !!(~i~2 < 2);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~2 * 4, 4); {55#false} is VALID [2018-11-14 17:22:41,567 INFO L273 TraceCheckUtils]: 36: Hoare triple {55#false} assume #t~mem4.base == ~pointer.base && #t~mem4.offset == ~pointer.offset;havoc #t~mem4.base, #t~mem4.offset;call #t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + ~i~2 * 4, 4); {55#false} is VALID [2018-11-14 17:22:41,567 INFO L273 TraceCheckUtils]: 37: Hoare triple {55#false} assume !(#t~mem5 == 1); {55#false} is VALID [2018-11-14 17:22:41,567 INFO L256 TraceCheckUtils]: 38: Hoare triple {55#false} call __blast_assert(); {55#false} is VALID [2018-11-14 17:22:41,568 INFO L273 TraceCheckUtils]: 39: Hoare triple {55#false} assume !false; {55#false} is VALID [2018-11-14 17:22:41,576 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 17:22:41,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:22:41,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:22:41,585 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 40 [2018-11-14 17:22:41,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:41,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:22:41,727 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:41,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:22:41,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:22:41,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:22:41,739 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-11-14 17:22:42,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:42,079 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2018-11-14 17:22:42,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:22:42,080 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 40 [2018-11-14 17:22:42,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:42,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:22:42,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 116 transitions. [2018-11-14 17:22:42,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:22:42,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 116 transitions. [2018-11-14 17:22:42,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 116 transitions. [2018-11-14 17:22:42,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:42,832 INFO L225 Difference]: With dead ends: 89 [2018-11-14 17:22:42,832 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 17:22:42,836 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:22:42,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 17:22:42,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-14 17:22:42,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:42,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-14 17:22:42,934 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 17:22:42,934 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 17:22:42,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:42,941 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-14 17:22:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-14 17:22:42,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:42,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:42,942 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 17:22:42,943 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 17:22:42,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:42,949 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-14 17:22:42,949 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-14 17:22:42,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:42,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:42,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:42,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:42,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 17:22:42,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-14 17:22:42,961 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 40 [2018-11-14 17:22:42,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:42,962 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-14 17:22:42,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:22:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-14 17:22:42,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-14 17:22:42,967 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:42,967 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:42,968 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:42,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:42,968 INFO L82 PathProgramCache]: Analyzing trace with hash -44847792, now seen corresponding path program 1 times [2018-11-14 17:22:42,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:42,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:42,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:42,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:42,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:43,090 INFO L256 TraceCheckUtils]: 0: Hoare triple {332#true} call ULTIMATE.init(); {332#true} is VALID [2018-11-14 17:22:43,090 INFO L273 TraceCheckUtils]: 1: Hoare triple {332#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4);~counter~0 := 1; {332#true} is VALID [2018-11-14 17:22:43,091 INFO L273 TraceCheckUtils]: 2: Hoare triple {332#true} assume true; {332#true} is VALID [2018-11-14 17:22:43,091 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {332#true} {332#true} #109#return; {332#true} is VALID [2018-11-14 17:22:43,091 INFO L256 TraceCheckUtils]: 4: Hoare triple {332#true} call #t~ret9 := main(); {332#true} is VALID [2018-11-14 17:22:43,092 INFO L273 TraceCheckUtils]: 5: Hoare triple {332#true} havoc ~a~0.base, ~a~0.offset;havoc ~b~0.base, ~b~0.offset; {332#true} is VALID [2018-11-14 17:22:43,092 INFO L256 TraceCheckUtils]: 6: Hoare triple {332#true} call init(); {332#true} is VALID [2018-11-14 17:22:43,094 INFO L273 TraceCheckUtils]: 7: Hoare triple {332#true} havoc ~i~0;~i~0 := 0; {334#(= init_~i~0 0)} is VALID [2018-11-14 17:22:43,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {334#(= init_~i~0 0)} assume true; {334#(= init_~i~0 0)} is VALID [2018-11-14 17:22:43,097 INFO L273 TraceCheckUtils]: 9: Hoare triple {334#(= init_~i~0 0)} assume !(~i~0 < 2); {333#false} is VALID [2018-11-14 17:22:43,098 INFO L273 TraceCheckUtils]: 10: Hoare triple {333#false} assume true; {333#false} is VALID [2018-11-14 17:22:43,098 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {333#false} {332#true} #95#return; {333#false} is VALID [2018-11-14 17:22:43,098 INFO L256 TraceCheckUtils]: 12: Hoare triple {333#false} call #t~ret7.base, #t~ret7.offset := malloc(4); {332#true} is VALID [2018-11-14 17:22:43,099 INFO L273 TraceCheckUtils]: 13: Hoare triple {332#true} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {332#true} is VALID [2018-11-14 17:22:43,099 INFO L273 TraceCheckUtils]: 14: Hoare triple {332#true} assume true; {332#true} is VALID [2018-11-14 17:22:43,099 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {332#true} {333#false} #97#return; {333#false} is VALID [2018-11-14 17:22:43,100 INFO L273 TraceCheckUtils]: 16: Hoare triple {333#false} ~a~0.base, ~a~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {333#false} is VALID [2018-11-14 17:22:43,100 INFO L256 TraceCheckUtils]: 17: Hoare triple {333#false} call #t~ret8.base, #t~ret8.offset := malloc(4); {332#true} is VALID [2018-11-14 17:22:43,100 INFO L273 TraceCheckUtils]: 18: Hoare triple {332#true} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {332#true} is VALID [2018-11-14 17:22:43,101 INFO L273 TraceCheckUtils]: 19: Hoare triple {332#true} assume true; {332#true} is VALID [2018-11-14 17:22:43,101 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {332#true} {333#false} #99#return; {333#false} is VALID [2018-11-14 17:22:43,101 INFO L273 TraceCheckUtils]: 21: Hoare triple {333#false} ~b~0.base, ~b~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {333#false} is VALID [2018-11-14 17:22:43,102 INFO L273 TraceCheckUtils]: 22: Hoare triple {333#false} assume !((~a~0.base == 0 && ~a~0.offset == 0) || (~b~0.base == 0 && ~b~0.offset == 0)); {333#false} is VALID [2018-11-14 17:22:43,102 INFO L256 TraceCheckUtils]: 23: Hoare triple {333#false} call f(~a~0.base, ~a~0.offset); {332#true} is VALID [2018-11-14 17:22:43,103 INFO L273 TraceCheckUtils]: 24: Hoare triple {332#true} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {332#true} is VALID [2018-11-14 17:22:43,103 INFO L273 TraceCheckUtils]: 25: Hoare triple {332#true} assume true; {332#true} is VALID [2018-11-14 17:22:43,103 INFO L273 TraceCheckUtils]: 26: Hoare triple {332#true} assume !(~i~1 < 2); {332#true} is VALID [2018-11-14 17:22:43,104 INFO L273 TraceCheckUtils]: 27: Hoare triple {332#true} assume true; {332#true} is VALID [2018-11-14 17:22:43,104 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {332#true} {333#false} #101#return; {333#false} is VALID [2018-11-14 17:22:43,104 INFO L256 TraceCheckUtils]: 29: Hoare triple {333#false} call f(~b~0.base, ~b~0.offset); {332#true} is VALID [2018-11-14 17:22:43,105 INFO L273 TraceCheckUtils]: 30: Hoare triple {332#true} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {332#true} is VALID [2018-11-14 17:22:43,105 INFO L273 TraceCheckUtils]: 31: Hoare triple {332#true} assume true; {332#true} is VALID [2018-11-14 17:22:43,105 INFO L273 TraceCheckUtils]: 32: Hoare triple {332#true} assume !(~i~1 < 2); {332#true} is VALID [2018-11-14 17:22:43,106 INFO L273 TraceCheckUtils]: 33: Hoare triple {332#true} assume true; {332#true} is VALID [2018-11-14 17:22:43,106 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {332#true} {333#false} #103#return; {333#false} is VALID [2018-11-14 17:22:43,106 INFO L256 TraceCheckUtils]: 35: Hoare triple {333#false} call g(~a~0.base, ~a~0.offset); {333#false} is VALID [2018-11-14 17:22:43,107 INFO L273 TraceCheckUtils]: 36: Hoare triple {333#false} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~2;~i~2 := 0; {333#false} is VALID [2018-11-14 17:22:43,107 INFO L273 TraceCheckUtils]: 37: Hoare triple {333#false} assume true; {333#false} is VALID [2018-11-14 17:22:43,107 INFO L273 TraceCheckUtils]: 38: Hoare triple {333#false} assume !!(~i~2 < 2);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~2 * 4, 4); {333#false} is VALID [2018-11-14 17:22:43,108 INFO L273 TraceCheckUtils]: 39: Hoare triple {333#false} assume #t~mem4.base == ~pointer.base && #t~mem4.offset == ~pointer.offset;havoc #t~mem4.base, #t~mem4.offset;call #t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + ~i~2 * 4, 4); {333#false} is VALID [2018-11-14 17:22:43,108 INFO L273 TraceCheckUtils]: 40: Hoare triple {333#false} assume !(#t~mem5 == 1); {333#false} is VALID [2018-11-14 17:22:43,108 INFO L256 TraceCheckUtils]: 41: Hoare triple {333#false} call __blast_assert(); {333#false} is VALID [2018-11-14 17:22:43,109 INFO L273 TraceCheckUtils]: 42: Hoare triple {333#false} assume !false; {333#false} is VALID [2018-11-14 17:22:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 17:22:43,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:22:43,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:22:43,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-11-14 17:22:43,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:43,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:22:43,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:43,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:22:43,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:22:43,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:22:43,271 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 3 states. [2018-11-14 17:22:43,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:43,689 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-11-14 17:22:43,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:22:43,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-11-14 17:22:43,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:43,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:22:43,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2018-11-14 17:22:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:22:43,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2018-11-14 17:22:43,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2018-11-14 17:22:43,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:43,909 INFO L225 Difference]: With dead ends: 80 [2018-11-14 17:22:43,909 INFO L226 Difference]: Without dead ends: 47 [2018-11-14 17:22:43,911 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:22:43,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-14 17:22:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-11-14 17:22:43,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:43,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 46 states. [2018-11-14 17:22:43,943 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 46 states. [2018-11-14 17:22:43,944 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 46 states. [2018-11-14 17:22:43,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:43,948 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-11-14 17:22:43,948 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-11-14 17:22:43,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:43,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:43,950 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 47 states. [2018-11-14 17:22:43,950 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 47 states. [2018-11-14 17:22:43,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:43,954 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-11-14 17:22:43,955 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-11-14 17:22:43,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:43,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:43,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:43,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:43,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 17:22:43,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-11-14 17:22:43,960 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 43 [2018-11-14 17:22:43,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:43,961 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-14 17:22:43,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:22:43,961 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-14 17:22:43,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-14 17:22:43,963 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:43,963 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:43,963 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:43,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:43,964 INFO L82 PathProgramCache]: Analyzing trace with hash 992063202, now seen corresponding path program 1 times [2018-11-14 17:22:43,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:43,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:43,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:43,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:43,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:44,109 INFO L256 TraceCheckUtils]: 0: Hoare triple {612#true} call ULTIMATE.init(); {612#true} is VALID [2018-11-14 17:22:44,109 INFO L273 TraceCheckUtils]: 1: Hoare triple {612#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4);~counter~0 := 1; {612#true} is VALID [2018-11-14 17:22:44,110 INFO L273 TraceCheckUtils]: 2: Hoare triple {612#true} assume true; {612#true} is VALID [2018-11-14 17:22:44,110 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {612#true} {612#true} #109#return; {612#true} is VALID [2018-11-14 17:22:44,110 INFO L256 TraceCheckUtils]: 4: Hoare triple {612#true} call #t~ret9 := main(); {612#true} is VALID [2018-11-14 17:22:44,111 INFO L273 TraceCheckUtils]: 5: Hoare triple {612#true} havoc ~a~0.base, ~a~0.offset;havoc ~b~0.base, ~b~0.offset; {612#true} is VALID [2018-11-14 17:22:44,111 INFO L256 TraceCheckUtils]: 6: Hoare triple {612#true} call init(); {612#true} is VALID [2018-11-14 17:22:44,111 INFO L273 TraceCheckUtils]: 7: Hoare triple {612#true} havoc ~i~0;~i~0 := 0; {612#true} is VALID [2018-11-14 17:22:44,112 INFO L273 TraceCheckUtils]: 8: Hoare triple {612#true} assume true; {612#true} is VALID [2018-11-14 17:22:44,112 INFO L273 TraceCheckUtils]: 9: Hoare triple {612#true} assume !!(~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + ~i~0 * 4, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + ~i~0 * 4, 4); {612#true} is VALID [2018-11-14 17:22:44,112 INFO L273 TraceCheckUtils]: 10: Hoare triple {612#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {612#true} is VALID [2018-11-14 17:22:44,113 INFO L273 TraceCheckUtils]: 11: Hoare triple {612#true} assume true; {612#true} is VALID [2018-11-14 17:22:44,113 INFO L273 TraceCheckUtils]: 12: Hoare triple {612#true} assume !(~i~0 < 2); {612#true} is VALID [2018-11-14 17:22:44,113 INFO L273 TraceCheckUtils]: 13: Hoare triple {612#true} assume true; {612#true} is VALID [2018-11-14 17:22:44,114 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {612#true} {612#true} #95#return; {612#true} is VALID [2018-11-14 17:22:44,114 INFO L256 TraceCheckUtils]: 15: Hoare triple {612#true} call #t~ret7.base, #t~ret7.offset := malloc(4); {612#true} is VALID [2018-11-14 17:22:44,114 INFO L273 TraceCheckUtils]: 16: Hoare triple {612#true} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {612#true} is VALID [2018-11-14 17:22:44,114 INFO L273 TraceCheckUtils]: 17: Hoare triple {612#true} assume true; {612#true} is VALID [2018-11-14 17:22:44,115 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {612#true} {612#true} #97#return; {612#true} is VALID [2018-11-14 17:22:44,115 INFO L273 TraceCheckUtils]: 19: Hoare triple {612#true} ~a~0.base, ~a~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {612#true} is VALID [2018-11-14 17:22:44,115 INFO L256 TraceCheckUtils]: 20: Hoare triple {612#true} call #t~ret8.base, #t~ret8.offset := malloc(4); {612#true} is VALID [2018-11-14 17:22:44,116 INFO L273 TraceCheckUtils]: 21: Hoare triple {612#true} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {612#true} is VALID [2018-11-14 17:22:44,116 INFO L273 TraceCheckUtils]: 22: Hoare triple {612#true} assume true; {612#true} is VALID [2018-11-14 17:22:44,116 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {612#true} {612#true} #99#return; {612#true} is VALID [2018-11-14 17:22:44,116 INFO L273 TraceCheckUtils]: 24: Hoare triple {612#true} ~b~0.base, ~b~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {612#true} is VALID [2018-11-14 17:22:44,117 INFO L273 TraceCheckUtils]: 25: Hoare triple {612#true} assume !((~a~0.base == 0 && ~a~0.offset == 0) || (~b~0.base == 0 && ~b~0.offset == 0)); {612#true} is VALID [2018-11-14 17:22:44,117 INFO L256 TraceCheckUtils]: 26: Hoare triple {612#true} call f(~a~0.base, ~a~0.offset); {612#true} is VALID [2018-11-14 17:22:44,119 INFO L273 TraceCheckUtils]: 27: Hoare triple {612#true} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {614#(= f_~i~1 0)} is VALID [2018-11-14 17:22:44,123 INFO L273 TraceCheckUtils]: 28: Hoare triple {614#(= f_~i~1 0)} assume true; {614#(= f_~i~1 0)} is VALID [2018-11-14 17:22:44,123 INFO L273 TraceCheckUtils]: 29: Hoare triple {614#(= f_~i~1 0)} assume !(~i~1 < 2); {613#false} is VALID [2018-11-14 17:22:44,124 INFO L273 TraceCheckUtils]: 30: Hoare triple {613#false} assume true; {613#false} is VALID [2018-11-14 17:22:44,124 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {613#false} {612#true} #101#return; {613#false} is VALID [2018-11-14 17:22:44,124 INFO L256 TraceCheckUtils]: 32: Hoare triple {613#false} call f(~b~0.base, ~b~0.offset); {612#true} is VALID [2018-11-14 17:22:44,125 INFO L273 TraceCheckUtils]: 33: Hoare triple {612#true} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {612#true} is VALID [2018-11-14 17:22:44,125 INFO L273 TraceCheckUtils]: 34: Hoare triple {612#true} assume true; {612#true} is VALID [2018-11-14 17:22:44,125 INFO L273 TraceCheckUtils]: 35: Hoare triple {612#true} assume !(~i~1 < 2); {612#true} is VALID [2018-11-14 17:22:44,125 INFO L273 TraceCheckUtils]: 36: Hoare triple {612#true} assume true; {612#true} is VALID [2018-11-14 17:22:44,126 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {612#true} {613#false} #103#return; {613#false} is VALID [2018-11-14 17:22:44,126 INFO L256 TraceCheckUtils]: 38: Hoare triple {613#false} call g(~a~0.base, ~a~0.offset); {613#false} is VALID [2018-11-14 17:22:44,127 INFO L273 TraceCheckUtils]: 39: Hoare triple {613#false} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~2;~i~2 := 0; {613#false} is VALID [2018-11-14 17:22:44,127 INFO L273 TraceCheckUtils]: 40: Hoare triple {613#false} assume true; {613#false} is VALID [2018-11-14 17:22:44,127 INFO L273 TraceCheckUtils]: 41: Hoare triple {613#false} assume !!(~i~2 < 2);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~2 * 4, 4); {613#false} is VALID [2018-11-14 17:22:44,128 INFO L273 TraceCheckUtils]: 42: Hoare triple {613#false} assume #t~mem4.base == ~pointer.base && #t~mem4.offset == ~pointer.offset;havoc #t~mem4.base, #t~mem4.offset;call #t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + ~i~2 * 4, 4); {613#false} is VALID [2018-11-14 17:22:44,128 INFO L273 TraceCheckUtils]: 43: Hoare triple {613#false} assume !(#t~mem5 == 1); {613#false} is VALID [2018-11-14 17:22:44,128 INFO L256 TraceCheckUtils]: 44: Hoare triple {613#false} call __blast_assert(); {613#false} is VALID [2018-11-14 17:22:44,129 INFO L273 TraceCheckUtils]: 45: Hoare triple {613#false} assume !false; {613#false} is VALID [2018-11-14 17:22:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 17:22:44,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:22:44,133 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:22:44,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:44,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:22:44,663 INFO L256 TraceCheckUtils]: 0: Hoare triple {612#true} call ULTIMATE.init(); {612#true} is VALID [2018-11-14 17:22:44,663 INFO L273 TraceCheckUtils]: 1: Hoare triple {612#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4);~counter~0 := 1; {612#true} is VALID [2018-11-14 17:22:44,664 INFO L273 TraceCheckUtils]: 2: Hoare triple {612#true} assume true; {612#true} is VALID [2018-11-14 17:22:44,664 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {612#true} {612#true} #109#return; {612#true} is VALID [2018-11-14 17:22:44,664 INFO L256 TraceCheckUtils]: 4: Hoare triple {612#true} call #t~ret9 := main(); {612#true} is VALID [2018-11-14 17:22:44,664 INFO L273 TraceCheckUtils]: 5: Hoare triple {612#true} havoc ~a~0.base, ~a~0.offset;havoc ~b~0.base, ~b~0.offset; {612#true} is VALID [2018-11-14 17:22:44,665 INFO L256 TraceCheckUtils]: 6: Hoare triple {612#true} call init(); {612#true} is VALID [2018-11-14 17:22:44,665 INFO L273 TraceCheckUtils]: 7: Hoare triple {612#true} havoc ~i~0;~i~0 := 0; {612#true} is VALID [2018-11-14 17:22:44,665 INFO L273 TraceCheckUtils]: 8: Hoare triple {612#true} assume true; {612#true} is VALID [2018-11-14 17:22:44,665 INFO L273 TraceCheckUtils]: 9: Hoare triple {612#true} assume !!(~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + ~i~0 * 4, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + ~i~0 * 4, 4); {612#true} is VALID [2018-11-14 17:22:44,666 INFO L273 TraceCheckUtils]: 10: Hoare triple {612#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {612#true} is VALID [2018-11-14 17:22:44,666 INFO L273 TraceCheckUtils]: 11: Hoare triple {612#true} assume true; {612#true} is VALID [2018-11-14 17:22:44,666 INFO L273 TraceCheckUtils]: 12: Hoare triple {612#true} assume !(~i~0 < 2); {612#true} is VALID [2018-11-14 17:22:44,666 INFO L273 TraceCheckUtils]: 13: Hoare triple {612#true} assume true; {612#true} is VALID [2018-11-14 17:22:44,667 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {612#true} {612#true} #95#return; {612#true} is VALID [2018-11-14 17:22:44,667 INFO L256 TraceCheckUtils]: 15: Hoare triple {612#true} call #t~ret7.base, #t~ret7.offset := malloc(4); {612#true} is VALID [2018-11-14 17:22:44,667 INFO L273 TraceCheckUtils]: 16: Hoare triple {612#true} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {612#true} is VALID [2018-11-14 17:22:44,667 INFO L273 TraceCheckUtils]: 17: Hoare triple {612#true} assume true; {612#true} is VALID [2018-11-14 17:22:44,668 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {612#true} {612#true} #97#return; {612#true} is VALID [2018-11-14 17:22:44,668 INFO L273 TraceCheckUtils]: 19: Hoare triple {612#true} ~a~0.base, ~a~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {612#true} is VALID [2018-11-14 17:22:44,668 INFO L256 TraceCheckUtils]: 20: Hoare triple {612#true} call #t~ret8.base, #t~ret8.offset := malloc(4); {612#true} is VALID [2018-11-14 17:22:44,669 INFO L273 TraceCheckUtils]: 21: Hoare triple {612#true} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {612#true} is VALID [2018-11-14 17:22:44,669 INFO L273 TraceCheckUtils]: 22: Hoare triple {612#true} assume true; {612#true} is VALID [2018-11-14 17:22:44,669 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {612#true} {612#true} #99#return; {612#true} is VALID [2018-11-14 17:22:44,669 INFO L273 TraceCheckUtils]: 24: Hoare triple {612#true} ~b~0.base, ~b~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {612#true} is VALID [2018-11-14 17:22:44,670 INFO L273 TraceCheckUtils]: 25: Hoare triple {612#true} assume !((~a~0.base == 0 && ~a~0.offset == 0) || (~b~0.base == 0 && ~b~0.offset == 0)); {612#true} is VALID [2018-11-14 17:22:44,670 INFO L256 TraceCheckUtils]: 26: Hoare triple {612#true} call f(~a~0.base, ~a~0.offset); {612#true} is VALID [2018-11-14 17:22:44,672 INFO L273 TraceCheckUtils]: 27: Hoare triple {612#true} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {699#(<= f_~i~1 0)} is VALID [2018-11-14 17:22:44,673 INFO L273 TraceCheckUtils]: 28: Hoare triple {699#(<= f_~i~1 0)} assume true; {699#(<= f_~i~1 0)} is VALID [2018-11-14 17:22:44,674 INFO L273 TraceCheckUtils]: 29: Hoare triple {699#(<= f_~i~1 0)} assume !(~i~1 < 2); {613#false} is VALID [2018-11-14 17:22:44,674 INFO L273 TraceCheckUtils]: 30: Hoare triple {613#false} assume true; {613#false} is VALID [2018-11-14 17:22:44,674 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {613#false} {612#true} #101#return; {613#false} is VALID [2018-11-14 17:22:44,674 INFO L256 TraceCheckUtils]: 32: Hoare triple {613#false} call f(~b~0.base, ~b~0.offset); {613#false} is VALID [2018-11-14 17:22:44,675 INFO L273 TraceCheckUtils]: 33: Hoare triple {613#false} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {613#false} is VALID [2018-11-14 17:22:44,675 INFO L273 TraceCheckUtils]: 34: Hoare triple {613#false} assume true; {613#false} is VALID [2018-11-14 17:22:44,675 INFO L273 TraceCheckUtils]: 35: Hoare triple {613#false} assume !(~i~1 < 2); {613#false} is VALID [2018-11-14 17:22:44,675 INFO L273 TraceCheckUtils]: 36: Hoare triple {613#false} assume true; {613#false} is VALID [2018-11-14 17:22:44,676 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {613#false} {613#false} #103#return; {613#false} is VALID [2018-11-14 17:22:44,676 INFO L256 TraceCheckUtils]: 38: Hoare triple {613#false} call g(~a~0.base, ~a~0.offset); {613#false} is VALID [2018-11-14 17:22:44,676 INFO L273 TraceCheckUtils]: 39: Hoare triple {613#false} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~2;~i~2 := 0; {613#false} is VALID [2018-11-14 17:22:44,676 INFO L273 TraceCheckUtils]: 40: Hoare triple {613#false} assume true; {613#false} is VALID [2018-11-14 17:22:44,676 INFO L273 TraceCheckUtils]: 41: Hoare triple {613#false} assume !!(~i~2 < 2);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~2 * 4, 4); {613#false} is VALID [2018-11-14 17:22:44,677 INFO L273 TraceCheckUtils]: 42: Hoare triple {613#false} assume #t~mem4.base == ~pointer.base && #t~mem4.offset == ~pointer.offset;havoc #t~mem4.base, #t~mem4.offset;call #t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + ~i~2 * 4, 4); {613#false} is VALID [2018-11-14 17:22:44,677 INFO L273 TraceCheckUtils]: 43: Hoare triple {613#false} assume !(#t~mem5 == 1); {613#false} is VALID [2018-11-14 17:22:44,677 INFO L256 TraceCheckUtils]: 44: Hoare triple {613#false} call __blast_assert(); {613#false} is VALID [2018-11-14 17:22:44,677 INFO L273 TraceCheckUtils]: 45: Hoare triple {613#false} assume !false; {613#false} is VALID [2018-11-14 17:22:44,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 17:22:44,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:22:44,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-14 17:22:44,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-11-14 17:22:44,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:44,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:22:44,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:44,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:22:44,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:22:44,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:22:44,870 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 4 states. [2018-11-14 17:22:45,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:45,133 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-11-14 17:22:45,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:22:45,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-11-14 17:22:45,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:22:45,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-14 17:22:45,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:22:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-14 17:22:45,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2018-11-14 17:22:45,330 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:45,333 INFO L225 Difference]: With dead ends: 74 [2018-11-14 17:22:45,334 INFO L226 Difference]: Without dead ends: 52 [2018-11-14 17:22:45,334 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:22:45,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-14 17:22:45,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-11-14 17:22:45,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:45,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 48 states. [2018-11-14 17:22:45,412 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 48 states. [2018-11-14 17:22:45,412 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 48 states. [2018-11-14 17:22:45,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:45,417 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2018-11-14 17:22:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-11-14 17:22:45,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:45,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:45,419 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 52 states. [2018-11-14 17:22:45,419 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 52 states. [2018-11-14 17:22:45,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:45,423 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2018-11-14 17:22:45,423 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-11-14 17:22:45,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:45,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:45,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:45,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:22:45,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-11-14 17:22:45,428 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 46 [2018-11-14 17:22:45,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:45,429 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-11-14 17:22:45,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:22:45,429 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-11-14 17:22:45,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-14 17:22:45,431 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:45,431 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:45,431 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:45,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:45,432 INFO L82 PathProgramCache]: Analyzing trace with hash 9382982, now seen corresponding path program 1 times [2018-11-14 17:22:45,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:45,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:45,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:45,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:45,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:45,581 INFO L256 TraceCheckUtils]: 0: Hoare triple {1032#true} call ULTIMATE.init(); {1032#true} is VALID [2018-11-14 17:22:45,581 INFO L273 TraceCheckUtils]: 1: Hoare triple {1032#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4);~counter~0 := 1; {1032#true} is VALID [2018-11-14 17:22:45,582 INFO L273 TraceCheckUtils]: 2: Hoare triple {1032#true} assume true; {1032#true} is VALID [2018-11-14 17:22:45,582 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1032#true} {1032#true} #109#return; {1032#true} is VALID [2018-11-14 17:22:45,582 INFO L256 TraceCheckUtils]: 4: Hoare triple {1032#true} call #t~ret9 := main(); {1032#true} is VALID [2018-11-14 17:22:45,583 INFO L273 TraceCheckUtils]: 5: Hoare triple {1032#true} havoc ~a~0.base, ~a~0.offset;havoc ~b~0.base, ~b~0.offset; {1032#true} is VALID [2018-11-14 17:22:45,583 INFO L256 TraceCheckUtils]: 6: Hoare triple {1032#true} call init(); {1032#true} is VALID [2018-11-14 17:22:45,583 INFO L273 TraceCheckUtils]: 7: Hoare triple {1032#true} havoc ~i~0;~i~0 := 0; {1034#(= init_~i~0 0)} is VALID [2018-11-14 17:22:45,584 INFO L273 TraceCheckUtils]: 8: Hoare triple {1034#(= init_~i~0 0)} assume true; {1034#(= init_~i~0 0)} is VALID [2018-11-14 17:22:45,584 INFO L273 TraceCheckUtils]: 9: Hoare triple {1034#(= init_~i~0 0)} assume !!(~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + ~i~0 * 4, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + ~i~0 * 4, 4); {1034#(= init_~i~0 0)} is VALID [2018-11-14 17:22:45,585 INFO L273 TraceCheckUtils]: 10: Hoare triple {1034#(= init_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1035#(<= init_~i~0 1)} is VALID [2018-11-14 17:22:45,586 INFO L273 TraceCheckUtils]: 11: Hoare triple {1035#(<= init_~i~0 1)} assume true; {1035#(<= init_~i~0 1)} is VALID [2018-11-14 17:22:45,586 INFO L273 TraceCheckUtils]: 12: Hoare triple {1035#(<= init_~i~0 1)} assume !(~i~0 < 2); {1033#false} is VALID [2018-11-14 17:22:45,586 INFO L273 TraceCheckUtils]: 13: Hoare triple {1033#false} assume true; {1033#false} is VALID [2018-11-14 17:22:45,587 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1033#false} {1032#true} #95#return; {1033#false} is VALID [2018-11-14 17:22:45,587 INFO L256 TraceCheckUtils]: 15: Hoare triple {1033#false} call #t~ret7.base, #t~ret7.offset := malloc(4); {1032#true} is VALID [2018-11-14 17:22:45,587 INFO L273 TraceCheckUtils]: 16: Hoare triple {1032#true} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {1032#true} is VALID [2018-11-14 17:22:45,588 INFO L273 TraceCheckUtils]: 17: Hoare triple {1032#true} assume true; {1032#true} is VALID [2018-11-14 17:22:45,588 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1032#true} {1033#false} #97#return; {1033#false} is VALID [2018-11-14 17:22:45,589 INFO L273 TraceCheckUtils]: 19: Hoare triple {1033#false} ~a~0.base, ~a~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {1033#false} is VALID [2018-11-14 17:22:45,589 INFO L256 TraceCheckUtils]: 20: Hoare triple {1033#false} call #t~ret8.base, #t~ret8.offset := malloc(4); {1032#true} is VALID [2018-11-14 17:22:45,589 INFO L273 TraceCheckUtils]: 21: Hoare triple {1032#true} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {1032#true} is VALID [2018-11-14 17:22:45,590 INFO L273 TraceCheckUtils]: 22: Hoare triple {1032#true} assume true; {1032#true} is VALID [2018-11-14 17:22:45,590 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1032#true} {1033#false} #99#return; {1033#false} is VALID [2018-11-14 17:22:45,590 INFO L273 TraceCheckUtils]: 24: Hoare triple {1033#false} ~b~0.base, ~b~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {1033#false} is VALID [2018-11-14 17:22:45,590 INFO L273 TraceCheckUtils]: 25: Hoare triple {1033#false} assume !((~a~0.base == 0 && ~a~0.offset == 0) || (~b~0.base == 0 && ~b~0.offset == 0)); {1033#false} is VALID [2018-11-14 17:22:45,591 INFO L256 TraceCheckUtils]: 26: Hoare triple {1033#false} call f(~a~0.base, ~a~0.offset); {1032#true} is VALID [2018-11-14 17:22:45,591 INFO L273 TraceCheckUtils]: 27: Hoare triple {1032#true} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {1032#true} is VALID [2018-11-14 17:22:45,591 INFO L273 TraceCheckUtils]: 28: Hoare triple {1032#true} assume true; {1032#true} is VALID [2018-11-14 17:22:45,592 INFO L273 TraceCheckUtils]: 29: Hoare triple {1032#true} assume !!(~i~1 < 2);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4); {1032#true} is VALID [2018-11-14 17:22:45,592 INFO L273 TraceCheckUtils]: 30: Hoare triple {1032#true} assume #t~mem2.base == 0 && #t~mem2.offset == 0;havoc #t~mem2.base, #t~mem2.offset;call write~$Pointer$(~pointer.base, ~pointer.offset, ~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + ~i~1 * 4, 4); {1032#true} is VALID [2018-11-14 17:22:45,592 INFO L273 TraceCheckUtils]: 31: Hoare triple {1032#true} assume true; {1032#true} is VALID [2018-11-14 17:22:45,592 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1032#true} {1033#false} #101#return; {1033#false} is VALID [2018-11-14 17:22:45,593 INFO L256 TraceCheckUtils]: 33: Hoare triple {1033#false} call f(~b~0.base, ~b~0.offset); {1032#true} is VALID [2018-11-14 17:22:45,593 INFO L273 TraceCheckUtils]: 34: Hoare triple {1032#true} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {1032#true} is VALID [2018-11-14 17:22:45,593 INFO L273 TraceCheckUtils]: 35: Hoare triple {1032#true} assume true; {1032#true} is VALID [2018-11-14 17:22:45,594 INFO L273 TraceCheckUtils]: 36: Hoare triple {1032#true} assume !!(~i~1 < 2);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4); {1032#true} is VALID [2018-11-14 17:22:45,594 INFO L273 TraceCheckUtils]: 37: Hoare triple {1032#true} assume #t~mem2.base == 0 && #t~mem2.offset == 0;havoc #t~mem2.base, #t~mem2.offset;call write~$Pointer$(~pointer.base, ~pointer.offset, ~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + ~i~1 * 4, 4); {1032#true} is VALID [2018-11-14 17:22:45,594 INFO L273 TraceCheckUtils]: 38: Hoare triple {1032#true} assume true; {1032#true} is VALID [2018-11-14 17:22:45,594 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1032#true} {1033#false} #103#return; {1033#false} is VALID [2018-11-14 17:22:45,595 INFO L256 TraceCheckUtils]: 40: Hoare triple {1033#false} call g(~a~0.base, ~a~0.offset); {1033#false} is VALID [2018-11-14 17:22:45,595 INFO L273 TraceCheckUtils]: 41: Hoare triple {1033#false} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~2;~i~2 := 0; {1033#false} is VALID [2018-11-14 17:22:45,595 INFO L273 TraceCheckUtils]: 42: Hoare triple {1033#false} assume true; {1033#false} is VALID [2018-11-14 17:22:45,595 INFO L273 TraceCheckUtils]: 43: Hoare triple {1033#false} assume !!(~i~2 < 2);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~2 * 4, 4); {1033#false} is VALID [2018-11-14 17:22:45,595 INFO L273 TraceCheckUtils]: 44: Hoare triple {1033#false} assume #t~mem4.base == ~pointer.base && #t~mem4.offset == ~pointer.offset;havoc #t~mem4.base, #t~mem4.offset;call #t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + ~i~2 * 4, 4); {1033#false} is VALID [2018-11-14 17:22:45,596 INFO L273 TraceCheckUtils]: 45: Hoare triple {1033#false} assume !(#t~mem5 == 1); {1033#false} is VALID [2018-11-14 17:22:45,596 INFO L256 TraceCheckUtils]: 46: Hoare triple {1033#false} call __blast_assert(); {1033#false} is VALID [2018-11-14 17:22:45,596 INFO L273 TraceCheckUtils]: 47: Hoare triple {1033#false} assume !false; {1033#false} is VALID [2018-11-14 17:22:45,599 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-14 17:22:45,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:22:45,600 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:22:45,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:45,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:22:46,104 INFO L256 TraceCheckUtils]: 0: Hoare triple {1032#true} call ULTIMATE.init(); {1032#true} is VALID [2018-11-14 17:22:46,104 INFO L273 TraceCheckUtils]: 1: Hoare triple {1032#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4);~counter~0 := 1; {1032#true} is VALID [2018-11-14 17:22:46,104 INFO L273 TraceCheckUtils]: 2: Hoare triple {1032#true} assume true; {1032#true} is VALID [2018-11-14 17:22:46,105 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1032#true} {1032#true} #109#return; {1032#true} is VALID [2018-11-14 17:22:46,105 INFO L256 TraceCheckUtils]: 4: Hoare triple {1032#true} call #t~ret9 := main(); {1032#true} is VALID [2018-11-14 17:22:46,105 INFO L273 TraceCheckUtils]: 5: Hoare triple {1032#true} havoc ~a~0.base, ~a~0.offset;havoc ~b~0.base, ~b~0.offset; {1032#true} is VALID [2018-11-14 17:22:46,105 INFO L256 TraceCheckUtils]: 6: Hoare triple {1032#true} call init(); {1032#true} is VALID [2018-11-14 17:22:46,109 INFO L273 TraceCheckUtils]: 7: Hoare triple {1032#true} havoc ~i~0;~i~0 := 0; {1060#(<= init_~i~0 0)} is VALID [2018-11-14 17:22:46,112 INFO L273 TraceCheckUtils]: 8: Hoare triple {1060#(<= init_~i~0 0)} assume true; {1060#(<= init_~i~0 0)} is VALID [2018-11-14 17:22:46,112 INFO L273 TraceCheckUtils]: 9: Hoare triple {1060#(<= init_~i~0 0)} assume !!(~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + ~i~0 * 4, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + ~i~0 * 4, 4); {1060#(<= init_~i~0 0)} is VALID [2018-11-14 17:22:46,114 INFO L273 TraceCheckUtils]: 10: Hoare triple {1060#(<= init_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1035#(<= init_~i~0 1)} is VALID [2018-11-14 17:22:46,116 INFO L273 TraceCheckUtils]: 11: Hoare triple {1035#(<= init_~i~0 1)} assume true; {1035#(<= init_~i~0 1)} is VALID [2018-11-14 17:22:46,116 INFO L273 TraceCheckUtils]: 12: Hoare triple {1035#(<= init_~i~0 1)} assume !(~i~0 < 2); {1033#false} is VALID [2018-11-14 17:22:46,117 INFO L273 TraceCheckUtils]: 13: Hoare triple {1033#false} assume true; {1033#false} is VALID [2018-11-14 17:22:46,117 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1033#false} {1032#true} #95#return; {1033#false} is VALID [2018-11-14 17:22:46,117 INFO L256 TraceCheckUtils]: 15: Hoare triple {1033#false} call #t~ret7.base, #t~ret7.offset := malloc(4); {1033#false} is VALID [2018-11-14 17:22:46,118 INFO L273 TraceCheckUtils]: 16: Hoare triple {1033#false} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {1033#false} is VALID [2018-11-14 17:22:46,118 INFO L273 TraceCheckUtils]: 17: Hoare triple {1033#false} assume true; {1033#false} is VALID [2018-11-14 17:22:46,118 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1033#false} {1033#false} #97#return; {1033#false} is VALID [2018-11-14 17:22:46,118 INFO L273 TraceCheckUtils]: 19: Hoare triple {1033#false} ~a~0.base, ~a~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {1033#false} is VALID [2018-11-14 17:22:46,119 INFO L256 TraceCheckUtils]: 20: Hoare triple {1033#false} call #t~ret8.base, #t~ret8.offset := malloc(4); {1033#false} is VALID [2018-11-14 17:22:46,119 INFO L273 TraceCheckUtils]: 21: Hoare triple {1033#false} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {1033#false} is VALID [2018-11-14 17:22:46,119 INFO L273 TraceCheckUtils]: 22: Hoare triple {1033#false} assume true; {1033#false} is VALID [2018-11-14 17:22:46,120 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1033#false} {1033#false} #99#return; {1033#false} is VALID [2018-11-14 17:22:46,120 INFO L273 TraceCheckUtils]: 24: Hoare triple {1033#false} ~b~0.base, ~b~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {1033#false} is VALID [2018-11-14 17:22:46,120 INFO L273 TraceCheckUtils]: 25: Hoare triple {1033#false} assume !((~a~0.base == 0 && ~a~0.offset == 0) || (~b~0.base == 0 && ~b~0.offset == 0)); {1033#false} is VALID [2018-11-14 17:22:46,120 INFO L256 TraceCheckUtils]: 26: Hoare triple {1033#false} call f(~a~0.base, ~a~0.offset); {1033#false} is VALID [2018-11-14 17:22:46,121 INFO L273 TraceCheckUtils]: 27: Hoare triple {1033#false} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {1033#false} is VALID [2018-11-14 17:22:46,121 INFO L273 TraceCheckUtils]: 28: Hoare triple {1033#false} assume true; {1033#false} is VALID [2018-11-14 17:22:46,121 INFO L273 TraceCheckUtils]: 29: Hoare triple {1033#false} assume !!(~i~1 < 2);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4); {1033#false} is VALID [2018-11-14 17:22:46,121 INFO L273 TraceCheckUtils]: 30: Hoare triple {1033#false} assume #t~mem2.base == 0 && #t~mem2.offset == 0;havoc #t~mem2.base, #t~mem2.offset;call write~$Pointer$(~pointer.base, ~pointer.offset, ~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + ~i~1 * 4, 4); {1033#false} is VALID [2018-11-14 17:22:46,122 INFO L273 TraceCheckUtils]: 31: Hoare triple {1033#false} assume true; {1033#false} is VALID [2018-11-14 17:22:46,122 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1033#false} {1033#false} #101#return; {1033#false} is VALID [2018-11-14 17:22:46,122 INFO L256 TraceCheckUtils]: 33: Hoare triple {1033#false} call f(~b~0.base, ~b~0.offset); {1033#false} is VALID [2018-11-14 17:22:46,123 INFO L273 TraceCheckUtils]: 34: Hoare triple {1033#false} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {1033#false} is VALID [2018-11-14 17:22:46,123 INFO L273 TraceCheckUtils]: 35: Hoare triple {1033#false} assume true; {1033#false} is VALID [2018-11-14 17:22:46,123 INFO L273 TraceCheckUtils]: 36: Hoare triple {1033#false} assume !!(~i~1 < 2);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4); {1033#false} is VALID [2018-11-14 17:22:46,123 INFO L273 TraceCheckUtils]: 37: Hoare triple {1033#false} assume #t~mem2.base == 0 && #t~mem2.offset == 0;havoc #t~mem2.base, #t~mem2.offset;call write~$Pointer$(~pointer.base, ~pointer.offset, ~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + ~i~1 * 4, 4); {1033#false} is VALID [2018-11-14 17:22:46,124 INFO L273 TraceCheckUtils]: 38: Hoare triple {1033#false} assume true; {1033#false} is VALID [2018-11-14 17:22:46,124 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1033#false} {1033#false} #103#return; {1033#false} is VALID [2018-11-14 17:22:46,124 INFO L256 TraceCheckUtils]: 40: Hoare triple {1033#false} call g(~a~0.base, ~a~0.offset); {1033#false} is VALID [2018-11-14 17:22:46,125 INFO L273 TraceCheckUtils]: 41: Hoare triple {1033#false} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~2;~i~2 := 0; {1033#false} is VALID [2018-11-14 17:22:46,125 INFO L273 TraceCheckUtils]: 42: Hoare triple {1033#false} assume true; {1033#false} is VALID [2018-11-14 17:22:46,125 INFO L273 TraceCheckUtils]: 43: Hoare triple {1033#false} assume !!(~i~2 < 2);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~2 * 4, 4); {1033#false} is VALID [2018-11-14 17:22:46,125 INFO L273 TraceCheckUtils]: 44: Hoare triple {1033#false} assume #t~mem4.base == ~pointer.base && #t~mem4.offset == ~pointer.offset;havoc #t~mem4.base, #t~mem4.offset;call #t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + ~i~2 * 4, 4); {1033#false} is VALID [2018-11-14 17:22:46,126 INFO L273 TraceCheckUtils]: 45: Hoare triple {1033#false} assume !(#t~mem5 == 1); {1033#false} is VALID [2018-11-14 17:22:46,126 INFO L256 TraceCheckUtils]: 46: Hoare triple {1033#false} call __blast_assert(); {1033#false} is VALID [2018-11-14 17:22:46,126 INFO L273 TraceCheckUtils]: 47: Hoare triple {1033#false} assume !false; {1033#false} is VALID [2018-11-14 17:22:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-14 17:22:46,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:22:46,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 17:22:46,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-14 17:22:46,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:46,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:22:46,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:46,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:22:46,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:22:46,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:22:46,285 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 5 states. [2018-11-14 17:22:46,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:46,588 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2018-11-14 17:22:46,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:22:46,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-14 17:22:46,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:46,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:22:46,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2018-11-14 17:22:46,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:22:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2018-11-14 17:22:46,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 96 transitions. [2018-11-14 17:22:46,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:46,808 INFO L225 Difference]: With dead ends: 86 [2018-11-14 17:22:46,809 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 17:22:46,810 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:22:46,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 17:22:46,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-14 17:22:46,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:46,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2018-11-14 17:22:46,837 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-14 17:22:46,838 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-14 17:22:46,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:46,841 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-14 17:22:46,841 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-14 17:22:46,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:46,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:46,843 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-14 17:22:46,843 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-14 17:22:46,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:46,846 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-14 17:22:46,847 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-14 17:22:46,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:46,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:46,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:46,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:46,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-14 17:22:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-11-14 17:22:46,851 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 48 [2018-11-14 17:22:46,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:46,852 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-11-14 17:22:46,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:22:46,852 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-14 17:22:46,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-14 17:22:46,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:46,854 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:46,854 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:46,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:46,854 INFO L82 PathProgramCache]: Analyzing trace with hash -511879692, now seen corresponding path program 2 times [2018-11-14 17:22:46,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:46,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:46,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:46,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:46,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:47,383 INFO L256 TraceCheckUtils]: 0: Hoare triple {1479#true} call ULTIMATE.init(); {1479#true} is VALID [2018-11-14 17:22:47,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {1479#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4);~counter~0 := 1; {1481#(and (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:47,385 INFO L273 TraceCheckUtils]: 2: Hoare triple {1481#(and (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} assume true; {1481#(and (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:47,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1481#(and (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} {1479#true} #109#return; {1481#(and (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:47,391 INFO L256 TraceCheckUtils]: 4: Hoare triple {1481#(and (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} call #t~ret9 := main(); {1481#(and (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:47,391 INFO L273 TraceCheckUtils]: 5: Hoare triple {1481#(and (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} havoc ~a~0.base, ~a~0.offset;havoc ~b~0.base, ~b~0.offset; {1481#(and (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:47,392 INFO L256 TraceCheckUtils]: 6: Hoare triple {1481#(and (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} call init(); {1479#true} is VALID [2018-11-14 17:22:47,392 INFO L273 TraceCheckUtils]: 7: Hoare triple {1479#true} havoc ~i~0;~i~0 := 0; {1479#true} is VALID [2018-11-14 17:22:47,392 INFO L273 TraceCheckUtils]: 8: Hoare triple {1479#true} assume true; {1479#true} is VALID [2018-11-14 17:22:47,392 INFO L273 TraceCheckUtils]: 9: Hoare triple {1479#true} assume !!(~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + ~i~0 * 4, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + ~i~0 * 4, 4); {1479#true} is VALID [2018-11-14 17:22:47,393 INFO L273 TraceCheckUtils]: 10: Hoare triple {1479#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1479#true} is VALID [2018-11-14 17:22:47,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {1479#true} assume true; {1479#true} is VALID [2018-11-14 17:22:47,393 INFO L273 TraceCheckUtils]: 12: Hoare triple {1479#true} assume !!(~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + ~i~0 * 4, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + ~i~0 * 4, 4); {1479#true} is VALID [2018-11-14 17:22:47,393 INFO L273 TraceCheckUtils]: 13: Hoare triple {1479#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1479#true} is VALID [2018-11-14 17:22:47,394 INFO L273 TraceCheckUtils]: 14: Hoare triple {1479#true} assume true; {1479#true} is VALID [2018-11-14 17:22:47,394 INFO L273 TraceCheckUtils]: 15: Hoare triple {1479#true} assume !(~i~0 < 2); {1479#true} is VALID [2018-11-14 17:22:47,394 INFO L273 TraceCheckUtils]: 16: Hoare triple {1479#true} assume true; {1479#true} is VALID [2018-11-14 17:22:47,397 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1479#true} {1481#(and (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} #95#return; {1481#(and (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:47,397 INFO L256 TraceCheckUtils]: 18: Hoare triple {1481#(and (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} call #t~ret7.base, #t~ret7.offset := malloc(4); {1479#true} is VALID [2018-11-14 17:22:47,398 INFO L273 TraceCheckUtils]: 19: Hoare triple {1479#true} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {1482#(= 0 |malloc_#res.base|)} is VALID [2018-11-14 17:22:47,403 INFO L273 TraceCheckUtils]: 20: Hoare triple {1482#(= 0 |malloc_#res.base|)} assume true; {1482#(= 0 |malloc_#res.base|)} is VALID [2018-11-14 17:22:47,404 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1482#(= 0 |malloc_#res.base|)} {1481#(and (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} #97#return; {1483#(and (= 0 |main_#t~ret7.base|) (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:47,405 INFO L273 TraceCheckUtils]: 22: Hoare triple {1483#(and (= 0 |main_#t~ret7.base|) (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} ~a~0.base, ~a~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {1484#(and (= 0 main_~a~0.base) (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:47,405 INFO L256 TraceCheckUtils]: 23: Hoare triple {1484#(and (= 0 main_~a~0.base) (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} call #t~ret8.base, #t~ret8.offset := malloc(4); {1479#true} is VALID [2018-11-14 17:22:47,405 INFO L273 TraceCheckUtils]: 24: Hoare triple {1479#true} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {1479#true} is VALID [2018-11-14 17:22:47,406 INFO L273 TraceCheckUtils]: 25: Hoare triple {1479#true} assume true; {1479#true} is VALID [2018-11-14 17:22:47,406 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1479#true} {1484#(and (= 0 main_~a~0.base) (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} #99#return; {1484#(and (= 0 main_~a~0.base) (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:47,408 INFO L273 TraceCheckUtils]: 27: Hoare triple {1484#(and (= 0 main_~a~0.base) (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} ~b~0.base, ~b~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {1484#(and (= 0 main_~a~0.base) (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:47,410 INFO L273 TraceCheckUtils]: 28: Hoare triple {1484#(and (= 0 main_~a~0.base) (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} assume !((~a~0.base == 0 && ~a~0.offset == 0) || (~b~0.base == 0 && ~b~0.offset == 0)); {1485#(and (<= |~#pp~0.offset| 0) (not (= 0 main_~a~0.offset)) (<= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:47,410 INFO L256 TraceCheckUtils]: 29: Hoare triple {1485#(and (<= |~#pp~0.offset| 0) (not (= 0 main_~a~0.offset)) (<= 0 |~#pp~0.offset|))} call f(~a~0.base, ~a~0.offset); {1479#true} is VALID [2018-11-14 17:22:47,411 INFO L273 TraceCheckUtils]: 30: Hoare triple {1479#true} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {1486#(and (= |f_#in~pointer.offset| f_~pointer.offset) (= f_~i~1 0))} is VALID [2018-11-14 17:22:47,412 INFO L273 TraceCheckUtils]: 31: Hoare triple {1486#(and (= |f_#in~pointer.offset| f_~pointer.offset) (= f_~i~1 0))} assume true; {1486#(and (= |f_#in~pointer.offset| f_~pointer.offset) (= f_~i~1 0))} is VALID [2018-11-14 17:22:47,415 INFO L273 TraceCheckUtils]: 32: Hoare triple {1486#(and (= |f_#in~pointer.offset| f_~pointer.offset) (= f_~i~1 0))} assume !!(~i~1 < 2);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4); {1487#(and (= f_~i~1 0) (or (= |f_#in~pointer.offset| f_~pointer.offset) (not (= (+ |~#pp~0.offset| (* 4 f_~i~1)) 0))))} is VALID [2018-11-14 17:22:47,416 INFO L273 TraceCheckUtils]: 33: Hoare triple {1487#(and (= f_~i~1 0) (or (= |f_#in~pointer.offset| f_~pointer.offset) (not (= (+ |~#pp~0.offset| (* 4 f_~i~1)) 0))))} assume #t~mem2.base == 0 && #t~mem2.offset == 0;havoc #t~mem2.base, #t~mem2.offset;call write~$Pointer$(~pointer.base, ~pointer.offset, ~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + ~i~1 * 4, 4); {1488#(or (<= (+ |~#pp~0.offset| 1) 0) (<= 1 |~#pp~0.offset|) (= |f_#in~pointer.offset| (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) 0)))} is VALID [2018-11-14 17:22:47,418 INFO L273 TraceCheckUtils]: 34: Hoare triple {1488#(or (<= (+ |~#pp~0.offset| 1) 0) (<= 1 |~#pp~0.offset|) (= |f_#in~pointer.offset| (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) 0)))} assume true; {1488#(or (<= (+ |~#pp~0.offset| 1) 0) (<= 1 |~#pp~0.offset|) (= |f_#in~pointer.offset| (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) 0)))} is VALID [2018-11-14 17:22:47,420 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1488#(or (<= (+ |~#pp~0.offset| 1) 0) (<= 1 |~#pp~0.offset|) (= |f_#in~pointer.offset| (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) 0)))} {1485#(and (<= |~#pp~0.offset| 0) (not (= 0 main_~a~0.offset)) (<= 0 |~#pp~0.offset|))} #101#return; {1489#(and (not (= 0 (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) 0))) (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:47,421 INFO L256 TraceCheckUtils]: 36: Hoare triple {1489#(and (not (= 0 (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) 0))) (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} call f(~b~0.base, ~b~0.offset); {1490#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)} is VALID [2018-11-14 17:22:47,423 INFO L273 TraceCheckUtils]: 37: Hoare triple {1490#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {1491#(and (= f_~i~1 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-14 17:22:47,424 INFO L273 TraceCheckUtils]: 38: Hoare triple {1491#(and (= f_~i~1 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume true; {1491#(and (= f_~i~1 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-14 17:22:47,428 INFO L273 TraceCheckUtils]: 39: Hoare triple {1491#(and (= f_~i~1 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !!(~i~1 < 2);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4); {1492#(and (= f_~i~1 0) (or (and (= (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| (* 4 f_~i~1))) |f_#t~mem2.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 0 (+ |~#pp~0.offset| (* 4 f_~i~1))))))} is VALID [2018-11-14 17:22:47,430 INFO L273 TraceCheckUtils]: 40: Hoare triple {1492#(and (= f_~i~1 0) (or (and (= (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| (* 4 f_~i~1))) |f_#t~mem2.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 0 (+ |~#pp~0.offset| (* 4 f_~i~1))))))} assume #t~mem2.base == 0 && #t~mem2.offset == 0;havoc #t~mem2.base, #t~mem2.offset;call write~$Pointer$(~pointer.base, ~pointer.offset, ~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + ~i~1 * 4, 4); {1493#(or (<= (+ |~#pp~0.offset| 1) 0) (<= 1 |~#pp~0.offset|) (= 0 (select (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|) 0)))} is VALID [2018-11-14 17:22:47,431 INFO L273 TraceCheckUtils]: 41: Hoare triple {1493#(or (<= (+ |~#pp~0.offset| 1) 0) (<= 1 |~#pp~0.offset|) (= 0 (select (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|) 0)))} assume true; {1493#(or (<= (+ |~#pp~0.offset| 1) 0) (<= 1 |~#pp~0.offset|) (= 0 (select (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|) 0)))} is VALID [2018-11-14 17:22:47,433 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1493#(or (<= (+ |~#pp~0.offset| 1) 0) (<= 1 |~#pp~0.offset|) (= 0 (select (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|) 0)))} {1489#(and (not (= 0 (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) 0))) (<= |~#pp~0.offset| 0) (<= 0 |~#pp~0.offset|))} #103#return; {1480#false} is VALID [2018-11-14 17:22:47,433 INFO L256 TraceCheckUtils]: 43: Hoare triple {1480#false} call g(~a~0.base, ~a~0.offset); {1480#false} is VALID [2018-11-14 17:22:47,434 INFO L273 TraceCheckUtils]: 44: Hoare triple {1480#false} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~2;~i~2 := 0; {1480#false} is VALID [2018-11-14 17:22:47,434 INFO L273 TraceCheckUtils]: 45: Hoare triple {1480#false} assume true; {1480#false} is VALID [2018-11-14 17:22:47,434 INFO L273 TraceCheckUtils]: 46: Hoare triple {1480#false} assume !!(~i~2 < 2);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~2 * 4, 4); {1480#false} is VALID [2018-11-14 17:22:47,435 INFO L273 TraceCheckUtils]: 47: Hoare triple {1480#false} assume #t~mem4.base == ~pointer.base && #t~mem4.offset == ~pointer.offset;havoc #t~mem4.base, #t~mem4.offset;call #t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + ~i~2 * 4, 4); {1480#false} is VALID [2018-11-14 17:22:47,435 INFO L273 TraceCheckUtils]: 48: Hoare triple {1480#false} assume !(#t~mem5 == 1); {1480#false} is VALID [2018-11-14 17:22:47,435 INFO L256 TraceCheckUtils]: 49: Hoare triple {1480#false} call __blast_assert(); {1480#false} is VALID [2018-11-14 17:22:47,435 INFO L273 TraceCheckUtils]: 50: Hoare triple {1480#false} assume !false; {1480#false} is VALID [2018-11-14 17:22:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 17:22:47,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:22:47,444 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:22:47,465 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:22:47,513 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 17:22:47,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:22:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:47,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:22:47,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 17:22:48,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 17:22:48,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:48,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:48,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:48,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-14 17:22:48,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 17:22:48,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 17:22:48,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:48,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:48,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:48,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-14 17:22:48,267 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:22:48,287 INFO L256 TraceCheckUtils]: 0: Hoare triple {1479#true} call ULTIMATE.init(); {1479#true} is VALID [2018-11-14 17:22:48,288 INFO L273 TraceCheckUtils]: 1: Hoare triple {1479#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4);~counter~0 := 1; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,289 INFO L273 TraceCheckUtils]: 2: Hoare triple {1500#(= |~#pstate~0.offset| 0)} assume true; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,289 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1500#(= |~#pstate~0.offset| 0)} {1479#true} #109#return; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,290 INFO L256 TraceCheckUtils]: 4: Hoare triple {1500#(= |~#pstate~0.offset| 0)} call #t~ret9 := main(); {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {1500#(= |~#pstate~0.offset| 0)} havoc ~a~0.base, ~a~0.offset;havoc ~b~0.base, ~b~0.offset; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,291 INFO L256 TraceCheckUtils]: 6: Hoare triple {1500#(= |~#pstate~0.offset| 0)} call init(); {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,291 INFO L273 TraceCheckUtils]: 7: Hoare triple {1500#(= |~#pstate~0.offset| 0)} havoc ~i~0;~i~0 := 0; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,292 INFO L273 TraceCheckUtils]: 8: Hoare triple {1500#(= |~#pstate~0.offset| 0)} assume true; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,292 INFO L273 TraceCheckUtils]: 9: Hoare triple {1500#(= |~#pstate~0.offset| 0)} assume !!(~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + ~i~0 * 4, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + ~i~0 * 4, 4); {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,300 INFO L273 TraceCheckUtils]: 10: Hoare triple {1500#(= |~#pstate~0.offset| 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,301 INFO L273 TraceCheckUtils]: 11: Hoare triple {1500#(= |~#pstate~0.offset| 0)} assume true; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,301 INFO L273 TraceCheckUtils]: 12: Hoare triple {1500#(= |~#pstate~0.offset| 0)} assume !!(~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + ~i~0 * 4, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + ~i~0 * 4, 4); {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,302 INFO L273 TraceCheckUtils]: 13: Hoare triple {1500#(= |~#pstate~0.offset| 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,302 INFO L273 TraceCheckUtils]: 14: Hoare triple {1500#(= |~#pstate~0.offset| 0)} assume true; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,302 INFO L273 TraceCheckUtils]: 15: Hoare triple {1500#(= |~#pstate~0.offset| 0)} assume !(~i~0 < 2); {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,303 INFO L273 TraceCheckUtils]: 16: Hoare triple {1500#(= |~#pstate~0.offset| 0)} assume true; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,304 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1500#(= |~#pstate~0.offset| 0)} {1500#(= |~#pstate~0.offset| 0)} #95#return; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,305 INFO L256 TraceCheckUtils]: 18: Hoare triple {1500#(= |~#pstate~0.offset| 0)} call #t~ret7.base, #t~ret7.offset := malloc(4); {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,305 INFO L273 TraceCheckUtils]: 19: Hoare triple {1500#(= |~#pstate~0.offset| 0)} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,306 INFO L273 TraceCheckUtils]: 20: Hoare triple {1500#(= |~#pstate~0.offset| 0)} assume true; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,314 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1500#(= |~#pstate~0.offset| 0)} {1500#(= |~#pstate~0.offset| 0)} #97#return; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,316 INFO L273 TraceCheckUtils]: 22: Hoare triple {1500#(= |~#pstate~0.offset| 0)} ~a~0.base, ~a~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,317 INFO L256 TraceCheckUtils]: 23: Hoare triple {1500#(= |~#pstate~0.offset| 0)} call #t~ret8.base, #t~ret8.offset := malloc(4); {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,317 INFO L273 TraceCheckUtils]: 24: Hoare triple {1500#(= |~#pstate~0.offset| 0)} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,318 INFO L273 TraceCheckUtils]: 25: Hoare triple {1500#(= |~#pstate~0.offset| 0)} assume true; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,318 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1500#(= |~#pstate~0.offset| 0)} {1500#(= |~#pstate~0.offset| 0)} #99#return; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,319 INFO L273 TraceCheckUtils]: 27: Hoare triple {1500#(= |~#pstate~0.offset| 0)} ~b~0.base, ~b~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,320 INFO L273 TraceCheckUtils]: 28: Hoare triple {1500#(= |~#pstate~0.offset| 0)} assume !((~a~0.base == 0 && ~a~0.offset == 0) || (~b~0.base == 0 && ~b~0.offset == 0)); {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,321 INFO L256 TraceCheckUtils]: 29: Hoare triple {1500#(= |~#pstate~0.offset| 0)} call f(~a~0.base, ~a~0.offset); {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,322 INFO L273 TraceCheckUtils]: 30: Hoare triple {1500#(= |~#pstate~0.offset| 0)} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,322 INFO L273 TraceCheckUtils]: 31: Hoare triple {1500#(= |~#pstate~0.offset| 0)} assume true; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,323 INFO L273 TraceCheckUtils]: 32: Hoare triple {1500#(= |~#pstate~0.offset| 0)} assume !!(~i~1 < 2);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4); {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,324 INFO L273 TraceCheckUtils]: 33: Hoare triple {1500#(= |~#pstate~0.offset| 0)} assume #t~mem2.base == 0 && #t~mem2.offset == 0;havoc #t~mem2.base, #t~mem2.offset;call write~$Pointer$(~pointer.base, ~pointer.offset, ~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + ~i~1 * 4, 4); {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,325 INFO L273 TraceCheckUtils]: 34: Hoare triple {1500#(= |~#pstate~0.offset| 0)} assume true; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,326 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1500#(= |~#pstate~0.offset| 0)} {1500#(= |~#pstate~0.offset| 0)} #101#return; {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,327 INFO L256 TraceCheckUtils]: 36: Hoare triple {1500#(= |~#pstate~0.offset| 0)} call f(~b~0.base, ~b~0.offset); {1500#(= |~#pstate~0.offset| 0)} is VALID [2018-11-14 17:22:48,328 INFO L273 TraceCheckUtils]: 37: Hoare triple {1500#(= |~#pstate~0.offset| 0)} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {1609#(and (= |~#pstate~0.offset| 0) (= f_~i~1 0))} is VALID [2018-11-14 17:22:48,328 INFO L273 TraceCheckUtils]: 38: Hoare triple {1609#(and (= |~#pstate~0.offset| 0) (= f_~i~1 0))} assume true; {1609#(and (= |~#pstate~0.offset| 0) (= f_~i~1 0))} is VALID [2018-11-14 17:22:48,329 INFO L273 TraceCheckUtils]: 39: Hoare triple {1609#(and (= |~#pstate~0.offset| 0) (= f_~i~1 0))} assume !!(~i~1 < 2);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4); {1609#(and (= |~#pstate~0.offset| 0) (= f_~i~1 0))} is VALID [2018-11-14 17:22:48,331 INFO L273 TraceCheckUtils]: 40: Hoare triple {1609#(and (= |~#pstate~0.offset| 0) (= f_~i~1 0))} assume #t~mem2.base == 0 && #t~mem2.offset == 0;havoc #t~mem2.base, #t~mem2.offset;call write~$Pointer$(~pointer.base, ~pointer.offset, ~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + ~i~1 * 4, 4); {1619#(and (= |~#pstate~0.offset| 0) (= (select (select |#memory_int| |~#pstate~0.base|) |~#pstate~0.offset|) 1))} is VALID [2018-11-14 17:22:48,331 INFO L273 TraceCheckUtils]: 41: Hoare triple {1619#(and (= |~#pstate~0.offset| 0) (= (select (select |#memory_int| |~#pstate~0.base|) |~#pstate~0.offset|) 1))} assume true; {1619#(and (= |~#pstate~0.offset| 0) (= (select (select |#memory_int| |~#pstate~0.base|) |~#pstate~0.offset|) 1))} is VALID [2018-11-14 17:22:48,333 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1619#(and (= |~#pstate~0.offset| 0) (= (select (select |#memory_int| |~#pstate~0.base|) |~#pstate~0.offset|) 1))} {1500#(= |~#pstate~0.offset| 0)} #103#return; {1619#(and (= |~#pstate~0.offset| 0) (= (select (select |#memory_int| |~#pstate~0.base|) |~#pstate~0.offset|) 1))} is VALID [2018-11-14 17:22:48,334 INFO L256 TraceCheckUtils]: 43: Hoare triple {1619#(and (= |~#pstate~0.offset| 0) (= (select (select |#memory_int| |~#pstate~0.base|) |~#pstate~0.offset|) 1))} call g(~a~0.base, ~a~0.offset); {1619#(and (= |~#pstate~0.offset| 0) (= (select (select |#memory_int| |~#pstate~0.base|) |~#pstate~0.offset|) 1))} is VALID [2018-11-14 17:22:48,335 INFO L273 TraceCheckUtils]: 44: Hoare triple {1619#(and (= |~#pstate~0.offset| 0) (= (select (select |#memory_int| |~#pstate~0.base|) |~#pstate~0.offset|) 1))} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~2;~i~2 := 0; {1632#(and (= |~#pstate~0.offset| 0) (= (select (select |#memory_int| |~#pstate~0.base|) |~#pstate~0.offset|) 1) (= g_~i~2 0))} is VALID [2018-11-14 17:22:48,336 INFO L273 TraceCheckUtils]: 45: Hoare triple {1632#(and (= |~#pstate~0.offset| 0) (= (select (select |#memory_int| |~#pstate~0.base|) |~#pstate~0.offset|) 1) (= g_~i~2 0))} assume true; {1632#(and (= |~#pstate~0.offset| 0) (= (select (select |#memory_int| |~#pstate~0.base|) |~#pstate~0.offset|) 1) (= g_~i~2 0))} is VALID [2018-11-14 17:22:48,338 INFO L273 TraceCheckUtils]: 46: Hoare triple {1632#(and (= |~#pstate~0.offset| 0) (= (select (select |#memory_int| |~#pstate~0.base|) |~#pstate~0.offset|) 1) (= g_~i~2 0))} assume !!(~i~2 < 2);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~2 * 4, 4); {1632#(and (= |~#pstate~0.offset| 0) (= (select (select |#memory_int| |~#pstate~0.base|) |~#pstate~0.offset|) 1) (= g_~i~2 0))} is VALID [2018-11-14 17:22:48,340 INFO L273 TraceCheckUtils]: 47: Hoare triple {1632#(and (= |~#pstate~0.offset| 0) (= (select (select |#memory_int| |~#pstate~0.base|) |~#pstate~0.offset|) 1) (= g_~i~2 0))} assume #t~mem4.base == ~pointer.base && #t~mem4.offset == ~pointer.offset;havoc #t~mem4.base, #t~mem4.offset;call #t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + ~i~2 * 4, 4); {1642#(= 1 |g_#t~mem5|)} is VALID [2018-11-14 17:22:48,342 INFO L273 TraceCheckUtils]: 48: Hoare triple {1642#(= 1 |g_#t~mem5|)} assume !(#t~mem5 == 1); {1480#false} is VALID [2018-11-14 17:22:48,342 INFO L256 TraceCheckUtils]: 49: Hoare triple {1480#false} call __blast_assert(); {1480#false} is VALID [2018-11-14 17:22:48,342 INFO L273 TraceCheckUtils]: 50: Hoare triple {1480#false} assume !false; {1480#false} is VALID [2018-11-14 17:22:48,346 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-14 17:22:48,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:22:48,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2018-11-14 17:22:48,368 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2018-11-14 17:22:48,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:48,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 17:22:48,570 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:48,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 17:22:48,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 17:22:48,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-11-14 17:22:48,572 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 20 states. [2018-11-14 17:22:54,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:54,430 INFO L93 Difference]: Finished difference Result 140 states and 170 transitions. [2018-11-14 17:22:54,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-14 17:22:54,430 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2018-11-14 17:22:54,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:54,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:22:54,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 167 transitions. [2018-11-14 17:22:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:22:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 167 transitions. [2018-11-14 17:22:54,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 167 transitions. [2018-11-14 17:22:54,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:54,768 INFO L225 Difference]: With dead ends: 140 [2018-11-14 17:22:54,769 INFO L226 Difference]: Without dead ends: 124 [2018-11-14 17:22:54,770 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=341, Invalid=1729, Unknown=0, NotChecked=0, Total=2070 [2018-11-14 17:22:54,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-14 17:22:54,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103. [2018-11-14 17:22:54,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:54,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 103 states. [2018-11-14 17:22:54,961 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 103 states. [2018-11-14 17:22:54,961 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 103 states. [2018-11-14 17:22:54,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:54,969 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2018-11-14 17:22:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 145 transitions. [2018-11-14 17:22:54,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:54,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:54,970 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 124 states. [2018-11-14 17:22:54,970 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 124 states. [2018-11-14 17:22:54,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:54,977 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2018-11-14 17:22:54,977 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 145 transitions. [2018-11-14 17:22:54,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:54,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:54,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:54,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-14 17:22:54,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 124 transitions. [2018-11-14 17:22:54,984 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 124 transitions. Word has length 51 [2018-11-14 17:22:54,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:54,985 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 124 transitions. [2018-11-14 17:22:54,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 17:22:54,985 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 124 transitions. [2018-11-14 17:22:54,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-14 17:22:54,986 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:54,986 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:54,987 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:54,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:54,987 INFO L82 PathProgramCache]: Analyzing trace with hash -739501730, now seen corresponding path program 1 times [2018-11-14 17:22:54,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:54,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:54,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:54,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:22:54,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:55,075 INFO L256 TraceCheckUtils]: 0: Hoare triple {2288#true} call ULTIMATE.init(); {2288#true} is VALID [2018-11-14 17:22:55,075 INFO L273 TraceCheckUtils]: 1: Hoare triple {2288#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4);~counter~0 := 1; {2288#true} is VALID [2018-11-14 17:22:55,075 INFO L273 TraceCheckUtils]: 2: Hoare triple {2288#true} assume true; {2288#true} is VALID [2018-11-14 17:22:55,076 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2288#true} {2288#true} #109#return; {2288#true} is VALID [2018-11-14 17:22:55,076 INFO L256 TraceCheckUtils]: 4: Hoare triple {2288#true} call #t~ret9 := main(); {2288#true} is VALID [2018-11-14 17:22:55,076 INFO L273 TraceCheckUtils]: 5: Hoare triple {2288#true} havoc ~a~0.base, ~a~0.offset;havoc ~b~0.base, ~b~0.offset; {2288#true} is VALID [2018-11-14 17:22:55,076 INFO L256 TraceCheckUtils]: 6: Hoare triple {2288#true} call init(); {2288#true} is VALID [2018-11-14 17:22:55,076 INFO L273 TraceCheckUtils]: 7: Hoare triple {2288#true} havoc ~i~0;~i~0 := 0; {2288#true} is VALID [2018-11-14 17:22:55,077 INFO L273 TraceCheckUtils]: 8: Hoare triple {2288#true} assume true; {2288#true} is VALID [2018-11-14 17:22:55,077 INFO L273 TraceCheckUtils]: 9: Hoare triple {2288#true} assume !!(~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + ~i~0 * 4, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + ~i~0 * 4, 4); {2288#true} is VALID [2018-11-14 17:22:55,077 INFO L273 TraceCheckUtils]: 10: Hoare triple {2288#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2288#true} is VALID [2018-11-14 17:22:55,077 INFO L273 TraceCheckUtils]: 11: Hoare triple {2288#true} assume true; {2288#true} is VALID [2018-11-14 17:22:55,078 INFO L273 TraceCheckUtils]: 12: Hoare triple {2288#true} assume !!(~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + ~i~0 * 4, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + ~i~0 * 4, 4); {2288#true} is VALID [2018-11-14 17:22:55,078 INFO L273 TraceCheckUtils]: 13: Hoare triple {2288#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2288#true} is VALID [2018-11-14 17:22:55,078 INFO L273 TraceCheckUtils]: 14: Hoare triple {2288#true} assume true; {2288#true} is VALID [2018-11-14 17:22:55,078 INFO L273 TraceCheckUtils]: 15: Hoare triple {2288#true} assume !(~i~0 < 2); {2288#true} is VALID [2018-11-14 17:22:55,079 INFO L273 TraceCheckUtils]: 16: Hoare triple {2288#true} assume true; {2288#true} is VALID [2018-11-14 17:22:55,079 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {2288#true} {2288#true} #95#return; {2288#true} is VALID [2018-11-14 17:22:55,079 INFO L256 TraceCheckUtils]: 18: Hoare triple {2288#true} call #t~ret7.base, #t~ret7.offset := malloc(4); {2288#true} is VALID [2018-11-14 17:22:55,080 INFO L273 TraceCheckUtils]: 19: Hoare triple {2288#true} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {2288#true} is VALID [2018-11-14 17:22:55,080 INFO L273 TraceCheckUtils]: 20: Hoare triple {2288#true} assume true; {2288#true} is VALID [2018-11-14 17:22:55,080 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2288#true} {2288#true} #97#return; {2288#true} is VALID [2018-11-14 17:22:55,080 INFO L273 TraceCheckUtils]: 22: Hoare triple {2288#true} ~a~0.base, ~a~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {2288#true} is VALID [2018-11-14 17:22:55,081 INFO L256 TraceCheckUtils]: 23: Hoare triple {2288#true} call #t~ret8.base, #t~ret8.offset := malloc(4); {2288#true} is VALID [2018-11-14 17:22:55,081 INFO L273 TraceCheckUtils]: 24: Hoare triple {2288#true} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {2288#true} is VALID [2018-11-14 17:22:55,081 INFO L273 TraceCheckUtils]: 25: Hoare triple {2288#true} assume true; {2288#true} is VALID [2018-11-14 17:22:55,081 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2288#true} {2288#true} #99#return; {2288#true} is VALID [2018-11-14 17:22:55,082 INFO L273 TraceCheckUtils]: 27: Hoare triple {2288#true} ~b~0.base, ~b~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {2288#true} is VALID [2018-11-14 17:22:55,082 INFO L273 TraceCheckUtils]: 28: Hoare triple {2288#true} assume !((~a~0.base == 0 && ~a~0.offset == 0) || (~b~0.base == 0 && ~b~0.offset == 0)); {2288#true} is VALID [2018-11-14 17:22:55,082 INFO L256 TraceCheckUtils]: 29: Hoare triple {2288#true} call f(~a~0.base, ~a~0.offset); {2288#true} is VALID [2018-11-14 17:22:55,082 INFO L273 TraceCheckUtils]: 30: Hoare triple {2288#true} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {2290#(= f_~i~1 0)} is VALID [2018-11-14 17:22:55,087 INFO L273 TraceCheckUtils]: 31: Hoare triple {2290#(= f_~i~1 0)} assume true; {2290#(= f_~i~1 0)} is VALID [2018-11-14 17:22:55,087 INFO L273 TraceCheckUtils]: 32: Hoare triple {2290#(= f_~i~1 0)} assume !!(~i~1 < 2);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4); {2290#(= f_~i~1 0)} is VALID [2018-11-14 17:22:55,089 INFO L273 TraceCheckUtils]: 33: Hoare triple {2290#(= f_~i~1 0)} assume !(#t~mem2.base == 0 && #t~mem2.offset == 0);havoc #t~mem2.base, #t~mem2.offset; {2290#(= f_~i~1 0)} is VALID [2018-11-14 17:22:55,089 INFO L273 TraceCheckUtils]: 34: Hoare triple {2290#(= f_~i~1 0)} #t~post1 := ~i~1;~i~1 := #t~post1 + 1;havoc #t~post1; {2291#(<= f_~i~1 1)} is VALID [2018-11-14 17:22:55,091 INFO L273 TraceCheckUtils]: 35: Hoare triple {2291#(<= f_~i~1 1)} assume true; {2291#(<= f_~i~1 1)} is VALID [2018-11-14 17:22:55,091 INFO L273 TraceCheckUtils]: 36: Hoare triple {2291#(<= f_~i~1 1)} assume !(~i~1 < 2); {2289#false} is VALID [2018-11-14 17:22:55,091 INFO L273 TraceCheckUtils]: 37: Hoare triple {2289#false} assume true; {2289#false} is VALID [2018-11-14 17:22:55,092 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2289#false} {2288#true} #101#return; {2289#false} is VALID [2018-11-14 17:22:55,092 INFO L256 TraceCheckUtils]: 39: Hoare triple {2289#false} call f(~b~0.base, ~b~0.offset); {2288#true} is VALID [2018-11-14 17:22:55,092 INFO L273 TraceCheckUtils]: 40: Hoare triple {2288#true} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {2288#true} is VALID [2018-11-14 17:22:55,092 INFO L273 TraceCheckUtils]: 41: Hoare triple {2288#true} assume true; {2288#true} is VALID [2018-11-14 17:22:55,092 INFO L273 TraceCheckUtils]: 42: Hoare triple {2288#true} assume !!(~i~1 < 2);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4); {2288#true} is VALID [2018-11-14 17:22:55,093 INFO L273 TraceCheckUtils]: 43: Hoare triple {2288#true} assume !(#t~mem2.base == 0 && #t~mem2.offset == 0);havoc #t~mem2.base, #t~mem2.offset; {2288#true} is VALID [2018-11-14 17:22:55,093 INFO L273 TraceCheckUtils]: 44: Hoare triple {2288#true} #t~post1 := ~i~1;~i~1 := #t~post1 + 1;havoc #t~post1; {2288#true} is VALID [2018-11-14 17:22:55,093 INFO L273 TraceCheckUtils]: 45: Hoare triple {2288#true} assume true; {2288#true} is VALID [2018-11-14 17:22:55,093 INFO L273 TraceCheckUtils]: 46: Hoare triple {2288#true} assume !(~i~1 < 2); {2288#true} is VALID [2018-11-14 17:22:55,093 INFO L273 TraceCheckUtils]: 47: Hoare triple {2288#true} assume true; {2288#true} is VALID [2018-11-14 17:22:55,093 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {2288#true} {2289#false} #103#return; {2289#false} is VALID [2018-11-14 17:22:55,094 INFO L256 TraceCheckUtils]: 49: Hoare triple {2289#false} call g(~a~0.base, ~a~0.offset); {2289#false} is VALID [2018-11-14 17:22:55,094 INFO L273 TraceCheckUtils]: 50: Hoare triple {2289#false} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~2;~i~2 := 0; {2289#false} is VALID [2018-11-14 17:22:55,094 INFO L273 TraceCheckUtils]: 51: Hoare triple {2289#false} assume true; {2289#false} is VALID [2018-11-14 17:22:55,094 INFO L273 TraceCheckUtils]: 52: Hoare triple {2289#false} assume !!(~i~2 < 2);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~2 * 4, 4); {2289#false} is VALID [2018-11-14 17:22:55,094 INFO L273 TraceCheckUtils]: 53: Hoare triple {2289#false} assume #t~mem4.base == ~pointer.base && #t~mem4.offset == ~pointer.offset;havoc #t~mem4.base, #t~mem4.offset;call #t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + ~i~2 * 4, 4); {2289#false} is VALID [2018-11-14 17:22:55,095 INFO L273 TraceCheckUtils]: 54: Hoare triple {2289#false} assume !(#t~mem5 == 1); {2289#false} is VALID [2018-11-14 17:22:55,095 INFO L256 TraceCheckUtils]: 55: Hoare triple {2289#false} call __blast_assert(); {2289#false} is VALID [2018-11-14 17:22:55,095 INFO L273 TraceCheckUtils]: 56: Hoare triple {2289#false} assume !false; {2289#false} is VALID [2018-11-14 17:22:55,098 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-14 17:22:55,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:22:55,099 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:22:55,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:55,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:22:55,367 INFO L256 TraceCheckUtils]: 0: Hoare triple {2288#true} call ULTIMATE.init(); {2288#true} is VALID [2018-11-14 17:22:55,368 INFO L273 TraceCheckUtils]: 1: Hoare triple {2288#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4);~counter~0 := 1; {2288#true} is VALID [2018-11-14 17:22:55,368 INFO L273 TraceCheckUtils]: 2: Hoare triple {2288#true} assume true; {2288#true} is VALID [2018-11-14 17:22:55,368 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2288#true} {2288#true} #109#return; {2288#true} is VALID [2018-11-14 17:22:55,368 INFO L256 TraceCheckUtils]: 4: Hoare triple {2288#true} call #t~ret9 := main(); {2288#true} is VALID [2018-11-14 17:22:55,369 INFO L273 TraceCheckUtils]: 5: Hoare triple {2288#true} havoc ~a~0.base, ~a~0.offset;havoc ~b~0.base, ~b~0.offset; {2288#true} is VALID [2018-11-14 17:22:55,369 INFO L256 TraceCheckUtils]: 6: Hoare triple {2288#true} call init(); {2288#true} is VALID [2018-11-14 17:22:55,369 INFO L273 TraceCheckUtils]: 7: Hoare triple {2288#true} havoc ~i~0;~i~0 := 0; {2288#true} is VALID [2018-11-14 17:22:55,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {2288#true} assume true; {2288#true} is VALID [2018-11-14 17:22:55,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {2288#true} assume !!(~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + ~i~0 * 4, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + ~i~0 * 4, 4); {2288#true} is VALID [2018-11-14 17:22:55,370 INFO L273 TraceCheckUtils]: 10: Hoare triple {2288#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2288#true} is VALID [2018-11-14 17:22:55,370 INFO L273 TraceCheckUtils]: 11: Hoare triple {2288#true} assume true; {2288#true} is VALID [2018-11-14 17:22:55,370 INFO L273 TraceCheckUtils]: 12: Hoare triple {2288#true} assume !!(~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + ~i~0 * 4, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + ~i~0 * 4, 4); {2288#true} is VALID [2018-11-14 17:22:55,371 INFO L273 TraceCheckUtils]: 13: Hoare triple {2288#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2288#true} is VALID [2018-11-14 17:22:55,371 INFO L273 TraceCheckUtils]: 14: Hoare triple {2288#true} assume true; {2288#true} is VALID [2018-11-14 17:22:55,371 INFO L273 TraceCheckUtils]: 15: Hoare triple {2288#true} assume !(~i~0 < 2); {2288#true} is VALID [2018-11-14 17:22:55,371 INFO L273 TraceCheckUtils]: 16: Hoare triple {2288#true} assume true; {2288#true} is VALID [2018-11-14 17:22:55,372 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {2288#true} {2288#true} #95#return; {2288#true} is VALID [2018-11-14 17:22:55,372 INFO L256 TraceCheckUtils]: 18: Hoare triple {2288#true} call #t~ret7.base, #t~ret7.offset := malloc(4); {2288#true} is VALID [2018-11-14 17:22:55,372 INFO L273 TraceCheckUtils]: 19: Hoare triple {2288#true} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {2288#true} is VALID [2018-11-14 17:22:55,372 INFO L273 TraceCheckUtils]: 20: Hoare triple {2288#true} assume true; {2288#true} is VALID [2018-11-14 17:22:55,373 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2288#true} {2288#true} #97#return; {2288#true} is VALID [2018-11-14 17:22:55,373 INFO L273 TraceCheckUtils]: 22: Hoare triple {2288#true} ~a~0.base, ~a~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {2288#true} is VALID [2018-11-14 17:22:55,373 INFO L256 TraceCheckUtils]: 23: Hoare triple {2288#true} call #t~ret8.base, #t~ret8.offset := malloc(4); {2288#true} is VALID [2018-11-14 17:22:55,373 INFO L273 TraceCheckUtils]: 24: Hoare triple {2288#true} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {2288#true} is VALID [2018-11-14 17:22:55,373 INFO L273 TraceCheckUtils]: 25: Hoare triple {2288#true} assume true; {2288#true} is VALID [2018-11-14 17:22:55,374 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2288#true} {2288#true} #99#return; {2288#true} is VALID [2018-11-14 17:22:55,374 INFO L273 TraceCheckUtils]: 27: Hoare triple {2288#true} ~b~0.base, ~b~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {2288#true} is VALID [2018-11-14 17:22:55,374 INFO L273 TraceCheckUtils]: 28: Hoare triple {2288#true} assume !((~a~0.base == 0 && ~a~0.offset == 0) || (~b~0.base == 0 && ~b~0.offset == 0)); {2288#true} is VALID [2018-11-14 17:22:55,375 INFO L256 TraceCheckUtils]: 29: Hoare triple {2288#true} call f(~a~0.base, ~a~0.offset); {2288#true} is VALID [2018-11-14 17:22:55,380 INFO L273 TraceCheckUtils]: 30: Hoare triple {2288#true} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {2385#(<= f_~i~1 0)} is VALID [2018-11-14 17:22:55,380 INFO L273 TraceCheckUtils]: 31: Hoare triple {2385#(<= f_~i~1 0)} assume true; {2385#(<= f_~i~1 0)} is VALID [2018-11-14 17:22:55,382 INFO L273 TraceCheckUtils]: 32: Hoare triple {2385#(<= f_~i~1 0)} assume !!(~i~1 < 2);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4); {2385#(<= f_~i~1 0)} is VALID [2018-11-14 17:22:55,382 INFO L273 TraceCheckUtils]: 33: Hoare triple {2385#(<= f_~i~1 0)} assume !(#t~mem2.base == 0 && #t~mem2.offset == 0);havoc #t~mem2.base, #t~mem2.offset; {2385#(<= f_~i~1 0)} is VALID [2018-11-14 17:22:55,384 INFO L273 TraceCheckUtils]: 34: Hoare triple {2385#(<= f_~i~1 0)} #t~post1 := ~i~1;~i~1 := #t~post1 + 1;havoc #t~post1; {2291#(<= f_~i~1 1)} is VALID [2018-11-14 17:22:55,384 INFO L273 TraceCheckUtils]: 35: Hoare triple {2291#(<= f_~i~1 1)} assume true; {2291#(<= f_~i~1 1)} is VALID [2018-11-14 17:22:55,386 INFO L273 TraceCheckUtils]: 36: Hoare triple {2291#(<= f_~i~1 1)} assume !(~i~1 < 2); {2289#false} is VALID [2018-11-14 17:22:55,386 INFO L273 TraceCheckUtils]: 37: Hoare triple {2289#false} assume true; {2289#false} is VALID [2018-11-14 17:22:55,386 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2289#false} {2288#true} #101#return; {2289#false} is VALID [2018-11-14 17:22:55,386 INFO L256 TraceCheckUtils]: 39: Hoare triple {2289#false} call f(~b~0.base, ~b~0.offset); {2289#false} is VALID [2018-11-14 17:22:55,386 INFO L273 TraceCheckUtils]: 40: Hoare triple {2289#false} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {2289#false} is VALID [2018-11-14 17:22:55,387 INFO L273 TraceCheckUtils]: 41: Hoare triple {2289#false} assume true; {2289#false} is VALID [2018-11-14 17:22:55,387 INFO L273 TraceCheckUtils]: 42: Hoare triple {2289#false} assume !!(~i~1 < 2);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4); {2289#false} is VALID [2018-11-14 17:22:55,387 INFO L273 TraceCheckUtils]: 43: Hoare triple {2289#false} assume !(#t~mem2.base == 0 && #t~mem2.offset == 0);havoc #t~mem2.base, #t~mem2.offset; {2289#false} is VALID [2018-11-14 17:22:55,387 INFO L273 TraceCheckUtils]: 44: Hoare triple {2289#false} #t~post1 := ~i~1;~i~1 := #t~post1 + 1;havoc #t~post1; {2289#false} is VALID [2018-11-14 17:22:55,387 INFO L273 TraceCheckUtils]: 45: Hoare triple {2289#false} assume true; {2289#false} is VALID [2018-11-14 17:22:55,387 INFO L273 TraceCheckUtils]: 46: Hoare triple {2289#false} assume !(~i~1 < 2); {2289#false} is VALID [2018-11-14 17:22:55,388 INFO L273 TraceCheckUtils]: 47: Hoare triple {2289#false} assume true; {2289#false} is VALID [2018-11-14 17:22:55,388 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {2289#false} {2289#false} #103#return; {2289#false} is VALID [2018-11-14 17:22:55,388 INFO L256 TraceCheckUtils]: 49: Hoare triple {2289#false} call g(~a~0.base, ~a~0.offset); {2289#false} is VALID [2018-11-14 17:22:55,388 INFO L273 TraceCheckUtils]: 50: Hoare triple {2289#false} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~2;~i~2 := 0; {2289#false} is VALID [2018-11-14 17:22:55,388 INFO L273 TraceCheckUtils]: 51: Hoare triple {2289#false} assume true; {2289#false} is VALID [2018-11-14 17:22:55,388 INFO L273 TraceCheckUtils]: 52: Hoare triple {2289#false} assume !!(~i~2 < 2);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~2 * 4, 4); {2289#false} is VALID [2018-11-14 17:22:55,389 INFO L273 TraceCheckUtils]: 53: Hoare triple {2289#false} assume #t~mem4.base == ~pointer.base && #t~mem4.offset == ~pointer.offset;havoc #t~mem4.base, #t~mem4.offset;call #t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + ~i~2 * 4, 4); {2289#false} is VALID [2018-11-14 17:22:55,389 INFO L273 TraceCheckUtils]: 54: Hoare triple {2289#false} assume !(#t~mem5 == 1); {2289#false} is VALID [2018-11-14 17:22:55,389 INFO L256 TraceCheckUtils]: 55: Hoare triple {2289#false} call __blast_assert(); {2289#false} is VALID [2018-11-14 17:22:55,389 INFO L273 TraceCheckUtils]: 56: Hoare triple {2289#false} assume !false; {2289#false} is VALID [2018-11-14 17:22:55,392 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-14 17:22:55,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:22:55,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 17:22:55,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-11-14 17:22:55,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:55,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:22:55,483 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:55,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:22:55,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:22:55,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:22:55,484 INFO L87 Difference]: Start difference. First operand 103 states and 124 transitions. Second operand 5 states. [2018-11-14 17:22:55,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:55,798 INFO L93 Difference]: Finished difference Result 176 states and 217 transitions. [2018-11-14 17:22:55,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:22:55,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-11-14 17:22:55,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:55,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:22:55,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2018-11-14 17:22:55,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:22:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2018-11-14 17:22:55,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 93 transitions. [2018-11-14 17:22:56,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:56,014 INFO L225 Difference]: With dead ends: 176 [2018-11-14 17:22:56,014 INFO L226 Difference]: Without dead ends: 111 [2018-11-14 17:22:56,015 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:22:56,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-14 17:22:56,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-11-14 17:22:56,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:56,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 109 states. [2018-11-14 17:22:56,332 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 109 states. [2018-11-14 17:22:56,332 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 109 states. [2018-11-14 17:22:56,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:56,338 INFO L93 Difference]: Finished difference Result 111 states and 133 transitions. [2018-11-14 17:22:56,338 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 133 transitions. [2018-11-14 17:22:56,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:56,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:56,340 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 111 states. [2018-11-14 17:22:56,340 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 111 states. [2018-11-14 17:22:56,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:56,345 INFO L93 Difference]: Finished difference Result 111 states and 133 transitions. [2018-11-14 17:22:56,345 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 133 transitions. [2018-11-14 17:22:56,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:56,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:56,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:56,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:56,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-14 17:22:56,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2018-11-14 17:22:56,351 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 57 [2018-11-14 17:22:56,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:56,351 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2018-11-14 17:22:56,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:22:56,351 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2018-11-14 17:22:56,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-14 17:22:56,352 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:56,352 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:56,353 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:56,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:56,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1869702828, now seen corresponding path program 1 times [2018-11-14 17:22:56,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:56,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:56,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:56,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:56,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:56,905 INFO L256 TraceCheckUtils]: 0: Hoare triple {3077#true} call ULTIMATE.init(); {3077#true} is VALID [2018-11-14 17:22:56,905 INFO L273 TraceCheckUtils]: 1: Hoare triple {3077#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4);~counter~0 := 1; {3077#true} is VALID [2018-11-14 17:22:56,905 INFO L273 TraceCheckUtils]: 2: Hoare triple {3077#true} assume true; {3077#true} is VALID [2018-11-14 17:22:56,905 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3077#true} {3077#true} #109#return; {3077#true} is VALID [2018-11-14 17:22:56,905 INFO L256 TraceCheckUtils]: 4: Hoare triple {3077#true} call #t~ret9 := main(); {3077#true} is VALID [2018-11-14 17:22:56,906 INFO L273 TraceCheckUtils]: 5: Hoare triple {3077#true} havoc ~a~0.base, ~a~0.offset;havoc ~b~0.base, ~b~0.offset; {3077#true} is VALID [2018-11-14 17:22:56,906 INFO L256 TraceCheckUtils]: 6: Hoare triple {3077#true} call init(); {3077#true} is VALID [2018-11-14 17:22:56,906 INFO L273 TraceCheckUtils]: 7: Hoare triple {3077#true} havoc ~i~0;~i~0 := 0; {3077#true} is VALID [2018-11-14 17:22:56,906 INFO L273 TraceCheckUtils]: 8: Hoare triple {3077#true} assume true; {3077#true} is VALID [2018-11-14 17:22:56,907 INFO L273 TraceCheckUtils]: 9: Hoare triple {3077#true} assume !!(~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + ~i~0 * 4, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + ~i~0 * 4, 4); {3077#true} is VALID [2018-11-14 17:22:56,907 INFO L273 TraceCheckUtils]: 10: Hoare triple {3077#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3077#true} is VALID [2018-11-14 17:22:56,907 INFO L273 TraceCheckUtils]: 11: Hoare triple {3077#true} assume true; {3077#true} is VALID [2018-11-14 17:22:56,907 INFO L273 TraceCheckUtils]: 12: Hoare triple {3077#true} assume !!(~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + ~i~0 * 4, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + ~i~0 * 4, 4); {3077#true} is VALID [2018-11-14 17:22:56,908 INFO L273 TraceCheckUtils]: 13: Hoare triple {3077#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3077#true} is VALID [2018-11-14 17:22:56,908 INFO L273 TraceCheckUtils]: 14: Hoare triple {3077#true} assume true; {3077#true} is VALID [2018-11-14 17:22:56,908 INFO L273 TraceCheckUtils]: 15: Hoare triple {3077#true} assume !(~i~0 < 2); {3077#true} is VALID [2018-11-14 17:22:56,908 INFO L273 TraceCheckUtils]: 16: Hoare triple {3077#true} assume true; {3077#true} is VALID [2018-11-14 17:22:56,908 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {3077#true} {3077#true} #95#return; {3077#true} is VALID [2018-11-14 17:22:56,909 INFO L256 TraceCheckUtils]: 18: Hoare triple {3077#true} call #t~ret7.base, #t~ret7.offset := malloc(4); {3077#true} is VALID [2018-11-14 17:22:56,909 INFO L273 TraceCheckUtils]: 19: Hoare triple {3077#true} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {3079#(= 0 |malloc_#res.base|)} is VALID [2018-11-14 17:22:56,909 INFO L273 TraceCheckUtils]: 20: Hoare triple {3079#(= 0 |malloc_#res.base|)} assume true; {3079#(= 0 |malloc_#res.base|)} is VALID [2018-11-14 17:22:56,910 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {3079#(= 0 |malloc_#res.base|)} {3077#true} #97#return; {3080#(= 0 |main_#t~ret7.base|)} is VALID [2018-11-14 17:22:56,911 INFO L273 TraceCheckUtils]: 22: Hoare triple {3080#(= 0 |main_#t~ret7.base|)} ~a~0.base, ~a~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {3081#(= 0 main_~a~0.base)} is VALID [2018-11-14 17:22:56,911 INFO L256 TraceCheckUtils]: 23: Hoare triple {3081#(= 0 main_~a~0.base)} call #t~ret8.base, #t~ret8.offset := malloc(4); {3077#true} is VALID [2018-11-14 17:22:56,911 INFO L273 TraceCheckUtils]: 24: Hoare triple {3077#true} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {3077#true} is VALID [2018-11-14 17:22:56,911 INFO L273 TraceCheckUtils]: 25: Hoare triple {3077#true} assume true; {3077#true} is VALID [2018-11-14 17:22:56,918 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {3077#true} {3081#(= 0 main_~a~0.base)} #99#return; {3081#(= 0 main_~a~0.base)} is VALID [2018-11-14 17:22:56,918 INFO L273 TraceCheckUtils]: 27: Hoare triple {3081#(= 0 main_~a~0.base)} ~b~0.base, ~b~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {3081#(= 0 main_~a~0.base)} is VALID [2018-11-14 17:22:56,919 INFO L273 TraceCheckUtils]: 28: Hoare triple {3081#(= 0 main_~a~0.base)} assume !((~a~0.base == 0 && ~a~0.offset == 0) || (~b~0.base == 0 && ~b~0.offset == 0)); {3082#(not (= 0 main_~a~0.offset))} is VALID [2018-11-14 17:22:56,919 INFO L256 TraceCheckUtils]: 29: Hoare triple {3082#(not (= 0 main_~a~0.offset))} call f(~a~0.base, ~a~0.offset); {3077#true} is VALID [2018-11-14 17:22:56,919 INFO L273 TraceCheckUtils]: 30: Hoare triple {3077#true} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {3083#(and (= |f_#in~pointer.offset| f_~pointer.offset) (= f_~i~1 0))} is VALID [2018-11-14 17:22:56,920 INFO L273 TraceCheckUtils]: 31: Hoare triple {3083#(and (= |f_#in~pointer.offset| f_~pointer.offset) (= f_~i~1 0))} assume true; {3083#(and (= |f_#in~pointer.offset| f_~pointer.offset) (= f_~i~1 0))} is VALID [2018-11-14 17:22:56,920 INFO L273 TraceCheckUtils]: 32: Hoare triple {3083#(and (= |f_#in~pointer.offset| f_~pointer.offset) (= f_~i~1 0))} assume !!(~i~1 < 2);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4); {3083#(and (= |f_#in~pointer.offset| f_~pointer.offset) (= f_~i~1 0))} is VALID [2018-11-14 17:22:56,931 INFO L273 TraceCheckUtils]: 33: Hoare triple {3083#(and (= |f_#in~pointer.offset| f_~pointer.offset) (= f_~i~1 0))} assume !(#t~mem2.base == 0 && #t~mem2.offset == 0);havoc #t~mem2.base, #t~mem2.offset; {3083#(and (= |f_#in~pointer.offset| f_~pointer.offset) (= f_~i~1 0))} is VALID [2018-11-14 17:22:56,932 INFO L273 TraceCheckUtils]: 34: Hoare triple {3083#(and (= |f_#in~pointer.offset| f_~pointer.offset) (= f_~i~1 0))} #t~post1 := ~i~1;~i~1 := #t~post1 + 1;havoc #t~post1; {3084#(and (or (= |f_#in~pointer.offset| f_~pointer.offset) (not (= 4 (* 4 f_~i~1)))) (< 0 f_~i~1))} is VALID [2018-11-14 17:22:56,933 INFO L273 TraceCheckUtils]: 35: Hoare triple {3084#(and (or (= |f_#in~pointer.offset| f_~pointer.offset) (not (= 4 (* 4 f_~i~1)))) (< 0 f_~i~1))} assume true; {3084#(and (or (= |f_#in~pointer.offset| f_~pointer.offset) (not (= 4 (* 4 f_~i~1)))) (< 0 f_~i~1))} is VALID [2018-11-14 17:22:56,933 INFO L273 TraceCheckUtils]: 36: Hoare triple {3084#(and (or (= |f_#in~pointer.offset| f_~pointer.offset) (not (= 4 (* 4 f_~i~1)))) (< 0 f_~i~1))} assume !!(~i~1 < 2);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4); {3085#(and (= 4 (* 4 f_~i~1)) (= |f_#in~pointer.offset| f_~pointer.offset))} is VALID [2018-11-14 17:22:56,934 INFO L273 TraceCheckUtils]: 37: Hoare triple {3085#(and (= 4 (* 4 f_~i~1)) (= |f_#in~pointer.offset| f_~pointer.offset))} assume #t~mem2.base == 0 && #t~mem2.offset == 0;havoc #t~mem2.base, #t~mem2.offset;call write~$Pointer$(~pointer.base, ~pointer.offset, ~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + ~i~1 * 4, 4); {3086#(= |f_#in~pointer.offset| (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| 4)))} is VALID [2018-11-14 17:22:56,935 INFO L273 TraceCheckUtils]: 38: Hoare triple {3086#(= |f_#in~pointer.offset| (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| 4)))} assume true; {3086#(= |f_#in~pointer.offset| (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| 4)))} is VALID [2018-11-14 17:22:56,936 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {3086#(= |f_#in~pointer.offset| (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| 4)))} {3082#(not (= 0 main_~a~0.offset))} #101#return; {3087#(not (= 0 (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| 4))))} is VALID [2018-11-14 17:22:56,938 INFO L256 TraceCheckUtils]: 40: Hoare triple {3087#(not (= 0 (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| 4))))} call f(~b~0.base, ~b~0.offset); {3088#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)} is VALID [2018-11-14 17:22:56,938 INFO L273 TraceCheckUtils]: 41: Hoare triple {3088#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {3089#(and (= f_~i~1 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-14 17:22:56,939 INFO L273 TraceCheckUtils]: 42: Hoare triple {3089#(and (= f_~i~1 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume true; {3089#(and (= f_~i~1 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-14 17:22:56,942 INFO L273 TraceCheckUtils]: 43: Hoare triple {3089#(and (= f_~i~1 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !!(~i~1 < 2);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4); {3089#(and (= f_~i~1 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-14 17:22:56,942 INFO L273 TraceCheckUtils]: 44: Hoare triple {3089#(and (= f_~i~1 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(#t~mem2.base == 0 && #t~mem2.offset == 0);havoc #t~mem2.base, #t~mem2.offset; {3089#(and (= f_~i~1 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-14 17:22:56,943 INFO L273 TraceCheckUtils]: 45: Hoare triple {3089#(and (= f_~i~1 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~post1 := ~i~1;~i~1 := #t~post1 + 1;havoc #t~post1; {3090#(and (< 0 f_~i~1) (or (not (= 4 (* 4 f_~i~1))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))} is VALID [2018-11-14 17:22:56,943 INFO L273 TraceCheckUtils]: 46: Hoare triple {3090#(and (< 0 f_~i~1) (or (not (= 4 (* 4 f_~i~1))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))} assume true; {3090#(and (< 0 f_~i~1) (or (not (= 4 (* 4 f_~i~1))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))} is VALID [2018-11-14 17:22:56,946 INFO L273 TraceCheckUtils]: 47: Hoare triple {3090#(and (< 0 f_~i~1) (or (not (= 4 (* 4 f_~i~1))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))} assume !!(~i~1 < 2);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4); {3091#(and (= 4 (* 4 f_~i~1)) (= (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| (* 4 f_~i~1))) |f_#t~mem2.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-14 17:22:56,947 INFO L273 TraceCheckUtils]: 48: Hoare triple {3091#(and (= 4 (* 4 f_~i~1)) (= (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| (* 4 f_~i~1))) |f_#t~mem2.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume #t~mem2.base == 0 && #t~mem2.offset == 0;havoc #t~mem2.base, #t~mem2.offset;call write~$Pointer$(~pointer.base, ~pointer.offset, ~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + ~i~1 * 4, 4); {3092#(= 0 (select (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|) (+ |~#pp~0.offset| 4)))} is VALID [2018-11-14 17:22:56,948 INFO L273 TraceCheckUtils]: 49: Hoare triple {3092#(= 0 (select (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|) (+ |~#pp~0.offset| 4)))} assume true; {3092#(= 0 (select (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|) (+ |~#pp~0.offset| 4)))} is VALID [2018-11-14 17:22:56,948 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {3092#(= 0 (select (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|) (+ |~#pp~0.offset| 4)))} {3087#(not (= 0 (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| 4))))} #103#return; {3078#false} is VALID [2018-11-14 17:22:56,949 INFO L256 TraceCheckUtils]: 51: Hoare triple {3078#false} call g(~a~0.base, ~a~0.offset); {3078#false} is VALID [2018-11-14 17:22:56,949 INFO L273 TraceCheckUtils]: 52: Hoare triple {3078#false} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~2;~i~2 := 0; {3078#false} is VALID [2018-11-14 17:22:56,949 INFO L273 TraceCheckUtils]: 53: Hoare triple {3078#false} assume true; {3078#false} is VALID [2018-11-14 17:22:56,949 INFO L273 TraceCheckUtils]: 54: Hoare triple {3078#false} assume !!(~i~2 < 2);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~2 * 4, 4); {3078#false} is VALID [2018-11-14 17:22:56,949 INFO L273 TraceCheckUtils]: 55: Hoare triple {3078#false} assume #t~mem4.base == ~pointer.base && #t~mem4.offset == ~pointer.offset;havoc #t~mem4.base, #t~mem4.offset;call #t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + ~i~2 * 4, 4); {3078#false} is VALID [2018-11-14 17:22:56,949 INFO L273 TraceCheckUtils]: 56: Hoare triple {3078#false} assume !(#t~mem5 == 1); {3078#false} is VALID [2018-11-14 17:22:56,950 INFO L256 TraceCheckUtils]: 57: Hoare triple {3078#false} call __blast_assert(); {3078#false} is VALID [2018-11-14 17:22:56,950 INFO L273 TraceCheckUtils]: 58: Hoare triple {3078#false} assume !false; {3078#false} is VALID [2018-11-14 17:22:56,953 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 17:22:56,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:22:56,954 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:22:56,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:57,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:22:57,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-14 17:22:57,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 17:22:57,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:57,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:57,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:57,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-14 17:22:57,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-14 17:22:57,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-14 17:22:57,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:57,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:57,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:57,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-11-14 17:22:57,419 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:22:57,628 INFO L256 TraceCheckUtils]: 0: Hoare triple {3077#true} call ULTIMATE.init(); {3077#true} is VALID [2018-11-14 17:22:57,629 INFO L273 TraceCheckUtils]: 1: Hoare triple {3077#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 0, 4);call write~unchecked~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4, 4);~counter~0 := 1; {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,629 INFO L273 TraceCheckUtils]: 2: Hoare triple {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} assume true; {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,630 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} {3077#true} #109#return; {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,630 INFO L256 TraceCheckUtils]: 4: Hoare triple {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} call #t~ret9 := main(); {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,631 INFO L273 TraceCheckUtils]: 5: Hoare triple {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} havoc ~a~0.base, ~a~0.offset;havoc ~b~0.base, ~b~0.offset; {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,631 INFO L256 TraceCheckUtils]: 6: Hoare triple {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} call init(); {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,632 INFO L273 TraceCheckUtils]: 7: Hoare triple {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} havoc ~i~0;~i~0 := 0; {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,632 INFO L273 TraceCheckUtils]: 8: Hoare triple {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} assume true; {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} assume !!(~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + ~i~0 * 4, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + ~i~0 * 4, 4); {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,633 INFO L273 TraceCheckUtils]: 10: Hoare triple {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,634 INFO L273 TraceCheckUtils]: 11: Hoare triple {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} assume true; {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,635 INFO L273 TraceCheckUtils]: 12: Hoare triple {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} assume !!(~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + ~i~0 * 4, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + ~i~0 * 4, 4); {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,636 INFO L273 TraceCheckUtils]: 13: Hoare triple {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,637 INFO L273 TraceCheckUtils]: 14: Hoare triple {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} assume true; {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,637 INFO L273 TraceCheckUtils]: 15: Hoare triple {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} assume !(~i~0 < 2); {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,638 INFO L273 TraceCheckUtils]: 16: Hoare triple {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} assume true; {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,639 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} #95#return; {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,639 INFO L256 TraceCheckUtils]: 18: Hoare triple {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} call #t~ret7.base, #t~ret7.offset := malloc(4); {3151#(and (= ~counter~0 |old(~counter~0)|) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,640 INFO L273 TraceCheckUtils]: 19: Hoare triple {3151#(and (= ~counter~0 |old(~counter~0)|) (= 0 |~#pp~0.offset|))} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {3155#(and (= |old(~counter~0)| |malloc_#res.offset|) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,641 INFO L273 TraceCheckUtils]: 20: Hoare triple {3155#(and (= |old(~counter~0)| |malloc_#res.offset|) (= 0 |~#pp~0.offset|))} assume true; {3155#(and (= |old(~counter~0)| |malloc_#res.offset|) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,642 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {3155#(and (= |old(~counter~0)| |malloc_#res.offset|) (= 0 |~#pp~0.offset|))} {3099#(and (= ~counter~0 1) (= 0 |~#pp~0.offset|))} #97#return; {3162#(and (= |main_#t~ret7.offset| 1) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,643 INFO L273 TraceCheckUtils]: 22: Hoare triple {3162#(and (= |main_#t~ret7.offset| 1) (= 0 |~#pp~0.offset|))} ~a~0.base, ~a~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {3166#(and (= main_~a~0.offset 1) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,644 INFO L256 TraceCheckUtils]: 23: Hoare triple {3166#(and (= main_~a~0.offset 1) (= 0 |~#pp~0.offset|))} call #t~ret8.base, #t~ret8.offset := malloc(4); {3170#(= 0 |~#pp~0.offset|)} is VALID [2018-11-14 17:22:57,644 INFO L273 TraceCheckUtils]: 24: Hoare triple {3170#(= 0 |~#pp~0.offset|)} ~size := #in~size;#t~post6 := ~counter~0;~counter~0 := #t~post6 + 1;#res.base, #res.offset := 0, #t~post6;havoc #t~post6; {3170#(= 0 |~#pp~0.offset|)} is VALID [2018-11-14 17:22:57,645 INFO L273 TraceCheckUtils]: 25: Hoare triple {3170#(= 0 |~#pp~0.offset|)} assume true; {3170#(= 0 |~#pp~0.offset|)} is VALID [2018-11-14 17:22:57,646 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {3170#(= 0 |~#pp~0.offset|)} {3166#(and (= main_~a~0.offset 1) (= 0 |~#pp~0.offset|))} #99#return; {3166#(and (= main_~a~0.offset 1) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,647 INFO L273 TraceCheckUtils]: 27: Hoare triple {3166#(and (= main_~a~0.offset 1) (= 0 |~#pp~0.offset|))} ~b~0.base, ~b~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {3166#(and (= main_~a~0.offset 1) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,648 INFO L273 TraceCheckUtils]: 28: Hoare triple {3166#(and (= main_~a~0.offset 1) (= 0 |~#pp~0.offset|))} assume !((~a~0.base == 0 && ~a~0.offset == 0) || (~b~0.base == 0 && ~b~0.offset == 0)); {3166#(and (= main_~a~0.offset 1) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,648 INFO L256 TraceCheckUtils]: 29: Hoare triple {3166#(and (= main_~a~0.offset 1) (= 0 |~#pp~0.offset|))} call f(~a~0.base, ~a~0.offset); {3170#(= 0 |~#pp~0.offset|)} is VALID [2018-11-14 17:22:57,649 INFO L273 TraceCheckUtils]: 30: Hoare triple {3170#(= 0 |~#pp~0.offset|)} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {3192#(and (= |f_#in~pointer.offset| f_~pointer.offset) (= f_~i~1 0) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,657 INFO L273 TraceCheckUtils]: 31: Hoare triple {3192#(and (= |f_#in~pointer.offset| f_~pointer.offset) (= f_~i~1 0) (= 0 |~#pp~0.offset|))} assume true; {3192#(and (= |f_#in~pointer.offset| f_~pointer.offset) (= f_~i~1 0) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,658 INFO L273 TraceCheckUtils]: 32: Hoare triple {3192#(and (= |f_#in~pointer.offset| f_~pointer.offset) (= f_~i~1 0) (= 0 |~#pp~0.offset|))} assume !!(~i~1 < 2);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4); {3192#(and (= |f_#in~pointer.offset| f_~pointer.offset) (= f_~i~1 0) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,658 INFO L273 TraceCheckUtils]: 33: Hoare triple {3192#(and (= |f_#in~pointer.offset| f_~pointer.offset) (= f_~i~1 0) (= 0 |~#pp~0.offset|))} assume !(#t~mem2.base == 0 && #t~mem2.offset == 0);havoc #t~mem2.base, #t~mem2.offset; {3192#(and (= |f_#in~pointer.offset| f_~pointer.offset) (= f_~i~1 0) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,659 INFO L273 TraceCheckUtils]: 34: Hoare triple {3192#(and (= |f_#in~pointer.offset| f_~pointer.offset) (= f_~i~1 0) (= 0 |~#pp~0.offset|))} #t~post1 := ~i~1;~i~1 := #t~post1 + 1;havoc #t~post1; {3205#(and (= f_~i~1 1) (= |f_#in~pointer.offset| f_~pointer.offset) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,659 INFO L273 TraceCheckUtils]: 35: Hoare triple {3205#(and (= f_~i~1 1) (= |f_#in~pointer.offset| f_~pointer.offset) (= 0 |~#pp~0.offset|))} assume true; {3205#(and (= f_~i~1 1) (= |f_#in~pointer.offset| f_~pointer.offset) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,660 INFO L273 TraceCheckUtils]: 36: Hoare triple {3205#(and (= f_~i~1 1) (= |f_#in~pointer.offset| f_~pointer.offset) (= 0 |~#pp~0.offset|))} assume !!(~i~1 < 2);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4); {3205#(and (= f_~i~1 1) (= |f_#in~pointer.offset| f_~pointer.offset) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,661 INFO L273 TraceCheckUtils]: 37: Hoare triple {3205#(and (= f_~i~1 1) (= |f_#in~pointer.offset| f_~pointer.offset) (= 0 |~#pp~0.offset|))} assume #t~mem2.base == 0 && #t~mem2.offset == 0;havoc #t~mem2.base, #t~mem2.offset;call write~$Pointer$(~pointer.base, ~pointer.offset, ~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + ~i~1 * 4, 4); {3215#(and (= |f_#in~pointer.offset| (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| 4))) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,661 INFO L273 TraceCheckUtils]: 38: Hoare triple {3215#(and (= |f_#in~pointer.offset| (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| 4))) (= 0 |~#pp~0.offset|))} assume true; {3215#(and (= |f_#in~pointer.offset| (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| 4))) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,662 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {3215#(and (= |f_#in~pointer.offset| (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| 4))) (= 0 |~#pp~0.offset|))} {3166#(and (= main_~a~0.offset 1) (= 0 |~#pp~0.offset|))} #101#return; {3222#(and (= 1 (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| 4))) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,664 INFO L256 TraceCheckUtils]: 40: Hoare triple {3222#(and (= 1 (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| 4))) (= 0 |~#pp~0.offset|))} call f(~b~0.base, ~b~0.offset); {3226#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,664 INFO L273 TraceCheckUtils]: 41: Hoare triple {3226#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 |~#pp~0.offset|))} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~1;~i~1 := 0; {3230#(and (= f_~i~1 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,665 INFO L273 TraceCheckUtils]: 42: Hoare triple {3230#(and (= f_~i~1 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 |~#pp~0.offset|))} assume true; {3230#(and (= f_~i~1 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,666 INFO L273 TraceCheckUtils]: 43: Hoare triple {3230#(and (= f_~i~1 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 |~#pp~0.offset|))} assume !!(~i~1 < 2);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4); {3230#(and (= f_~i~1 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,667 INFO L273 TraceCheckUtils]: 44: Hoare triple {3230#(and (= f_~i~1 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 |~#pp~0.offset|))} assume !(#t~mem2.base == 0 && #t~mem2.offset == 0);havoc #t~mem2.base, #t~mem2.offset; {3230#(and (= f_~i~1 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,667 INFO L273 TraceCheckUtils]: 45: Hoare triple {3230#(and (= f_~i~1 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 |~#pp~0.offset|))} #t~post1 := ~i~1;~i~1 := #t~post1 + 1;havoc #t~post1; {3243#(and (= f_~i~1 1) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,668 INFO L273 TraceCheckUtils]: 46: Hoare triple {3243#(and (= f_~i~1 1) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 |~#pp~0.offset|))} assume true; {3243#(and (= f_~i~1 1) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,669 INFO L273 TraceCheckUtils]: 47: Hoare triple {3243#(and (= f_~i~1 1) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 |~#pp~0.offset|))} assume !!(~i~1 < 2);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4); {3250#(and (= (select (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|) (+ |~#pp~0.offset| 4)) |f_#t~mem2.offset|) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,671 INFO L273 TraceCheckUtils]: 48: Hoare triple {3250#(and (= (select (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|) (+ |~#pp~0.offset| 4)) |f_#t~mem2.offset|) (= 0 |~#pp~0.offset|))} assume #t~mem2.base == 0 && #t~mem2.offset == 0;havoc #t~mem2.base, #t~mem2.offset;call write~$Pointer$(~pointer.base, ~pointer.offset, ~#pp~0.base, ~#pp~0.offset + ~i~1 * 4, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + ~i~1 * 4, 4); {3254#(and (= 0 (select (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|) (+ |~#pp~0.offset| 4))) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,672 INFO L273 TraceCheckUtils]: 49: Hoare triple {3254#(and (= 0 (select (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|) (+ |~#pp~0.offset| 4))) (= 0 |~#pp~0.offset|))} assume true; {3254#(and (= 0 (select (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|) (+ |~#pp~0.offset| 4))) (= 0 |~#pp~0.offset|))} is VALID [2018-11-14 17:22:57,673 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {3254#(and (= 0 (select (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|) (+ |~#pp~0.offset| 4))) (= 0 |~#pp~0.offset|))} {3222#(and (= 1 (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (+ |~#pp~0.offset| 4))) (= 0 |~#pp~0.offset|))} #103#return; {3078#false} is VALID [2018-11-14 17:22:57,673 INFO L256 TraceCheckUtils]: 51: Hoare triple {3078#false} call g(~a~0.base, ~a~0.offset); {3078#false} is VALID [2018-11-14 17:22:57,673 INFO L273 TraceCheckUtils]: 52: Hoare triple {3078#false} ~pointer.base, ~pointer.offset := #in~pointer.base, #in~pointer.offset;havoc ~i~2;~i~2 := 0; {3078#false} is VALID [2018-11-14 17:22:57,674 INFO L273 TraceCheckUtils]: 53: Hoare triple {3078#false} assume true; {3078#false} is VALID [2018-11-14 17:22:57,674 INFO L273 TraceCheckUtils]: 54: Hoare triple {3078#false} assume !!(~i~2 < 2);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + ~i~2 * 4, 4); {3078#false} is VALID [2018-11-14 17:22:57,674 INFO L273 TraceCheckUtils]: 55: Hoare triple {3078#false} assume #t~mem4.base == ~pointer.base && #t~mem4.offset == ~pointer.offset;havoc #t~mem4.base, #t~mem4.offset;call #t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + ~i~2 * 4, 4); {3078#false} is VALID [2018-11-14 17:22:57,674 INFO L273 TraceCheckUtils]: 56: Hoare triple {3078#false} assume !(#t~mem5 == 1); {3078#false} is VALID [2018-11-14 17:22:57,675 INFO L256 TraceCheckUtils]: 57: Hoare triple {3078#false} call __blast_assert(); {3078#false} is VALID [2018-11-14 17:22:57,675 INFO L273 TraceCheckUtils]: 58: Hoare triple {3078#false} assume !false; {3078#false} is VALID [2018-11-14 17:22:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 17:22:57,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:22:57,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2018-11-14 17:22:57,703 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2018-11-14 17:22:57,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:57,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-14 17:22:57,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:57,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-14 17:22:57,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-14 17:22:57,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2018-11-14 17:22:57,830 INFO L87 Difference]: Start difference. First operand 109 states and 130 transitions. Second operand 31 states. [2018-11-14 17:23:03,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:23:03,178 INFO L93 Difference]: Finished difference Result 171 states and 204 transitions. [2018-11-14 17:23:03,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 17:23:03,179 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2018-11-14 17:23:03,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:23:03,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:23:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 120 transitions. [2018-11-14 17:23:03,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:23:03,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 120 transitions. [2018-11-14 17:23:03,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 120 transitions. [2018-11-14 17:23:03,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:23:03,363 INFO L225 Difference]: With dead ends: 171 [2018-11-14 17:23:03,364 INFO L226 Difference]: Without dead ends: 155 [2018-11-14 17:23:03,365 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=293, Invalid=2157, Unknown=0, NotChecked=0, Total=2450 [2018-11-14 17:23:03,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-14 17:23:03,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 127. [2018-11-14 17:23:03,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:23:03,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand 127 states. [2018-11-14 17:23:03,682 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 127 states. [2018-11-14 17:23:03,682 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 127 states. [2018-11-14 17:23:03,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:23:03,689 INFO L93 Difference]: Finished difference Result 155 states and 185 transitions. [2018-11-14 17:23:03,689 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 185 transitions. [2018-11-14 17:23:03,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:23:03,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:23:03,690 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 155 states. [2018-11-14 17:23:03,690 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 155 states. [2018-11-14 17:23:03,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:23:03,697 INFO L93 Difference]: Finished difference Result 155 states and 185 transitions. [2018-11-14 17:23:03,697 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 185 transitions. [2018-11-14 17:23:03,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:23:03,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:23:03,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:23:03,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:23:03,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-14 17:23:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 151 transitions. [2018-11-14 17:23:03,704 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 151 transitions. Word has length 59 [2018-11-14 17:23:03,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:23:03,705 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 151 transitions. [2018-11-14 17:23:03,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-14 17:23:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 151 transitions. [2018-11-14 17:23:03,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-14 17:23:03,706 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:23:03,706 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:23:03,706 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:23:03,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:23:03,707 INFO L82 PathProgramCache]: Analyzing trace with hash -709140094, now seen corresponding path program 1 times [2018-11-14 17:23:03,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:23:03,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:23:03,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:23:03,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:23:03,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:23:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:23:04,278 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: must not be argument of unary minus @diff at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:111) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:316) 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) [2018-11-14 17:23:04,282 INFO L168 Benchmark]: Toolchain (without parser) took 24617.01 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -949.9 MB). Peak memory consumption was 143.8 MB. Max. memory is 7.1 GB. [2018-11-14 17:23:04,283 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:23:04,284 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:23:04,285 INFO L168 Benchmark]: Boogie Preprocessor took 78.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:23:04,285 INFO L168 Benchmark]: RCFGBuilder took 1043.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 720.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -739.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-14 17:23:04,286 INFO L168 Benchmark]: TraceAbstraction took 23081.86 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 372.8 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -220.7 MB). Peak memory consumption was 152.1 MB. Max. memory is 7.1 GB. [2018-11-14 17:23:04,289 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 407.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1043.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 720.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -739.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23081.86 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 372.8 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -220.7 MB). Peak memory consumption was 152.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: must not be argument of unary minus @diff de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: must not be argument of unary minus @diff: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:111) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...