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/simple_built_from_end_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:53:21,488 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:53:21,490 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:53:21,502 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:53:21,502 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:53:21,503 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:53:21,504 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:53:21,506 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:53:21,508 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:53:21,509 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:53:21,510 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:53:21,510 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:53:21,511 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:53:21,512 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:53:21,513 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:53:21,514 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:53:21,515 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:53:21,517 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:53:21,519 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:53:21,521 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:53:21,522 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:53:21,523 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:53:21,530 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:53:21,530 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:53:21,530 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:53:21,531 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:53:21,533 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:53:21,533 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:53:21,538 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:53:21,543 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:53:21,543 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:53:21,544 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:53:21,544 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:53:21,544 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:53:21,545 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:53:21,546 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:53:21,546 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:21,579 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:53:21,579 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:53:21,580 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:53:21,581 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:53:21,582 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:53:21,582 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:53:21,582 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:53:21,582 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:53:21,584 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:53:21,584 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:53:21,584 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:53:21,584 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:53:21,584 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:53:21,585 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:53:21,585 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:53:21,585 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:53:21,585 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:53:21,585 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:53:21,586 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:53:21,586 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:53:21,586 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:53:21,586 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:53:21,586 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:53:21,586 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:53:21,587 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:53:21,587 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:53:21,587 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:53:21,587 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:53:21,587 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:53:21,589 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:53:21,589 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:53:21,654 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:53:21,672 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:53:21,676 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:53:21,677 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:53:21,678 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:53:21,678 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_built_from_end_true-unreach-call_false-valid-memtrack.i [2018-11-23 12:53:21,736 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f4a76c3d/b115d8291f8b4f6e8420218c08f235bc/FLAG58450da76 [2018-11-23 12:53:22,265 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:53:22,266 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/simple_built_from_end_true-unreach-call_false-valid-memtrack.i [2018-11-23 12:53:22,280 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f4a76c3d/b115d8291f8b4f6e8420218c08f235bc/FLAG58450da76 [2018-11-23 12:53:22,539 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f4a76c3d/b115d8291f8b4f6e8420218c08f235bc [2018-11-23 12:53:22,549 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:53:22,551 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:53:22,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:22,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:53:22,556 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:53:22,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:22" (1/1) ... [2018-11-23 12:53:22,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aff6dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:22, skipping insertion in model container [2018-11-23 12:53:22,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:22" (1/1) ... [2018-11-23 12:53:22,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:53:22,626 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:53:23,028 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:23,040 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:53:23,098 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:23,165 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:53:23,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:23 WrapperNode [2018-11-23 12:53:23,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:23,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:23,167 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:53:23,167 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:53:23,177 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:23" (1/1) ... [2018-11-23 12:53:23,267 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:23" (1/1) ... [2018-11-23 12:53:23,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:23,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:53:23,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:53:23,279 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:53:23,288 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:23" (1/1) ... [2018-11-23 12:53:23,288 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:23" (1/1) ... [2018-11-23 12:53:23,291 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:23" (1/1) ... [2018-11-23 12:53:23,292 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:23" (1/1) ... [2018-11-23 12:53:23,302 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:23" (1/1) ... [2018-11-23 12:53:23,307 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:23" (1/1) ... [2018-11-23 12:53:23,309 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:23" (1/1) ... [2018-11-23 12:53:23,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:53:23,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:53:23,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:53:23,312 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:53:23,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:23" (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:23,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:53:23,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:53:23,379 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:53:23,379 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:53:23,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:53:23,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:53:23,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:53:23,379 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:53:23,380 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:53:23,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:53:23,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:53:23,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:53:23,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:53:23,892 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:53:23,893 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:53:23,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:23 BoogieIcfgContainer [2018-11-23 12:53:23,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:53:23,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:53:23,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:53:23,898 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:53:23,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:53:22" (1/3) ... [2018-11-23 12:53:23,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0fc62d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:23, skipping insertion in model container [2018-11-23 12:53:23,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:23" (2/3) ... [2018-11-23 12:53:23,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0fc62d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:23, skipping insertion in model container [2018-11-23 12:53:23,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:23" (3/3) ... [2018-11-23 12:53:23,902 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_built_from_end_true-unreach-call_false-valid-memtrack.i [2018-11-23 12:53:23,913 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:53:23,921 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:53:23,940 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:53:23,970 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:53:23,971 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:53:23,971 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:53:23,971 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:53:23,972 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:53:23,972 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:53:23,972 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:53:23,972 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:53:23,972 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:53:23,989 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 12:53:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 12:53:23,996 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:23,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:24,000 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:24,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:24,007 INFO L82 PathProgramCache]: Analyzing trace with hash 782306078, now seen corresponding path program 1 times [2018-11-23 12:53:24,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:24,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:24,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:24,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:24,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:24,153 INFO L256 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2018-11-23 12:53:24,156 INFO L273 TraceCheckUtils]: 1: Hoare triple {25#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25#true} is VALID [2018-11-23 12:53:24,157 INFO L273 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-23 12:53:24,157 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #55#return; {25#true} is VALID [2018-11-23 12:53:24,158 INFO L256 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret4 := main(); {25#true} is VALID [2018-11-23 12:53:24,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := 0, 0; {25#true} is VALID [2018-11-23 12:53:24,167 INFO L273 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2018-11-23 12:53:24,167 INFO L273 TraceCheckUtils]: 7: Hoare triple {26#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem2 := read~int(~p~0.base, ~p~0.offset, 4); {26#false} is VALID [2018-11-23 12:53:24,168 INFO L273 TraceCheckUtils]: 8: Hoare triple {26#false} assume 1 != #t~mem2;havoc #t~mem2; {26#false} is VALID [2018-11-23 12:53:24,168 INFO L273 TraceCheckUtils]: 9: Hoare triple {26#false} assume !false; {26#false} is VALID [2018-11-23 12:53:24,171 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:24,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:24,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:53:24,179 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 12:53:24,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:24,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:53:24,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:24,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:53:24,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:53:24,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:53:24,264 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-23 12:53:24,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:24,565 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2018-11-23 12:53:24,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:53:24,565 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 12:53:24,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:24,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:53:24,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2018-11-23 12:53:24,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:53:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2018-11-23 12:53:24,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 38 transitions. [2018-11-23 12:53:24,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:24,838 INFO L225 Difference]: With dead ends: 31 [2018-11-23 12:53:24,838 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 12:53:24,842 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:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 12:53:24,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 12:53:24,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:24,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 12:53:24,958 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 12:53:24,958 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 12:53:24,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:24,961 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-23 12:53:24,963 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 12:53:24,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:24,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:24,964 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 12:53:24,965 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 12:53:24,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:24,969 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-23 12:53:24,969 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 12:53:24,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:24,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:24,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:24,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:24,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:53:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-23 12:53:24,980 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-11-23 12:53:24,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:24,980 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 12:53:24,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:53:24,981 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 12:53:24,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 12:53:24,981 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:24,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:24,983 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:24,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:24,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1532796685, now seen corresponding path program 1 times [2018-11-23 12:53:24,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:24,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:24,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:24,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:24,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:25,125 INFO L256 TraceCheckUtils]: 0: Hoare triple {118#true} call ULTIMATE.init(); {118#true} is VALID [2018-11-23 12:53:25,125 INFO L273 TraceCheckUtils]: 1: Hoare triple {118#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {118#true} is VALID [2018-11-23 12:53:25,126 INFO L273 TraceCheckUtils]: 2: Hoare triple {118#true} assume true; {118#true} is VALID [2018-11-23 12:53:25,126 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} #55#return; {118#true} is VALID [2018-11-23 12:53:25,126 INFO L256 TraceCheckUtils]: 4: Hoare triple {118#true} call #t~ret4 := main(); {118#true} is VALID [2018-11-23 12:53:25,129 INFO L273 TraceCheckUtils]: 5: Hoare triple {118#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := 0, 0; {120#(and (= main_~p~0.base 0) (= main_~p~0.offset 0))} is VALID [2018-11-23 12:53:25,131 INFO L273 TraceCheckUtils]: 6: Hoare triple {120#(and (= main_~p~0.base 0) (= main_~p~0.offset 0))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {120#(and (= main_~p~0.base 0) (= main_~p~0.offset 0))} is VALID [2018-11-23 12:53:25,136 INFO L273 TraceCheckUtils]: 7: Hoare triple {120#(and (= main_~p~0.base 0) (= main_~p~0.offset 0))} assume !(0 != #t~nondet0);havoc #t~nondet0; {120#(and (= main_~p~0.base 0) (= main_~p~0.offset 0))} is VALID [2018-11-23 12:53:25,141 INFO L273 TraceCheckUtils]: 8: Hoare triple {120#(and (= main_~p~0.base 0) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem2 := read~int(~p~0.base, ~p~0.offset, 4); {119#false} is VALID [2018-11-23 12:53:25,141 INFO L273 TraceCheckUtils]: 9: Hoare triple {119#false} assume 1 != #t~mem2;havoc #t~mem2; {119#false} is VALID [2018-11-23 12:53:25,142 INFO L273 TraceCheckUtils]: 10: Hoare triple {119#false} assume !false; {119#false} is VALID [2018-11-23 12:53:25,143 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:25,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:25,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:53:25,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-23 12:53:25,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:25,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:53:25,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:25,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:53:25,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:53:25,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:53:25,201 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 3 states. [2018-11-23 12:53:25,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:25,415 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 12:53:25,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:53:25,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-23 12:53:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:53:25,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-11-23 12:53:25,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:53:25,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-11-23 12:53:25,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2018-11-23 12:53:25,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:25,491 INFO L225 Difference]: With dead ends: 25 [2018-11-23 12:53:25,491 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 12:53:25,492 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:25,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 12:53:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-23 12:53:25,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:25,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 17 states. [2018-11-23 12:53:25,528 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 17 states. [2018-11-23 12:53:25,528 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 17 states. [2018-11-23 12:53:25,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:25,530 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 12:53:25,530 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 12:53:25,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:25,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:25,533 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 19 states. [2018-11-23 12:53:25,533 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 19 states. [2018-11-23 12:53:25,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:25,536 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 12:53:25,537 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 12:53:25,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:25,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:25,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:25,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:25,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:53:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-23 12:53:25,543 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2018-11-23 12:53:25,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:25,544 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-23 12:53:25,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:53:25,544 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 12:53:25,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:53:25,544 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:25,548 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:25,548 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:25,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:25,549 INFO L82 PathProgramCache]: Analyzing trace with hash -135181588, now seen corresponding path program 1 times [2018-11-23 12:53:25,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:25,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:25,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:25,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:25,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:25,729 INFO L256 TraceCheckUtils]: 0: Hoare triple {215#true} call ULTIMATE.init(); {215#true} is VALID [2018-11-23 12:53:25,729 INFO L273 TraceCheckUtils]: 1: Hoare triple {215#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {215#true} is VALID [2018-11-23 12:53:25,729 INFO L273 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-23 12:53:25,730 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #55#return; {215#true} is VALID [2018-11-23 12:53:25,730 INFO L256 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret4 := main(); {215#true} is VALID [2018-11-23 12:53:25,730 INFO L273 TraceCheckUtils]: 5: Hoare triple {215#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := 0, 0; {215#true} is VALID [2018-11-23 12:53:25,731 INFO L273 TraceCheckUtils]: 6: Hoare triple {215#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {215#true} is VALID [2018-11-23 12:53:25,731 INFO L273 TraceCheckUtils]: 7: Hoare triple {215#true} assume !!(0 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {215#true} is VALID [2018-11-23 12:53:25,731 INFO L273 TraceCheckUtils]: 8: Hoare triple {215#true} assume !(~t~0.base == 0 && ~t~0.offset == 0); {215#true} is VALID [2018-11-23 12:53:25,735 INFO L273 TraceCheckUtils]: 9: Hoare triple {215#true} call write~int(1, ~t~0.base, ~t~0.offset, 4);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, 4 + ~t~0.offset, 4);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {217#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:53:25,736 INFO L273 TraceCheckUtils]: 10: Hoare triple {217#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {217#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:53:25,737 INFO L273 TraceCheckUtils]: 11: Hoare triple {217#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(0 != #t~nondet0);havoc #t~nondet0; {217#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:53:25,738 INFO L273 TraceCheckUtils]: 12: Hoare triple {217#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem2 := read~int(~p~0.base, ~p~0.offset, 4); {218#(= |main_#t~mem2| 1)} is VALID [2018-11-23 12:53:25,741 INFO L273 TraceCheckUtils]: 13: Hoare triple {218#(= |main_#t~mem2| 1)} assume 1 != #t~mem2;havoc #t~mem2; {216#false} is VALID [2018-11-23 12:53:25,741 INFO L273 TraceCheckUtils]: 14: Hoare triple {216#false} assume !false; {216#false} is VALID [2018-11-23 12:53:25,743 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:25,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:25,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:53:25,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 12:53:25,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:25,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:53:25,804 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:25,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:53:25,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:53:25,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:53:25,805 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 4 states. [2018-11-23 12:53:26,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:26,308 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 12:53:26,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:53:26,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 12:53:26,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:26,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:53:26,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-23 12:53:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:53:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-23 12:53:26,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 25 transitions. [2018-11-23 12:53:26,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:26,387 INFO L225 Difference]: With dead ends: 24 [2018-11-23 12:53:26,390 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 12:53:26,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:53:26,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 12:53:26,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2018-11-23 12:53:26,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:26,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 19 states. [2018-11-23 12:53:26,403 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 19 states. [2018-11-23 12:53:26,403 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 19 states. [2018-11-23 12:53:26,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:26,405 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 12:53:26,405 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 12:53:26,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:26,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:26,406 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 22 states. [2018-11-23 12:53:26,406 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 22 states. [2018-11-23 12:53:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:26,409 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 12:53:26,409 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 12:53:26,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:26,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:26,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:26,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:26,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:53:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 12:53:26,412 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2018-11-23 12:53:26,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:26,412 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 12:53:26,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:53:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 12:53:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:53:26,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:26,417 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:26,417 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:26,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:26,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1489440925, now seen corresponding path program 1 times [2018-11-23 12:53:26,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:26,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:26,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:26,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:26,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:26,606 INFO L256 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2018-11-23 12:53:26,606 INFO L273 TraceCheckUtils]: 1: Hoare triple {322#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {322#true} is VALID [2018-11-23 12:53:26,606 INFO L273 TraceCheckUtils]: 2: Hoare triple {322#true} assume true; {322#true} is VALID [2018-11-23 12:53:26,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {322#true} {322#true} #55#return; {322#true} is VALID [2018-11-23 12:53:26,607 INFO L256 TraceCheckUtils]: 4: Hoare triple {322#true} call #t~ret4 := main(); {322#true} is VALID [2018-11-23 12:53:26,607 INFO L273 TraceCheckUtils]: 5: Hoare triple {322#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := 0, 0; {324#(and (= 0 main_~p~0.base) (= 0 main_~p~0.offset))} is VALID [2018-11-23 12:53:26,608 INFO L273 TraceCheckUtils]: 6: Hoare triple {324#(and (= 0 main_~p~0.base) (= 0 main_~p~0.offset))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {324#(and (= 0 main_~p~0.base) (= 0 main_~p~0.offset))} is VALID [2018-11-23 12:53:26,612 INFO L273 TraceCheckUtils]: 7: Hoare triple {324#(and (= 0 main_~p~0.base) (= 0 main_~p~0.offset))} assume !!(0 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {324#(and (= 0 main_~p~0.base) (= 0 main_~p~0.offset))} is VALID [2018-11-23 12:53:26,612 INFO L273 TraceCheckUtils]: 8: Hoare triple {324#(and (= 0 main_~p~0.base) (= 0 main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {324#(and (= 0 main_~p~0.base) (= 0 main_~p~0.offset))} is VALID [2018-11-23 12:53:26,614 INFO L273 TraceCheckUtils]: 9: Hoare triple {324#(and (= 0 main_~p~0.base) (= 0 main_~p~0.offset))} call write~int(1, ~t~0.base, ~t~0.offset, 4);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, 4 + ~t~0.offset, 4);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {325#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:53:26,614 INFO L273 TraceCheckUtils]: 10: Hoare triple {325#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {325#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:53:26,616 INFO L273 TraceCheckUtils]: 11: Hoare triple {325#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(0 != #t~nondet0);havoc #t~nondet0; {325#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:53:26,617 INFO L273 TraceCheckUtils]: 12: Hoare triple {325#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem2 := read~int(~p~0.base, ~p~0.offset, 4); {325#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:53:26,618 INFO L273 TraceCheckUtils]: 13: Hoare triple {325#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(1 != #t~mem2);havoc #t~mem2; {325#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:53:26,619 INFO L273 TraceCheckUtils]: 14: Hoare triple {325#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {324#(and (= 0 main_~p~0.base) (= 0 main_~p~0.offset))} is VALID [2018-11-23 12:53:26,625 INFO L273 TraceCheckUtils]: 15: Hoare triple {324#(and (= 0 main_~p~0.base) (= 0 main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem2 := read~int(~p~0.base, ~p~0.offset, 4); {323#false} is VALID [2018-11-23 12:53:26,625 INFO L273 TraceCheckUtils]: 16: Hoare triple {323#false} assume 1 != #t~mem2;havoc #t~mem2; {323#false} is VALID [2018-11-23 12:53:26,625 INFO L273 TraceCheckUtils]: 17: Hoare triple {323#false} assume !false; {323#false} is VALID [2018-11-23 12:53:26,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:26,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:53:26,628 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:26,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:26,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:53:26,955 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 13 treesize of output 10 [2018-11-23 12:53:26,997 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 10 treesize of output 9 [2018-11-23 12:53:27,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:27,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:27,143 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 13 treesize of output 10 [2018-11-23 12:53:27,148 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 10 treesize of output 9 [2018-11-23 12:53:27,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:27,157 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:27,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:27,182 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-11-23 12:53:27,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 12:53:27,364 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:27,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:27,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:27,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 12:53:27,398 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:27,403 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:27,404 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:27,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:27,408 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 12:53:27,413 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:27,413 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, v_main_~p~0.base_9, |#memory_$Pointer$.base|]. (let ((.cse1 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_9) 4)) (.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_9) 4))) (and (= 0 .cse0) (= .cse1 main_~p~0.offset) (= .cse1 0) (= .cse0 main_~p~0.base))) [2018-11-23 12:53:27,414 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~p~0.base) (= main_~p~0.offset 0)) [2018-11-23 12:53:27,422 INFO L256 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2018-11-23 12:53:27,422 INFO L273 TraceCheckUtils]: 1: Hoare triple {322#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {322#true} is VALID [2018-11-23 12:53:27,423 INFO L273 TraceCheckUtils]: 2: Hoare triple {322#true} assume true; {322#true} is VALID [2018-11-23 12:53:27,423 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {322#true} {322#true} #55#return; {322#true} is VALID [2018-11-23 12:53:27,423 INFO L256 TraceCheckUtils]: 4: Hoare triple {322#true} call #t~ret4 := main(); {322#true} is VALID [2018-11-23 12:53:27,424 INFO L273 TraceCheckUtils]: 5: Hoare triple {322#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := 0, 0; {324#(and (= 0 main_~p~0.base) (= 0 main_~p~0.offset))} is VALID [2018-11-23 12:53:27,425 INFO L273 TraceCheckUtils]: 6: Hoare triple {324#(and (= 0 main_~p~0.base) (= 0 main_~p~0.offset))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {324#(and (= 0 main_~p~0.base) (= 0 main_~p~0.offset))} is VALID [2018-11-23 12:53:27,425 INFO L273 TraceCheckUtils]: 7: Hoare triple {324#(and (= 0 main_~p~0.base) (= 0 main_~p~0.offset))} assume !!(0 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {350#(and (= 0 main_~p~0.base) (= 0 main_~p~0.offset) (= main_~t~0.offset 0))} is VALID [2018-11-23 12:53:27,427 INFO L273 TraceCheckUtils]: 8: Hoare triple {350#(and (= 0 main_~p~0.base) (= 0 main_~p~0.offset) (= main_~t~0.offset 0))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {350#(and (= 0 main_~p~0.base) (= 0 main_~p~0.offset) (= main_~t~0.offset 0))} is VALID [2018-11-23 12:53:27,430 INFO L273 TraceCheckUtils]: 9: Hoare triple {350#(and (= 0 main_~p~0.base) (= 0 main_~p~0.offset) (= main_~t~0.offset 0))} call write~int(1, ~t~0.base, ~t~0.offset, 4);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, 4 + ~t~0.offset, 4);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {357#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:53:27,431 INFO L273 TraceCheckUtils]: 10: Hoare triple {357#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {357#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:53:27,432 INFO L273 TraceCheckUtils]: 11: Hoare triple {357#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(0 != #t~nondet0);havoc #t~nondet0; {357#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:53:27,433 INFO L273 TraceCheckUtils]: 12: Hoare triple {357#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem2 := read~int(~p~0.base, ~p~0.offset, 4); {357#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:53:27,434 INFO L273 TraceCheckUtils]: 13: Hoare triple {357#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(1 != #t~mem2);havoc #t~mem2; {357#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:53:27,436 INFO L273 TraceCheckUtils]: 14: Hoare triple {357#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {324#(and (= 0 main_~p~0.base) (= 0 main_~p~0.offset))} is VALID [2018-11-23 12:53:27,437 INFO L273 TraceCheckUtils]: 15: Hoare triple {324#(and (= 0 main_~p~0.base) (= 0 main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem2 := read~int(~p~0.base, ~p~0.offset, 4); {323#false} is VALID [2018-11-23 12:53:27,437 INFO L273 TraceCheckUtils]: 16: Hoare triple {323#false} assume 1 != #t~mem2;havoc #t~mem2; {323#false} is VALID [2018-11-23 12:53:27,437 INFO L273 TraceCheckUtils]: 17: Hoare triple {323#false} assume !false; {323#false} is VALID [2018-11-23 12:53:27,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:27,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:53:27,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 6 [2018-11-23 12:53:27,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 12:53:27,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:27,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:53:27,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:27,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:53:27,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:53:27,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:53:27,559 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 6 states. [2018-11-23 12:53:27,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:27,752 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 12:53:27,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:53:27,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 12:53:27,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:27,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:53:27,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-23 12:53:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:53:27,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-23 12:53:27,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2018-11-23 12:53:27,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:27,862 INFO L225 Difference]: With dead ends: 34 [2018-11-23 12:53:27,862 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 12:53:27,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:53:27,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 12:53:27,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-23 12:53:27,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:27,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 23 states. [2018-11-23 12:53:27,878 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 23 states. [2018-11-23 12:53:27,878 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 23 states. [2018-11-23 12:53:27,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:27,880 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 12:53:27,881 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 12:53:27,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:27,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:27,881 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 25 states. [2018-11-23 12:53:27,882 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 25 states. [2018-11-23 12:53:27,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:27,884 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 12:53:27,884 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 12:53:27,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:27,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:27,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:27,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:27,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:53:27,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 12:53:27,887 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2018-11-23 12:53:27,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:27,887 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 12:53:27,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:53:27,888 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 12:53:27,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:53:27,888 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:27,889 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:27,889 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:27,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:27,889 INFO L82 PathProgramCache]: Analyzing trace with hash 548777092, now seen corresponding path program 2 times [2018-11-23 12:53:27,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:27,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:27,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:27,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:27,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:28,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {502#true} call ULTIMATE.init(); {502#true} is VALID [2018-11-23 12:53:28,420 INFO L273 TraceCheckUtils]: 1: Hoare triple {502#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {502#true} is VALID [2018-11-23 12:53:28,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {502#true} assume true; {502#true} is VALID [2018-11-23 12:53:28,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {502#true} {502#true} #55#return; {502#true} is VALID [2018-11-23 12:53:28,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {502#true} call #t~ret4 := main(); {502#true} is VALID [2018-11-23 12:53:28,422 INFO L273 TraceCheckUtils]: 5: Hoare triple {502#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := 0, 0; {502#true} is VALID [2018-11-23 12:53:28,422 INFO L273 TraceCheckUtils]: 6: Hoare triple {502#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {502#true} is VALID [2018-11-23 12:53:28,424 INFO L273 TraceCheckUtils]: 7: Hoare triple {502#true} assume !!(0 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {504#(and (= main_~t~0.offset 0) (= (select |#valid| main_~t~0.base) 1))} is VALID [2018-11-23 12:53:28,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {504#(and (= main_~t~0.offset 0) (= (select |#valid| main_~t~0.base) 1))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {504#(and (= main_~t~0.offset 0) (= (select |#valid| main_~t~0.base) 1))} is VALID [2018-11-23 12:53:28,425 INFO L273 TraceCheckUtils]: 9: Hoare triple {504#(and (= main_~t~0.offset 0) (= (select |#valid| main_~t~0.base) 1))} call write~int(1, ~t~0.base, ~t~0.offset, 4);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, 4 + ~t~0.offset, 4);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {505#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset) (= (select |#valid| main_~p~0.base) 1))} is VALID [2018-11-23 12:53:28,427 INFO L273 TraceCheckUtils]: 10: Hoare triple {505#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset) (= (select |#valid| main_~p~0.base) 1))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {505#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset) (= (select |#valid| main_~p~0.base) 1))} is VALID [2018-11-23 12:53:28,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {505#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset) (= (select |#valid| main_~p~0.base) 1))} assume !!(0 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {506#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset 0))} is VALID [2018-11-23 12:53:28,436 INFO L273 TraceCheckUtils]: 12: Hoare triple {506#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset 0))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {506#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset 0))} is VALID [2018-11-23 12:53:28,438 INFO L273 TraceCheckUtils]: 13: Hoare triple {506#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset 0))} call write~int(1, ~t~0.base, ~t~0.offset, 4);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, 4 + ~t~0.offset, 4);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {507#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0)))} is VALID [2018-11-23 12:53:28,439 INFO L273 TraceCheckUtils]: 14: Hoare triple {507#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {507#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0)))} is VALID [2018-11-23 12:53:28,440 INFO L273 TraceCheckUtils]: 15: Hoare triple {507#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0)))} assume !(0 != #t~nondet0);havoc #t~nondet0; {507#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0)))} is VALID [2018-11-23 12:53:28,441 INFO L273 TraceCheckUtils]: 16: Hoare triple {507#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0)))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem2 := read~int(~p~0.base, ~p~0.offset, 4); {507#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0)))} is VALID [2018-11-23 12:53:28,442 INFO L273 TraceCheckUtils]: 17: Hoare triple {507#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0)))} assume !(1 != #t~mem2);havoc #t~mem2; {507#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0)))} is VALID [2018-11-23 12:53:28,443 INFO L273 TraceCheckUtils]: 18: Hoare triple {507#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0)))} call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {508#(and (= main_~p~0.offset 0) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 12:53:28,444 INFO L273 TraceCheckUtils]: 19: Hoare triple {508#(and (= main_~p~0.offset 0) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem2 := read~int(~p~0.base, ~p~0.offset, 4); {509#(= |main_#t~mem2| 1)} is VALID [2018-11-23 12:53:28,445 INFO L273 TraceCheckUtils]: 20: Hoare triple {509#(= |main_#t~mem2| 1)} assume 1 != #t~mem2;havoc #t~mem2; {503#false} is VALID [2018-11-23 12:53:28,445 INFO L273 TraceCheckUtils]: 21: Hoare triple {503#false} assume !false; {503#false} is VALID [2018-11-23 12:53:28,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:28,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:53:28,449 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:28,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:53:28,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:53:28,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:53:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:28,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:53:28,542 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:28,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:28,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:28,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 12:53:28,558 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:28,558 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_9|]. (and (= |#valid| (store |v_#valid_9| main_~t~0.base 1)) (= main_~t~0.offset 0)) [2018-11-23 12:53:28,558 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~t~0.offset 0) (= (select |#valid| main_~t~0.base) 1)) [2018-11-23 12:53:28,590 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 22 treesize of output 19 [2018-11-23 12:53:28,605 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-23 12:53:28,617 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:53:28,619 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:28,621 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:28,630 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:28,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:28,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:28,645 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:31, output treesize:16 [2018-11-23 12:53:28,687 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:53:28,689 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:53:28,691 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:28,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:28,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:28,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-11-23 12:53:28,743 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 13 treesize of output 10 [2018-11-23 12:53:28,749 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 10 treesize of output 9 [2018-11-23 12:53:28,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:28,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:28,788 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 13 treesize of output 10 [2018-11-23 12:53:28,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-11-23 12:53:28,806 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:28,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:28,842 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 30 treesize of output 37 [2018-11-23 12:53:28,849 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-23 12:53:28,860 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:53:28,864 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:28,870 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:28,877 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:28,889 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:28,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:28,907 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:63, output treesize:43 [2018-11-23 12:53:28,913 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:28,914 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_9|, v_main_~p~0.base_10, |v_#memory_$Pointer$.offset_9|, |v_#memory_int_8|]. (let ((.cse0 (+ main_~p~0.offset 4))) (and (= (store |v_#memory_$Pointer$.offset_9| main_~p~0.base (store (select |v_#memory_$Pointer$.offset_9| main_~p~0.base) .cse0 0)) |#memory_$Pointer$.offset|) (= 1 (select (select |v_#memory_int_8| v_main_~p~0.base_10) 0)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_9| main_~p~0.base (store (select |v_#memory_$Pointer$.base_9| main_~p~0.base) .cse0 v_main_~p~0.base_10))) (= (store |v_#memory_int_8| main_~p~0.base (store (store (select |v_#memory_int_8| main_~p~0.base) main_~p~0.offset 1) .cse0 (select (select |#memory_int| main_~p~0.base) .cse0))) |#memory_int|) (= main_~p~0.offset 0) (not (= v_main_~p~0.base_10 main_~p~0.base)))) [2018-11-23 12:53:28,914 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (+ main_~p~0.offset 4))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~p~0.base) .cse1))) (and (= (select (select |#memory_int| .cse0) 0) 1) (not (= main_~p~0.base .cse0)) (= main_~p~0.offset 0) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) .cse1))))) [2018-11-23 12:53:29,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 12:53:29,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 12 [2018-11-23 12:53:29,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:29,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:29,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-11-23 12:53:29,447 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:29,450 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:29,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:29,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:53:29,505 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:22 [2018-11-23 12:53:29,519 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:29,519 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_11, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_11) 4)) (.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_11) 4))) (and (not (= v_main_~p~0.base_11 .cse0)) (= 1 (select (select |#memory_int| .cse0) 0)) (= main_~p~0.offset .cse1) (= 0 .cse1) (= .cse0 main_~p~0.base) (= 1 (select (select |#memory_int| v_main_~p~0.base_11) 0)))) [2018-11-23 12:53:29,519 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_11]. (and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (not (= v_main_~p~0.base_11 main_~p~0.base)) (= main_~p~0.offset 0) (= 1 (select (select |#memory_int| v_main_~p~0.base_11) 0))) [2018-11-23 12:53:29,712 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:29,721 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:29,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:29,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:29,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:29,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-11-23 12:53:29,736 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:29,736 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, v_main_~p~0.base_11]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) 0))) (and (= 1 .cse0) (not (= v_main_~p~0.base_11 main_~p~0.base)) (= |main_#t~mem2| .cse0) (= 1 (select (select |#memory_int| v_main_~p~0.base_11) 0)))) [2018-11-23 12:53:29,736 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 |main_#t~mem2|) [2018-11-23 12:53:29,745 INFO L256 TraceCheckUtils]: 0: Hoare triple {502#true} call ULTIMATE.init(); {502#true} is VALID [2018-11-23 12:53:29,746 INFO L273 TraceCheckUtils]: 1: Hoare triple {502#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {502#true} is VALID [2018-11-23 12:53:29,746 INFO L273 TraceCheckUtils]: 2: Hoare triple {502#true} assume true; {502#true} is VALID [2018-11-23 12:53:29,746 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {502#true} {502#true} #55#return; {502#true} is VALID [2018-11-23 12:53:29,747 INFO L256 TraceCheckUtils]: 4: Hoare triple {502#true} call #t~ret4 := main(); {502#true} is VALID [2018-11-23 12:53:29,747 INFO L273 TraceCheckUtils]: 5: Hoare triple {502#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := 0, 0; {502#true} is VALID [2018-11-23 12:53:29,747 INFO L273 TraceCheckUtils]: 6: Hoare triple {502#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {502#true} is VALID [2018-11-23 12:53:29,748 INFO L273 TraceCheckUtils]: 7: Hoare triple {502#true} assume !!(0 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {504#(and (= main_~t~0.offset 0) (= (select |#valid| main_~t~0.base) 1))} is VALID [2018-11-23 12:53:29,749 INFO L273 TraceCheckUtils]: 8: Hoare triple {504#(and (= main_~t~0.offset 0) (= (select |#valid| main_~t~0.base) 1))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {504#(and (= main_~t~0.offset 0) (= (select |#valid| main_~t~0.base) 1))} is VALID [2018-11-23 12:53:29,750 INFO L273 TraceCheckUtils]: 9: Hoare triple {504#(and (= main_~t~0.offset 0) (= (select |#valid| main_~t~0.base) 1))} call write~int(1, ~t~0.base, ~t~0.offset, 4);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, 4 + ~t~0.offset, 4);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {505#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset) (= (select |#valid| main_~p~0.base) 1))} is VALID [2018-11-23 12:53:29,751 INFO L273 TraceCheckUtils]: 10: Hoare triple {505#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset) (= (select |#valid| main_~p~0.base) 1))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {505#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset) (= (select |#valid| main_~p~0.base) 1))} is VALID [2018-11-23 12:53:29,757 INFO L273 TraceCheckUtils]: 11: Hoare triple {505#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset) (= (select |#valid| main_~p~0.base) 1))} assume !!(0 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {506#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset 0))} is VALID [2018-11-23 12:53:29,758 INFO L273 TraceCheckUtils]: 12: Hoare triple {506#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset 0))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {506#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset 0))} is VALID [2018-11-23 12:53:29,759 INFO L273 TraceCheckUtils]: 13: Hoare triple {506#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset 0))} call write~int(1, ~t~0.base, ~t~0.offset, 4);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, 4 + ~t~0.offset, 4);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {552#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0) 1) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:53:29,760 INFO L273 TraceCheckUtils]: 14: Hoare triple {552#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0) 1) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {552#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0) 1) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:53:29,762 INFO L273 TraceCheckUtils]: 15: Hoare triple {552#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0) 1) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(0 != #t~nondet0);havoc #t~nondet0; {552#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0) 1) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:53:29,763 INFO L273 TraceCheckUtils]: 16: Hoare triple {552#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0) 1) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem2 := read~int(~p~0.base, ~p~0.offset, 4); {552#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0) 1) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:53:29,765 INFO L273 TraceCheckUtils]: 17: Hoare triple {552#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0) 1) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(1 != #t~mem2);havoc #t~mem2; {552#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0) 1) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:53:29,766 INFO L273 TraceCheckUtils]: 18: Hoare triple {552#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 0) 1) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {568#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (exists ((v_main_~p~0.base_11 Int)) (and (not (= v_main_~p~0.base_11 main_~p~0.base)) (= 1 (select (select |#memory_int| v_main_~p~0.base_11) 0)))) (= main_~p~0.offset 0))} is VALID [2018-11-23 12:53:29,768 INFO L273 TraceCheckUtils]: 19: Hoare triple {568#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (exists ((v_main_~p~0.base_11 Int)) (and (not (= v_main_~p~0.base_11 main_~p~0.base)) (= 1 (select (select |#memory_int| v_main_~p~0.base_11) 0)))) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem2 := read~int(~p~0.base, ~p~0.offset, 4); {509#(= |main_#t~mem2| 1)} is VALID [2018-11-23 12:53:29,768 INFO L273 TraceCheckUtils]: 20: Hoare triple {509#(= |main_#t~mem2| 1)} assume 1 != #t~mem2;havoc #t~mem2; {503#false} is VALID [2018-11-23 12:53:29,769 INFO L273 TraceCheckUtils]: 21: Hoare triple {503#false} assume !false; {503#false} is VALID [2018-11-23 12:53:29,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:29,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:53:29,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-23 12:53:29,794 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-23 12:53:29,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:29,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:53:29,873 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:29,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:53:29,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:53:29,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:53:29,874 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 10 states. [2018-11-23 12:53:30,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:30,766 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 12:53:30,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:53:30,767 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-23 12:53:30,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:53:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2018-11-23 12:53:30,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:53:30,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2018-11-23 12:53:30,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 32 transitions. [2018-11-23 12:53:30,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:30,844 INFO L225 Difference]: With dead ends: 31 [2018-11-23 12:53:30,844 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:53:30,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:53:30,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:53:30,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-11-23 12:53:30,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:30,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 26 states. [2018-11-23 12:53:30,879 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 26 states. [2018-11-23 12:53:30,879 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 26 states. [2018-11-23 12:53:30,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:30,881 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 12:53:30,882 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 12:53:30,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:30,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:30,882 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 29 states. [2018-11-23 12:53:30,883 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 29 states. [2018-11-23 12:53:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:30,884 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 12:53:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 12:53:30,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:30,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:30,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:30,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:30,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:53:30,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-23 12:53:30,887 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2018-11-23 12:53:30,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:30,888 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-23 12:53:30,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:53:30,888 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 12:53:30,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:53:30,889 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:30,889 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:30,889 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:30,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:30,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1977624581, now seen corresponding path program 3 times [2018-11-23 12:53:30,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:30,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:30,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:30,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:53:30,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:31,171 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:31,176 INFO L168 Benchmark]: Toolchain (without parser) took 8626.66 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.0 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -257.0 MB). Peak memory consumption was 476.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:31,178 INFO L168 Benchmark]: CDTParser took 0.19 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:31,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 614.41 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:31,179 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.47 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -812.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:31,180 INFO L168 Benchmark]: Boogie Preprocessor took 32.96 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:31,180 INFO L168 Benchmark]: RCFGBuilder took 582.02 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: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:31,181 INFO L168 Benchmark]: TraceAbstraction took 7280.97 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 499.9 MB). Peak memory consumption was 499.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:31,185 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.19 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 614.41 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 111.47 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -812.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.96 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 582.02 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: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7280.97 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 499.9 MB). Peak memory consumption was 499.9 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...