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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:55:49,575 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:55:49,577 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:55:49,595 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:55:49,595 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:55:49,596 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:55:49,598 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:55:49,601 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:55:49,603 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:55:49,604 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:55:49,606 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:55:49,607 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:55:49,608 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:55:49,609 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:55:49,612 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:55:49,618 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:55:49,619 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:55:49,625 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:55:49,627 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:55:49,628 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:55:49,630 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:55:49,633 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:55:49,637 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:55:49,637 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:55:49,638 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:55:49,638 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:55:49,639 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:55:49,642 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:55:49,643 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:55:49,643 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:55:49,644 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:55:49,644 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:55:49,644 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:55:49,645 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:55:49,647 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:55:49,647 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:55:49,648 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-23 12:55:49,674 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:55:49,674 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:55:49,675 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:55:49,676 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:55:49,676 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:55:49,677 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:55:49,677 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:55:49,677 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:55:49,677 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:55:49,677 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:55:49,679 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:55:49,679 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:55:49,679 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:55:49,680 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:55:49,680 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:55:49,680 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:55:49,680 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:55:49,680 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:55:49,680 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:55:49,682 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:55:49,682 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:55:49,682 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:55:49,682 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:55:49,683 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:55:49,683 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:55:49,683 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:55:49,683 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:55:49,684 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:55:49,684 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:55:49,684 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:55:49,684 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:55:49,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:55:49,745 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:55:49,749 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:55:49,750 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:55:49,751 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:55:49,751 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i [2018-11-23 12:55:49,810 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/753ff33a1/f7763f9484614e03ba67a09d6aa9c13d/FLAGa3dcc28bd [2018-11-23 12:55:50,366 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:55:50,367 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i [2018-11-23 12:55:50,381 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/753ff33a1/f7763f9484614e03ba67a09d6aa9c13d/FLAGa3dcc28bd [2018-11-23 12:55:50,648 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/753ff33a1/f7763f9484614e03ba67a09d6aa9c13d [2018-11-23 12:55:50,658 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:55:50,659 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:55:50,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:55:50,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:55:50,664 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:55:50,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:50" (1/1) ... [2018-11-23 12:55:50,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4176cb74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50, skipping insertion in model container [2018-11-23 12:55:50,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:50" (1/1) ... [2018-11-23 12:55:50,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:55:50,739 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:55:51,233 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:55:51,247 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:55:51,325 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:55:51,387 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:55:51,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51 WrapperNode [2018-11-23 12:55:51,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:55:51,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:55:51,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:55:51,389 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:55:51,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51" (1/1) ... [2018-11-23 12:55:51,505 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51" (1/1) ... [2018-11-23 12:55:51,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:55:51,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:55:51,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:55:51,516 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:55:51,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51" (1/1) ... [2018-11-23 12:55:51,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51" (1/1) ... [2018-11-23 12:55:51,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51" (1/1) ... [2018-11-23 12:55:51,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51" (1/1) ... [2018-11-23 12:55:51,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51" (1/1) ... [2018-11-23 12:55:51,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51" (1/1) ... [2018-11-23 12:55:51,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51" (1/1) ... [2018-11-23 12:55:51,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:55:51,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:55:51,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:55:51,604 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:55:51,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51" (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-23 12:55:51,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:55:51,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:55:51,671 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:55:51,671 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:55:51,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:55:51,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:55:51,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:55:51,672 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:55:51,672 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:55:51,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:55:51,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:55:51,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:55:51,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:55:51,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:55:53,144 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:55:53,145 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 12:55:53,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:53 BoogieIcfgContainer [2018-11-23 12:55:53,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:55:53,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:55:53,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:55:53,150 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:55:53,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:55:50" (1/3) ... [2018-11-23 12:55:53,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d21fdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:53, skipping insertion in model container [2018-11-23 12:55:53,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51" (2/3) ... [2018-11-23 12:55:53,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d21fdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:53, skipping insertion in model container [2018-11-23 12:55:53,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:53" (3/3) ... [2018-11-23 12:55:53,153 INFO L112 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr_false-unreach-call_false-termination.i [2018-11-23 12:55:53,162 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:55:53,172 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:55:53,190 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:55:53,223 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:55:53,224 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:55:53,224 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:55:53,225 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:55:53,225 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:55:53,225 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:55:53,225 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:55:53,225 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:55:53,225 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:55:53,245 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-11-23 12:55:53,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:55:53,253 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:53,254 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:53,256 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:53,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:53,262 INFO L82 PathProgramCache]: Analyzing trace with hash 615932551, now seen corresponding path program 1 times [2018-11-23 12:55:53,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:53,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:53,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:53,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:53,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:53,457 INFO L256 TraceCheckUtils]: 0: Hoare triple {60#true} call ULTIMATE.init(); {60#true} is VALID [2018-11-23 12:55:53,462 INFO L273 TraceCheckUtils]: 1: Hoare triple {60#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {60#true} is VALID [2018-11-23 12:55:53,463 INFO L273 TraceCheckUtils]: 2: Hoare triple {60#true} assume true; {60#true} is VALID [2018-11-23 12:55:53,463 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {60#true} {60#true} #215#return; {60#true} is VALID [2018-11-23 12:55:53,463 INFO L256 TraceCheckUtils]: 4: Hoare triple {60#true} call #t~ret41 := main(); {60#true} is VALID [2018-11-23 12:55:53,464 INFO L273 TraceCheckUtils]: 5: Hoare triple {60#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {60#true} is VALID [2018-11-23 12:55:53,479 INFO L273 TraceCheckUtils]: 6: Hoare triple {60#true} assume !true; {61#false} is VALID [2018-11-23 12:55:53,480 INFO L273 TraceCheckUtils]: 7: Hoare triple {61#false} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {61#false} is VALID [2018-11-23 12:55:53,480 INFO L273 TraceCheckUtils]: 8: Hoare triple {61#false} assume !(~root~0.base != 0 || ~root~0.offset != 0); {61#false} is VALID [2018-11-23 12:55:53,480 INFO L273 TraceCheckUtils]: 9: Hoare triple {61#false} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {61#false} is VALID [2018-11-23 12:55:53,481 INFO L273 TraceCheckUtils]: 10: Hoare triple {61#false} assume !(~a~0.base == 0 && ~a~0.offset == 0); {61#false} is VALID [2018-11-23 12:55:53,481 INFO L273 TraceCheckUtils]: 11: Hoare triple {61#false} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {61#false} is VALID [2018-11-23 12:55:53,481 INFO L273 TraceCheckUtils]: 12: Hoare triple {61#false} assume !true; {61#false} is VALID [2018-11-23 12:55:53,482 INFO L273 TraceCheckUtils]: 13: Hoare triple {61#false} assume !true; {61#false} is VALID [2018-11-23 12:55:53,482 INFO L273 TraceCheckUtils]: 14: Hoare triple {61#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {61#false} is VALID [2018-11-23 12:55:53,482 INFO L273 TraceCheckUtils]: 15: Hoare triple {61#false} assume !true; {61#false} is VALID [2018-11-23 12:55:53,484 INFO L273 TraceCheckUtils]: 16: Hoare triple {61#false} assume !true; {61#false} is VALID [2018-11-23 12:55:53,485 INFO L273 TraceCheckUtils]: 17: Hoare triple {61#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {61#false} is VALID [2018-11-23 12:55:53,485 INFO L273 TraceCheckUtils]: 18: Hoare triple {61#false} assume 3 != #t~mem40;havoc #t~mem40; {61#false} is VALID [2018-11-23 12:55:53,486 INFO L273 TraceCheckUtils]: 19: Hoare triple {61#false} assume !false; {61#false} is VALID [2018-11-23 12:55:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:55:53,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:53,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:55:53,502 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-23 12:55:53,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:53,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:55:53,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:53,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:55:53,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:55:53,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:55:53,731 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 2 states. [2018-11-23 12:55:54,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:54,080 INFO L93 Difference]: Finished difference Result 108 states and 166 transitions. [2018-11-23 12:55:54,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:55:54,081 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-23 12:55:54,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:55:54,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 166 transitions. [2018-11-23 12:55:54,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:55:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 166 transitions. [2018-11-23 12:55:54,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 166 transitions. [2018-11-23 12:55:54,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:54,619 INFO L225 Difference]: With dead ends: 108 [2018-11-23 12:55:54,619 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:55:54,623 INFO L631 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-23 12:55:54,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:55:54,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-23 12:55:54,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:54,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2018-11-23 12:55:54,677 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-23 12:55:54,677 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-23 12:55:54,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:54,682 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2018-11-23 12:55:54,682 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2018-11-23 12:55:54,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:54,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:54,683 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-23 12:55:54,684 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-23 12:55:54,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:54,689 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2018-11-23 12:55:54,689 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2018-11-23 12:55:54,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:54,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:54,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:54,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:55:54,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2018-11-23 12:55:54,696 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 20 [2018-11-23 12:55:54,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:54,697 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2018-11-23 12:55:54,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:55:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2018-11-23 12:55:54,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:55:54,699 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:54,699 INFO L402 BasicCegarLoop]: trace histogram [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-23 12:55:54,699 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:54,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:54,700 INFO L82 PathProgramCache]: Analyzing trace with hash -2054128225, now seen corresponding path program 1 times [2018-11-23 12:55:54,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:54,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:54,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:54,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:54,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:54,817 INFO L256 TraceCheckUtils]: 0: Hoare triple {349#true} call ULTIMATE.init(); {349#true} is VALID [2018-11-23 12:55:54,818 INFO L273 TraceCheckUtils]: 1: Hoare triple {349#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {349#true} is VALID [2018-11-23 12:55:54,818 INFO L273 TraceCheckUtils]: 2: Hoare triple {349#true} assume true; {349#true} is VALID [2018-11-23 12:55:54,818 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {349#true} {349#true} #215#return; {349#true} is VALID [2018-11-23 12:55:54,819 INFO L256 TraceCheckUtils]: 4: Hoare triple {349#true} call #t~ret41 := main(); {349#true} is VALID [2018-11-23 12:55:54,824 INFO L273 TraceCheckUtils]: 5: Hoare triple {349#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {351#(not (= main_~root~0.base 0))} is VALID [2018-11-23 12:55:54,827 INFO L273 TraceCheckUtils]: 6: Hoare triple {351#(not (= main_~root~0.base 0))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {351#(not (= main_~root~0.base 0))} is VALID [2018-11-23 12:55:54,827 INFO L273 TraceCheckUtils]: 7: Hoare triple {351#(not (= main_~root~0.base 0))} assume !(0 != #t~nondet3);havoc #t~nondet3; {351#(not (= main_~root~0.base 0))} is VALID [2018-11-23 12:55:54,830 INFO L273 TraceCheckUtils]: 8: Hoare triple {351#(not (= main_~root~0.base 0))} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {351#(not (= main_~root~0.base 0))} is VALID [2018-11-23 12:55:54,830 INFO L273 TraceCheckUtils]: 9: Hoare triple {351#(not (= main_~root~0.base 0))} assume !(~root~0.base != 0 || ~root~0.offset != 0); {350#false} is VALID [2018-11-23 12:55:54,831 INFO L273 TraceCheckUtils]: 10: Hoare triple {350#false} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {350#false} is VALID [2018-11-23 12:55:54,831 INFO L273 TraceCheckUtils]: 11: Hoare triple {350#false} assume !(~a~0.base == 0 && ~a~0.offset == 0); {350#false} is VALID [2018-11-23 12:55:54,831 INFO L273 TraceCheckUtils]: 12: Hoare triple {350#false} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {350#false} is VALID [2018-11-23 12:55:54,832 INFO L273 TraceCheckUtils]: 13: Hoare triple {350#false} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {350#false} is VALID [2018-11-23 12:55:54,832 INFO L273 TraceCheckUtils]: 14: Hoare triple {350#false} assume !(0 != #t~nondet30);havoc #t~nondet30; {350#false} is VALID [2018-11-23 12:55:54,832 INFO L273 TraceCheckUtils]: 15: Hoare triple {350#false} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {350#false} is VALID [2018-11-23 12:55:54,833 INFO L273 TraceCheckUtils]: 16: Hoare triple {350#false} assume !(0 != #t~nondet33);havoc #t~nondet33; {350#false} is VALID [2018-11-23 12:55:54,833 INFO L273 TraceCheckUtils]: 17: Hoare triple {350#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {350#false} is VALID [2018-11-23 12:55:54,833 INFO L273 TraceCheckUtils]: 18: Hoare triple {350#false} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {350#false} is VALID [2018-11-23 12:55:54,834 INFO L273 TraceCheckUtils]: 19: Hoare triple {350#false} assume !(2 == #t~mem36);havoc #t~mem36; {350#false} is VALID [2018-11-23 12:55:54,834 INFO L273 TraceCheckUtils]: 20: Hoare triple {350#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {350#false} is VALID [2018-11-23 12:55:54,835 INFO L273 TraceCheckUtils]: 21: Hoare triple {350#false} assume !(1 == #t~mem38);havoc #t~mem38; {350#false} is VALID [2018-11-23 12:55:54,835 INFO L273 TraceCheckUtils]: 22: Hoare triple {350#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {350#false} is VALID [2018-11-23 12:55:54,835 INFO L273 TraceCheckUtils]: 23: Hoare triple {350#false} assume 3 != #t~mem40;havoc #t~mem40; {350#false} is VALID [2018-11-23 12:55:54,836 INFO L273 TraceCheckUtils]: 24: Hoare triple {350#false} assume !false; {350#false} is VALID [2018-11-23 12:55:54,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:55:54,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:54,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:55:54,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:55:54,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:54,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:55:54,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:54,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:55:54,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:55:54,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:55:54,895 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand 3 states. [2018-11-23 12:55:55,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:55,166 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2018-11-23 12:55:55,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:55:55,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:55:55,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:55:55,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2018-11-23 12:55:55,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:55:55,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2018-11-23 12:55:55,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2018-11-23 12:55:55,377 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-23 12:55:55,381 INFO L225 Difference]: With dead ends: 75 [2018-11-23 12:55:55,381 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 12:55:55,382 INFO L631 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-23 12:55:55,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 12:55:55,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-23 12:55:55,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:55,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2018-11-23 12:55:55,438 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-23 12:55:55,439 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-23 12:55:55,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:55,443 INFO L93 Difference]: Finished difference Result 55 states and 77 transitions. [2018-11-23 12:55:55,444 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2018-11-23 12:55:55,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:55,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:55,445 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-23 12:55:55,445 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-23 12:55:55,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:55,450 INFO L93 Difference]: Finished difference Result 55 states and 77 transitions. [2018-11-23 12:55:55,450 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2018-11-23 12:55:55,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:55,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:55,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:55,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:55:55,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2018-11-23 12:55:55,456 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 25 [2018-11-23 12:55:55,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:55,456 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2018-11-23 12:55:55,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:55:55,456 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2018-11-23 12:55:55,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:55:55,458 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:55,458 INFO L402 BasicCegarLoop]: trace histogram [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-23 12:55:55,458 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:55,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:55,459 INFO L82 PathProgramCache]: Analyzing trace with hash 623425772, now seen corresponding path program 1 times [2018-11-23 12:55:55,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:55,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:55,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:55,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:55,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:55,546 INFO L256 TraceCheckUtils]: 0: Hoare triple {620#true} call ULTIMATE.init(); {620#true} is VALID [2018-11-23 12:55:55,546 INFO L273 TraceCheckUtils]: 1: Hoare triple {620#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {620#true} is VALID [2018-11-23 12:55:55,547 INFO L273 TraceCheckUtils]: 2: Hoare triple {620#true} assume true; {620#true} is VALID [2018-11-23 12:55:55,547 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {620#true} {620#true} #215#return; {620#true} is VALID [2018-11-23 12:55:55,547 INFO L256 TraceCheckUtils]: 4: Hoare triple {620#true} call #t~ret41 := main(); {620#true} is VALID [2018-11-23 12:55:55,548 INFO L273 TraceCheckUtils]: 5: Hoare triple {620#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {620#true} is VALID [2018-11-23 12:55:55,548 INFO L273 TraceCheckUtils]: 6: Hoare triple {620#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {620#true} is VALID [2018-11-23 12:55:55,548 INFO L273 TraceCheckUtils]: 7: Hoare triple {620#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {620#true} is VALID [2018-11-23 12:55:55,549 INFO L273 TraceCheckUtils]: 8: Hoare triple {620#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {620#true} is VALID [2018-11-23 12:55:55,549 INFO L273 TraceCheckUtils]: 9: Hoare triple {620#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {620#true} is VALID [2018-11-23 12:55:55,550 INFO L273 TraceCheckUtils]: 10: Hoare triple {620#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {620#true} is VALID [2018-11-23 12:55:55,552 INFO L273 TraceCheckUtils]: 11: Hoare triple {620#true} assume #t~short24; {622#|main_#t~short24|} is VALID [2018-11-23 12:55:55,563 INFO L273 TraceCheckUtils]: 12: Hoare triple {622#|main_#t~short24|} assume !#t~short24;havoc #t~mem23.base, #t~mem23.offset;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset; {621#false} is VALID [2018-11-23 12:55:55,563 INFO L273 TraceCheckUtils]: 13: Hoare triple {621#false} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {621#false} is VALID [2018-11-23 12:55:55,564 INFO L273 TraceCheckUtils]: 14: Hoare triple {621#false} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {621#false} is VALID [2018-11-23 12:55:55,564 INFO L273 TraceCheckUtils]: 15: Hoare triple {621#false} assume !(~root~0.base != 0 || ~root~0.offset != 0); {621#false} is VALID [2018-11-23 12:55:55,564 INFO L273 TraceCheckUtils]: 16: Hoare triple {621#false} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {621#false} is VALID [2018-11-23 12:55:55,565 INFO L273 TraceCheckUtils]: 17: Hoare triple {621#false} assume !(~a~0.base == 0 && ~a~0.offset == 0); {621#false} is VALID [2018-11-23 12:55:55,565 INFO L273 TraceCheckUtils]: 18: Hoare triple {621#false} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {621#false} is VALID [2018-11-23 12:55:55,566 INFO L273 TraceCheckUtils]: 19: Hoare triple {621#false} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {621#false} is VALID [2018-11-23 12:55:55,566 INFO L273 TraceCheckUtils]: 20: Hoare triple {621#false} assume !(0 != #t~nondet30);havoc #t~nondet30; {621#false} is VALID [2018-11-23 12:55:55,566 INFO L273 TraceCheckUtils]: 21: Hoare triple {621#false} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {621#false} is VALID [2018-11-23 12:55:55,567 INFO L273 TraceCheckUtils]: 22: Hoare triple {621#false} assume !(0 != #t~nondet33);havoc #t~nondet33; {621#false} is VALID [2018-11-23 12:55:55,567 INFO L273 TraceCheckUtils]: 23: Hoare triple {621#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {621#false} is VALID [2018-11-23 12:55:55,567 INFO L273 TraceCheckUtils]: 24: Hoare triple {621#false} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {621#false} is VALID [2018-11-23 12:55:55,568 INFO L273 TraceCheckUtils]: 25: Hoare triple {621#false} assume !(2 == #t~mem36);havoc #t~mem36; {621#false} is VALID [2018-11-23 12:55:55,568 INFO L273 TraceCheckUtils]: 26: Hoare triple {621#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {621#false} is VALID [2018-11-23 12:55:55,568 INFO L273 TraceCheckUtils]: 27: Hoare triple {621#false} assume !(1 == #t~mem38);havoc #t~mem38; {621#false} is VALID [2018-11-23 12:55:55,569 INFO L273 TraceCheckUtils]: 28: Hoare triple {621#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {621#false} is VALID [2018-11-23 12:55:55,569 INFO L273 TraceCheckUtils]: 29: Hoare triple {621#false} assume 3 != #t~mem40;havoc #t~mem40; {621#false} is VALID [2018-11-23 12:55:55,569 INFO L273 TraceCheckUtils]: 30: Hoare triple {621#false} assume !false; {621#false} is VALID [2018-11-23 12:55:55,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:55:55,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:55,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:55:55,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:55:55,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:55,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:55:55,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:55,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:55:55,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:55:55,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:55:55,645 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand 3 states. [2018-11-23 12:55:55,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:55,835 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2018-11-23 12:55:55,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:55:55,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:55:55,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:55:55,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2018-11-23 12:55:55,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:55:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2018-11-23 12:55:55,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2018-11-23 12:55:55,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:55,988 INFO L225 Difference]: With dead ends: 93 [2018-11-23 12:55:55,989 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:55:55,989 INFO L631 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-23 12:55:55,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:55:56,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 12:55:56,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:56,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2018-11-23 12:55:56,026 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 12:55:56,026 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 12:55:56,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:56,031 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2018-11-23 12:55:56,032 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2018-11-23 12:55:56,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:56,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:56,033 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 12:55:56,033 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 12:55:56,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:56,036 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2018-11-23 12:55:56,037 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2018-11-23 12:55:56,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:56,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:56,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:56,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:55:56,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2018-11-23 12:55:56,042 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 31 [2018-11-23 12:55:56,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:56,042 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2018-11-23 12:55:56,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:55:56,042 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2018-11-23 12:55:56,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:55:56,044 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:56,044 INFO L402 BasicCegarLoop]: trace histogram [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-23 12:55:56,044 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:56,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:56,045 INFO L82 PathProgramCache]: Analyzing trace with hash -194222678, now seen corresponding path program 1 times [2018-11-23 12:55:56,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:56,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:56,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:56,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:56,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:56,193 INFO L256 TraceCheckUtils]: 0: Hoare triple {919#true} call ULTIMATE.init(); {919#true} is VALID [2018-11-23 12:55:56,193 INFO L273 TraceCheckUtils]: 1: Hoare triple {919#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {919#true} is VALID [2018-11-23 12:55:56,193 INFO L273 TraceCheckUtils]: 2: Hoare triple {919#true} assume true; {919#true} is VALID [2018-11-23 12:55:56,194 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {919#true} {919#true} #215#return; {919#true} is VALID [2018-11-23 12:55:56,194 INFO L256 TraceCheckUtils]: 4: Hoare triple {919#true} call #t~ret41 := main(); {919#true} is VALID [2018-11-23 12:55:56,194 INFO L273 TraceCheckUtils]: 5: Hoare triple {919#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {919#true} is VALID [2018-11-23 12:55:56,194 INFO L273 TraceCheckUtils]: 6: Hoare triple {919#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {919#true} is VALID [2018-11-23 12:55:56,195 INFO L273 TraceCheckUtils]: 7: Hoare triple {919#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {919#true} is VALID [2018-11-23 12:55:56,195 INFO L273 TraceCheckUtils]: 8: Hoare triple {919#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {919#true} is VALID [2018-11-23 12:55:56,195 INFO L273 TraceCheckUtils]: 9: Hoare triple {919#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {919#true} is VALID [2018-11-23 12:55:56,195 INFO L273 TraceCheckUtils]: 10: Hoare triple {919#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {919#true} is VALID [2018-11-23 12:55:56,196 INFO L273 TraceCheckUtils]: 11: Hoare triple {919#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {919#true} is VALID [2018-11-23 12:55:56,196 INFO L273 TraceCheckUtils]: 12: Hoare triple {919#true} assume !#t~short24;havoc #t~mem23.base, #t~mem23.offset;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset; {919#true} is VALID [2018-11-23 12:55:56,196 INFO L273 TraceCheckUtils]: 13: Hoare triple {919#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {919#true} is VALID [2018-11-23 12:55:56,197 INFO L273 TraceCheckUtils]: 14: Hoare triple {919#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {919#true} is VALID [2018-11-23 12:55:56,197 INFO L273 TraceCheckUtils]: 15: Hoare triple {919#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {919#true} is VALID [2018-11-23 12:55:56,197 INFO L273 TraceCheckUtils]: 16: Hoare triple {919#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {919#true} is VALID [2018-11-23 12:55:56,198 INFO L273 TraceCheckUtils]: 17: Hoare triple {919#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {919#true} is VALID [2018-11-23 12:55:56,209 INFO L273 TraceCheckUtils]: 18: Hoare triple {919#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {921#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:56,210 INFO L273 TraceCheckUtils]: 19: Hoare triple {921#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {921#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:56,210 INFO L273 TraceCheckUtils]: 20: Hoare triple {921#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet30);havoc #t~nondet30; {921#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:56,212 INFO L273 TraceCheckUtils]: 21: Hoare triple {921#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {921#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:56,212 INFO L273 TraceCheckUtils]: 22: Hoare triple {921#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet33);havoc #t~nondet33; {921#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:56,222 INFO L273 TraceCheckUtils]: 23: Hoare triple {921#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {922#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:55:56,223 INFO L273 TraceCheckUtils]: 24: Hoare triple {922#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {922#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:55:56,229 INFO L273 TraceCheckUtils]: 25: Hoare triple {922#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem36);havoc #t~mem36; {922#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:55:56,229 INFO L273 TraceCheckUtils]: 26: Hoare triple {922#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {922#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:55:56,231 INFO L273 TraceCheckUtils]: 27: Hoare triple {922#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1 == #t~mem38);havoc #t~mem38; {922#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:55:56,231 INFO L273 TraceCheckUtils]: 28: Hoare triple {922#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {923#(= 3 |main_#t~mem40|)} is VALID [2018-11-23 12:55:56,237 INFO L273 TraceCheckUtils]: 29: Hoare triple {923#(= 3 |main_#t~mem40|)} assume 3 != #t~mem40;havoc #t~mem40; {920#false} is VALID [2018-11-23 12:55:56,238 INFO L273 TraceCheckUtils]: 30: Hoare triple {920#false} assume !false; {920#false} is VALID [2018-11-23 12:55:56,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:55:56,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:56,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:55:56,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 12:55:56,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:56,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:55:56,291 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:56,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:55:56,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:55:56,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:55:56,292 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand 5 states. [2018-11-23 12:55:56,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:56,875 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2018-11-23 12:55:56,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:55:56,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 12:55:56,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:56,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:55:56,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2018-11-23 12:55:56,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:55:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2018-11-23 12:55:56,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 93 transitions. [2018-11-23 12:55:57,034 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-23 12:55:57,037 INFO L225 Difference]: With dead ends: 82 [2018-11-23 12:55:57,037 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:55:57,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:55:57,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:55:57,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2018-11-23 12:55:57,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:57,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 66 states. [2018-11-23 12:55:57,077 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 66 states. [2018-11-23 12:55:57,077 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 66 states. [2018-11-23 12:55:57,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:57,081 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2018-11-23 12:55:57,081 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2018-11-23 12:55:57,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:57,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:57,083 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 78 states. [2018-11-23 12:55:57,083 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 78 states. [2018-11-23 12:55:57,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:57,087 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2018-11-23 12:55:57,087 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2018-11-23 12:55:57,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:57,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:57,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:57,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:57,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 12:55:57,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2018-11-23 12:55:57,092 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 31 [2018-11-23 12:55:57,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:57,092 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2018-11-23 12:55:57,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:55:57,092 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2018-11-23 12:55:57,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:55:57,093 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:57,094 INFO L402 BasicCegarLoop]: trace histogram [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-23 12:55:57,094 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:57,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:57,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1915719579, now seen corresponding path program 1 times [2018-11-23 12:55:57,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:57,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:57,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:57,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:57,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:57,227 INFO L256 TraceCheckUtils]: 0: Hoare triple {1263#true} call ULTIMATE.init(); {1263#true} is VALID [2018-11-23 12:55:57,227 INFO L273 TraceCheckUtils]: 1: Hoare triple {1263#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1263#true} is VALID [2018-11-23 12:55:57,228 INFO L273 TraceCheckUtils]: 2: Hoare triple {1263#true} assume true; {1263#true} is VALID [2018-11-23 12:55:57,228 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1263#true} {1263#true} #215#return; {1263#true} is VALID [2018-11-23 12:55:57,228 INFO L256 TraceCheckUtils]: 4: Hoare triple {1263#true} call #t~ret41 := main(); {1263#true} is VALID [2018-11-23 12:55:57,228 INFO L273 TraceCheckUtils]: 5: Hoare triple {1263#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {1263#true} is VALID [2018-11-23 12:55:57,229 INFO L273 TraceCheckUtils]: 6: Hoare triple {1263#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1263#true} is VALID [2018-11-23 12:55:57,229 INFO L273 TraceCheckUtils]: 7: Hoare triple {1263#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {1263#true} is VALID [2018-11-23 12:55:57,229 INFO L273 TraceCheckUtils]: 8: Hoare triple {1263#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {1263#true} is VALID [2018-11-23 12:55:57,230 INFO L273 TraceCheckUtils]: 9: Hoare triple {1263#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {1263#true} is VALID [2018-11-23 12:55:57,230 INFO L273 TraceCheckUtils]: 10: Hoare triple {1263#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {1263#true} is VALID [2018-11-23 12:55:57,230 INFO L273 TraceCheckUtils]: 11: Hoare triple {1263#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {1263#true} is VALID [2018-11-23 12:55:57,230 INFO L273 TraceCheckUtils]: 12: Hoare triple {1263#true} assume !#t~short24;havoc #t~mem23.base, #t~mem23.offset;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset; {1263#true} is VALID [2018-11-23 12:55:57,231 INFO L273 TraceCheckUtils]: 13: Hoare triple {1263#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {1263#true} is VALID [2018-11-23 12:55:57,231 INFO L273 TraceCheckUtils]: 14: Hoare triple {1263#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {1263#true} is VALID [2018-11-23 12:55:57,231 INFO L273 TraceCheckUtils]: 15: Hoare triple {1263#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {1263#true} is VALID [2018-11-23 12:55:57,231 INFO L273 TraceCheckUtils]: 16: Hoare triple {1263#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {1263#true} is VALID [2018-11-23 12:55:57,232 INFO L273 TraceCheckUtils]: 17: Hoare triple {1263#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1263#true} is VALID [2018-11-23 12:55:57,245 INFO L273 TraceCheckUtils]: 18: Hoare triple {1263#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1265#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:57,250 INFO L273 TraceCheckUtils]: 19: Hoare triple {1265#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {1265#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:57,251 INFO L273 TraceCheckUtils]: 20: Hoare triple {1265#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet30);havoc #t~nondet30; {1265#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:57,254 INFO L273 TraceCheckUtils]: 21: Hoare triple {1265#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {1265#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:57,255 INFO L273 TraceCheckUtils]: 22: Hoare triple {1265#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet33);havoc #t~nondet33; {1265#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:57,256 INFO L273 TraceCheckUtils]: 23: Hoare triple {1265#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1266#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:55:57,257 INFO L273 TraceCheckUtils]: 24: Hoare triple {1266#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {1266#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:55:57,257 INFO L273 TraceCheckUtils]: 25: Hoare triple {1266#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem36);havoc #t~mem36; {1266#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:55:57,260 INFO L273 TraceCheckUtils]: 26: Hoare triple {1266#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {1267#(= 3 |main_#t~mem38|)} is VALID [2018-11-23 12:55:57,265 INFO L273 TraceCheckUtils]: 27: Hoare triple {1267#(= 3 |main_#t~mem38|)} assume !!(1 == #t~mem38);havoc #t~mem38;call #t~mem39.base, #t~mem39.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem39.base, #t~mem39.offset;havoc #t~mem39.base, #t~mem39.offset; {1264#false} is VALID [2018-11-23 12:55:57,265 INFO L273 TraceCheckUtils]: 28: Hoare triple {1264#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {1264#false} is VALID [2018-11-23 12:55:57,265 INFO L273 TraceCheckUtils]: 29: Hoare triple {1264#false} assume !(1 == #t~mem38);havoc #t~mem38; {1264#false} is VALID [2018-11-23 12:55:57,266 INFO L273 TraceCheckUtils]: 30: Hoare triple {1264#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {1264#false} is VALID [2018-11-23 12:55:57,266 INFO L273 TraceCheckUtils]: 31: Hoare triple {1264#false} assume 3 != #t~mem40;havoc #t~mem40; {1264#false} is VALID [2018-11-23 12:55:57,266 INFO L273 TraceCheckUtils]: 32: Hoare triple {1264#false} assume !false; {1264#false} is VALID [2018-11-23 12:55:57,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:55:57,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:57,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:55:57,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-23 12:55:57,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:57,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:55:57,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:57,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:55:57,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:55:57,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:55:57,333 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand 5 states. [2018-11-23 12:55:57,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:57,917 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2018-11-23 12:55:57,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:55:57,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-23 12:55:57,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:55:57,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-23 12:55:57,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:55:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-23 12:55:57,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 95 transitions. [2018-11-23 12:55:58,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:58,084 INFO L225 Difference]: With dead ends: 84 [2018-11-23 12:55:58,084 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 12:55:58,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:55:58,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 12:55:58,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2018-11-23 12:55:58,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:58,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 64 states. [2018-11-23 12:55:58,132 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 64 states. [2018-11-23 12:55:58,132 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 64 states. [2018-11-23 12:55:58,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:58,136 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2018-11-23 12:55:58,136 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2018-11-23 12:55:58,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:58,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:58,137 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 76 states. [2018-11-23 12:55:58,137 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 76 states. [2018-11-23 12:55:58,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:58,141 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2018-11-23 12:55:58,141 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2018-11-23 12:55:58,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:58,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:58,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:58,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:58,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 12:55:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2018-11-23 12:55:58,145 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 33 [2018-11-23 12:55:58,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:58,145 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2018-11-23 12:55:58,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:55:58,146 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2018-11-23 12:55:58,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:55:58,147 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:58,147 INFO L402 BasicCegarLoop]: trace histogram [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-23 12:55:58,147 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:58,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:58,148 INFO L82 PathProgramCache]: Analyzing trace with hash -891016603, now seen corresponding path program 1 times [2018-11-23 12:55:58,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:58,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:58,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:58,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:58,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:58,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {1603#true} call ULTIMATE.init(); {1603#true} is VALID [2018-11-23 12:55:58,285 INFO L273 TraceCheckUtils]: 1: Hoare triple {1603#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1603#true} is VALID [2018-11-23 12:55:58,286 INFO L273 TraceCheckUtils]: 2: Hoare triple {1603#true} assume true; {1603#true} is VALID [2018-11-23 12:55:58,286 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1603#true} {1603#true} #215#return; {1603#true} is VALID [2018-11-23 12:55:58,286 INFO L256 TraceCheckUtils]: 4: Hoare triple {1603#true} call #t~ret41 := main(); {1603#true} is VALID [2018-11-23 12:55:58,286 INFO L273 TraceCheckUtils]: 5: Hoare triple {1603#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {1603#true} is VALID [2018-11-23 12:55:58,286 INFO L273 TraceCheckUtils]: 6: Hoare triple {1603#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1603#true} is VALID [2018-11-23 12:55:58,287 INFO L273 TraceCheckUtils]: 7: Hoare triple {1603#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {1603#true} is VALID [2018-11-23 12:55:58,287 INFO L273 TraceCheckUtils]: 8: Hoare triple {1603#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {1603#true} is VALID [2018-11-23 12:55:58,287 INFO L273 TraceCheckUtils]: 9: Hoare triple {1603#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {1603#true} is VALID [2018-11-23 12:55:58,287 INFO L273 TraceCheckUtils]: 10: Hoare triple {1603#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {1603#true} is VALID [2018-11-23 12:55:58,288 INFO L273 TraceCheckUtils]: 11: Hoare triple {1603#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {1603#true} is VALID [2018-11-23 12:55:58,288 INFO L273 TraceCheckUtils]: 12: Hoare triple {1603#true} assume !#t~short24;havoc #t~mem23.base, #t~mem23.offset;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset; {1603#true} is VALID [2018-11-23 12:55:58,288 INFO L273 TraceCheckUtils]: 13: Hoare triple {1603#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {1603#true} is VALID [2018-11-23 12:55:58,289 INFO L273 TraceCheckUtils]: 14: Hoare triple {1603#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {1603#true} is VALID [2018-11-23 12:55:58,289 INFO L273 TraceCheckUtils]: 15: Hoare triple {1603#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {1603#true} is VALID [2018-11-23 12:55:58,289 INFO L273 TraceCheckUtils]: 16: Hoare triple {1603#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {1603#true} is VALID [2018-11-23 12:55:58,289 INFO L273 TraceCheckUtils]: 17: Hoare triple {1603#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1603#true} is VALID [2018-11-23 12:55:58,296 INFO L273 TraceCheckUtils]: 18: Hoare triple {1603#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1605#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:58,297 INFO L273 TraceCheckUtils]: 19: Hoare triple {1605#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {1605#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:58,298 INFO L273 TraceCheckUtils]: 20: Hoare triple {1605#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet30);havoc #t~nondet30; {1605#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:58,299 INFO L273 TraceCheckUtils]: 21: Hoare triple {1605#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {1605#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:58,300 INFO L273 TraceCheckUtils]: 22: Hoare triple {1605#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet33);havoc #t~nondet33; {1605#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:58,301 INFO L273 TraceCheckUtils]: 23: Hoare triple {1605#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1606#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-23 12:55:58,325 INFO L273 TraceCheckUtils]: 24: Hoare triple {1606#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {1607#(= |main_#t~mem36| 3)} is VALID [2018-11-23 12:55:58,334 INFO L273 TraceCheckUtils]: 25: Hoare triple {1607#(= |main_#t~mem36| 3)} assume !!(2 == #t~mem36);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {1604#false} is VALID [2018-11-23 12:55:58,334 INFO L273 TraceCheckUtils]: 26: Hoare triple {1604#false} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {1604#false} is VALID [2018-11-23 12:55:58,335 INFO L273 TraceCheckUtils]: 27: Hoare triple {1604#false} assume !(2 == #t~mem36);havoc #t~mem36; {1604#false} is VALID [2018-11-23 12:55:58,335 INFO L273 TraceCheckUtils]: 28: Hoare triple {1604#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {1604#false} is VALID [2018-11-23 12:55:58,335 INFO L273 TraceCheckUtils]: 29: Hoare triple {1604#false} assume !(1 == #t~mem38);havoc #t~mem38; {1604#false} is VALID [2018-11-23 12:55:58,335 INFO L273 TraceCheckUtils]: 30: Hoare triple {1604#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {1604#false} is VALID [2018-11-23 12:55:58,336 INFO L273 TraceCheckUtils]: 31: Hoare triple {1604#false} assume 3 != #t~mem40;havoc #t~mem40; {1604#false} is VALID [2018-11-23 12:55:58,336 INFO L273 TraceCheckUtils]: 32: Hoare triple {1604#false} assume !false; {1604#false} is VALID [2018-11-23 12:55:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:55:58,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:58,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:55:58,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-23 12:55:58,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:58,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:55:58,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:58,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:55:58,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:55:58,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:55:58,414 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand 5 states. [2018-11-23 12:55:59,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:59,184 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2018-11-23 12:55:59,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:55:59,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-23 12:55:59,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:55:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-23 12:55:59,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:55:59,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-23 12:55:59,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 95 transitions. [2018-11-23 12:55:59,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:59,364 INFO L225 Difference]: With dead ends: 84 [2018-11-23 12:55:59,364 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 12:55:59,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:55:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 12:55:59,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2018-11-23 12:55:59,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:59,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 61 states. [2018-11-23 12:55:59,404 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 61 states. [2018-11-23 12:55:59,405 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 61 states. [2018-11-23 12:55:59,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:59,408 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2018-11-23 12:55:59,408 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 97 transitions. [2018-11-23 12:55:59,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:59,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:59,409 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 73 states. [2018-11-23 12:55:59,409 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 73 states. [2018-11-23 12:55:59,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:59,412 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2018-11-23 12:55:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 97 transitions. [2018-11-23 12:55:59,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:59,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:59,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:59,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:55:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 84 transitions. [2018-11-23 12:55:59,416 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 84 transitions. Word has length 33 [2018-11-23 12:55:59,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:59,416 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 84 transitions. [2018-11-23 12:55:59,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:55:59,416 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 84 transitions. [2018-11-23 12:55:59,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:55:59,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:59,417 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-11-23 12:55:59,418 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:59,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:59,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1255728367, now seen corresponding path program 1 times [2018-11-23 12:55:59,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:59,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:59,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:59,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:59,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:59,714 INFO L256 TraceCheckUtils]: 0: Hoare triple {1934#true} call ULTIMATE.init(); {1934#true} is VALID [2018-11-23 12:55:59,715 INFO L273 TraceCheckUtils]: 1: Hoare triple {1934#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1934#true} is VALID [2018-11-23 12:55:59,715 INFO L273 TraceCheckUtils]: 2: Hoare triple {1934#true} assume true; {1934#true} is VALID [2018-11-23 12:55:59,716 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1934#true} {1934#true} #215#return; {1934#true} is VALID [2018-11-23 12:55:59,716 INFO L256 TraceCheckUtils]: 4: Hoare triple {1934#true} call #t~ret41 := main(); {1934#true} is VALID [2018-11-23 12:55:59,716 INFO L273 TraceCheckUtils]: 5: Hoare triple {1934#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {1934#true} is VALID [2018-11-23 12:55:59,717 INFO L273 TraceCheckUtils]: 6: Hoare triple {1934#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1934#true} is VALID [2018-11-23 12:55:59,717 INFO L273 TraceCheckUtils]: 7: Hoare triple {1934#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {1934#true} is VALID [2018-11-23 12:55:59,717 INFO L273 TraceCheckUtils]: 8: Hoare triple {1934#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {1934#true} is VALID [2018-11-23 12:55:59,717 INFO L273 TraceCheckUtils]: 9: Hoare triple {1934#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {1934#true} is VALID [2018-11-23 12:55:59,718 INFO L273 TraceCheckUtils]: 10: Hoare triple {1934#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {1934#true} is VALID [2018-11-23 12:55:59,718 INFO L273 TraceCheckUtils]: 11: Hoare triple {1934#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {1934#true} is VALID [2018-11-23 12:55:59,718 INFO L273 TraceCheckUtils]: 12: Hoare triple {1934#true} assume !#t~short24;havoc #t~mem23.base, #t~mem23.offset;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset; {1934#true} is VALID [2018-11-23 12:55:59,718 INFO L273 TraceCheckUtils]: 13: Hoare triple {1934#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {1934#true} is VALID [2018-11-23 12:55:59,719 INFO L273 TraceCheckUtils]: 14: Hoare triple {1934#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {1934#true} is VALID [2018-11-23 12:55:59,719 INFO L273 TraceCheckUtils]: 15: Hoare triple {1934#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {1934#true} is VALID [2018-11-23 12:55:59,727 INFO L273 TraceCheckUtils]: 16: Hoare triple {1934#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {1936#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:55:59,728 INFO L273 TraceCheckUtils]: 17: Hoare triple {1936#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1936#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:55:59,729 INFO L273 TraceCheckUtils]: 18: Hoare triple {1936#(= (select |#valid| main_~a~0.base) 1)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1937#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:59,730 INFO L273 TraceCheckUtils]: 19: Hoare triple {1937#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {1937#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:59,731 INFO L273 TraceCheckUtils]: 20: Hoare triple {1937#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!(0 != #t~nondet30);havoc #t~nondet30;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc31.base, #t~malloc31.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc31.base, #t~malloc31.offset; {1938#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:59,732 INFO L273 TraceCheckUtils]: 21: Hoare triple {1938#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1938#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:59,734 INFO L273 TraceCheckUtils]: 22: Hoare triple {1938#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem32.base, #t~mem32.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem32.base, #t~mem32.offset;havoc #t~mem32.base, #t~mem32.offset; {1939#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:55:59,735 INFO L273 TraceCheckUtils]: 23: Hoare triple {1939#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {1939#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:55:59,736 INFO L273 TraceCheckUtils]: 24: Hoare triple {1939#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume !(0 != #t~nondet30);havoc #t~nondet30; {1939#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:55:59,737 INFO L273 TraceCheckUtils]: 25: Hoare triple {1939#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {1939#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:55:59,740 INFO L273 TraceCheckUtils]: 26: Hoare triple {1939#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume !(0 != #t~nondet33);havoc #t~nondet33; {1939#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:55:59,742 INFO L273 TraceCheckUtils]: 27: Hoare triple {1939#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1940#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:55:59,742 INFO L273 TraceCheckUtils]: 28: Hoare triple {1940#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {1940#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:55:59,743 INFO L273 TraceCheckUtils]: 29: Hoare triple {1940#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem36);havoc #t~mem36; {1940#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:55:59,743 INFO L273 TraceCheckUtils]: 30: Hoare triple {1940#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {1941#(= 1 |main_#t~mem38|)} is VALID [2018-11-23 12:55:59,750 INFO L273 TraceCheckUtils]: 31: Hoare triple {1941#(= 1 |main_#t~mem38|)} assume !(1 == #t~mem38);havoc #t~mem38; {1935#false} is VALID [2018-11-23 12:55:59,750 INFO L273 TraceCheckUtils]: 32: Hoare triple {1935#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {1935#false} is VALID [2018-11-23 12:55:59,750 INFO L273 TraceCheckUtils]: 33: Hoare triple {1935#false} assume 3 != #t~mem40;havoc #t~mem40; {1935#false} is VALID [2018-11-23 12:55:59,750 INFO L273 TraceCheckUtils]: 34: Hoare triple {1935#false} assume !false; {1935#false} is VALID [2018-11-23 12:55:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:55:59,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:55:59,756 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-23 12:55:59,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:59,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:55:59,959 INFO L478 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 6 treesize of output 5 [2018-11-23 12:55:59,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:59,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:59,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 12:55:59,988 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:55:59,988 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_21|]. (= |#valid| (store |v_#valid_21| main_~a~0.base 1)) [2018-11-23 12:55:59,989 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 (select |#valid| main_~a~0.base)) [2018-11-23 12:56:00,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:56:00,373 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:56:00,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 12:56:00,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:00,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-23 12:56:00,447 INFO L478 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-23 12:56:00,471 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:00,506 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:00,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:00,576 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-11-23 12:56:00,590 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:00,590 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_36|, |v_#valid_22|]. (and (= (store |v_#memory_int_36| main_~p~0.base (store (select |v_#memory_int_36| main_~p~0.base) main_~p~0.offset 1)) |#memory_int|) (= 1 (select |v_#valid_22| main_~p~0.base)) (= 0 (select |v_#valid_22| main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) [2018-11-23 12:56:00,591 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) [2018-11-23 12:56:00,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 12:56:00,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:56:00,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 12:56:00,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:00,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:00,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:00,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-11-23 12:56:01,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 12:56:01,014 INFO L478 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-23 12:56:01,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:01,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:01,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 12:56:01,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-23 12:56:01,037 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:01,037 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_38|, v_main_~p~0.base_18, v_main_~p~0.offset_18]. (and (= (store |v_#memory_int_38| v_main_~p~0.base_18 (store (select |v_#memory_int_38| v_main_~p~0.base_18) v_main_~p~0.offset_18 3)) |#memory_int|) (= 1 (select (select |v_#memory_int_38| main_~p~0.base) main_~p~0.offset)) (not (= v_main_~p~0.base_18 main_~p~0.base))) [2018-11-23 12:56:01,037 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_18, v_main_~p~0.offset_18]. (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (not (= v_main_~p~0.base_18 main_~p~0.base)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) [2018-11-23 12:56:01,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-23 12:56:01,205 INFO L478 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-23 12:56:01,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:01,222 INFO L478 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 5 treesize of output 1 [2018-11-23 12:56:01,224 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:01,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:01,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:01,233 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-23 12:56:01,235 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:01,235 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset, v_main_~p~0.base_18, v_main_~p~0.offset_18]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (= |main_#t~mem38| .cse0) (not (= v_main_~p~0.base_18 main_~p~0.base)) (= 1 .cse0))) [2018-11-23 12:56:01,235 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem38| 1) [2018-11-23 12:56:01,243 INFO L256 TraceCheckUtils]: 0: Hoare triple {1934#true} call ULTIMATE.init(); {1934#true} is VALID [2018-11-23 12:56:01,244 INFO L273 TraceCheckUtils]: 1: Hoare triple {1934#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1934#true} is VALID [2018-11-23 12:56:01,244 INFO L273 TraceCheckUtils]: 2: Hoare triple {1934#true} assume true; {1934#true} is VALID [2018-11-23 12:56:01,244 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1934#true} {1934#true} #215#return; {1934#true} is VALID [2018-11-23 12:56:01,244 INFO L256 TraceCheckUtils]: 4: Hoare triple {1934#true} call #t~ret41 := main(); {1934#true} is VALID [2018-11-23 12:56:01,245 INFO L273 TraceCheckUtils]: 5: Hoare triple {1934#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {1934#true} is VALID [2018-11-23 12:56:01,245 INFO L273 TraceCheckUtils]: 6: Hoare triple {1934#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1934#true} is VALID [2018-11-23 12:56:01,245 INFO L273 TraceCheckUtils]: 7: Hoare triple {1934#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {1934#true} is VALID [2018-11-23 12:56:01,246 INFO L273 TraceCheckUtils]: 8: Hoare triple {1934#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {1934#true} is VALID [2018-11-23 12:56:01,246 INFO L273 TraceCheckUtils]: 9: Hoare triple {1934#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {1934#true} is VALID [2018-11-23 12:56:01,246 INFO L273 TraceCheckUtils]: 10: Hoare triple {1934#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {1934#true} is VALID [2018-11-23 12:56:01,246 INFO L273 TraceCheckUtils]: 11: Hoare triple {1934#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {1934#true} is VALID [2018-11-23 12:56:01,246 INFO L273 TraceCheckUtils]: 12: Hoare triple {1934#true} assume !#t~short24;havoc #t~mem23.base, #t~mem23.offset;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset; {1934#true} is VALID [2018-11-23 12:56:01,247 INFO L273 TraceCheckUtils]: 13: Hoare triple {1934#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {1934#true} is VALID [2018-11-23 12:56:01,247 INFO L273 TraceCheckUtils]: 14: Hoare triple {1934#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {1934#true} is VALID [2018-11-23 12:56:01,247 INFO L273 TraceCheckUtils]: 15: Hoare triple {1934#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {1934#true} is VALID [2018-11-23 12:56:01,248 INFO L273 TraceCheckUtils]: 16: Hoare triple {1934#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {1936#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:56:01,249 INFO L273 TraceCheckUtils]: 17: Hoare triple {1936#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1936#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:56:01,249 INFO L273 TraceCheckUtils]: 18: Hoare triple {1936#(= (select |#valid| main_~a~0.base) 1)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1937#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:01,250 INFO L273 TraceCheckUtils]: 19: Hoare triple {1937#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {1937#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:01,251 INFO L273 TraceCheckUtils]: 20: Hoare triple {1937#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!(0 != #t~nondet30);havoc #t~nondet30;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc31.base, #t~malloc31.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc31.base, #t~malloc31.offset; {1938#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:01,252 INFO L273 TraceCheckUtils]: 21: Hoare triple {1938#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1938#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:01,254 INFO L273 TraceCheckUtils]: 22: Hoare triple {1938#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem32.base, #t~mem32.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem32.base, #t~mem32.offset;havoc #t~mem32.base, #t~mem32.offset; {2011#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:56:01,256 INFO L273 TraceCheckUtils]: 23: Hoare triple {2011#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {2011#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:56:01,257 INFO L273 TraceCheckUtils]: 24: Hoare triple {2011#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet30);havoc #t~nondet30; {2011#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:56:01,258 INFO L273 TraceCheckUtils]: 25: Hoare triple {2011#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {2011#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:56:01,258 INFO L273 TraceCheckUtils]: 26: Hoare triple {2011#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet33);havoc #t~nondet33; {2011#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:56:01,260 INFO L273 TraceCheckUtils]: 27: Hoare triple {2011#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2027#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_18 Int) (v_main_~p~0.base_18 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (not (= v_main_~p~0.base_18 main_~p~0.base)))))} is VALID [2018-11-23 12:56:01,261 INFO L273 TraceCheckUtils]: 28: Hoare triple {2027#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_18 Int) (v_main_~p~0.base_18 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (not (= v_main_~p~0.base_18 main_~p~0.base)))))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {2027#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_18 Int) (v_main_~p~0.base_18 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (not (= v_main_~p~0.base_18 main_~p~0.base)))))} is VALID [2018-11-23 12:56:01,262 INFO L273 TraceCheckUtils]: 29: Hoare triple {2027#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_18 Int) (v_main_~p~0.base_18 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (not (= v_main_~p~0.base_18 main_~p~0.base)))))} assume !(2 == #t~mem36);havoc #t~mem36; {2027#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_18 Int) (v_main_~p~0.base_18 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (not (= v_main_~p~0.base_18 main_~p~0.base)))))} is VALID [2018-11-23 12:56:01,263 INFO L273 TraceCheckUtils]: 30: Hoare triple {2027#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_18 Int) (v_main_~p~0.base_18 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (not (= v_main_~p~0.base_18 main_~p~0.base)))))} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {1941#(= 1 |main_#t~mem38|)} is VALID [2018-11-23 12:56:01,264 INFO L273 TraceCheckUtils]: 31: Hoare triple {1941#(= 1 |main_#t~mem38|)} assume !(1 == #t~mem38);havoc #t~mem38; {1935#false} is VALID [2018-11-23 12:56:01,264 INFO L273 TraceCheckUtils]: 32: Hoare triple {1935#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {1935#false} is VALID [2018-11-23 12:56:01,265 INFO L273 TraceCheckUtils]: 33: Hoare triple {1935#false} assume 3 != #t~mem40;havoc #t~mem40; {1935#false} is VALID [2018-11-23 12:56:01,265 INFO L273 TraceCheckUtils]: 34: Hoare triple {1935#false} assume !false; {1935#false} is VALID [2018-11-23 12:56:01,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:56:01,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:56:01,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-23 12:56:01,301 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 12:56:01,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:01,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:56:01,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:01,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:56:01,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:56:01,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:56:01,370 INFO L87 Difference]: Start difference. First operand 61 states and 84 transitions. Second operand 10 states. [2018-11-23 12:56:02,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:02,739 INFO L93 Difference]: Finished difference Result 90 states and 117 transitions. [2018-11-23 12:56:02,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:56:02,739 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 12:56:02,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:02,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:56:02,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2018-11-23 12:56:02,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:56:02,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2018-11-23 12:56:02,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 102 transitions. [2018-11-23 12:56:02,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:02,876 INFO L225 Difference]: With dead ends: 90 [2018-11-23 12:56:02,876 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 12:56:02,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:56:02,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 12:56:02,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2018-11-23 12:56:02,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:02,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 72 states. [2018-11-23 12:56:02,949 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 72 states. [2018-11-23 12:56:02,950 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 72 states. [2018-11-23 12:56:02,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:02,953 INFO L93 Difference]: Finished difference Result 86 states and 113 transitions. [2018-11-23 12:56:02,953 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 113 transitions. [2018-11-23 12:56:02,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:02,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:02,954 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 86 states. [2018-11-23 12:56:02,954 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 86 states. [2018-11-23 12:56:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:02,957 INFO L93 Difference]: Finished difference Result 86 states and 113 transitions. [2018-11-23 12:56:02,957 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 113 transitions. [2018-11-23 12:56:02,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:02,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:02,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:02,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:02,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 12:56:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2018-11-23 12:56:02,960 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 98 transitions. Word has length 35 [2018-11-23 12:56:02,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:02,961 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 98 transitions. [2018-11-23 12:56:02,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:56:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2018-11-23 12:56:02,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:56:02,962 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:02,962 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-11-23 12:56:02,962 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:02,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:02,963 INFO L82 PathProgramCache]: Analyzing trace with hash -2119130031, now seen corresponding path program 1 times [2018-11-23 12:56:02,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:02,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:02,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:02,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:02,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:03,322 INFO L256 TraceCheckUtils]: 0: Hoare triple {2425#true} call ULTIMATE.init(); {2425#true} is VALID [2018-11-23 12:56:03,322 INFO L273 TraceCheckUtils]: 1: Hoare triple {2425#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2425#true} is VALID [2018-11-23 12:56:03,323 INFO L273 TraceCheckUtils]: 2: Hoare triple {2425#true} assume true; {2425#true} is VALID [2018-11-23 12:56:03,323 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2425#true} {2425#true} #215#return; {2425#true} is VALID [2018-11-23 12:56:03,323 INFO L256 TraceCheckUtils]: 4: Hoare triple {2425#true} call #t~ret41 := main(); {2425#true} is VALID [2018-11-23 12:56:03,323 INFO L273 TraceCheckUtils]: 5: Hoare triple {2425#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {2425#true} is VALID [2018-11-23 12:56:03,323 INFO L273 TraceCheckUtils]: 6: Hoare triple {2425#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2425#true} is VALID [2018-11-23 12:56:03,324 INFO L273 TraceCheckUtils]: 7: Hoare triple {2425#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {2425#true} is VALID [2018-11-23 12:56:03,324 INFO L273 TraceCheckUtils]: 8: Hoare triple {2425#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {2425#true} is VALID [2018-11-23 12:56:03,324 INFO L273 TraceCheckUtils]: 9: Hoare triple {2425#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {2425#true} is VALID [2018-11-23 12:56:03,324 INFO L273 TraceCheckUtils]: 10: Hoare triple {2425#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {2425#true} is VALID [2018-11-23 12:56:03,325 INFO L273 TraceCheckUtils]: 11: Hoare triple {2425#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {2425#true} is VALID [2018-11-23 12:56:03,325 INFO L273 TraceCheckUtils]: 12: Hoare triple {2425#true} assume !#t~short24;havoc #t~mem23.base, #t~mem23.offset;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset; {2425#true} is VALID [2018-11-23 12:56:03,325 INFO L273 TraceCheckUtils]: 13: Hoare triple {2425#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {2425#true} is VALID [2018-11-23 12:56:03,325 INFO L273 TraceCheckUtils]: 14: Hoare triple {2425#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {2425#true} is VALID [2018-11-23 12:56:03,325 INFO L273 TraceCheckUtils]: 15: Hoare triple {2425#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {2425#true} is VALID [2018-11-23 12:56:03,346 INFO L273 TraceCheckUtils]: 16: Hoare triple {2425#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {2427#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:56:03,361 INFO L273 TraceCheckUtils]: 17: Hoare triple {2427#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2427#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:56:03,375 INFO L273 TraceCheckUtils]: 18: Hoare triple {2427#(= (select |#valid| main_~a~0.base) 1)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2428#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:03,376 INFO L273 TraceCheckUtils]: 19: Hoare triple {2428#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {2428#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:03,377 INFO L273 TraceCheckUtils]: 20: Hoare triple {2428#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet30);havoc #t~nondet30; {2428#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:03,377 INFO L273 TraceCheckUtils]: 21: Hoare triple {2428#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {2428#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:03,378 INFO L273 TraceCheckUtils]: 22: Hoare triple {2428#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {2429#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:03,379 INFO L273 TraceCheckUtils]: 23: Hoare triple {2429#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {2429#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:03,380 INFO L273 TraceCheckUtils]: 24: Hoare triple {2429#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {2430#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:56:03,390 INFO L273 TraceCheckUtils]: 25: Hoare triple {2430#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {2430#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:56:03,390 INFO L273 TraceCheckUtils]: 26: Hoare triple {2430#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume !(0 != #t~nondet33);havoc #t~nondet33; {2430#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:56:03,391 INFO L273 TraceCheckUtils]: 27: Hoare triple {2430#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2431#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:56:03,392 INFO L273 TraceCheckUtils]: 28: Hoare triple {2431#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {2432#(= 2 |main_#t~mem36|)} is VALID [2018-11-23 12:56:03,392 INFO L273 TraceCheckUtils]: 29: Hoare triple {2432#(= 2 |main_#t~mem36|)} assume !(2 == #t~mem36);havoc #t~mem36; {2426#false} is VALID [2018-11-23 12:56:03,392 INFO L273 TraceCheckUtils]: 30: Hoare triple {2426#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {2426#false} is VALID [2018-11-23 12:56:03,393 INFO L273 TraceCheckUtils]: 31: Hoare triple {2426#false} assume !(1 == #t~mem38);havoc #t~mem38; {2426#false} is VALID [2018-11-23 12:56:03,393 INFO L273 TraceCheckUtils]: 32: Hoare triple {2426#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {2426#false} is VALID [2018-11-23 12:56:03,393 INFO L273 TraceCheckUtils]: 33: Hoare triple {2426#false} assume 3 != #t~mem40;havoc #t~mem40; {2426#false} is VALID [2018-11-23 12:56:03,393 INFO L273 TraceCheckUtils]: 34: Hoare triple {2426#false} assume !false; {2426#false} is VALID [2018-11-23 12:56:03,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:56:03,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:56:03,395 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-23 12:56:03,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:03,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:03,481 INFO L478 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 6 treesize of output 5 [2018-11-23 12:56:03,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 12:56:03,487 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:03,487 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_23|]. (= (store |v_#valid_23| main_~a~0.base 1) |#valid|) [2018-11-23 12:56:03,487 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 (select |#valid| main_~a~0.base)) [2018-11-23 12:56:03,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:56:03,527 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:56:03,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 12:56:03,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-23 12:56:03,550 INFO L478 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-23 12:56:03,551 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,553 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,564 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-11-23 12:56:03,567 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:03,568 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_39|, |v_#valid_24|]. (and (= 1 (select |v_#valid_24| main_~p~0.base)) (= (select |v_#valid_24| main_~t~0.base) 0) (= |#memory_int| (store |v_#memory_int_39| main_~p~0.base (store (select |v_#memory_int_39| main_~p~0.base) main_~p~0.offset 2))) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) [2018-11-23 12:56:03,568 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) [2018-11-23 12:56:03,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 12:56:03,616 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:56:03,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 12:56:03,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-11-23 12:56:03,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 12:56:03,699 INFO L478 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-23 12:56:03,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 12:56:03,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-23 12:56:03,721 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:03,721 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_41|, v_main_~p~0.base_20, v_main_~p~0.offset_20]. (and (= (select (select |v_#memory_int_41| main_~p~0.base) main_~p~0.offset) 2) (not (= v_main_~p~0.base_20 main_~p~0.base)) (= |#memory_int| (store |v_#memory_int_41| v_main_~p~0.base_20 (store (select |v_#memory_int_41| v_main_~p~0.base_20) v_main_~p~0.offset_20 3)))) [2018-11-23 12:56:03,721 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_20, v_main_~p~0.offset_20]. (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) [2018-11-23 12:56:03,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-23 12:56:03,760 INFO L478 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-23 12:56:03,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,770 INFO L478 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 5 treesize of output 1 [2018-11-23 12:56:03,771 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,779 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-23 12:56:03,781 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:03,781 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset, v_main_~p~0.base_20, v_main_~p~0.offset_20]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (= |main_#t~mem36| .cse0) (not (= v_main_~p~0.base_20 main_~p~0.base)) (= 2 .cse0))) [2018-11-23 12:56:03,782 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem36| 2) [2018-11-23 12:56:03,789 INFO L256 TraceCheckUtils]: 0: Hoare triple {2425#true} call ULTIMATE.init(); {2425#true} is VALID [2018-11-23 12:56:03,789 INFO L273 TraceCheckUtils]: 1: Hoare triple {2425#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2425#true} is VALID [2018-11-23 12:56:03,789 INFO L273 TraceCheckUtils]: 2: Hoare triple {2425#true} assume true; {2425#true} is VALID [2018-11-23 12:56:03,790 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2425#true} {2425#true} #215#return; {2425#true} is VALID [2018-11-23 12:56:03,790 INFO L256 TraceCheckUtils]: 4: Hoare triple {2425#true} call #t~ret41 := main(); {2425#true} is VALID [2018-11-23 12:56:03,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {2425#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {2425#true} is VALID [2018-11-23 12:56:03,790 INFO L273 TraceCheckUtils]: 6: Hoare triple {2425#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2425#true} is VALID [2018-11-23 12:56:03,790 INFO L273 TraceCheckUtils]: 7: Hoare triple {2425#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {2425#true} is VALID [2018-11-23 12:56:03,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {2425#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {2425#true} is VALID [2018-11-23 12:56:03,791 INFO L273 TraceCheckUtils]: 9: Hoare triple {2425#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {2425#true} is VALID [2018-11-23 12:56:03,791 INFO L273 TraceCheckUtils]: 10: Hoare triple {2425#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {2425#true} is VALID [2018-11-23 12:56:03,791 INFO L273 TraceCheckUtils]: 11: Hoare triple {2425#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {2425#true} is VALID [2018-11-23 12:56:03,791 INFO L273 TraceCheckUtils]: 12: Hoare triple {2425#true} assume !#t~short24;havoc #t~mem23.base, #t~mem23.offset;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset; {2425#true} is VALID [2018-11-23 12:56:03,791 INFO L273 TraceCheckUtils]: 13: Hoare triple {2425#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {2425#true} is VALID [2018-11-23 12:56:03,792 INFO L273 TraceCheckUtils]: 14: Hoare triple {2425#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {2425#true} is VALID [2018-11-23 12:56:03,792 INFO L273 TraceCheckUtils]: 15: Hoare triple {2425#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {2425#true} is VALID [2018-11-23 12:56:03,793 INFO L273 TraceCheckUtils]: 16: Hoare triple {2425#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {2427#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:56:03,793 INFO L273 TraceCheckUtils]: 17: Hoare triple {2427#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2427#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:56:03,794 INFO L273 TraceCheckUtils]: 18: Hoare triple {2427#(= (select |#valid| main_~a~0.base) 1)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2428#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:03,794 INFO L273 TraceCheckUtils]: 19: Hoare triple {2428#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {2428#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:03,795 INFO L273 TraceCheckUtils]: 20: Hoare triple {2428#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet30);havoc #t~nondet30; {2428#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:03,795 INFO L273 TraceCheckUtils]: 21: Hoare triple {2428#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {2428#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:03,796 INFO L273 TraceCheckUtils]: 22: Hoare triple {2428#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {2429#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:03,798 INFO L273 TraceCheckUtils]: 23: Hoare triple {2429#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {2429#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:03,800 INFO L273 TraceCheckUtils]: 24: Hoare triple {2429#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {2508#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:56:03,801 INFO L273 TraceCheckUtils]: 25: Hoare triple {2508#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {2508#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:56:03,802 INFO L273 TraceCheckUtils]: 26: Hoare triple {2508#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet33);havoc #t~nondet33; {2508#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:56:03,803 INFO L273 TraceCheckUtils]: 27: Hoare triple {2508#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2518#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} is VALID [2018-11-23 12:56:03,804 INFO L273 TraceCheckUtils]: 28: Hoare triple {2518#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {2432#(= 2 |main_#t~mem36|)} is VALID [2018-11-23 12:56:03,805 INFO L273 TraceCheckUtils]: 29: Hoare triple {2432#(= 2 |main_#t~mem36|)} assume !(2 == #t~mem36);havoc #t~mem36; {2426#false} is VALID [2018-11-23 12:56:03,805 INFO L273 TraceCheckUtils]: 30: Hoare triple {2426#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {2426#false} is VALID [2018-11-23 12:56:03,806 INFO L273 TraceCheckUtils]: 31: Hoare triple {2426#false} assume !(1 == #t~mem38);havoc #t~mem38; {2426#false} is VALID [2018-11-23 12:56:03,806 INFO L273 TraceCheckUtils]: 32: Hoare triple {2426#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {2426#false} is VALID [2018-11-23 12:56:03,806 INFO L273 TraceCheckUtils]: 33: Hoare triple {2426#false} assume 3 != #t~mem40;havoc #t~mem40; {2426#false} is VALID [2018-11-23 12:56:03,807 INFO L273 TraceCheckUtils]: 34: Hoare triple {2426#false} assume !false; {2426#false} is VALID [2018-11-23 12:56:03,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:56:03,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:56:03,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-23 12:56:03,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 12:56:03,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:03,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:56:03,875 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:03,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:56:03,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:56:03,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:56:03,876 INFO L87 Difference]: Start difference. First operand 72 states and 98 transitions. Second operand 10 states. [2018-11-23 12:56:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:05,249 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2018-11-23 12:56:05,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:56:05,249 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 12:56:05,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:05,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:56:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2018-11-23 12:56:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:56:05,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2018-11-23 12:56:05,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 97 transitions. [2018-11-23 12:56:05,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:05,419 INFO L225 Difference]: With dead ends: 95 [2018-11-23 12:56:05,419 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 12:56:05,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:56:05,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 12:56:05,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2018-11-23 12:56:05,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:05,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 79 states. [2018-11-23 12:56:05,453 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 79 states. [2018-11-23 12:56:05,453 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 79 states. [2018-11-23 12:56:05,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:05,457 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2018-11-23 12:56:05,457 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2018-11-23 12:56:05,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:05,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:05,458 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 89 states. [2018-11-23 12:56:05,458 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 89 states. [2018-11-23 12:56:05,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:05,461 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2018-11-23 12:56:05,461 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2018-11-23 12:56:05,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:05,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:05,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:05,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:05,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 12:56:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2018-11-23 12:56:05,465 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 35 [2018-11-23 12:56:05,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:05,465 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2018-11-23 12:56:05,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:56:05,465 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2018-11-23 12:56:05,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:56:05,466 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:05,466 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-11-23 12:56:05,466 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:05,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:05,467 INFO L82 PathProgramCache]: Analyzing trace with hash 179529740, now seen corresponding path program 1 times [2018-11-23 12:56:05,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:05,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:05,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:05,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:05,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:05,919 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) 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:155) 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:456) 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:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-23 12:56:05,924 INFO L168 Benchmark]: Toolchain (without parser) took 15265.25 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 860.4 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -402.5 MB). Peak memory consumption was 457.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:05,926 INFO L168 Benchmark]: CDTParser took 0.23 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-23 12:56:05,926 INFO L168 Benchmark]: CACSL2BoogieTranslator took 727.90 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:05,927 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.55 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:05,928 INFO L168 Benchmark]: Boogie Preprocessor took 87.94 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:56:05,928 INFO L168 Benchmark]: RCFGBuilder took 1541.85 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:05,929 INFO L168 Benchmark]: TraceAbstraction took 12776.38 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 147.3 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 292.3 MB). Peak memory consumption was 439.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:05,932 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.23 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 727.90 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 126.55 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 87.94 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1541.85 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12776.38 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 147.3 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 292.3 MB). Peak memory consumption was 439.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...