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-properties/list_flag_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:53:08,652 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:53:08,654 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:53:08,669 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:53:08,670 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:53:08,671 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:53:08,674 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:53:08,678 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:53:08,680 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:53:08,688 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:53:08,689 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:53:08,690 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:53:08,690 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:53:08,695 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:53:08,696 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:53:08,697 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:53:08,699 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:53:08,700 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:53:08,703 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:53:08,708 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:53:08,709 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:53:08,711 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:53:08,714 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:53:08,715 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:53:08,715 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:53:08,716 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:53:08,717 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:53:08,719 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:53:08,720 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:53:08,722 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:53:08,723 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:53:08,723 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:53:08,724 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:53:08,724 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:53:08,725 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:53:08,725 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:53:08,728 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:53:08,747 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:53:08,747 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:53:08,748 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:53:08,748 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:53:08,749 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:53:08,749 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:53:08,749 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:53:08,749 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:53:08,750 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:53:08,750 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:53:08,750 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:53:08,750 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:53:08,750 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:53:08,751 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:53:08,751 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:53:08,751 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:53:08,752 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:53:08,752 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:53:08,752 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:53:08,753 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:53:08,753 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:53:08,754 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:53:08,754 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:53:08,754 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:53:08,754 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:53:08,754 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:53:08,755 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:53:08,755 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:53:08,755 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:53:08,755 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:53:08,756 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:53:08,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:53:08,835 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:53:08,841 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:53:08,843 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:53:08,844 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:53:08,845 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_flag_true-unreach-call_false-valid-memtrack.i [2018-11-23 12:53:08,917 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04f604e64/d5e4184d99f949a7b62f6c08fd70492c/FLAG54be4cbe4 [2018-11-23 12:53:09,420 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:53:09,420 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_flag_true-unreach-call_false-valid-memtrack.i [2018-11-23 12:53:09,437 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04f604e64/d5e4184d99f949a7b62f6c08fd70492c/FLAG54be4cbe4 [2018-11-23 12:53:09,708 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04f604e64/d5e4184d99f949a7b62f6c08fd70492c [2018-11-23 12:53:09,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:53:09,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:53:09,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:09,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:53:09,727 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:53:09,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:09" (1/1) ... [2018-11-23 12:53:09,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45545a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:09, skipping insertion in model container [2018-11-23 12:53:09,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:09" (1/1) ... [2018-11-23 12:53:09,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:53:09,799 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:53:10,259 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:10,273 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:53:10,337 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:10,402 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:53:10,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:10 WrapperNode [2018-11-23 12:53:10,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:10,404 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:10,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:53:10,404 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:53:10,414 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:53:10" (1/1) ... [2018-11-23 12:53:10,509 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:53:10" (1/1) ... [2018-11-23 12:53:10,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:10,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:53:10,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:53:10,521 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:53:10,530 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:10" (1/1) ... [2018-11-23 12:53:10,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:10" (1/1) ... [2018-11-23 12:53:10,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:10" (1/1) ... [2018-11-23 12:53:10,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:10" (1/1) ... [2018-11-23 12:53:10,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:10" (1/1) ... [2018-11-23 12:53:10,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:10" (1/1) ... [2018-11-23 12:53:10,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:10" (1/1) ... [2018-11-23 12:53:10,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:53:10,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:53:10,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:53:10,568 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:53:10,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:10" (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:53:10,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:53:10,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:53:10,629 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:53:10,629 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:53:10,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:53:10,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:53:10,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:53:10,630 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:53:10,630 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:53:10,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:53:10,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:53:10,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:53:10,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:53:11,402 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:53:11,403 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:53:11,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:11 BoogieIcfgContainer [2018-11-23 12:53:11,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:53:11,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:53:11,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:53:11,409 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:53:11,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:53:09" (1/3) ... [2018-11-23 12:53:11,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb29c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:11, skipping insertion in model container [2018-11-23 12:53:11,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:10" (2/3) ... [2018-11-23 12:53:11,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb29c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:11, skipping insertion in model container [2018-11-23 12:53:11,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:11" (3/3) ... [2018-11-23 12:53:11,415 INFO L112 eAbstractionObserver]: Analyzing ICFG list_flag_true-unreach-call_false-valid-memtrack.i [2018-11-23 12:53:11,427 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:53:11,437 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:53:11,457 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:53:11,494 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:53:11,495 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:53:11,495 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:53:11,495 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:53:11,496 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:53:11,496 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:53:11,496 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:53:11,496 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:53:11,496 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:53:11,516 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 12:53:11,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:53:11,526 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:11,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:11,530 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:11,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:11,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1959867314, now seen corresponding path program 1 times [2018-11-23 12:53:11,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:11,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:11,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:11,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:11,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:11,732 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-23 12:53:11,736 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35#true} is VALID [2018-11-23 12:53:11,737 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:53:11,737 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #91#return; {35#true} is VALID [2018-11-23 12:53:11,738 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret10 := main(); {35#true} is VALID [2018-11-23 12:53:11,738 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {35#true} is VALID [2018-11-23 12:53:11,739 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {35#true} is VALID [2018-11-23 12:53:11,739 INFO L273 TraceCheckUtils]: 7: Hoare triple {35#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {35#true} is VALID [2018-11-23 12:53:11,752 INFO L273 TraceCheckUtils]: 8: Hoare triple {35#true} assume !true; {36#false} is VALID [2018-11-23 12:53:11,753 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {36#false} is VALID [2018-11-23 12:53:11,753 INFO L273 TraceCheckUtils]: 10: Hoare triple {36#false} assume !(0 != ~flag~0); {36#false} is VALID [2018-11-23 12:53:11,753 INFO L273 TraceCheckUtils]: 11: Hoare triple {36#false} assume !true; {36#false} is VALID [2018-11-23 12:53:11,754 INFO L273 TraceCheckUtils]: 12: Hoare triple {36#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {36#false} is VALID [2018-11-23 12:53:11,754 INFO L273 TraceCheckUtils]: 13: Hoare triple {36#false} assume 3 != #t~mem9;havoc #t~mem9; {36#false} is VALID [2018-11-23 12:53:11,754 INFO L273 TraceCheckUtils]: 14: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-23 12:53:11,758 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:53:11,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:11,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:53:11,767 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:53:11,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:11,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:53:11,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:11,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:53:11,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:53:11,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:53:11,908 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-23 12:53:12,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:12,047 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2018-11-23 12:53:12,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:53:12,047 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:53:12,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:12,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:53:12,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2018-11-23 12:53:12,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:53:12,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2018-11-23 12:53:12,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 61 transitions. [2018-11-23 12:53:12,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:12,308 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:53:12,308 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:53:12,312 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:53:12,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:53:12,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 12:53:12,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:12,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 12:53:12,347 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:53:12,347 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:53:12,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:12,352 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 12:53:12,352 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:53:12,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:12,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:12,353 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:53:12,353 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:53:12,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:12,358 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 12:53:12,358 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:53:12,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:12,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:12,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:12,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:53:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-23 12:53:12,364 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2018-11-23 12:53:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:12,365 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 12:53:12,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:53:12,365 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:53:12,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:53:12,366 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:12,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:12,366 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:12,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:12,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1959498088, now seen corresponding path program 1 times [2018-11-23 12:53:12,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:12,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:12,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:12,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:12,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:12,571 INFO L256 TraceCheckUtils]: 0: Hoare triple {177#true} call ULTIMATE.init(); {177#true} is VALID [2018-11-23 12:53:12,571 INFO L273 TraceCheckUtils]: 1: Hoare triple {177#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {177#true} is VALID [2018-11-23 12:53:12,572 INFO L273 TraceCheckUtils]: 2: Hoare triple {177#true} assume true; {177#true} is VALID [2018-11-23 12:53:12,572 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {177#true} {177#true} #91#return; {177#true} is VALID [2018-11-23 12:53:12,572 INFO L256 TraceCheckUtils]: 4: Hoare triple {177#true} call #t~ret10 := main(); {177#true} is VALID [2018-11-23 12:53:12,572 INFO L273 TraceCheckUtils]: 5: Hoare triple {177#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {177#true} is VALID [2018-11-23 12:53:12,573 INFO L273 TraceCheckUtils]: 6: Hoare triple {177#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {177#true} is VALID [2018-11-23 12:53:12,575 INFO L273 TraceCheckUtils]: 7: Hoare triple {177#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {179#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:12,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {179#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {179#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:12,579 INFO L273 TraceCheckUtils]: 9: Hoare triple {179#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet2);havoc #t~nondet2; {179#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:12,598 INFO L273 TraceCheckUtils]: 10: Hoare triple {179#(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; {180#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:53:12,607 INFO L273 TraceCheckUtils]: 11: Hoare triple {180#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(0 != ~flag~0); {180#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:53:12,623 INFO L273 TraceCheckUtils]: 12: Hoare triple {180#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {180#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:53:12,632 INFO L273 TraceCheckUtils]: 13: Hoare triple {180#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem7);havoc #t~mem7; {180#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:53:12,645 INFO L273 TraceCheckUtils]: 14: Hoare triple {180#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {181#(= |main_#t~mem9| 3)} is VALID [2018-11-23 12:53:12,658 INFO L273 TraceCheckUtils]: 15: Hoare triple {181#(= |main_#t~mem9| 3)} assume 3 != #t~mem9;havoc #t~mem9; {178#false} is VALID [2018-11-23 12:53:12,658 INFO L273 TraceCheckUtils]: 16: Hoare triple {178#false} assume !false; {178#false} is VALID [2018-11-23 12:53:12,661 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:53:12,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:12,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:53:12,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 12:53:12,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:12,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:53:12,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:12,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:53:12,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:53:12,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:53:12,746 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 5 states. [2018-11-23 12:53:13,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:13,522 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2018-11-23 12:53:13,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:53:13,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 12:53:13,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:13,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:53:13,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2018-11-23 12:53:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:53:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2018-11-23 12:53:13,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 57 transitions. [2018-11-23 12:53:13,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:13,646 INFO L225 Difference]: With dead ends: 48 [2018-11-23 12:53:13,647 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:53:13,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:53:13,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:53:13,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2018-11-23 12:53:13,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:13,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 32 states. [2018-11-23 12:53:13,676 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 32 states. [2018-11-23 12:53:13,676 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 32 states. [2018-11-23 12:53:13,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:13,681 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 12:53:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 12:53:13,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:13,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:13,682 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 44 states. [2018-11-23 12:53:13,682 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 44 states. [2018-11-23 12:53:13,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:13,686 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 12:53:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 12:53:13,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:13,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:13,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:13,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:13,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:53:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-11-23 12:53:13,691 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 17 [2018-11-23 12:53:13,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:13,691 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-23 12:53:13,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:53:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 12:53:13,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:53:13,693 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:13,693 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:13,693 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:13,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:13,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1930663235, now seen corresponding path program 1 times [2018-11-23 12:53:13,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:13,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:13,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:13,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:13,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:13,862 INFO L256 TraceCheckUtils]: 0: Hoare triple {378#true} call ULTIMATE.init(); {378#true} is VALID [2018-11-23 12:53:13,862 INFO L273 TraceCheckUtils]: 1: Hoare triple {378#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {378#true} is VALID [2018-11-23 12:53:13,863 INFO L273 TraceCheckUtils]: 2: Hoare triple {378#true} assume true; {378#true} is VALID [2018-11-23 12:53:13,863 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {378#true} {378#true} #91#return; {378#true} is VALID [2018-11-23 12:53:13,863 INFO L256 TraceCheckUtils]: 4: Hoare triple {378#true} call #t~ret10 := main(); {378#true} is VALID [2018-11-23 12:53:13,864 INFO L273 TraceCheckUtils]: 5: Hoare triple {378#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {378#true} is VALID [2018-11-23 12:53:13,864 INFO L273 TraceCheckUtils]: 6: Hoare triple {378#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {378#true} is VALID [2018-11-23 12:53:13,883 INFO L273 TraceCheckUtils]: 7: Hoare triple {378#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {380#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:13,896 INFO L273 TraceCheckUtils]: 8: Hoare triple {380#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {380#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:13,904 INFO L273 TraceCheckUtils]: 9: Hoare triple {380#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet2);havoc #t~nondet2; {380#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:13,910 INFO L273 TraceCheckUtils]: 10: Hoare triple {380#(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; {381#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-23 12:53:13,910 INFO L273 TraceCheckUtils]: 11: Hoare triple {381#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} assume !(0 != ~flag~0); {381#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-23 12:53:13,912 INFO L273 TraceCheckUtils]: 12: Hoare triple {381#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {382#(= |main_#t~mem7| 3)} is VALID [2018-11-23 12:53:13,912 INFO L273 TraceCheckUtils]: 13: Hoare triple {382#(= |main_#t~mem7| 3)} assume !!(2 == #t~mem7);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {379#false} is VALID [2018-11-23 12:53:13,913 INFO L273 TraceCheckUtils]: 14: Hoare triple {379#false} call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {379#false} is VALID [2018-11-23 12:53:13,913 INFO L273 TraceCheckUtils]: 15: Hoare triple {379#false} assume !(2 == #t~mem7);havoc #t~mem7; {379#false} is VALID [2018-11-23 12:53:13,913 INFO L273 TraceCheckUtils]: 16: Hoare triple {379#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {379#false} is VALID [2018-11-23 12:53:13,914 INFO L273 TraceCheckUtils]: 17: Hoare triple {379#false} assume 3 != #t~mem9;havoc #t~mem9; {379#false} is VALID [2018-11-23 12:53:13,914 INFO L273 TraceCheckUtils]: 18: Hoare triple {379#false} assume !false; {379#false} is VALID [2018-11-23 12:53:13,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:13,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:13,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:53:13,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 12:53:13,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:13,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:53:13,951 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:13,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:53:13,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:53:13,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:53:13,952 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 5 states. [2018-11-23 12:53:14,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:14,415 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-23 12:53:14,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:53:14,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 12:53:14,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:14,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:53:14,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:53:14,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:53:14,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:53:14,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2018-11-23 12:53:14,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:14,554 INFO L225 Difference]: With dead ends: 50 [2018-11-23 12:53:14,555 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:53:14,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:53:14,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:53:14,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2018-11-23 12:53:14,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:14,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 30 states. [2018-11-23 12:53:14,575 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 30 states. [2018-11-23 12:53:14,575 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 30 states. [2018-11-23 12:53:14,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:14,579 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-23 12:53:14,579 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-23 12:53:14,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:14,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:14,580 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 42 states. [2018-11-23 12:53:14,580 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 42 states. [2018-11-23 12:53:14,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:14,584 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-23 12:53:14,584 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-23 12:53:14,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:14,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:14,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:14,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:14,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:53:14,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 12:53:14,587 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 19 [2018-11-23 12:53:14,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:14,588 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 12:53:14,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:53:14,588 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 12:53:14,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:53:14,589 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:14,589 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:14,590 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:14,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:14,590 INFO L82 PathProgramCache]: Analyzing trace with hash 686921714, now seen corresponding path program 1 times [2018-11-23 12:53:14,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:14,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:14,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:14,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:14,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:14,715 INFO L256 TraceCheckUtils]: 0: Hoare triple {575#true} call ULTIMATE.init(); {575#true} is VALID [2018-11-23 12:53:14,716 INFO L273 TraceCheckUtils]: 1: Hoare triple {575#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {575#true} is VALID [2018-11-23 12:53:14,717 INFO L273 TraceCheckUtils]: 2: Hoare triple {575#true} assume true; {575#true} is VALID [2018-11-23 12:53:14,717 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {575#true} {575#true} #91#return; {575#true} is VALID [2018-11-23 12:53:14,718 INFO L256 TraceCheckUtils]: 4: Hoare triple {575#true} call #t~ret10 := main(); {575#true} is VALID [2018-11-23 12:53:14,718 INFO L273 TraceCheckUtils]: 5: Hoare triple {575#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {575#true} is VALID [2018-11-23 12:53:14,719 INFO L273 TraceCheckUtils]: 6: Hoare triple {575#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {575#true} is VALID [2018-11-23 12:53:14,719 INFO L273 TraceCheckUtils]: 7: Hoare triple {575#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {577#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:14,720 INFO L273 TraceCheckUtils]: 8: Hoare triple {577#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {577#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:14,721 INFO L273 TraceCheckUtils]: 9: Hoare triple {577#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet2);havoc #t~nondet2; {577#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:14,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {577#(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; {578#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-23 12:53:14,725 INFO L273 TraceCheckUtils]: 11: Hoare triple {578#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} assume 0 != ~flag~0; {578#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-23 12:53:14,728 INFO L273 TraceCheckUtils]: 12: Hoare triple {578#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {579#(= |main_#t~mem5| 3)} is VALID [2018-11-23 12:53:14,737 INFO L273 TraceCheckUtils]: 13: Hoare triple {579#(= |main_#t~mem5| 3)} assume !!(1 == #t~mem5);havoc #t~mem5;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {576#false} is VALID [2018-11-23 12:53:14,738 INFO L273 TraceCheckUtils]: 14: Hoare triple {576#false} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {576#false} is VALID [2018-11-23 12:53:14,738 INFO L273 TraceCheckUtils]: 15: Hoare triple {576#false} assume !(1 == #t~mem5);havoc #t~mem5; {576#false} is VALID [2018-11-23 12:53:14,738 INFO L273 TraceCheckUtils]: 16: Hoare triple {576#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {576#false} is VALID [2018-11-23 12:53:14,739 INFO L273 TraceCheckUtils]: 17: Hoare triple {576#false} assume 3 != #t~mem9;havoc #t~mem9; {576#false} is VALID [2018-11-23 12:53:14,739 INFO L273 TraceCheckUtils]: 18: Hoare triple {576#false} assume !false; {576#false} is VALID [2018-11-23 12:53:14,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:14,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:14,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:53:14,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 12:53:14,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:14,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:53:14,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:14,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:53:14,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:53:14,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:53:14,769 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2018-11-23 12:53:15,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:15,045 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-23 12:53:15,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:53:15,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 12:53:15,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:53:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-23 12:53:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:53:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-23 12:53:15,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2018-11-23 12:53:15,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:15,162 INFO L225 Difference]: With dead ends: 48 [2018-11-23 12:53:15,163 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:53:15,163 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:53:15,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:53:15,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2018-11-23 12:53:15,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:15,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 26 states. [2018-11-23 12:53:15,198 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 26 states. [2018-11-23 12:53:15,198 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 26 states. [2018-11-23 12:53:15,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:15,200 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2018-11-23 12:53:15,201 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2018-11-23 12:53:15,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:15,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:15,202 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 38 states. [2018-11-23 12:53:15,202 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 38 states. [2018-11-23 12:53:15,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:15,204 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2018-11-23 12:53:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2018-11-23 12:53:15,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:15,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:15,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:15,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:15,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:53:15,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 12:53:15,208 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2018-11-23 12:53:15,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:15,208 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 12:53:15,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:53:15,208 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:53:15,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:53:15,209 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:15,209 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] [2018-11-23 12:53:15,210 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:15,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:15,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234719, now seen corresponding path program 1 times [2018-11-23 12:53:15,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:15,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:15,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:15,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:15,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:15,553 INFO L256 TraceCheckUtils]: 0: Hoare triple {756#true} call ULTIMATE.init(); {756#true} is VALID [2018-11-23 12:53:15,554 INFO L273 TraceCheckUtils]: 1: Hoare triple {756#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {756#true} is VALID [2018-11-23 12:53:15,555 INFO L273 TraceCheckUtils]: 2: Hoare triple {756#true} assume true; {756#true} is VALID [2018-11-23 12:53:15,555 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {756#true} {756#true} #91#return; {756#true} is VALID [2018-11-23 12:53:15,555 INFO L256 TraceCheckUtils]: 4: Hoare triple {756#true} call #t~ret10 := main(); {756#true} is VALID [2018-11-23 12:53:15,557 INFO L273 TraceCheckUtils]: 5: Hoare triple {756#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {758#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:53:15,562 INFO L273 TraceCheckUtils]: 6: Hoare triple {758#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {758#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:53:15,562 INFO L273 TraceCheckUtils]: 7: Hoare triple {758#(= (select |#valid| main_~a~0.base) 1)} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {759#(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:53:15,564 INFO L273 TraceCheckUtils]: 8: Hoare triple {759#(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~nondet2 && #t~nondet2 <= 2147483647; {759#(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:53:15,564 INFO L273 TraceCheckUtils]: 9: Hoare triple {759#(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~nondet2);havoc #t~nondet2; {759#(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:53:15,565 INFO L273 TraceCheckUtils]: 10: Hoare triple {759#(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 != ~flag~0);call write~int(2, ~p~0.base, ~p~0.offset, 4); {760#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-23 12:53:15,566 INFO L273 TraceCheckUtils]: 11: Hoare triple {760#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; {761#(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.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-23 12:53:15,568 INFO L273 TraceCheckUtils]: 12: Hoare triple {761#(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.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {761#(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.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-23 12:53:15,574 INFO L273 TraceCheckUtils]: 13: Hoare triple {761#(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.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset; {762#(= 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:53:15,575 INFO L273 TraceCheckUtils]: 14: Hoare triple {762#(= 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~nondet2 && #t~nondet2 <= 2147483647; {762#(= 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:53:15,575 INFO L273 TraceCheckUtils]: 15: Hoare triple {762#(= 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~nondet2);havoc #t~nondet2; {762#(= 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:53:15,580 INFO L273 TraceCheckUtils]: 16: Hoare triple {762#(= 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; {763#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:53:15,581 INFO L273 TraceCheckUtils]: 17: Hoare triple {763#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(0 != ~flag~0); {763#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:53:15,581 INFO L273 TraceCheckUtils]: 18: Hoare triple {763#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {764#(= |main_#t~mem7| 2)} is VALID [2018-11-23 12:53:15,583 INFO L273 TraceCheckUtils]: 19: Hoare triple {764#(= |main_#t~mem7| 2)} assume !(2 == #t~mem7);havoc #t~mem7; {757#false} is VALID [2018-11-23 12:53:15,583 INFO L273 TraceCheckUtils]: 20: Hoare triple {757#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {757#false} is VALID [2018-11-23 12:53:15,583 INFO L273 TraceCheckUtils]: 21: Hoare triple {757#false} assume 3 != #t~mem9;havoc #t~mem9; {757#false} is VALID [2018-11-23 12:53:15,584 INFO L273 TraceCheckUtils]: 22: Hoare triple {757#false} assume !false; {757#false} is VALID [2018-11-23 12:53:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:15,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:53:15,587 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:53:15,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:15,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:53:15,757 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:53:15,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:15,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:15,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 12:53:15,769 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:15,770 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_11|]. (= |#valid| (store |v_#valid_11| main_~a~0.base 1)) [2018-11-23 12:53:15,770 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 (select |#valid| main_~a~0.base)) [2018-11-23 12:53:15,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 12:53:15,867 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:53:15,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:15,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:15,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:15,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-23 12:53:16,054 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:53:16,056 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:53:16,058 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:53:16,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:16,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:16,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-11-23 12:53:16,078 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:16,078 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_12|]. (and (= (select |v_#valid_12| main_~p~0.base) 1) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select |v_#valid_12| main_~t~0.base) 0) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)) [2018-11-23 12:53:16,078 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.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)) [2018-11-23 12:53:16,133 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:53:16,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:53:16,150 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:53:16,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:16,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:16,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:16,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-11-23 12:53:16,400 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:53:16,439 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:53:16,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:16,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:16,461 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:53:16,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-23 12:53:16,467 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:16,467 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_16|, v_main_~p~0.base_17, v_main_~p~0.offset_17]. (and (= (store |v_#memory_int_16| v_main_~p~0.base_17 (store (select |v_#memory_int_16| v_main_~p~0.base_17) v_main_~p~0.offset_17 3)) |#memory_int|) (= (select (select |v_#memory_int_16| main_~p~0.base) main_~p~0.offset) 2) (not (= v_main_~p~0.base_17 main_~p~0.base))) [2018-11-23 12:53:16,467 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_17, v_main_~p~0.offset_17]. (and (= (select (select |#memory_int| v_main_~p~0.base_17) v_main_~p~0.offset_17) 3) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= v_main_~p~0.base_17 main_~p~0.base))) [2018-11-23 12:53:16,582 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:53:16,597 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:53:16,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:16,605 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:53:16,616 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:16,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:16,623 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:53:16,623 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-23 12:53:16,626 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:16,626 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset, v_main_~p~0.base_17, v_main_~p~0.offset_17]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= (select (select |#memory_int| v_main_~p~0.base_17) v_main_~p~0.offset_17) 3) (= |main_#t~mem7| .cse0) (= 2 .cse0) (not (= v_main_~p~0.base_17 main_~p~0.base)))) [2018-11-23 12:53:16,626 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 2 |main_#t~mem7|) [2018-11-23 12:53:16,635 INFO L256 TraceCheckUtils]: 0: Hoare triple {756#true} call ULTIMATE.init(); {756#true} is VALID [2018-11-23 12:53:16,635 INFO L273 TraceCheckUtils]: 1: Hoare triple {756#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {756#true} is VALID [2018-11-23 12:53:16,636 INFO L273 TraceCheckUtils]: 2: Hoare triple {756#true} assume true; {756#true} is VALID [2018-11-23 12:53:16,636 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {756#true} {756#true} #91#return; {756#true} is VALID [2018-11-23 12:53:16,636 INFO L256 TraceCheckUtils]: 4: Hoare triple {756#true} call #t~ret10 := main(); {756#true} is VALID [2018-11-23 12:53:16,638 INFO L273 TraceCheckUtils]: 5: Hoare triple {756#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {758#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:53:16,638 INFO L273 TraceCheckUtils]: 6: Hoare triple {758#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {758#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:53:16,639 INFO L273 TraceCheckUtils]: 7: Hoare triple {758#(= (select |#valid| main_~a~0.base) 1)} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {759#(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:53:16,640 INFO L273 TraceCheckUtils]: 8: Hoare triple {759#(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~nondet2 && #t~nondet2 <= 2147483647; {759#(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:53:16,640 INFO L273 TraceCheckUtils]: 9: Hoare triple {759#(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~nondet2);havoc #t~nondet2; {759#(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:53:16,641 INFO L273 TraceCheckUtils]: 10: Hoare triple {759#(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 != ~flag~0);call write~int(2, ~p~0.base, ~p~0.offset, 4); {760#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-23 12:53:16,643 INFO L273 TraceCheckUtils]: 11: Hoare triple {760#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; {761#(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.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-23 12:53:16,644 INFO L273 TraceCheckUtils]: 12: Hoare triple {761#(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.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {761#(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.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-23 12:53:16,650 INFO L273 TraceCheckUtils]: 13: Hoare triple {761#(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.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset; {807#(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:53:16,651 INFO L273 TraceCheckUtils]: 14: Hoare triple {807#(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~nondet2 && #t~nondet2 <= 2147483647; {807#(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:53:16,652 INFO L273 TraceCheckUtils]: 15: Hoare triple {807#(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~nondet2);havoc #t~nondet2; {807#(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:53:16,653 INFO L273 TraceCheckUtils]: 16: Hoare triple {807#(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; {817#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_17 Int) (v_main_~p~0.offset_17 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_17) v_main_~p~0.offset_17) 3) (not (= v_main_~p~0.base_17 main_~p~0.base)))))} is VALID [2018-11-23 12:53:16,654 INFO L273 TraceCheckUtils]: 17: Hoare triple {817#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_17 Int) (v_main_~p~0.offset_17 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_17) v_main_~p~0.offset_17) 3) (not (= v_main_~p~0.base_17 main_~p~0.base)))))} assume !(0 != ~flag~0); {817#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_17 Int) (v_main_~p~0.offset_17 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_17) v_main_~p~0.offset_17) 3) (not (= v_main_~p~0.base_17 main_~p~0.base)))))} is VALID [2018-11-23 12:53:16,655 INFO L273 TraceCheckUtils]: 18: Hoare triple {817#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_17 Int) (v_main_~p~0.offset_17 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_17) v_main_~p~0.offset_17) 3) (not (= v_main_~p~0.base_17 main_~p~0.base)))))} call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {764#(= |main_#t~mem7| 2)} is VALID [2018-11-23 12:53:16,656 INFO L273 TraceCheckUtils]: 19: Hoare triple {764#(= |main_#t~mem7| 2)} assume !(2 == #t~mem7);havoc #t~mem7; {757#false} is VALID [2018-11-23 12:53:16,656 INFO L273 TraceCheckUtils]: 20: Hoare triple {757#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {757#false} is VALID [2018-11-23 12:53:16,657 INFO L273 TraceCheckUtils]: 21: Hoare triple {757#false} assume 3 != #t~mem9;havoc #t~mem9; {757#false} is VALID [2018-11-23 12:53:16,657 INFO L273 TraceCheckUtils]: 22: Hoare triple {757#false} assume !false; {757#false} is VALID [2018-11-23 12:53:16,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:16,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:53:16,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-11-23 12:53:16,684 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-11-23 12:53:16,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:16,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:53:16,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:16,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:53:16,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:53:16,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:53:16,741 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 11 states. [2018-11-23 12:53:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:17,996 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-11-23 12:53:17,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:53:17,996 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-11-23 12:53:17,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:17,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:53:17,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2018-11-23 12:53:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:53:18,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2018-11-23 12:53:18,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 76 transitions. [2018-11-23 12:53:18,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:18,147 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:53:18,147 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 12:53:18,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:53:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 12:53:18,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 36. [2018-11-23 12:53:18,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:18,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 36 states. [2018-11-23 12:53:18,242 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 36 states. [2018-11-23 12:53:18,242 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 36 states. [2018-11-23 12:53:18,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:18,246 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-11-23 12:53:18,246 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-11-23 12:53:18,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:18,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:18,247 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 63 states. [2018-11-23 12:53:18,247 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 63 states. [2018-11-23 12:53:18,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:18,251 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-11-23 12:53:18,251 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-11-23 12:53:18,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:18,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:18,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:18,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:53:18,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 12:53:18,255 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 23 [2018-11-23 12:53:18,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:18,255 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 12:53:18,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:53:18,255 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 12:53:18,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:53:18,256 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:18,257 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] [2018-11-23 12:53:18,257 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:18,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:18,257 INFO L82 PathProgramCache]: Analyzing trace with hash 869497774, now seen corresponding path program 1 times [2018-11-23 12:53:18,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:18,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:18,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:18,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:18,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:18,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {1099#true} call ULTIMATE.init(); {1099#true} is VALID [2018-11-23 12:53:18,369 INFO L273 TraceCheckUtils]: 1: Hoare triple {1099#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1099#true} is VALID [2018-11-23 12:53:18,369 INFO L273 TraceCheckUtils]: 2: Hoare triple {1099#true} assume true; {1099#true} is VALID [2018-11-23 12:53:18,369 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1099#true} {1099#true} #91#return; {1099#true} is VALID [2018-11-23 12:53:18,370 INFO L256 TraceCheckUtils]: 4: Hoare triple {1099#true} call #t~ret10 := main(); {1099#true} is VALID [2018-11-23 12:53:18,370 INFO L273 TraceCheckUtils]: 5: Hoare triple {1099#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {1099#true} is VALID [2018-11-23 12:53:18,370 INFO L273 TraceCheckUtils]: 6: Hoare triple {1099#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1099#true} is VALID [2018-11-23 12:53:18,370 INFO L273 TraceCheckUtils]: 7: Hoare triple {1099#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1099#true} is VALID [2018-11-23 12:53:18,371 INFO L273 TraceCheckUtils]: 8: Hoare triple {1099#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1099#true} is VALID [2018-11-23 12:53:18,371 INFO L273 TraceCheckUtils]: 9: Hoare triple {1099#true} assume !!(0 != #t~nondet2);havoc #t~nondet2; {1099#true} is VALID [2018-11-23 12:53:18,380 INFO L273 TraceCheckUtils]: 10: Hoare triple {1099#true} assume !(0 != ~flag~0);call write~int(2, ~p~0.base, ~p~0.offset, 4); {1101#(= main_~flag~0 0)} is VALID [2018-11-23 12:53:18,386 INFO L273 TraceCheckUtils]: 11: Hoare triple {1101#(= main_~flag~0 0)} call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; {1101#(= main_~flag~0 0)} is VALID [2018-11-23 12:53:18,389 INFO L273 TraceCheckUtils]: 12: Hoare triple {1101#(= main_~flag~0 0)} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1101#(= main_~flag~0 0)} is VALID [2018-11-23 12:53:18,390 INFO L273 TraceCheckUtils]: 13: Hoare triple {1101#(= main_~flag~0 0)} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset; {1101#(= main_~flag~0 0)} is VALID [2018-11-23 12:53:18,394 INFO L273 TraceCheckUtils]: 14: Hoare triple {1101#(= main_~flag~0 0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1101#(= main_~flag~0 0)} is VALID [2018-11-23 12:53:18,394 INFO L273 TraceCheckUtils]: 15: Hoare triple {1101#(= main_~flag~0 0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {1101#(= main_~flag~0 0)} is VALID [2018-11-23 12:53:18,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {1101#(= main_~flag~0 0)} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1101#(= main_~flag~0 0)} is VALID [2018-11-23 12:53:18,396 INFO L273 TraceCheckUtils]: 17: Hoare triple {1101#(= main_~flag~0 0)} assume 0 != ~flag~0; {1100#false} is VALID [2018-11-23 12:53:18,396 INFO L273 TraceCheckUtils]: 18: Hoare triple {1100#false} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {1100#false} is VALID [2018-11-23 12:53:18,397 INFO L273 TraceCheckUtils]: 19: Hoare triple {1100#false} assume !(1 == #t~mem5);havoc #t~mem5; {1100#false} is VALID [2018-11-23 12:53:18,397 INFO L273 TraceCheckUtils]: 20: Hoare triple {1100#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1100#false} is VALID [2018-11-23 12:53:18,397 INFO L273 TraceCheckUtils]: 21: Hoare triple {1100#false} assume 3 != #t~mem9;havoc #t~mem9; {1100#false} is VALID [2018-11-23 12:53:18,397 INFO L273 TraceCheckUtils]: 22: Hoare triple {1100#false} assume !false; {1100#false} is VALID [2018-11-23 12:53:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:18,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:18,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:53:18,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:53:18,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:18,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:53:18,422 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:18,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:53:18,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:53:18,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:53:18,423 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 3 states. [2018-11-23 12:53:18,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:18,552 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2018-11-23 12:53:18,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:53:18,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:53:18,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:18,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:53:18,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-23 12:53:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:53:18,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-23 12:53:18,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2018-11-23 12:53:18,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:18,631 INFO L225 Difference]: With dead ends: 64 [2018-11-23 12:53:18,631 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:53:18,631 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:53:18,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:53:18,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-11-23 12:53:18,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:18,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 44 states. [2018-11-23 12:53:18,925 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 44 states. [2018-11-23 12:53:18,925 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 44 states. [2018-11-23 12:53:18,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:18,928 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-23 12:53:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-23 12:53:18,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:18,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:18,929 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 48 states. [2018-11-23 12:53:18,929 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 48 states. [2018-11-23 12:53:18,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:18,932 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-23 12:53:18,932 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-23 12:53:18,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:18,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:18,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:18,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:18,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:53:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-23 12:53:18,935 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 23 [2018-11-23 12:53:18,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:18,935 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-23 12:53:18,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:53:18,936 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-23 12:53:18,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:53:18,937 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:18,937 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] [2018-11-23 12:53:18,937 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:18,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:18,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1900040733, now seen corresponding path program 1 times [2018-11-23 12:53:18,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:18,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:18,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:18,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:18,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:19,027 INFO L256 TraceCheckUtils]: 0: Hoare triple {1333#true} call ULTIMATE.init(); {1333#true} is VALID [2018-11-23 12:53:19,027 INFO L273 TraceCheckUtils]: 1: Hoare triple {1333#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1333#true} is VALID [2018-11-23 12:53:19,028 INFO L273 TraceCheckUtils]: 2: Hoare triple {1333#true} assume true; {1333#true} is VALID [2018-11-23 12:53:19,028 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1333#true} {1333#true} #91#return; {1333#true} is VALID [2018-11-23 12:53:19,028 INFO L256 TraceCheckUtils]: 4: Hoare triple {1333#true} call #t~ret10 := main(); {1333#true} is VALID [2018-11-23 12:53:19,028 INFO L273 TraceCheckUtils]: 5: Hoare triple {1333#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {1333#true} is VALID [2018-11-23 12:53:19,029 INFO L273 TraceCheckUtils]: 6: Hoare triple {1333#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1333#true} is VALID [2018-11-23 12:53:19,029 INFO L273 TraceCheckUtils]: 7: Hoare triple {1333#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1333#true} is VALID [2018-11-23 12:53:19,029 INFO L273 TraceCheckUtils]: 8: Hoare triple {1333#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1333#true} is VALID [2018-11-23 12:53:19,030 INFO L273 TraceCheckUtils]: 9: Hoare triple {1333#true} assume !!(0 != #t~nondet2);havoc #t~nondet2; {1333#true} is VALID [2018-11-23 12:53:19,031 INFO L273 TraceCheckUtils]: 10: Hoare triple {1333#true} assume 0 != ~flag~0;call write~int(1, ~p~0.base, ~p~0.offset, 4); {1335#(not (= main_~flag~0 0))} is VALID [2018-11-23 12:53:19,032 INFO L273 TraceCheckUtils]: 11: Hoare triple {1335#(not (= main_~flag~0 0))} call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; {1335#(not (= main_~flag~0 0))} is VALID [2018-11-23 12:53:19,032 INFO L273 TraceCheckUtils]: 12: Hoare triple {1335#(not (= main_~flag~0 0))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1335#(not (= main_~flag~0 0))} is VALID [2018-11-23 12:53:19,033 INFO L273 TraceCheckUtils]: 13: Hoare triple {1335#(not (= main_~flag~0 0))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset; {1335#(not (= main_~flag~0 0))} is VALID [2018-11-23 12:53:19,036 INFO L273 TraceCheckUtils]: 14: Hoare triple {1335#(not (= main_~flag~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1335#(not (= main_~flag~0 0))} is VALID [2018-11-23 12:53:19,036 INFO L273 TraceCheckUtils]: 15: Hoare triple {1335#(not (= main_~flag~0 0))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1335#(not (= main_~flag~0 0))} is VALID [2018-11-23 12:53:19,038 INFO L273 TraceCheckUtils]: 16: Hoare triple {1335#(not (= main_~flag~0 0))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1335#(not (= main_~flag~0 0))} is VALID [2018-11-23 12:53:19,038 INFO L273 TraceCheckUtils]: 17: Hoare triple {1335#(not (= main_~flag~0 0))} assume !(0 != ~flag~0); {1334#false} is VALID [2018-11-23 12:53:19,038 INFO L273 TraceCheckUtils]: 18: Hoare triple {1334#false} call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {1334#false} is VALID [2018-11-23 12:53:19,039 INFO L273 TraceCheckUtils]: 19: Hoare triple {1334#false} assume !(2 == #t~mem7);havoc #t~mem7; {1334#false} is VALID [2018-11-23 12:53:19,039 INFO L273 TraceCheckUtils]: 20: Hoare triple {1334#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1334#false} is VALID [2018-11-23 12:53:19,039 INFO L273 TraceCheckUtils]: 21: Hoare triple {1334#false} assume 3 != #t~mem9;havoc #t~mem9; {1334#false} is VALID [2018-11-23 12:53:19,039 INFO L273 TraceCheckUtils]: 22: Hoare triple {1334#false} assume !false; {1334#false} is VALID [2018-11-23 12:53:19,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:19,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:19,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:53:19,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:53:19,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:19,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:53:19,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:19,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:53:19,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:53:19,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:53:19,093 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 3 states. [2018-11-23 12:53:19,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:19,250 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-11-23 12:53:19,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:53:19,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:53:19,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:53:19,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-23 12:53:19,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:53:19,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-23 12:53:19,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2018-11-23 12:53:19,429 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:19,430 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:53:19,430 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:53:19,430 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:53:19,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:53:19,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-11-23 12:53:19,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:19,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 44 states. [2018-11-23 12:53:19,489 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 44 states. [2018-11-23 12:53:19,490 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 44 states. [2018-11-23 12:53:19,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:19,493 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-23 12:53:19,493 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-23 12:53:19,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:19,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:19,494 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 48 states. [2018-11-23 12:53:19,494 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 48 states. [2018-11-23 12:53:19,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:19,496 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-23 12:53:19,496 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-23 12:53:19,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:19,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:19,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:19,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:19,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:53:19,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-23 12:53:19,499 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 23 [2018-11-23 12:53:19,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:19,500 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-23 12:53:19,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:53:19,500 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-23 12:53:19,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:53:19,501 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:19,501 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] [2018-11-23 12:53:19,501 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:19,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:19,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1456303788, now seen corresponding path program 1 times [2018-11-23 12:53:19,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:19,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:19,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:19,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:19,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:19,749 INFO L256 TraceCheckUtils]: 0: Hoare triple {1564#true} call ULTIMATE.init(); {1564#true} is VALID [2018-11-23 12:53:19,749 INFO L273 TraceCheckUtils]: 1: Hoare triple {1564#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1564#true} is VALID [2018-11-23 12:53:19,750 INFO L273 TraceCheckUtils]: 2: Hoare triple {1564#true} assume true; {1564#true} is VALID [2018-11-23 12:53:19,750 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1564#true} {1564#true} #91#return; {1564#true} is VALID [2018-11-23 12:53:19,750 INFO L256 TraceCheckUtils]: 4: Hoare triple {1564#true} call #t~ret10 := main(); {1564#true} is VALID [2018-11-23 12:53:19,751 INFO L273 TraceCheckUtils]: 5: Hoare triple {1564#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {1566#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:53:19,752 INFO L273 TraceCheckUtils]: 6: Hoare triple {1566#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1566#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:53:19,753 INFO L273 TraceCheckUtils]: 7: Hoare triple {1566#(= (select |#valid| main_~a~0.base) 1)} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1567#(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:53:19,754 INFO L273 TraceCheckUtils]: 8: Hoare triple {1567#(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~nondet2 && #t~nondet2 <= 2147483647; {1567#(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:53:19,755 INFO L273 TraceCheckUtils]: 9: Hoare triple {1567#(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~nondet2);havoc #t~nondet2; {1567#(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:53:19,757 INFO L273 TraceCheckUtils]: 10: Hoare triple {1567#(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 != ~flag~0;call write~int(1, ~p~0.base, ~p~0.offset, 4); {1568#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (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:53:19,763 INFO L273 TraceCheckUtils]: 11: Hoare triple {1568#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; {1569#(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:53:19,764 INFO L273 TraceCheckUtils]: 12: Hoare triple {1569#(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); {1569#(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:53:19,765 INFO L273 TraceCheckUtils]: 13: Hoare triple {1569#(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~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset; {1570#(= 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:53:19,765 INFO L273 TraceCheckUtils]: 14: Hoare triple {1570#(= 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~nondet2 && #t~nondet2 <= 2147483647; {1570#(= 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:53:19,766 INFO L273 TraceCheckUtils]: 15: Hoare triple {1570#(= 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~nondet2);havoc #t~nondet2; {1570#(= 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:53:19,766 INFO L273 TraceCheckUtils]: 16: Hoare triple {1570#(= 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; {1571#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:53:19,767 INFO L273 TraceCheckUtils]: 17: Hoare triple {1571#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume 0 != ~flag~0; {1571#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:53:19,768 INFO L273 TraceCheckUtils]: 18: Hoare triple {1571#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {1572#(= |main_#t~mem5| 1)} is VALID [2018-11-23 12:53:19,772 INFO L273 TraceCheckUtils]: 19: Hoare triple {1572#(= |main_#t~mem5| 1)} assume !(1 == #t~mem5);havoc #t~mem5; {1565#false} is VALID [2018-11-23 12:53:19,772 INFO L273 TraceCheckUtils]: 20: Hoare triple {1565#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1565#false} is VALID [2018-11-23 12:53:19,772 INFO L273 TraceCheckUtils]: 21: Hoare triple {1565#false} assume 3 != #t~mem9;havoc #t~mem9; {1565#false} is VALID [2018-11-23 12:53:19,772 INFO L273 TraceCheckUtils]: 22: Hoare triple {1565#false} assume !false; {1565#false} is VALID [2018-11-23 12:53:19,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:19,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:53:19,774 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:53:19,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:19,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:53:19,864 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:53:19,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:19,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:19,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 12:53:19,870 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:19,870 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_13|]. (= (store |v_#valid_13| main_~a~0.base 1) |#valid|) [2018-11-23 12:53:19,870 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 (select |#valid| main_~a~0.base)) [2018-11-23 12:53:19,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 12:53:19,912 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:53:19,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:19,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:19,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:19,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-23 12:53:19,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:53:19,988 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:53:19,989 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:53:19,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:19,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:19,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-11-23 12:53:20,001 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:20,002 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_14|]. (and (= (select |v_#valid_14| main_~t~0.base) 0) (= (select |v_#valid_14| main_~p~0.base) 1) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) [2018-11-23 12:53:20,002 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:53:20,125 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:53:20,129 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:53:20,131 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:53:20,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:20,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:20,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:20,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-11-23 12:53:20,181 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:53:20,190 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:53:20,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:20,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:20,205 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:53:20,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-23 12:53:20,209 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:20,209 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_19|, v_main_~p~0.base_19, v_main_~p~0.offset_19]. (and (= |#memory_int| (store |v_#memory_int_19| v_main_~p~0.base_19 (store (select |v_#memory_int_19| v_main_~p~0.base_19) v_main_~p~0.offset_19 3))) (= (select (select |v_#memory_int_19| main_~p~0.base) main_~p~0.offset) 1) (not (= v_main_~p~0.base_19 main_~p~0.base))) [2018-11-23 12:53:20,210 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_19, v_main_~p~0.offset_19]. (and (= 3 (select (select |#memory_int| v_main_~p~0.base_19) v_main_~p~0.offset_19)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= v_main_~p~0.base_19 main_~p~0.base))) [2018-11-23 12:53:20,258 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:53:20,263 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:53:20,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:20,274 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:53:20,275 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:20,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:20,282 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:53:20,283 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-23 12:53:20,285 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:20,285 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset, v_main_~p~0.base_19, v_main_~p~0.offset_19]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= |main_#t~mem5| .cse0) (= 3 (select (select |#memory_int| v_main_~p~0.base_19) v_main_~p~0.offset_19)) (= 1 .cse0) (not (= v_main_~p~0.base_19 main_~p~0.base)))) [2018-11-23 12:53:20,286 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 |main_#t~mem5|) [2018-11-23 12:53:20,294 INFO L256 TraceCheckUtils]: 0: Hoare triple {1564#true} call ULTIMATE.init(); {1564#true} is VALID [2018-11-23 12:53:20,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {1564#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1564#true} is VALID [2018-11-23 12:53:20,295 INFO L273 TraceCheckUtils]: 2: Hoare triple {1564#true} assume true; {1564#true} is VALID [2018-11-23 12:53:20,295 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1564#true} {1564#true} #91#return; {1564#true} is VALID [2018-11-23 12:53:20,295 INFO L256 TraceCheckUtils]: 4: Hoare triple {1564#true} call #t~ret10 := main(); {1564#true} is VALID [2018-11-23 12:53:20,317 INFO L273 TraceCheckUtils]: 5: Hoare triple {1564#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {1566#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:53:20,331 INFO L273 TraceCheckUtils]: 6: Hoare triple {1566#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1566#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:53:20,340 INFO L273 TraceCheckUtils]: 7: Hoare triple {1566#(= (select |#valid| main_~a~0.base) 1)} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1567#(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:53:20,347 INFO L273 TraceCheckUtils]: 8: Hoare triple {1567#(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~nondet2 && #t~nondet2 <= 2147483647; {1567#(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:53:20,347 INFO L273 TraceCheckUtils]: 9: Hoare triple {1567#(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~nondet2);havoc #t~nondet2; {1567#(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:53:20,351 INFO L273 TraceCheckUtils]: 10: Hoare triple {1567#(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 != ~flag~0;call write~int(1, ~p~0.base, ~p~0.offset, 4); {1568#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (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:53:20,354 INFO L273 TraceCheckUtils]: 11: Hoare triple {1568#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; {1569#(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:53:20,355 INFO L273 TraceCheckUtils]: 12: Hoare triple {1569#(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); {1569#(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:53:20,356 INFO L273 TraceCheckUtils]: 13: Hoare triple {1569#(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~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset; {1615#(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:53:20,356 INFO L273 TraceCheckUtils]: 14: Hoare triple {1615#(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~nondet2 && #t~nondet2 <= 2147483647; {1615#(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:53:20,357 INFO L273 TraceCheckUtils]: 15: Hoare triple {1615#(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~nondet2);havoc #t~nondet2; {1615#(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:53:20,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {1615#(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; {1625#(and (exists ((v_main_~p~0.offset_19 Int) (v_main_~p~0.base_19 Int)) (and (= 3 (select (select |#memory_int| v_main_~p~0.base_19) v_main_~p~0.offset_19)) (not (= v_main_~p~0.base_19 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 12:53:20,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {1625#(and (exists ((v_main_~p~0.offset_19 Int) (v_main_~p~0.base_19 Int)) (and (= 3 (select (select |#memory_int| v_main_~p~0.base_19) v_main_~p~0.offset_19)) (not (= v_main_~p~0.base_19 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume 0 != ~flag~0; {1625#(and (exists ((v_main_~p~0.offset_19 Int) (v_main_~p~0.base_19 Int)) (and (= 3 (select (select |#memory_int| v_main_~p~0.base_19) v_main_~p~0.offset_19)) (not (= v_main_~p~0.base_19 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 12:53:20,365 INFO L273 TraceCheckUtils]: 18: Hoare triple {1625#(and (exists ((v_main_~p~0.offset_19 Int) (v_main_~p~0.base_19 Int)) (and (= 3 (select (select |#memory_int| v_main_~p~0.base_19) v_main_~p~0.offset_19)) (not (= v_main_~p~0.base_19 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {1572#(= |main_#t~mem5| 1)} is VALID [2018-11-23 12:53:20,367 INFO L273 TraceCheckUtils]: 19: Hoare triple {1572#(= |main_#t~mem5| 1)} assume !(1 == #t~mem5);havoc #t~mem5; {1565#false} is VALID [2018-11-23 12:53:20,367 INFO L273 TraceCheckUtils]: 20: Hoare triple {1565#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1565#false} is VALID [2018-11-23 12:53:20,367 INFO L273 TraceCheckUtils]: 21: Hoare triple {1565#false} assume 3 != #t~mem9;havoc #t~mem9; {1565#false} is VALID [2018-11-23 12:53:20,367 INFO L273 TraceCheckUtils]: 22: Hoare triple {1565#false} assume !false; {1565#false} is VALID [2018-11-23 12:53:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:20,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:53:20,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-11-23 12:53:20,389 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-11-23 12:53:20,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:20,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:53:20,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:20,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:53:20,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:53:20,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:53:20,433 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 11 states. [2018-11-23 12:53:21,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:21,402 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-11-23 12:53:21,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:53:21,402 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-11-23 12:53:21,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:21,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:53:21,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2018-11-23 12:53:21,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:53:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2018-11-23 12:53:21,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 65 transitions. [2018-11-23 12:53:21,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:21,499 INFO L225 Difference]: With dead ends: 69 [2018-11-23 12:53:21,500 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:53:21,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:53:21,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:53:21,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-11-23 12:53:21,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:21,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 53 states. [2018-11-23 12:53:21,545 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 53 states. [2018-11-23 12:53:21,545 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 53 states. [2018-11-23 12:53:21,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:21,548 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-11-23 12:53:21,548 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-11-23 12:53:21,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:21,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:21,549 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 65 states. [2018-11-23 12:53:21,549 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 65 states. [2018-11-23 12:53:21,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:21,551 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-11-23 12:53:21,551 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-11-23 12:53:21,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:21,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:21,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:21,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:21,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:53:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-11-23 12:53:21,554 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 23 [2018-11-23 12:53:21,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:21,554 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-11-23 12:53:21,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:53:21,554 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-11-23 12:53:21,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:53:21,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:21,555 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] [2018-11-23 12:53:21,555 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:21,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:21,556 INFO L82 PathProgramCache]: Analyzing trace with hash -653143750, now seen corresponding path program 1 times [2018-11-23 12:53:21,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:21,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:21,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:21,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:21,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:21,739 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:53:21,743 INFO L168 Benchmark]: Toolchain (without parser) took 12022.28 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 859.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -657.6 MB). Peak memory consumption was 202.2 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:21,745 INFO L168 Benchmark]: CDTParser took 0.25 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:53:21,746 INFO L168 Benchmark]: CACSL2BoogieTranslator took 680.39 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:53:21,746 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.25 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -813.6 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:21,747 INFO L168 Benchmark]: Boogie Preprocessor took 46.59 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:53:21,747 INFO L168 Benchmark]: RCFGBuilder took 835.79 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:21,748 INFO L168 Benchmark]: TraceAbstraction took 10337.93 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 127.9 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 89.3 MB). Peak memory consumption was 217.2 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:21,752 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.25 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 680.39 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 116.25 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -813.6 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.59 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 835.79 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10337.93 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 127.9 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 89.3 MB). Peak memory consumption was 217.2 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...