/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-lopstr16/flag_loopdep.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:48:42,694 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:48:42,696 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:48:42,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:48:42,710 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:48:42,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:48:42,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:48:42,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:48:42,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:48:42,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:48:42,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:48:42,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:48:42,722 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:48:42,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:48:42,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:48:42,725 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:48:42,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:48:42,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:48:42,728 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:48:42,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:48:42,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:48:42,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:48:42,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:48:42,739 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:48:42,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:48:42,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:48:42,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:48:42,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:48:42,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:48:42,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:48:42,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:48:42,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:48:42,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:48:42,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:48:42,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:48:42,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:48:42,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:48:42,757 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:48:42,757 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:48:42,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:48:42,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:48:42,761 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:48:42,783 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:48:42,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:48:42,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:48:42,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:48:42,787 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:48:42,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:48:42,787 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:48:42,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:48:42,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:48:42,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:48:42,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:48:42,789 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:48:42,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:48:42,790 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:48:42,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:48:42,790 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:48:42,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:48:42,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:48:42,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:48:42,791 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:48:42,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:48:42,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:48:42,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:48:42,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:48:42,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:48:42,792 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:48:42,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:48:42,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:48:42,793 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:48:42,793 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:48:43,079 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:48:43,101 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:48:43,106 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:48:43,107 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:48:43,108 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:48:43,108 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-lopstr16/flag_loopdep.i [2020-07-17 22:48:43,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33ba8d9f4/b498204d2445464488b7b909bb81e34f/FLAG8ba104f9f [2020-07-17 22:48:43,692 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:48:43,693 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-lopstr16/flag_loopdep.i [2020-07-17 22:48:43,701 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33ba8d9f4/b498204d2445464488b7b909bb81e34f/FLAG8ba104f9f [2020-07-17 22:48:44,070 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33ba8d9f4/b498204d2445464488b7b909bb81e34f [2020-07-17 22:48:44,081 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:48:44,084 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:48:44,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:48:44,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:48:44,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:48:44,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:48:44" (1/1) ... [2020-07-17 22:48:44,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@487e0097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:44, skipping insertion in model container [2020-07-17 22:48:44,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:48:44" (1/1) ... [2020-07-17 22:48:44,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:48:44,125 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:48:44,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:48:44,345 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:48:44,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:48:44,383 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:48:44,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:44 WrapperNode [2020-07-17 22:48:44,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:48:44,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:48:44,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:48:44,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:48:44,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:44" (1/1) ... [2020-07-17 22:48:44,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:44" (1/1) ... [2020-07-17 22:48:44,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:44" (1/1) ... [2020-07-17 22:48:44,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:44" (1/1) ... [2020-07-17 22:48:44,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:44" (1/1) ... [2020-07-17 22:48:44,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:44" (1/1) ... [2020-07-17 22:48:44,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:44" (1/1) ... [2020-07-17 22:48:44,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:48:44,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:48:44,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:48:44,513 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:48:44,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:44" (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 [2020-07-17 22:48:44,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:48:44,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:48:44,576 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:48:44,576 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2020-07-17 22:48:44,576 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:48:44,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:48:44,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:48:44,577 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:48:44,577 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_pointer [2020-07-17 22:48:44,577 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-07-17 22:48:44,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:48:44,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-17 22:48:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:48:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:48:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-17 22:48:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:48:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:48:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:48:44,995 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:48:44,996 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-17 22:48:45,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:48:45 BoogieIcfgContainer [2020-07-17 22:48:45,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:48:45,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:48:45,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:48:45,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:48:45,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:48:44" (1/3) ... [2020-07-17 22:48:45,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9a1a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:48:45, skipping insertion in model container [2020-07-17 22:48:45,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:44" (2/3) ... [2020-07-17 22:48:45,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9a1a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:48:45, skipping insertion in model container [2020-07-17 22:48:45,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:48:45" (3/3) ... [2020-07-17 22:48:45,010 INFO L109 eAbstractionObserver]: Analyzing ICFG flag_loopdep.i [2020-07-17 22:48:45,020 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:48:45,027 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:48:45,040 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:48:45,062 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:48:45,062 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:48:45,062 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:48:45,062 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:48:45,062 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:48:45,063 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:48:45,063 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:48:45,063 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:48:45,080 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-17 22:48:45,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:48:45,085 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:45,086 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:48:45,087 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:45,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:45,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1059974619, now seen corresponding path program 1 times [2020-07-17 22:48:45,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:45,103 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768222003] [2020-07-17 22:48:45,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:45,359 INFO L280 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {36#true} is VALID [2020-07-17 22:48:45,360 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-17 22:48:45,360 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #80#return; {36#true} is VALID [2020-07-17 22:48:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:45,416 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {36#true} is VALID [2020-07-17 22:48:45,417 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume !(~i~0 < ~size); {36#true} is VALID [2020-07-17 22:48:45,418 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-17 22:48:45,418 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #76#return; {36#true} is VALID [2020-07-17 22:48:45,420 INFO L263 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {45#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:48:45,421 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {36#true} is VALID [2020-07-17 22:48:45,421 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-17 22:48:45,422 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #80#return; {36#true} is VALID [2020-07-17 22:48:45,422 INFO L263 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret6 := main(); {36#true} is VALID [2020-07-17 22:48:45,423 INFO L280 TraceCheckUtils]: 5: Hoare triple {36#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {36#true} is VALID [2020-07-17 22:48:45,426 INFO L263 TraceCheckUtils]: 6: Hoare triple {36#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {46#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:48:45,426 INFO L280 TraceCheckUtils]: 7: Hoare triple {46#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {36#true} is VALID [2020-07-17 22:48:45,427 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#true} assume !(~i~0 < ~size); {36#true} is VALID [2020-07-17 22:48:45,427 INFO L280 TraceCheckUtils]: 9: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-17 22:48:45,434 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {36#true} {36#true} #76#return; {36#true} is VALID [2020-07-17 22:48:45,434 INFO L280 TraceCheckUtils]: 11: Hoare triple {36#true} ~i~1 := 0; {36#true} is VALID [2020-07-17 22:48:45,437 INFO L280 TraceCheckUtils]: 12: Hoare triple {36#true} assume !true; {37#false} is VALID [2020-07-17 22:48:45,437 INFO L280 TraceCheckUtils]: 13: Hoare triple {37#false} ~i~1 := 0; {37#false} is VALID [2020-07-17 22:48:45,438 INFO L280 TraceCheckUtils]: 14: Hoare triple {37#false} assume !!(~i~1 < 1000000); {37#false} is VALID [2020-07-17 22:48:45,439 INFO L280 TraceCheckUtils]: 15: Hoare triple {37#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {37#false} is VALID [2020-07-17 22:48:45,439 INFO L263 TraceCheckUtils]: 16: Hoare triple {37#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {37#false} is VALID [2020-07-17 22:48:45,440 INFO L280 TraceCheckUtils]: 17: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2020-07-17 22:48:45,440 INFO L280 TraceCheckUtils]: 18: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2020-07-17 22:48:45,440 INFO L280 TraceCheckUtils]: 19: Hoare triple {37#false} assume !false; {37#false} is VALID [2020-07-17 22:48:45,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:48:45,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768222003] [2020-07-17 22:48:45,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:48:45,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:48:45,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724427595] [2020-07-17 22:48:45,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-07-17 22:48:45,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:45,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:48:45,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:45,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:48:45,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:45,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:48:45,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:48:45,524 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 4 states. [2020-07-17 22:48:45,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:45,868 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2020-07-17 22:48:45,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:48:45,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-07-17 22:48:45,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:48:45,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2020-07-17 22:48:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:48:45,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2020-07-17 22:48:45,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2020-07-17 22:48:46,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:46,098 INFO L225 Difference]: With dead ends: 59 [2020-07-17 22:48:46,099 INFO L226 Difference]: Without dead ends: 31 [2020-07-17 22:48:46,106 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:48:46,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-17 22:48:46,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2020-07-17 22:48:46,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:46,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 28 states. [2020-07-17 22:48:46,169 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 28 states. [2020-07-17 22:48:46,170 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 28 states. [2020-07-17 22:48:46,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:46,176 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2020-07-17 22:48:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2020-07-17 22:48:46,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:46,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:46,179 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 31 states. [2020-07-17 22:48:46,179 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 31 states. [2020-07-17 22:48:46,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:46,183 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2020-07-17 22:48:46,183 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2020-07-17 22:48:46,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:46,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:46,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:46,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:46,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-17 22:48:46,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-17 22:48:46,194 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2020-07-17 22:48:46,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:46,195 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-17 22:48:46,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:48:46,195 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-17 22:48:46,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:48:46,197 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:46,201 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:48:46,202 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:48:46,202 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:46,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:46,211 INFO L82 PathProgramCache]: Analyzing trace with hash -931069882, now seen corresponding path program 1 times [2020-07-17 22:48:46,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:46,211 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746208235] [2020-07-17 22:48:46,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:46,301 INFO L280 TraceCheckUtils]: 0: Hoare triple {237#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {228#true} is VALID [2020-07-17 22:48:46,301 INFO L280 TraceCheckUtils]: 1: Hoare triple {228#true} assume true; {228#true} is VALID [2020-07-17 22:48:46,302 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {228#true} {228#true} #80#return; {228#true} is VALID [2020-07-17 22:48:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:46,422 INFO L280 TraceCheckUtils]: 0: Hoare triple {238#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {239#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:46,423 INFO L280 TraceCheckUtils]: 1: Hoare triple {239#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {240#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:46,425 INFO L280 TraceCheckUtils]: 2: Hoare triple {240#(not (= |init_#in~size| 1000000))} assume true; {240#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:46,426 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {240#(not (= |init_#in~size| 1000000))} {228#true} #76#return; {229#false} is VALID [2020-07-17 22:48:46,432 INFO L263 TraceCheckUtils]: 0: Hoare triple {228#true} call ULTIMATE.init(); {237#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:48:46,433 INFO L280 TraceCheckUtils]: 1: Hoare triple {237#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {228#true} is VALID [2020-07-17 22:48:46,433 INFO L280 TraceCheckUtils]: 2: Hoare triple {228#true} assume true; {228#true} is VALID [2020-07-17 22:48:46,433 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} #80#return; {228#true} is VALID [2020-07-17 22:48:46,434 INFO L263 TraceCheckUtils]: 4: Hoare triple {228#true} call #t~ret6 := main(); {228#true} is VALID [2020-07-17 22:48:46,434 INFO L280 TraceCheckUtils]: 5: Hoare triple {228#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {228#true} is VALID [2020-07-17 22:48:46,436 INFO L263 TraceCheckUtils]: 6: Hoare triple {228#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {238#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:48:46,437 INFO L280 TraceCheckUtils]: 7: Hoare triple {238#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {239#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:46,438 INFO L280 TraceCheckUtils]: 8: Hoare triple {239#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {240#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:46,440 INFO L280 TraceCheckUtils]: 9: Hoare triple {240#(not (= |init_#in~size| 1000000))} assume true; {240#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:46,442 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {240#(not (= |init_#in~size| 1000000))} {228#true} #76#return; {229#false} is VALID [2020-07-17 22:48:46,442 INFO L280 TraceCheckUtils]: 11: Hoare triple {229#false} ~i~1 := 0; {229#false} is VALID [2020-07-17 22:48:46,443 INFO L280 TraceCheckUtils]: 12: Hoare triple {229#false} assume !(~i~1 < 1000000); {229#false} is VALID [2020-07-17 22:48:46,443 INFO L280 TraceCheckUtils]: 13: Hoare triple {229#false} ~i~1 := 0; {229#false} is VALID [2020-07-17 22:48:46,443 INFO L280 TraceCheckUtils]: 14: Hoare triple {229#false} assume !!(~i~1 < 1000000); {229#false} is VALID [2020-07-17 22:48:46,444 INFO L280 TraceCheckUtils]: 15: Hoare triple {229#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {229#false} is VALID [2020-07-17 22:48:46,444 INFO L263 TraceCheckUtils]: 16: Hoare triple {229#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {229#false} is VALID [2020-07-17 22:48:46,448 INFO L280 TraceCheckUtils]: 17: Hoare triple {229#false} ~cond := #in~cond; {229#false} is VALID [2020-07-17 22:48:46,449 INFO L280 TraceCheckUtils]: 18: Hoare triple {229#false} assume 0 == ~cond; {229#false} is VALID [2020-07-17 22:48:46,449 INFO L280 TraceCheckUtils]: 19: Hoare triple {229#false} assume !false; {229#false} is VALID [2020-07-17 22:48:46,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:48:46,451 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746208235] [2020-07-17 22:48:46,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:48:46,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:48:46,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110468915] [2020-07-17 22:48:46,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-17 22:48:46,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:46,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:48:46,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:46,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:48:46,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:46,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:48:46,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:48:46,484 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2020-07-17 22:48:46,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:46,948 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2020-07-17 22:48:46,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:48:46,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-17 22:48:46,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:46,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:48:46,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2020-07-17 22:48:46,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:48:46,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2020-07-17 22:48:46,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2020-07-17 22:48:47,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:47,065 INFO L225 Difference]: With dead ends: 48 [2020-07-17 22:48:47,066 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 22:48:47,067 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:48:47,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 22:48:47,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-07-17 22:48:47,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:47,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2020-07-17 22:48:47,099 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2020-07-17 22:48:47,100 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2020-07-17 22:48:47,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:47,104 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-17 22:48:47,105 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-17 22:48:47,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:47,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:47,106 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2020-07-17 22:48:47,106 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2020-07-17 22:48:47,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:47,111 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-17 22:48:47,111 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-17 22:48:47,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:47,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:47,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:47,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:47,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-17 22:48:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2020-07-17 22:48:47,127 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 20 [2020-07-17 22:48:47,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:47,128 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-07-17 22:48:47,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:48:47,128 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-17 22:48:47,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:48:47,131 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:47,132 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:48:47,132 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:48:47,132 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:47,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:47,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1782065480, now seen corresponding path program 1 times [2020-07-17 22:48:47,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:47,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042844897] [2020-07-17 22:48:47,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:47,209 INFO L280 TraceCheckUtils]: 0: Hoare triple {426#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {415#true} is VALID [2020-07-17 22:48:47,209 INFO L280 TraceCheckUtils]: 1: Hoare triple {415#true} assume true; {415#true} is VALID [2020-07-17 22:48:47,210 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {415#true} {415#true} #80#return; {415#true} is VALID [2020-07-17 22:48:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:47,357 INFO L280 TraceCheckUtils]: 0: Hoare triple {427#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {428#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:47,359 INFO L280 TraceCheckUtils]: 1: Hoare triple {428#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {428#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:47,360 INFO L280 TraceCheckUtils]: 2: Hoare triple {428#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {429#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:47,361 INFO L280 TraceCheckUtils]: 3: Hoare triple {429#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {430#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:47,362 INFO L280 TraceCheckUtils]: 4: Hoare triple {430#(not (= |init_#in~size| 1000000))} assume true; {430#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:47,363 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {430#(not (= |init_#in~size| 1000000))} {415#true} #76#return; {416#false} is VALID [2020-07-17 22:48:47,365 INFO L263 TraceCheckUtils]: 0: Hoare triple {415#true} call ULTIMATE.init(); {426#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:48:47,365 INFO L280 TraceCheckUtils]: 1: Hoare triple {426#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {415#true} is VALID [2020-07-17 22:48:47,366 INFO L280 TraceCheckUtils]: 2: Hoare triple {415#true} assume true; {415#true} is VALID [2020-07-17 22:48:47,366 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {415#true} {415#true} #80#return; {415#true} is VALID [2020-07-17 22:48:47,366 INFO L263 TraceCheckUtils]: 4: Hoare triple {415#true} call #t~ret6 := main(); {415#true} is VALID [2020-07-17 22:48:47,366 INFO L280 TraceCheckUtils]: 5: Hoare triple {415#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {415#true} is VALID [2020-07-17 22:48:47,368 INFO L263 TraceCheckUtils]: 6: Hoare triple {415#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {427#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:48:47,369 INFO L280 TraceCheckUtils]: 7: Hoare triple {427#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {428#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:47,370 INFO L280 TraceCheckUtils]: 8: Hoare triple {428#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {428#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:47,372 INFO L280 TraceCheckUtils]: 9: Hoare triple {428#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {429#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:47,373 INFO L280 TraceCheckUtils]: 10: Hoare triple {429#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {430#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:47,374 INFO L280 TraceCheckUtils]: 11: Hoare triple {430#(not (= |init_#in~size| 1000000))} assume true; {430#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:47,375 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {430#(not (= |init_#in~size| 1000000))} {415#true} #76#return; {416#false} is VALID [2020-07-17 22:48:47,375 INFO L280 TraceCheckUtils]: 13: Hoare triple {416#false} ~i~1 := 0; {416#false} is VALID [2020-07-17 22:48:47,376 INFO L280 TraceCheckUtils]: 14: Hoare triple {416#false} assume !(~i~1 < 1000000); {416#false} is VALID [2020-07-17 22:48:47,376 INFO L280 TraceCheckUtils]: 15: Hoare triple {416#false} ~i~1 := 0; {416#false} is VALID [2020-07-17 22:48:47,376 INFO L280 TraceCheckUtils]: 16: Hoare triple {416#false} assume !!(~i~1 < 1000000); {416#false} is VALID [2020-07-17 22:48:47,377 INFO L280 TraceCheckUtils]: 17: Hoare triple {416#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {416#false} is VALID [2020-07-17 22:48:47,377 INFO L263 TraceCheckUtils]: 18: Hoare triple {416#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {416#false} is VALID [2020-07-17 22:48:47,377 INFO L280 TraceCheckUtils]: 19: Hoare triple {416#false} ~cond := #in~cond; {416#false} is VALID [2020-07-17 22:48:47,377 INFO L280 TraceCheckUtils]: 20: Hoare triple {416#false} assume 0 == ~cond; {416#false} is VALID [2020-07-17 22:48:47,378 INFO L280 TraceCheckUtils]: 21: Hoare triple {416#false} assume !false; {416#false} is VALID [2020-07-17 22:48:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:48:47,380 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042844897] [2020-07-17 22:48:47,380 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640574111] [2020-07-17 22:48:47,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:47,445 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-17 22:48:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:47,462 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:47,548 INFO L263 TraceCheckUtils]: 0: Hoare triple {415#true} call ULTIMATE.init(); {415#true} is VALID [2020-07-17 22:48:47,549 INFO L280 TraceCheckUtils]: 1: Hoare triple {415#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {415#true} is VALID [2020-07-17 22:48:47,549 INFO L280 TraceCheckUtils]: 2: Hoare triple {415#true} assume true; {415#true} is VALID [2020-07-17 22:48:47,550 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {415#true} {415#true} #80#return; {415#true} is VALID [2020-07-17 22:48:47,550 INFO L263 TraceCheckUtils]: 4: Hoare triple {415#true} call #t~ret6 := main(); {415#true} is VALID [2020-07-17 22:48:47,550 INFO L280 TraceCheckUtils]: 5: Hoare triple {415#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {415#true} is VALID [2020-07-17 22:48:47,550 INFO L263 TraceCheckUtils]: 6: Hoare triple {415#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {415#true} is VALID [2020-07-17 22:48:47,551 INFO L280 TraceCheckUtils]: 7: Hoare triple {415#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {415#true} is VALID [2020-07-17 22:48:47,551 INFO L280 TraceCheckUtils]: 8: Hoare triple {415#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {415#true} is VALID [2020-07-17 22:48:47,552 INFO L280 TraceCheckUtils]: 9: Hoare triple {415#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {415#true} is VALID [2020-07-17 22:48:47,552 INFO L280 TraceCheckUtils]: 10: Hoare triple {415#true} assume !(~i~0 < ~size); {415#true} is VALID [2020-07-17 22:48:47,553 INFO L280 TraceCheckUtils]: 11: Hoare triple {415#true} assume true; {415#true} is VALID [2020-07-17 22:48:47,553 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {415#true} {415#true} #76#return; {415#true} is VALID [2020-07-17 22:48:47,556 INFO L280 TraceCheckUtils]: 13: Hoare triple {415#true} ~i~1 := 0; {473#(<= main_~i~1 0)} is VALID [2020-07-17 22:48:47,558 INFO L280 TraceCheckUtils]: 14: Hoare triple {473#(<= main_~i~1 0)} assume !(~i~1 < 1000000); {416#false} is VALID [2020-07-17 22:48:47,559 INFO L280 TraceCheckUtils]: 15: Hoare triple {416#false} ~i~1 := 0; {416#false} is VALID [2020-07-17 22:48:47,559 INFO L280 TraceCheckUtils]: 16: Hoare triple {416#false} assume !!(~i~1 < 1000000); {416#false} is VALID [2020-07-17 22:48:47,559 INFO L280 TraceCheckUtils]: 17: Hoare triple {416#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {416#false} is VALID [2020-07-17 22:48:47,560 INFO L263 TraceCheckUtils]: 18: Hoare triple {416#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {416#false} is VALID [2020-07-17 22:48:47,560 INFO L280 TraceCheckUtils]: 19: Hoare triple {416#false} ~cond := #in~cond; {416#false} is VALID [2020-07-17 22:48:47,560 INFO L280 TraceCheckUtils]: 20: Hoare triple {416#false} assume 0 == ~cond; {416#false} is VALID [2020-07-17 22:48:47,560 INFO L280 TraceCheckUtils]: 21: Hoare triple {416#false} assume !false; {416#false} is VALID [2020-07-17 22:48:47,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:48:47,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:48:47,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2020-07-17 22:48:47,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787206503] [2020-07-17 22:48:47,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:48:47,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:47,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:48:47,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:47,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:48:47,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:47,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:48:47,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:48:47,596 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2020-07-17 22:48:47,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:47,712 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2020-07-17 22:48:47,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:48:47,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:48:47,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:47,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:48:47,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2020-07-17 22:48:47,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:48:47,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2020-07-17 22:48:47,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 57 transitions. [2020-07-17 22:48:47,793 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:47,796 INFO L225 Difference]: With dead ends: 49 [2020-07-17 22:48:47,797 INFO L226 Difference]: Without dead ends: 37 [2020-07-17 22:48:47,797 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:48:47,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-17 22:48:47,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2020-07-17 22:48:47,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:47,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 30 states. [2020-07-17 22:48:47,832 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 30 states. [2020-07-17 22:48:47,832 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 30 states. [2020-07-17 22:48:47,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:47,838 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2020-07-17 22:48:47,838 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2020-07-17 22:48:47,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:47,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:47,839 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 37 states. [2020-07-17 22:48:47,839 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 37 states. [2020-07-17 22:48:47,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:47,843 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2020-07-17 22:48:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2020-07-17 22:48:47,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:47,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:47,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:47,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 22:48:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-17 22:48:47,846 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2020-07-17 22:48:47,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:47,846 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-17 22:48:47,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:48:47,847 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-17 22:48:47,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:48:47,847 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:47,847 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:48:48,051 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:48:48,053 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:48,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:48,054 INFO L82 PathProgramCache]: Analyzing trace with hash 413319423, now seen corresponding path program 1 times [2020-07-17 22:48:48,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:48,055 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635526062] [2020-07-17 22:48:48,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:48,131 INFO L280 TraceCheckUtils]: 0: Hoare triple {694#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {681#true} is VALID [2020-07-17 22:48:48,132 INFO L280 TraceCheckUtils]: 1: Hoare triple {681#true} assume true; {681#true} is VALID [2020-07-17 22:48:48,132 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {681#true} {681#true} #80#return; {681#true} is VALID [2020-07-17 22:48:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:48,174 INFO L280 TraceCheckUtils]: 0: Hoare triple {695#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {681#true} is VALID [2020-07-17 22:48:48,174 INFO L280 TraceCheckUtils]: 1: Hoare triple {681#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {681#true} is VALID [2020-07-17 22:48:48,175 INFO L280 TraceCheckUtils]: 2: Hoare triple {681#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {681#true} is VALID [2020-07-17 22:48:48,175 INFO L280 TraceCheckUtils]: 3: Hoare triple {681#true} assume !(~i~0 < ~size); {681#true} is VALID [2020-07-17 22:48:48,175 INFO L280 TraceCheckUtils]: 4: Hoare triple {681#true} assume true; {681#true} is VALID [2020-07-17 22:48:48,176 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {681#true} {681#true} #76#return; {681#true} is VALID [2020-07-17 22:48:48,177 INFO L263 TraceCheckUtils]: 0: Hoare triple {681#true} call ULTIMATE.init(); {694#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:48:48,177 INFO L280 TraceCheckUtils]: 1: Hoare triple {694#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {681#true} is VALID [2020-07-17 22:48:48,177 INFO L280 TraceCheckUtils]: 2: Hoare triple {681#true} assume true; {681#true} is VALID [2020-07-17 22:48:48,178 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {681#true} {681#true} #80#return; {681#true} is VALID [2020-07-17 22:48:48,178 INFO L263 TraceCheckUtils]: 4: Hoare triple {681#true} call #t~ret6 := main(); {681#true} is VALID [2020-07-17 22:48:48,178 INFO L280 TraceCheckUtils]: 5: Hoare triple {681#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {681#true} is VALID [2020-07-17 22:48:48,182 INFO L263 TraceCheckUtils]: 6: Hoare triple {681#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {695#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:48:48,188 INFO L280 TraceCheckUtils]: 7: Hoare triple {695#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {681#true} is VALID [2020-07-17 22:48:48,189 INFO L280 TraceCheckUtils]: 8: Hoare triple {681#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {681#true} is VALID [2020-07-17 22:48:48,189 INFO L280 TraceCheckUtils]: 9: Hoare triple {681#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {681#true} is VALID [2020-07-17 22:48:48,189 INFO L280 TraceCheckUtils]: 10: Hoare triple {681#true} assume !(~i~0 < ~size); {681#true} is VALID [2020-07-17 22:48:48,190 INFO L280 TraceCheckUtils]: 11: Hoare triple {681#true} assume true; {681#true} is VALID [2020-07-17 22:48:48,190 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {681#true} {681#true} #76#return; {681#true} is VALID [2020-07-17 22:48:48,192 INFO L280 TraceCheckUtils]: 13: Hoare triple {681#true} ~i~1 := 0; {692#(= 0 main_~i~1)} is VALID [2020-07-17 22:48:48,193 INFO L280 TraceCheckUtils]: 14: Hoare triple {692#(= 0 main_~i~1)} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {692#(= 0 main_~i~1)} is VALID [2020-07-17 22:48:48,194 INFO L280 TraceCheckUtils]: 15: Hoare triple {692#(= 0 main_~i~1)} assume #t~mem3.base != 0 || #t~mem3.offset != 0;havoc #t~mem3.base, #t~mem3.offset;~flag~0 := 1; {692#(= 0 main_~i~1)} is VALID [2020-07-17 22:48:48,195 INFO L280 TraceCheckUtils]: 16: Hoare triple {692#(= 0 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {693#(<= main_~i~1 1)} is VALID [2020-07-17 22:48:48,206 INFO L280 TraceCheckUtils]: 17: Hoare triple {693#(<= main_~i~1 1)} assume !(~i~1 < 1000000); {682#false} is VALID [2020-07-17 22:48:48,206 INFO L280 TraceCheckUtils]: 18: Hoare triple {682#false} ~i~1 := 0; {682#false} is VALID [2020-07-17 22:48:48,206 INFO L280 TraceCheckUtils]: 19: Hoare triple {682#false} assume !!(~i~1 < 1000000); {682#false} is VALID [2020-07-17 22:48:48,207 INFO L280 TraceCheckUtils]: 20: Hoare triple {682#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {682#false} is VALID [2020-07-17 22:48:48,207 INFO L263 TraceCheckUtils]: 21: Hoare triple {682#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {682#false} is VALID [2020-07-17 22:48:48,207 INFO L280 TraceCheckUtils]: 22: Hoare triple {682#false} ~cond := #in~cond; {682#false} is VALID [2020-07-17 22:48:48,207 INFO L280 TraceCheckUtils]: 23: Hoare triple {682#false} assume 0 == ~cond; {682#false} is VALID [2020-07-17 22:48:48,207 INFO L280 TraceCheckUtils]: 24: Hoare triple {682#false} assume !false; {682#false} is VALID [2020-07-17 22:48:48,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:48:48,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635526062] [2020-07-17 22:48:48,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920083972] [2020-07-17 22:48:48,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:48,263 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-17 22:48:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:48,276 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:48,318 INFO L263 TraceCheckUtils]: 0: Hoare triple {681#true} call ULTIMATE.init(); {681#true} is VALID [2020-07-17 22:48:48,318 INFO L280 TraceCheckUtils]: 1: Hoare triple {681#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {681#true} is VALID [2020-07-17 22:48:48,318 INFO L280 TraceCheckUtils]: 2: Hoare triple {681#true} assume true; {681#true} is VALID [2020-07-17 22:48:48,319 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {681#true} {681#true} #80#return; {681#true} is VALID [2020-07-17 22:48:48,319 INFO L263 TraceCheckUtils]: 4: Hoare triple {681#true} call #t~ret6 := main(); {681#true} is VALID [2020-07-17 22:48:48,319 INFO L280 TraceCheckUtils]: 5: Hoare triple {681#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {681#true} is VALID [2020-07-17 22:48:48,321 INFO L263 TraceCheckUtils]: 6: Hoare triple {681#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {681#true} is VALID [2020-07-17 22:48:48,322 INFO L280 TraceCheckUtils]: 7: Hoare triple {681#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {681#true} is VALID [2020-07-17 22:48:48,322 INFO L280 TraceCheckUtils]: 8: Hoare triple {681#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {681#true} is VALID [2020-07-17 22:48:48,322 INFO L280 TraceCheckUtils]: 9: Hoare triple {681#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {681#true} is VALID [2020-07-17 22:48:48,322 INFO L280 TraceCheckUtils]: 10: Hoare triple {681#true} assume !(~i~0 < ~size); {681#true} is VALID [2020-07-17 22:48:48,323 INFO L280 TraceCheckUtils]: 11: Hoare triple {681#true} assume true; {681#true} is VALID [2020-07-17 22:48:48,323 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {681#true} {681#true} #76#return; {681#true} is VALID [2020-07-17 22:48:48,323 INFO L280 TraceCheckUtils]: 13: Hoare triple {681#true} ~i~1 := 0; {681#true} is VALID [2020-07-17 22:48:48,323 INFO L280 TraceCheckUtils]: 14: Hoare triple {681#true} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {681#true} is VALID [2020-07-17 22:48:48,327 INFO L280 TraceCheckUtils]: 15: Hoare triple {681#true} assume #t~mem3.base != 0 || #t~mem3.offset != 0;havoc #t~mem3.base, #t~mem3.offset;~flag~0 := 1; {744#(<= 1 main_~flag~0)} is VALID [2020-07-17 22:48:48,328 INFO L280 TraceCheckUtils]: 16: Hoare triple {744#(<= 1 main_~flag~0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {744#(<= 1 main_~flag~0)} is VALID [2020-07-17 22:48:48,329 INFO L280 TraceCheckUtils]: 17: Hoare triple {744#(<= 1 main_~flag~0)} assume !(~i~1 < 1000000); {744#(<= 1 main_~flag~0)} is VALID [2020-07-17 22:48:48,330 INFO L280 TraceCheckUtils]: 18: Hoare triple {744#(<= 1 main_~flag~0)} ~i~1 := 0; {744#(<= 1 main_~flag~0)} is VALID [2020-07-17 22:48:48,340 INFO L280 TraceCheckUtils]: 19: Hoare triple {744#(<= 1 main_~flag~0)} assume !!(~i~1 < 1000000); {744#(<= 1 main_~flag~0)} is VALID [2020-07-17 22:48:48,341 INFO L280 TraceCheckUtils]: 20: Hoare triple {744#(<= 1 main_~flag~0)} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {682#false} is VALID [2020-07-17 22:48:48,341 INFO L263 TraceCheckUtils]: 21: Hoare triple {682#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {682#false} is VALID [2020-07-17 22:48:48,341 INFO L280 TraceCheckUtils]: 22: Hoare triple {682#false} ~cond := #in~cond; {682#false} is VALID [2020-07-17 22:48:48,342 INFO L280 TraceCheckUtils]: 23: Hoare triple {682#false} assume 0 == ~cond; {682#false} is VALID [2020-07-17 22:48:48,342 INFO L280 TraceCheckUtils]: 24: Hoare triple {682#false} assume !false; {682#false} is VALID [2020-07-17 22:48:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:48:48,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:48:48,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2020-07-17 22:48:48,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436689954] [2020-07-17 22:48:48,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:48:48,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:48,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:48:48,391 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:48,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:48:48,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:48,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:48:48,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:48:48,393 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 3 states. [2020-07-17 22:48:48,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:48,486 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2020-07-17 22:48:48,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:48:48,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:48:48,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:48:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2020-07-17 22:48:48,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:48:48,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2020-07-17 22:48:48,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2020-07-17 22:48:48,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:48,574 INFO L225 Difference]: With dead ends: 48 [2020-07-17 22:48:48,575 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 22:48:48,575 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:48:48,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 22:48:48,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-17 22:48:48,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:48,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-17 22:48:48,602 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-17 22:48:48,602 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-17 22:48:48,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:48,604 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-17 22:48:48,604 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-17 22:48:48,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:48,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:48,606 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-17 22:48:48,606 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-17 22:48:48,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:48,609 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-17 22:48:48,609 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-17 22:48:48,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:48,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:48,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:48,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:48,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 22:48:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-17 22:48:48,612 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2020-07-17 22:48:48,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:48,613 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-17 22:48:48,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:48:48,613 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-17 22:48:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:48:48,614 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:48,614 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:48:48,818 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:48,818 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:48,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:48,819 INFO L82 PathProgramCache]: Analyzing trace with hash 20292413, now seen corresponding path program 1 times [2020-07-17 22:48:48,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:48,820 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122859151] [2020-07-17 22:48:48,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:48,898 INFO L280 TraceCheckUtils]: 0: Hoare triple {953#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {940#true} is VALID [2020-07-17 22:48:48,899 INFO L280 TraceCheckUtils]: 1: Hoare triple {940#true} assume true; {940#true} is VALID [2020-07-17 22:48:48,899 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {940#true} {940#true} #80#return; {940#true} is VALID [2020-07-17 22:48:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:48,927 INFO L280 TraceCheckUtils]: 0: Hoare triple {954#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {940#true} is VALID [2020-07-17 22:48:48,928 INFO L280 TraceCheckUtils]: 1: Hoare triple {940#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {940#true} is VALID [2020-07-17 22:48:48,928 INFO L280 TraceCheckUtils]: 2: Hoare triple {940#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {940#true} is VALID [2020-07-17 22:48:48,928 INFO L280 TraceCheckUtils]: 3: Hoare triple {940#true} assume !(~i~0 < ~size); {940#true} is VALID [2020-07-17 22:48:48,928 INFO L280 TraceCheckUtils]: 4: Hoare triple {940#true} assume true; {940#true} is VALID [2020-07-17 22:48:48,929 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {940#true} {940#true} #76#return; {940#true} is VALID [2020-07-17 22:48:48,930 INFO L263 TraceCheckUtils]: 0: Hoare triple {940#true} call ULTIMATE.init(); {953#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:48:48,930 INFO L280 TraceCheckUtils]: 1: Hoare triple {953#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {940#true} is VALID [2020-07-17 22:48:48,930 INFO L280 TraceCheckUtils]: 2: Hoare triple {940#true} assume true; {940#true} is VALID [2020-07-17 22:48:48,931 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {940#true} {940#true} #80#return; {940#true} is VALID [2020-07-17 22:48:48,931 INFO L263 TraceCheckUtils]: 4: Hoare triple {940#true} call #t~ret6 := main(); {940#true} is VALID [2020-07-17 22:48:48,931 INFO L280 TraceCheckUtils]: 5: Hoare triple {940#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {940#true} is VALID [2020-07-17 22:48:48,932 INFO L263 TraceCheckUtils]: 6: Hoare triple {940#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {954#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:48:48,933 INFO L280 TraceCheckUtils]: 7: Hoare triple {954#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {940#true} is VALID [2020-07-17 22:48:48,933 INFO L280 TraceCheckUtils]: 8: Hoare triple {940#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {940#true} is VALID [2020-07-17 22:48:48,933 INFO L280 TraceCheckUtils]: 9: Hoare triple {940#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {940#true} is VALID [2020-07-17 22:48:48,934 INFO L280 TraceCheckUtils]: 10: Hoare triple {940#true} assume !(~i~0 < ~size); {940#true} is VALID [2020-07-17 22:48:48,934 INFO L280 TraceCheckUtils]: 11: Hoare triple {940#true} assume true; {940#true} is VALID [2020-07-17 22:48:48,934 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {940#true} {940#true} #76#return; {940#true} is VALID [2020-07-17 22:48:48,935 INFO L280 TraceCheckUtils]: 13: Hoare triple {940#true} ~i~1 := 0; {951#(= 0 main_~i~1)} is VALID [2020-07-17 22:48:48,936 INFO L280 TraceCheckUtils]: 14: Hoare triple {951#(= 0 main_~i~1)} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {951#(= 0 main_~i~1)} is VALID [2020-07-17 22:48:48,937 INFO L280 TraceCheckUtils]: 15: Hoare triple {951#(= 0 main_~i~1)} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {951#(= 0 main_~i~1)} is VALID [2020-07-17 22:48:48,938 INFO L280 TraceCheckUtils]: 16: Hoare triple {951#(= 0 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {952#(<= main_~i~1 1)} is VALID [2020-07-17 22:48:48,939 INFO L280 TraceCheckUtils]: 17: Hoare triple {952#(<= main_~i~1 1)} assume !(~i~1 < 1000000); {941#false} is VALID [2020-07-17 22:48:48,939 INFO L280 TraceCheckUtils]: 18: Hoare triple {941#false} ~i~1 := 0; {941#false} is VALID [2020-07-17 22:48:48,939 INFO L280 TraceCheckUtils]: 19: Hoare triple {941#false} assume !!(~i~1 < 1000000); {941#false} is VALID [2020-07-17 22:48:48,939 INFO L280 TraceCheckUtils]: 20: Hoare triple {941#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {941#false} is VALID [2020-07-17 22:48:48,940 INFO L263 TraceCheckUtils]: 21: Hoare triple {941#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {941#false} is VALID [2020-07-17 22:48:48,940 INFO L280 TraceCheckUtils]: 22: Hoare triple {941#false} ~cond := #in~cond; {941#false} is VALID [2020-07-17 22:48:48,940 INFO L280 TraceCheckUtils]: 23: Hoare triple {941#false} assume 0 == ~cond; {941#false} is VALID [2020-07-17 22:48:48,940 INFO L280 TraceCheckUtils]: 24: Hoare triple {941#false} assume !false; {941#false} is VALID [2020-07-17 22:48:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:48:48,942 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122859151] [2020-07-17 22:48:48,942 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978103951] [2020-07-17 22:48:48,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:49,001 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-17 22:48:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:49,013 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:49,143 INFO L263 TraceCheckUtils]: 0: Hoare triple {940#true} call ULTIMATE.init(); {940#true} is VALID [2020-07-17 22:48:49,145 INFO L280 TraceCheckUtils]: 1: Hoare triple {940#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {940#true} is VALID [2020-07-17 22:48:49,145 INFO L280 TraceCheckUtils]: 2: Hoare triple {940#true} assume true; {940#true} is VALID [2020-07-17 22:48:49,146 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {940#true} {940#true} #80#return; {940#true} is VALID [2020-07-17 22:48:49,146 INFO L263 TraceCheckUtils]: 4: Hoare triple {940#true} call #t~ret6 := main(); {940#true} is VALID [2020-07-17 22:48:49,146 INFO L280 TraceCheckUtils]: 5: Hoare triple {940#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {940#true} is VALID [2020-07-17 22:48:49,146 INFO L263 TraceCheckUtils]: 6: Hoare triple {940#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {940#true} is VALID [2020-07-17 22:48:49,147 INFO L280 TraceCheckUtils]: 7: Hoare triple {940#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {979#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} is VALID [2020-07-17 22:48:49,148 INFO L280 TraceCheckUtils]: 8: Hoare triple {979#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {979#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} is VALID [2020-07-17 22:48:49,149 INFO L280 TraceCheckUtils]: 9: Hoare triple {979#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {986#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} is VALID [2020-07-17 22:48:49,150 INFO L280 TraceCheckUtils]: 10: Hoare triple {986#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} assume !(~i~0 < ~size); {990#(<= |init_#in~size| 1)} is VALID [2020-07-17 22:48:49,151 INFO L280 TraceCheckUtils]: 11: Hoare triple {990#(<= |init_#in~size| 1)} assume true; {990#(<= |init_#in~size| 1)} is VALID [2020-07-17 22:48:49,152 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {990#(<= |init_#in~size| 1)} {940#true} #76#return; {941#false} is VALID [2020-07-17 22:48:49,152 INFO L280 TraceCheckUtils]: 13: Hoare triple {941#false} ~i~1 := 0; {941#false} is VALID [2020-07-17 22:48:49,152 INFO L280 TraceCheckUtils]: 14: Hoare triple {941#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {941#false} is VALID [2020-07-17 22:48:49,153 INFO L280 TraceCheckUtils]: 15: Hoare triple {941#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {941#false} is VALID [2020-07-17 22:48:49,153 INFO L280 TraceCheckUtils]: 16: Hoare triple {941#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {941#false} is VALID [2020-07-17 22:48:49,153 INFO L280 TraceCheckUtils]: 17: Hoare triple {941#false} assume !(~i~1 < 1000000); {941#false} is VALID [2020-07-17 22:48:49,153 INFO L280 TraceCheckUtils]: 18: Hoare triple {941#false} ~i~1 := 0; {941#false} is VALID [2020-07-17 22:48:49,154 INFO L280 TraceCheckUtils]: 19: Hoare triple {941#false} assume !!(~i~1 < 1000000); {941#false} is VALID [2020-07-17 22:48:49,154 INFO L280 TraceCheckUtils]: 20: Hoare triple {941#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {941#false} is VALID [2020-07-17 22:48:49,154 INFO L263 TraceCheckUtils]: 21: Hoare triple {941#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {941#false} is VALID [2020-07-17 22:48:49,154 INFO L280 TraceCheckUtils]: 22: Hoare triple {941#false} ~cond := #in~cond; {941#false} is VALID [2020-07-17 22:48:49,155 INFO L280 TraceCheckUtils]: 23: Hoare triple {941#false} assume 0 == ~cond; {941#false} is VALID [2020-07-17 22:48:49,155 INFO L280 TraceCheckUtils]: 24: Hoare triple {941#false} assume !false; {941#false} is VALID [2020-07-17 22:48:49,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:48:49,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:48:49,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2020-07-17 22:48:49,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756565955] [2020-07-17 22:48:49,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-17 22:48:49,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:49,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:48:49,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:49,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:48:49,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:49,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:48:49,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:48:49,200 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 9 states. [2020-07-17 22:48:49,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:49,804 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2020-07-17 22:48:49,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:48:49,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-17 22:48:49,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:49,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:48:49,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2020-07-17 22:48:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:48:49,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2020-07-17 22:48:49,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 77 transitions. [2020-07-17 22:48:49,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:49,913 INFO L225 Difference]: With dead ends: 67 [2020-07-17 22:48:49,913 INFO L226 Difference]: Without dead ends: 48 [2020-07-17 22:48:49,914 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:48:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-17 22:48:49,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2020-07-17 22:48:49,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:49,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 35 states. [2020-07-17 22:48:49,937 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 35 states. [2020-07-17 22:48:49,937 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 35 states. [2020-07-17 22:48:49,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:49,940 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2020-07-17 22:48:49,940 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2020-07-17 22:48:49,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:49,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:49,942 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 48 states. [2020-07-17 22:48:49,942 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 48 states. [2020-07-17 22:48:49,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:49,945 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2020-07-17 22:48:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2020-07-17 22:48:49,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:49,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:49,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:49,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:49,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-17 22:48:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2020-07-17 22:48:49,948 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 25 [2020-07-17 22:48:49,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:49,949 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2020-07-17 22:48:49,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:48:49,949 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-17 22:48:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:48:49,953 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:49,953 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:48:50,153 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:50,154 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:50,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:50,155 INFO L82 PathProgramCache]: Analyzing trace with hash -40898518, now seen corresponding path program 2 times [2020-07-17 22:48:50,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:50,156 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782430314] [2020-07-17 22:48:50,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:50,211 INFO L280 TraceCheckUtils]: 0: Hoare triple {1289#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1276#true} is VALID [2020-07-17 22:48:50,211 INFO L280 TraceCheckUtils]: 1: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-17 22:48:50,212 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1276#true} {1276#true} #80#return; {1276#true} is VALID [2020-07-17 22:48:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:50,386 INFO L280 TraceCheckUtils]: 0: Hoare triple {1290#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {1291#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:50,388 INFO L280 TraceCheckUtils]: 1: Hoare triple {1291#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1291#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:50,389 INFO L280 TraceCheckUtils]: 2: Hoare triple {1291#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1292#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:50,390 INFO L280 TraceCheckUtils]: 3: Hoare triple {1292#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1292#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:50,391 INFO L280 TraceCheckUtils]: 4: Hoare triple {1292#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1293#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-17 22:48:50,392 INFO L280 TraceCheckUtils]: 5: Hoare triple {1293#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !(~i~0 < ~size); {1294#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:50,393 INFO L280 TraceCheckUtils]: 6: Hoare triple {1294#(not (= |init_#in~size| 1000000))} assume true; {1294#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:50,393 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1294#(not (= |init_#in~size| 1000000))} {1276#true} #76#return; {1277#false} is VALID [2020-07-17 22:48:50,394 INFO L263 TraceCheckUtils]: 0: Hoare triple {1276#true} call ULTIMATE.init(); {1289#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:48:50,395 INFO L280 TraceCheckUtils]: 1: Hoare triple {1289#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1276#true} is VALID [2020-07-17 22:48:50,395 INFO L280 TraceCheckUtils]: 2: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-17 22:48:50,395 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1276#true} {1276#true} #80#return; {1276#true} is VALID [2020-07-17 22:48:50,395 INFO L263 TraceCheckUtils]: 4: Hoare triple {1276#true} call #t~ret6 := main(); {1276#true} is VALID [2020-07-17 22:48:50,396 INFO L280 TraceCheckUtils]: 5: Hoare triple {1276#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {1276#true} is VALID [2020-07-17 22:48:50,397 INFO L263 TraceCheckUtils]: 6: Hoare triple {1276#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {1290#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:48:50,398 INFO L280 TraceCheckUtils]: 7: Hoare triple {1290#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {1291#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:50,399 INFO L280 TraceCheckUtils]: 8: Hoare triple {1291#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1291#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:50,400 INFO L280 TraceCheckUtils]: 9: Hoare triple {1291#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1292#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:50,405 INFO L280 TraceCheckUtils]: 10: Hoare triple {1292#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1292#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:50,406 INFO L280 TraceCheckUtils]: 11: Hoare triple {1292#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1293#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-17 22:48:50,407 INFO L280 TraceCheckUtils]: 12: Hoare triple {1293#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !(~i~0 < ~size); {1294#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:50,407 INFO L280 TraceCheckUtils]: 13: Hoare triple {1294#(not (= |init_#in~size| 1000000))} assume true; {1294#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:50,409 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1294#(not (= |init_#in~size| 1000000))} {1276#true} #76#return; {1277#false} is VALID [2020-07-17 22:48:50,410 INFO L280 TraceCheckUtils]: 15: Hoare triple {1277#false} ~i~1 := 0; {1277#false} is VALID [2020-07-17 22:48:50,410 INFO L280 TraceCheckUtils]: 16: Hoare triple {1277#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1277#false} is VALID [2020-07-17 22:48:50,410 INFO L280 TraceCheckUtils]: 17: Hoare triple {1277#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1277#false} is VALID [2020-07-17 22:48:50,411 INFO L280 TraceCheckUtils]: 18: Hoare triple {1277#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1277#false} is VALID [2020-07-17 22:48:50,411 INFO L280 TraceCheckUtils]: 19: Hoare triple {1277#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1277#false} is VALID [2020-07-17 22:48:50,412 INFO L280 TraceCheckUtils]: 20: Hoare triple {1277#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1277#false} is VALID [2020-07-17 22:48:50,412 INFO L280 TraceCheckUtils]: 21: Hoare triple {1277#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1277#false} is VALID [2020-07-17 22:48:50,412 INFO L280 TraceCheckUtils]: 22: Hoare triple {1277#false} assume !(~i~1 < 1000000); {1277#false} is VALID [2020-07-17 22:48:50,413 INFO L280 TraceCheckUtils]: 23: Hoare triple {1277#false} ~i~1 := 0; {1277#false} is VALID [2020-07-17 22:48:50,413 INFO L280 TraceCheckUtils]: 24: Hoare triple {1277#false} assume !!(~i~1 < 1000000); {1277#false} is VALID [2020-07-17 22:48:50,413 INFO L280 TraceCheckUtils]: 25: Hoare triple {1277#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1277#false} is VALID [2020-07-17 22:48:50,413 INFO L263 TraceCheckUtils]: 26: Hoare triple {1277#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {1277#false} is VALID [2020-07-17 22:48:50,414 INFO L280 TraceCheckUtils]: 27: Hoare triple {1277#false} ~cond := #in~cond; {1277#false} is VALID [2020-07-17 22:48:50,414 INFO L280 TraceCheckUtils]: 28: Hoare triple {1277#false} assume 0 == ~cond; {1277#false} is VALID [2020-07-17 22:48:50,414 INFO L280 TraceCheckUtils]: 29: Hoare triple {1277#false} assume !false; {1277#false} is VALID [2020-07-17 22:48:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-17 22:48:50,416 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782430314] [2020-07-17 22:48:50,416 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455567482] [2020-07-17 22:48:50,416 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:50,467 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:48:50,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:48:50,469 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:48:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:50,491 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:50,602 INFO L263 TraceCheckUtils]: 0: Hoare triple {1276#true} call ULTIMATE.init(); {1276#true} is VALID [2020-07-17 22:48:50,602 INFO L280 TraceCheckUtils]: 1: Hoare triple {1276#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1276#true} is VALID [2020-07-17 22:48:50,603 INFO L280 TraceCheckUtils]: 2: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-17 22:48:50,603 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1276#true} {1276#true} #80#return; {1276#true} is VALID [2020-07-17 22:48:50,603 INFO L263 TraceCheckUtils]: 4: Hoare triple {1276#true} call #t~ret6 := main(); {1276#true} is VALID [2020-07-17 22:48:50,603 INFO L280 TraceCheckUtils]: 5: Hoare triple {1276#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {1276#true} is VALID [2020-07-17 22:48:50,604 INFO L263 TraceCheckUtils]: 6: Hoare triple {1276#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {1276#true} is VALID [2020-07-17 22:48:50,604 INFO L280 TraceCheckUtils]: 7: Hoare triple {1276#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {1276#true} is VALID [2020-07-17 22:48:50,604 INFO L280 TraceCheckUtils]: 8: Hoare triple {1276#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1276#true} is VALID [2020-07-17 22:48:50,604 INFO L280 TraceCheckUtils]: 9: Hoare triple {1276#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1276#true} is VALID [2020-07-17 22:48:50,605 INFO L280 TraceCheckUtils]: 10: Hoare triple {1276#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1276#true} is VALID [2020-07-17 22:48:50,605 INFO L280 TraceCheckUtils]: 11: Hoare triple {1276#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1276#true} is VALID [2020-07-17 22:48:50,605 INFO L280 TraceCheckUtils]: 12: Hoare triple {1276#true} assume !(~i~0 < ~size); {1276#true} is VALID [2020-07-17 22:48:50,605 INFO L280 TraceCheckUtils]: 13: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-17 22:48:50,606 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1276#true} {1276#true} #76#return; {1276#true} is VALID [2020-07-17 22:48:50,606 INFO L280 TraceCheckUtils]: 15: Hoare triple {1276#true} ~i~1 := 0; {1343#(<= main_~i~1 0)} is VALID [2020-07-17 22:48:50,607 INFO L280 TraceCheckUtils]: 16: Hoare triple {1343#(<= main_~i~1 0)} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1343#(<= main_~i~1 0)} is VALID [2020-07-17 22:48:50,608 INFO L280 TraceCheckUtils]: 17: Hoare triple {1343#(<= main_~i~1 0)} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1343#(<= main_~i~1 0)} is VALID [2020-07-17 22:48:50,608 INFO L280 TraceCheckUtils]: 18: Hoare triple {1343#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1353#(<= main_~i~1 1)} is VALID [2020-07-17 22:48:50,609 INFO L280 TraceCheckUtils]: 19: Hoare triple {1353#(<= main_~i~1 1)} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1353#(<= main_~i~1 1)} is VALID [2020-07-17 22:48:50,610 INFO L280 TraceCheckUtils]: 20: Hoare triple {1353#(<= main_~i~1 1)} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1353#(<= main_~i~1 1)} is VALID [2020-07-17 22:48:50,610 INFO L280 TraceCheckUtils]: 21: Hoare triple {1353#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1363#(<= main_~i~1 2)} is VALID [2020-07-17 22:48:50,611 INFO L280 TraceCheckUtils]: 22: Hoare triple {1363#(<= main_~i~1 2)} assume !(~i~1 < 1000000); {1277#false} is VALID [2020-07-17 22:48:50,611 INFO L280 TraceCheckUtils]: 23: Hoare triple {1277#false} ~i~1 := 0; {1277#false} is VALID [2020-07-17 22:48:50,612 INFO L280 TraceCheckUtils]: 24: Hoare triple {1277#false} assume !!(~i~1 < 1000000); {1277#false} is VALID [2020-07-17 22:48:50,612 INFO L280 TraceCheckUtils]: 25: Hoare triple {1277#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1277#false} is VALID [2020-07-17 22:48:50,612 INFO L263 TraceCheckUtils]: 26: Hoare triple {1277#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {1277#false} is VALID [2020-07-17 22:48:50,612 INFO L280 TraceCheckUtils]: 27: Hoare triple {1277#false} ~cond := #in~cond; {1277#false} is VALID [2020-07-17 22:48:50,613 INFO L280 TraceCheckUtils]: 28: Hoare triple {1277#false} assume 0 == ~cond; {1277#false} is VALID [2020-07-17 22:48:50,613 INFO L280 TraceCheckUtils]: 29: Hoare triple {1277#false} assume !false; {1277#false} is VALID [2020-07-17 22:48:50,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 22:48:50,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:48:50,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2020-07-17 22:48:50,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038979825] [2020-07-17 22:48:50,617 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2020-07-17 22:48:50,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:50,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:48:50,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:50,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:48:50,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:50,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:48:50,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:48:50,679 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 11 states. [2020-07-17 22:48:51,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:51,361 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2020-07-17 22:48:51,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 22:48:51,361 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2020-07-17 22:48:51,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:48:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 89 transitions. [2020-07-17 22:48:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:48:51,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 89 transitions. [2020-07-17 22:48:51,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 89 transitions. [2020-07-17 22:48:51,475 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:51,478 INFO L225 Difference]: With dead ends: 80 [2020-07-17 22:48:51,478 INFO L226 Difference]: Without dead ends: 58 [2020-07-17 22:48:51,479 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:48:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-17 22:48:51,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 40. [2020-07-17 22:48:51,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:51,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 40 states. [2020-07-17 22:48:51,510 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 40 states. [2020-07-17 22:48:51,510 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 40 states. [2020-07-17 22:48:51,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:51,513 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-07-17 22:48:51,513 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2020-07-17 22:48:51,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:51,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:51,516 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 58 states. [2020-07-17 22:48:51,516 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 58 states. [2020-07-17 22:48:51,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:51,519 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-07-17 22:48:51,519 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2020-07-17 22:48:51,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:51,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:51,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:51,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:51,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-17 22:48:51,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-07-17 22:48:51,524 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 30 [2020-07-17 22:48:51,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:51,525 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-07-17 22:48:51,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:48:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-17 22:48:51,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-17 22:48:51,527 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:51,528 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:48:51,741 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:51,742 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:51,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:51,743 INFO L82 PathProgramCache]: Analyzing trace with hash -577379495, now seen corresponding path program 3 times [2020-07-17 22:48:51,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:51,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620846360] [2020-07-17 22:48:51,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:51,793 INFO L280 TraceCheckUtils]: 0: Hoare triple {1691#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1676#true} is VALID [2020-07-17 22:48:51,794 INFO L280 TraceCheckUtils]: 1: Hoare triple {1676#true} assume true; {1676#true} is VALID [2020-07-17 22:48:51,794 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1676#true} {1676#true} #80#return; {1676#true} is VALID [2020-07-17 22:48:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:52,029 INFO L280 TraceCheckUtils]: 0: Hoare triple {1692#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {1693#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:52,031 INFO L280 TraceCheckUtils]: 1: Hoare triple {1693#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1693#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:52,032 INFO L280 TraceCheckUtils]: 2: Hoare triple {1693#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1694#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:52,033 INFO L280 TraceCheckUtils]: 3: Hoare triple {1694#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1694#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:52,034 INFO L280 TraceCheckUtils]: 4: Hoare triple {1694#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1695#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-17 22:48:52,035 INFO L280 TraceCheckUtils]: 5: Hoare triple {1695#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1695#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-17 22:48:52,036 INFO L280 TraceCheckUtils]: 6: Hoare triple {1695#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1696#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:52,040 INFO L280 TraceCheckUtils]: 7: Hoare triple {1696#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {1697#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:52,043 INFO L280 TraceCheckUtils]: 8: Hoare triple {1697#(not (= |init_#in~size| 1000000))} assume true; {1697#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:52,044 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1697#(not (= |init_#in~size| 1000000))} {1676#true} #76#return; {1677#false} is VALID [2020-07-17 22:48:52,046 INFO L263 TraceCheckUtils]: 0: Hoare triple {1676#true} call ULTIMATE.init(); {1691#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:48:52,046 INFO L280 TraceCheckUtils]: 1: Hoare triple {1691#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1676#true} is VALID [2020-07-17 22:48:52,046 INFO L280 TraceCheckUtils]: 2: Hoare triple {1676#true} assume true; {1676#true} is VALID [2020-07-17 22:48:52,046 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1676#true} {1676#true} #80#return; {1676#true} is VALID [2020-07-17 22:48:52,047 INFO L263 TraceCheckUtils]: 4: Hoare triple {1676#true} call #t~ret6 := main(); {1676#true} is VALID [2020-07-17 22:48:52,047 INFO L280 TraceCheckUtils]: 5: Hoare triple {1676#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {1676#true} is VALID [2020-07-17 22:48:52,050 INFO L263 TraceCheckUtils]: 6: Hoare triple {1676#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {1692#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:48:52,050 INFO L280 TraceCheckUtils]: 7: Hoare triple {1692#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {1693#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:52,052 INFO L280 TraceCheckUtils]: 8: Hoare triple {1693#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1693#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:52,052 INFO L280 TraceCheckUtils]: 9: Hoare triple {1693#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1694#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:52,054 INFO L280 TraceCheckUtils]: 10: Hoare triple {1694#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1694#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:52,054 INFO L280 TraceCheckUtils]: 11: Hoare triple {1694#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1695#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-17 22:48:52,055 INFO L280 TraceCheckUtils]: 12: Hoare triple {1695#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1695#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-17 22:48:52,056 INFO L280 TraceCheckUtils]: 13: Hoare triple {1695#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1696#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:52,059 INFO L280 TraceCheckUtils]: 14: Hoare triple {1696#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {1697#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:52,060 INFO L280 TraceCheckUtils]: 15: Hoare triple {1697#(not (= |init_#in~size| 1000000))} assume true; {1697#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:52,061 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1697#(not (= |init_#in~size| 1000000))} {1676#true} #76#return; {1677#false} is VALID [2020-07-17 22:48:52,061 INFO L280 TraceCheckUtils]: 17: Hoare triple {1677#false} ~i~1 := 0; {1677#false} is VALID [2020-07-17 22:48:52,062 INFO L280 TraceCheckUtils]: 18: Hoare triple {1677#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1677#false} is VALID [2020-07-17 22:48:52,062 INFO L280 TraceCheckUtils]: 19: Hoare triple {1677#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1677#false} is VALID [2020-07-17 22:48:52,062 INFO L280 TraceCheckUtils]: 20: Hoare triple {1677#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1677#false} is VALID [2020-07-17 22:48:52,062 INFO L280 TraceCheckUtils]: 21: Hoare triple {1677#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1677#false} is VALID [2020-07-17 22:48:52,062 INFO L280 TraceCheckUtils]: 22: Hoare triple {1677#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1677#false} is VALID [2020-07-17 22:48:52,062 INFO L280 TraceCheckUtils]: 23: Hoare triple {1677#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1677#false} is VALID [2020-07-17 22:48:52,062 INFO L280 TraceCheckUtils]: 24: Hoare triple {1677#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1677#false} is VALID [2020-07-17 22:48:52,063 INFO L280 TraceCheckUtils]: 25: Hoare triple {1677#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1677#false} is VALID [2020-07-17 22:48:52,063 INFO L280 TraceCheckUtils]: 26: Hoare triple {1677#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1677#false} is VALID [2020-07-17 22:48:52,063 INFO L280 TraceCheckUtils]: 27: Hoare triple {1677#false} assume !(~i~1 < 1000000); {1677#false} is VALID [2020-07-17 22:48:52,063 INFO L280 TraceCheckUtils]: 28: Hoare triple {1677#false} ~i~1 := 0; {1677#false} is VALID [2020-07-17 22:48:52,064 INFO L280 TraceCheckUtils]: 29: Hoare triple {1677#false} assume !!(~i~1 < 1000000); {1677#false} is VALID [2020-07-17 22:48:52,064 INFO L280 TraceCheckUtils]: 30: Hoare triple {1677#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1677#false} is VALID [2020-07-17 22:48:52,064 INFO L263 TraceCheckUtils]: 31: Hoare triple {1677#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {1677#false} is VALID [2020-07-17 22:48:52,065 INFO L280 TraceCheckUtils]: 32: Hoare triple {1677#false} ~cond := #in~cond; {1677#false} is VALID [2020-07-17 22:48:52,065 INFO L280 TraceCheckUtils]: 33: Hoare triple {1677#false} assume 0 == ~cond; {1677#false} is VALID [2020-07-17 22:48:52,065 INFO L280 TraceCheckUtils]: 34: Hoare triple {1677#false} assume !false; {1677#false} is VALID [2020-07-17 22:48:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-17 22:48:52,068 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620846360] [2020-07-17 22:48:52,068 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560444389] [2020-07-17 22:48:52,068 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:52,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-17 22:48:52,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:48:52,119 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-17 22:48:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:52,135 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:52,352 INFO L384 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 7 [2020-07-17 22:48:52,356 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:48:52,366 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:48:52,369 INFO L384 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 7 [2020-07-17 22:48:52,374 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:48:52,378 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:48:52,378 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:48:52,379 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2020-07-17 22:48:52,381 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:48:52,382 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, |main_~#a~0.base|, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) 0)) (.cse1 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) 0))) (and (= .cse0 |main_#t~mem5.base|) (= 0 .cse1) (= 0 .cse0) (= |main_#t~mem5.offset| .cse1))) [2020-07-17 22:48:52,382 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 |main_#t~mem5.offset|) (= 0 |main_#t~mem5.base|)) [2020-07-17 22:48:52,450 INFO L263 TraceCheckUtils]: 0: Hoare triple {1676#true} call ULTIMATE.init(); {1676#true} is VALID [2020-07-17 22:48:52,451 INFO L280 TraceCheckUtils]: 1: Hoare triple {1676#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1676#true} is VALID [2020-07-17 22:48:52,451 INFO L280 TraceCheckUtils]: 2: Hoare triple {1676#true} assume true; {1676#true} is VALID [2020-07-17 22:48:52,451 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1676#true} {1676#true} #80#return; {1676#true} is VALID [2020-07-17 22:48:52,451 INFO L263 TraceCheckUtils]: 4: Hoare triple {1676#true} call #t~ret6 := main(); {1676#true} is VALID [2020-07-17 22:48:52,452 INFO L280 TraceCheckUtils]: 5: Hoare triple {1676#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {1716#(= 0 |main_~#a~0.offset|)} is VALID [2020-07-17 22:48:52,452 INFO L263 TraceCheckUtils]: 6: Hoare triple {1716#(= 0 |main_~#a~0.offset|)} call init(~#a~0.base, ~#a~0.offset, 1000000); {1676#true} is VALID [2020-07-17 22:48:52,452 INFO L280 TraceCheckUtils]: 7: Hoare triple {1676#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {1676#true} is VALID [2020-07-17 22:48:52,453 INFO L280 TraceCheckUtils]: 8: Hoare triple {1676#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1676#true} is VALID [2020-07-17 22:48:52,453 INFO L280 TraceCheckUtils]: 9: Hoare triple {1676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1676#true} is VALID [2020-07-17 22:48:52,453 INFO L280 TraceCheckUtils]: 10: Hoare triple {1676#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1676#true} is VALID [2020-07-17 22:48:52,453 INFO L280 TraceCheckUtils]: 11: Hoare triple {1676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1676#true} is VALID [2020-07-17 22:48:52,453 INFO L280 TraceCheckUtils]: 12: Hoare triple {1676#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1676#true} is VALID [2020-07-17 22:48:52,454 INFO L280 TraceCheckUtils]: 13: Hoare triple {1676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1676#true} is VALID [2020-07-17 22:48:52,454 INFO L280 TraceCheckUtils]: 14: Hoare triple {1676#true} assume !(~i~0 < ~size); {1676#true} is VALID [2020-07-17 22:48:52,454 INFO L280 TraceCheckUtils]: 15: Hoare triple {1676#true} assume true; {1676#true} is VALID [2020-07-17 22:48:52,454 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1676#true} {1716#(= 0 |main_~#a~0.offset|)} #76#return; {1716#(= 0 |main_~#a~0.offset|)} is VALID [2020-07-17 22:48:52,455 INFO L280 TraceCheckUtils]: 17: Hoare triple {1716#(= 0 |main_~#a~0.offset|)} ~i~1 := 0; {1753#(and (= 0 main_~i~1) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-17 22:48:52,456 INFO L280 TraceCheckUtils]: 18: Hoare triple {1753#(and (= 0 main_~i~1) (= 0 |main_~#a~0.offset|))} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1757#(and (= |main_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|) |main_#t~mem3.base|) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-17 22:48:52,456 INFO L280 TraceCheckUtils]: 19: Hoare triple {1757#(and (= |main_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|) |main_#t~mem3.base|) (= 0 |main_~#a~0.offset|))} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-17 22:48:52,459 INFO L280 TraceCheckUtils]: 20: Hoare triple {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-17 22:48:52,463 INFO L280 TraceCheckUtils]: 21: Hoare triple {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-17 22:48:52,464 INFO L280 TraceCheckUtils]: 22: Hoare triple {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-17 22:48:52,465 INFO L280 TraceCheckUtils]: 23: Hoare triple {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-17 22:48:52,466 INFO L280 TraceCheckUtils]: 24: Hoare triple {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-17 22:48:52,466 INFO L280 TraceCheckUtils]: 25: Hoare triple {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-17 22:48:52,467 INFO L280 TraceCheckUtils]: 26: Hoare triple {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-17 22:48:52,468 INFO L280 TraceCheckUtils]: 27: Hoare triple {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} assume !(~i~1 < 1000000); {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-17 22:48:52,469 INFO L280 TraceCheckUtils]: 28: Hoare triple {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} ~i~1 := 0; {1789#(and (= 0 main_~i~1) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-17 22:48:52,469 INFO L280 TraceCheckUtils]: 29: Hoare triple {1789#(and (= 0 main_~i~1) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} assume !!(~i~1 < 1000000); {1789#(and (= 0 main_~i~1) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-17 22:48:52,470 INFO L280 TraceCheckUtils]: 30: Hoare triple {1789#(and (= 0 main_~i~1) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1796#(and (= 0 |main_#t~mem5.offset|) (= 0 |main_#t~mem5.base|))} is VALID [2020-07-17 22:48:52,471 INFO L263 TraceCheckUtils]: 31: Hoare triple {1796#(and (= 0 |main_#t~mem5.offset|) (= 0 |main_#t~mem5.base|))} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {1800#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:48:52,472 INFO L280 TraceCheckUtils]: 32: Hoare triple {1800#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1804#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:48:52,472 INFO L280 TraceCheckUtils]: 33: Hoare triple {1804#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1677#false} is VALID [2020-07-17 22:48:52,473 INFO L280 TraceCheckUtils]: 34: Hoare triple {1677#false} assume !false; {1677#false} is VALID [2020-07-17 22:48:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-17 22:48:52,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:48:52,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2020-07-17 22:48:52,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629605465] [2020-07-17 22:48:52,476 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2020-07-17 22:48:52,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:52,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-17 22:48:52,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:52,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-17 22:48:52,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:52,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-17 22:48:52,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2020-07-17 22:48:52,546 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 17 states. [2020-07-17 22:48:53,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:53,552 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2020-07-17 22:48:53,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-17 22:48:53,553 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2020-07-17 22:48:53,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-17 22:48:53,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 74 transitions. [2020-07-17 22:48:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-17 22:48:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 74 transitions. [2020-07-17 22:48:53,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 74 transitions. [2020-07-17 22:48:53,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:53,660 INFO L225 Difference]: With dead ends: 77 [2020-07-17 22:48:53,660 INFO L226 Difference]: Without dead ends: 52 [2020-07-17 22:48:53,661 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2020-07-17 22:48:53,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-17 22:48:53,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2020-07-17 22:48:53,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:53,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 49 states. [2020-07-17 22:48:53,715 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 49 states. [2020-07-17 22:48:53,716 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 49 states. [2020-07-17 22:48:53,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:53,718 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-07-17 22:48:53,718 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-07-17 22:48:53,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:53,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:53,718 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 52 states. [2020-07-17 22:48:53,719 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 52 states. [2020-07-17 22:48:53,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:53,720 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-07-17 22:48:53,721 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-07-17 22:48:53,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:53,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:53,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:53,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:53,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-17 22:48:53,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2020-07-17 22:48:53,723 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 35 [2020-07-17 22:48:53,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:53,723 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2020-07-17 22:48:53,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-17 22:48:53,723 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2020-07-17 22:48:53,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-17 22:48:53,724 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:53,724 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:48:53,936 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-17 22:48:53,936 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:53,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:53,937 INFO L82 PathProgramCache]: Analyzing trace with hash -749708025, now seen corresponding path program 1 times [2020-07-17 22:48:53,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:53,938 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812379861] [2020-07-17 22:48:53,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:54,018 INFO L280 TraceCheckUtils]: 0: Hoare triple {2121#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2104#true} is VALID [2020-07-17 22:48:54,019 INFO L280 TraceCheckUtils]: 1: Hoare triple {2104#true} assume true; {2104#true} is VALID [2020-07-17 22:48:54,019 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2104#true} {2104#true} #80#return; {2104#true} is VALID [2020-07-17 22:48:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:54,280 INFO L280 TraceCheckUtils]: 0: Hoare triple {2122#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {2123#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:54,281 INFO L280 TraceCheckUtils]: 1: Hoare triple {2123#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2123#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:54,283 INFO L280 TraceCheckUtils]: 2: Hoare triple {2123#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2124#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:54,285 INFO L280 TraceCheckUtils]: 3: Hoare triple {2124#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2124#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:54,286 INFO L280 TraceCheckUtils]: 4: Hoare triple {2124#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2125#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-17 22:48:54,287 INFO L280 TraceCheckUtils]: 5: Hoare triple {2125#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2125#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-17 22:48:54,288 INFO L280 TraceCheckUtils]: 6: Hoare triple {2125#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2126#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:54,289 INFO L280 TraceCheckUtils]: 7: Hoare triple {2126#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2126#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:54,290 INFO L280 TraceCheckUtils]: 8: Hoare triple {2126#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2127#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:54,291 INFO L280 TraceCheckUtils]: 9: Hoare triple {2127#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {2128#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:54,292 INFO L280 TraceCheckUtils]: 10: Hoare triple {2128#(not (= |init_#in~size| 1000000))} assume true; {2128#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:54,293 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2128#(not (= |init_#in~size| 1000000))} {2104#true} #76#return; {2105#false} is VALID [2020-07-17 22:48:54,295 INFO L263 TraceCheckUtils]: 0: Hoare triple {2104#true} call ULTIMATE.init(); {2121#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:48:54,295 INFO L280 TraceCheckUtils]: 1: Hoare triple {2121#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2104#true} is VALID [2020-07-17 22:48:54,295 INFO L280 TraceCheckUtils]: 2: Hoare triple {2104#true} assume true; {2104#true} is VALID [2020-07-17 22:48:54,296 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2104#true} {2104#true} #80#return; {2104#true} is VALID [2020-07-17 22:48:54,296 INFO L263 TraceCheckUtils]: 4: Hoare triple {2104#true} call #t~ret6 := main(); {2104#true} is VALID [2020-07-17 22:48:54,296 INFO L280 TraceCheckUtils]: 5: Hoare triple {2104#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {2104#true} is VALID [2020-07-17 22:48:54,298 INFO L263 TraceCheckUtils]: 6: Hoare triple {2104#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {2122#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:48:54,299 INFO L280 TraceCheckUtils]: 7: Hoare triple {2122#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {2123#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:54,300 INFO L280 TraceCheckUtils]: 8: Hoare triple {2123#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2123#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:54,301 INFO L280 TraceCheckUtils]: 9: Hoare triple {2123#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2124#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:54,303 INFO L280 TraceCheckUtils]: 10: Hoare triple {2124#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2124#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:54,304 INFO L280 TraceCheckUtils]: 11: Hoare triple {2124#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2125#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-17 22:48:54,305 INFO L280 TraceCheckUtils]: 12: Hoare triple {2125#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2125#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-17 22:48:54,306 INFO L280 TraceCheckUtils]: 13: Hoare triple {2125#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2126#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:54,307 INFO L280 TraceCheckUtils]: 14: Hoare triple {2126#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2126#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:54,308 INFO L280 TraceCheckUtils]: 15: Hoare triple {2126#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2127#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:54,309 INFO L280 TraceCheckUtils]: 16: Hoare triple {2127#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {2128#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:54,310 INFO L280 TraceCheckUtils]: 17: Hoare triple {2128#(not (= |init_#in~size| 1000000))} assume true; {2128#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:54,311 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2128#(not (= |init_#in~size| 1000000))} {2104#true} #76#return; {2105#false} is VALID [2020-07-17 22:48:54,312 INFO L280 TraceCheckUtils]: 19: Hoare triple {2105#false} ~i~1 := 0; {2105#false} is VALID [2020-07-17 22:48:54,312 INFO L280 TraceCheckUtils]: 20: Hoare triple {2105#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2105#false} is VALID [2020-07-17 22:48:54,312 INFO L280 TraceCheckUtils]: 21: Hoare triple {2105#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2105#false} is VALID [2020-07-17 22:48:54,312 INFO L280 TraceCheckUtils]: 22: Hoare triple {2105#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2105#false} is VALID [2020-07-17 22:48:54,313 INFO L280 TraceCheckUtils]: 23: Hoare triple {2105#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2105#false} is VALID [2020-07-17 22:48:54,313 INFO L280 TraceCheckUtils]: 24: Hoare triple {2105#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2105#false} is VALID [2020-07-17 22:48:54,313 INFO L280 TraceCheckUtils]: 25: Hoare triple {2105#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2105#false} is VALID [2020-07-17 22:48:54,313 INFO L280 TraceCheckUtils]: 26: Hoare triple {2105#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2105#false} is VALID [2020-07-17 22:48:54,313 INFO L280 TraceCheckUtils]: 27: Hoare triple {2105#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2105#false} is VALID [2020-07-17 22:48:54,314 INFO L280 TraceCheckUtils]: 28: Hoare triple {2105#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2105#false} is VALID [2020-07-17 22:48:54,314 INFO L280 TraceCheckUtils]: 29: Hoare triple {2105#false} assume !(~i~1 < 1000000); {2105#false} is VALID [2020-07-17 22:48:54,314 INFO L280 TraceCheckUtils]: 30: Hoare triple {2105#false} ~i~1 := 0; {2105#false} is VALID [2020-07-17 22:48:54,314 INFO L280 TraceCheckUtils]: 31: Hoare triple {2105#false} assume !!(~i~1 < 1000000); {2105#false} is VALID [2020-07-17 22:48:54,315 INFO L280 TraceCheckUtils]: 32: Hoare triple {2105#false} assume !(0 == ~flag~0); {2105#false} is VALID [2020-07-17 22:48:54,315 INFO L280 TraceCheckUtils]: 33: Hoare triple {2105#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2105#false} is VALID [2020-07-17 22:48:54,315 INFO L280 TraceCheckUtils]: 34: Hoare triple {2105#false} assume !!(~i~1 < 1000000); {2105#false} is VALID [2020-07-17 22:48:54,315 INFO L280 TraceCheckUtils]: 35: Hoare triple {2105#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2105#false} is VALID [2020-07-17 22:48:54,315 INFO L263 TraceCheckUtils]: 36: Hoare triple {2105#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {2105#false} is VALID [2020-07-17 22:48:54,316 INFO L280 TraceCheckUtils]: 37: Hoare triple {2105#false} ~cond := #in~cond; {2105#false} is VALID [2020-07-17 22:48:54,316 INFO L280 TraceCheckUtils]: 38: Hoare triple {2105#false} assume 0 == ~cond; {2105#false} is VALID [2020-07-17 22:48:54,316 INFO L280 TraceCheckUtils]: 39: Hoare triple {2105#false} assume !false; {2105#false} is VALID [2020-07-17 22:48:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-07-17 22:48:54,320 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812379861] [2020-07-17 22:48:54,321 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360920989] [2020-07-17 22:48:54,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:54,383 INFO L264 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:48:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:54,414 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:54,470 INFO L263 TraceCheckUtils]: 0: Hoare triple {2104#true} call ULTIMATE.init(); {2104#true} is VALID [2020-07-17 22:48:54,471 INFO L280 TraceCheckUtils]: 1: Hoare triple {2104#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2104#true} is VALID [2020-07-17 22:48:54,471 INFO L280 TraceCheckUtils]: 2: Hoare triple {2104#true} assume true; {2104#true} is VALID [2020-07-17 22:48:54,471 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2104#true} {2104#true} #80#return; {2104#true} is VALID [2020-07-17 22:48:54,472 INFO L263 TraceCheckUtils]: 4: Hoare triple {2104#true} call #t~ret6 := main(); {2104#true} is VALID [2020-07-17 22:48:54,473 INFO L280 TraceCheckUtils]: 5: Hoare triple {2104#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {2147#(= 0 main_~flag~0)} is VALID [2020-07-17 22:48:54,474 INFO L263 TraceCheckUtils]: 6: Hoare triple {2147#(= 0 main_~flag~0)} call init(~#a~0.base, ~#a~0.offset, 1000000); {2104#true} is VALID [2020-07-17 22:48:54,474 INFO L280 TraceCheckUtils]: 7: Hoare triple {2104#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {2104#true} is VALID [2020-07-17 22:48:54,474 INFO L280 TraceCheckUtils]: 8: Hoare triple {2104#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2104#true} is VALID [2020-07-17 22:48:54,475 INFO L280 TraceCheckUtils]: 9: Hoare triple {2104#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2104#true} is VALID [2020-07-17 22:48:54,475 INFO L280 TraceCheckUtils]: 10: Hoare triple {2104#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2104#true} is VALID [2020-07-17 22:48:54,475 INFO L280 TraceCheckUtils]: 11: Hoare triple {2104#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2104#true} is VALID [2020-07-17 22:48:54,475 INFO L280 TraceCheckUtils]: 12: Hoare triple {2104#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2104#true} is VALID [2020-07-17 22:48:54,475 INFO L280 TraceCheckUtils]: 13: Hoare triple {2104#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2104#true} is VALID [2020-07-17 22:48:54,476 INFO L280 TraceCheckUtils]: 14: Hoare triple {2104#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2104#true} is VALID [2020-07-17 22:48:54,476 INFO L280 TraceCheckUtils]: 15: Hoare triple {2104#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2104#true} is VALID [2020-07-17 22:48:54,476 INFO L280 TraceCheckUtils]: 16: Hoare triple {2104#true} assume !(~i~0 < ~size); {2104#true} is VALID [2020-07-17 22:48:54,476 INFO L280 TraceCheckUtils]: 17: Hoare triple {2104#true} assume true; {2104#true} is VALID [2020-07-17 22:48:54,486 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2104#true} {2147#(= 0 main_~flag~0)} #76#return; {2147#(= 0 main_~flag~0)} is VALID [2020-07-17 22:48:54,487 INFO L280 TraceCheckUtils]: 19: Hoare triple {2147#(= 0 main_~flag~0)} ~i~1 := 0; {2147#(= 0 main_~flag~0)} is VALID [2020-07-17 22:48:54,487 INFO L280 TraceCheckUtils]: 20: Hoare triple {2147#(= 0 main_~flag~0)} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2147#(= 0 main_~flag~0)} is VALID [2020-07-17 22:48:54,488 INFO L280 TraceCheckUtils]: 21: Hoare triple {2147#(= 0 main_~flag~0)} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2147#(= 0 main_~flag~0)} is VALID [2020-07-17 22:48:54,489 INFO L280 TraceCheckUtils]: 22: Hoare triple {2147#(= 0 main_~flag~0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2147#(= 0 main_~flag~0)} is VALID [2020-07-17 22:48:54,489 INFO L280 TraceCheckUtils]: 23: Hoare triple {2147#(= 0 main_~flag~0)} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2147#(= 0 main_~flag~0)} is VALID [2020-07-17 22:48:54,490 INFO L280 TraceCheckUtils]: 24: Hoare triple {2147#(= 0 main_~flag~0)} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2147#(= 0 main_~flag~0)} is VALID [2020-07-17 22:48:54,490 INFO L280 TraceCheckUtils]: 25: Hoare triple {2147#(= 0 main_~flag~0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2147#(= 0 main_~flag~0)} is VALID [2020-07-17 22:48:54,491 INFO L280 TraceCheckUtils]: 26: Hoare triple {2147#(= 0 main_~flag~0)} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2147#(= 0 main_~flag~0)} is VALID [2020-07-17 22:48:54,492 INFO L280 TraceCheckUtils]: 27: Hoare triple {2147#(= 0 main_~flag~0)} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2147#(= 0 main_~flag~0)} is VALID [2020-07-17 22:48:54,493 INFO L280 TraceCheckUtils]: 28: Hoare triple {2147#(= 0 main_~flag~0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2147#(= 0 main_~flag~0)} is VALID [2020-07-17 22:48:54,497 INFO L280 TraceCheckUtils]: 29: Hoare triple {2147#(= 0 main_~flag~0)} assume !(~i~1 < 1000000); {2147#(= 0 main_~flag~0)} is VALID [2020-07-17 22:48:54,497 INFO L280 TraceCheckUtils]: 30: Hoare triple {2147#(= 0 main_~flag~0)} ~i~1 := 0; {2147#(= 0 main_~flag~0)} is VALID [2020-07-17 22:48:54,498 INFO L280 TraceCheckUtils]: 31: Hoare triple {2147#(= 0 main_~flag~0)} assume !!(~i~1 < 1000000); {2147#(= 0 main_~flag~0)} is VALID [2020-07-17 22:48:54,499 INFO L280 TraceCheckUtils]: 32: Hoare triple {2147#(= 0 main_~flag~0)} assume !(0 == ~flag~0); {2105#false} is VALID [2020-07-17 22:48:54,499 INFO L280 TraceCheckUtils]: 33: Hoare triple {2105#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2105#false} is VALID [2020-07-17 22:48:54,499 INFO L280 TraceCheckUtils]: 34: Hoare triple {2105#false} assume !!(~i~1 < 1000000); {2105#false} is VALID [2020-07-17 22:48:54,499 INFO L280 TraceCheckUtils]: 35: Hoare triple {2105#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2105#false} is VALID [2020-07-17 22:48:54,500 INFO L263 TraceCheckUtils]: 36: Hoare triple {2105#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {2105#false} is VALID [2020-07-17 22:48:54,500 INFO L280 TraceCheckUtils]: 37: Hoare triple {2105#false} ~cond := #in~cond; {2105#false} is VALID [2020-07-17 22:48:54,500 INFO L280 TraceCheckUtils]: 38: Hoare triple {2105#false} assume 0 == ~cond; {2105#false} is VALID [2020-07-17 22:48:54,500 INFO L280 TraceCheckUtils]: 39: Hoare triple {2105#false} assume !false; {2105#false} is VALID [2020-07-17 22:48:54,514 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-07-17 22:48:54,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:48:54,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2020-07-17 22:48:54,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477601102] [2020-07-17 22:48:54,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2020-07-17 22:48:54,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:54,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:48:54,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:54,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:48:54,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:54,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:48:54,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:48:54,552 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 3 states. [2020-07-17 22:48:54,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:54,640 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2020-07-17 22:48:54,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:48:54,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2020-07-17 22:48:54,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:48:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2020-07-17 22:48:54,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:48:54,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2020-07-17 22:48:54,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2020-07-17 22:48:54,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:54,690 INFO L225 Difference]: With dead ends: 60 [2020-07-17 22:48:54,691 INFO L226 Difference]: Without dead ends: 49 [2020-07-17 22:48:54,691 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:48:54,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-17 22:48:54,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-17 22:48:54,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:54,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2020-07-17 22:48:54,741 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-17 22:48:54,741 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-17 22:48:54,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:54,744 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-17 22:48:54,744 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-17 22:48:54,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:54,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:54,745 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-17 22:48:54,745 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-17 22:48:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:54,747 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-17 22:48:54,747 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-17 22:48:54,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:54,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:54,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:54,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:54,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-17 22:48:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2020-07-17 22:48:54,750 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 40 [2020-07-17 22:48:54,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:54,750 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2020-07-17 22:48:54,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:48:54,750 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-17 22:48:54,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-17 22:48:54,751 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:54,751 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:48:54,965 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:54,966 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:54,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:54,967 INFO L82 PathProgramCache]: Analyzing trace with hash 379746771, now seen corresponding path program 1 times [2020-07-17 22:48:54,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:54,968 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128536246] [2020-07-17 22:48:54,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:55,039 INFO L280 TraceCheckUtils]: 0: Hoare triple {2522#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2501#true} is VALID [2020-07-17 22:48:55,039 INFO L280 TraceCheckUtils]: 1: Hoare triple {2501#true} assume true; {2501#true} is VALID [2020-07-17 22:48:55,039 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2501#true} {2501#true} #80#return; {2501#true} is VALID [2020-07-17 22:48:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:55,320 INFO L280 TraceCheckUtils]: 0: Hoare triple {2523#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {2524#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:55,322 INFO L280 TraceCheckUtils]: 1: Hoare triple {2524#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2524#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:55,324 INFO L280 TraceCheckUtils]: 2: Hoare triple {2524#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2525#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:55,326 INFO L280 TraceCheckUtils]: 3: Hoare triple {2525#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2525#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:55,327 INFO L280 TraceCheckUtils]: 4: Hoare triple {2525#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2526#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-17 22:48:55,329 INFO L280 TraceCheckUtils]: 5: Hoare triple {2526#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2526#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-17 22:48:55,330 INFO L280 TraceCheckUtils]: 6: Hoare triple {2526#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2527#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:55,331 INFO L280 TraceCheckUtils]: 7: Hoare triple {2527#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2527#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:55,333 INFO L280 TraceCheckUtils]: 8: Hoare triple {2527#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2528#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:55,334 INFO L280 TraceCheckUtils]: 9: Hoare triple {2528#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {2529#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:55,334 INFO L280 TraceCheckUtils]: 10: Hoare triple {2529#(not (= |init_#in~size| 1000000))} assume true; {2529#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:55,336 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2529#(not (= |init_#in~size| 1000000))} {2501#true} #76#return; {2502#false} is VALID [2020-07-17 22:48:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:55,342 INFO L280 TraceCheckUtils]: 0: Hoare triple {2501#true} ~cond := #in~cond; {2501#true} is VALID [2020-07-17 22:48:55,343 INFO L280 TraceCheckUtils]: 1: Hoare triple {2501#true} assume !(0 == ~cond); {2501#true} is VALID [2020-07-17 22:48:55,343 INFO L280 TraceCheckUtils]: 2: Hoare triple {2501#true} assume true; {2501#true} is VALID [2020-07-17 22:48:55,343 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2501#true} {2502#false} #78#return; {2502#false} is VALID [2020-07-17 22:48:55,344 INFO L263 TraceCheckUtils]: 0: Hoare triple {2501#true} call ULTIMATE.init(); {2522#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:48:55,345 INFO L280 TraceCheckUtils]: 1: Hoare triple {2522#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2501#true} is VALID [2020-07-17 22:48:55,345 INFO L280 TraceCheckUtils]: 2: Hoare triple {2501#true} assume true; {2501#true} is VALID [2020-07-17 22:48:55,345 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2501#true} {2501#true} #80#return; {2501#true} is VALID [2020-07-17 22:48:55,346 INFO L263 TraceCheckUtils]: 4: Hoare triple {2501#true} call #t~ret6 := main(); {2501#true} is VALID [2020-07-17 22:48:55,346 INFO L280 TraceCheckUtils]: 5: Hoare triple {2501#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {2501#true} is VALID [2020-07-17 22:48:55,348 INFO L263 TraceCheckUtils]: 6: Hoare triple {2501#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {2523#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:48:55,349 INFO L280 TraceCheckUtils]: 7: Hoare triple {2523#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {2524#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:55,351 INFO L280 TraceCheckUtils]: 8: Hoare triple {2524#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2524#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:55,352 INFO L280 TraceCheckUtils]: 9: Hoare triple {2524#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2525#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:55,354 INFO L280 TraceCheckUtils]: 10: Hoare triple {2525#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2525#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:55,355 INFO L280 TraceCheckUtils]: 11: Hoare triple {2525#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2526#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-17 22:48:55,357 INFO L280 TraceCheckUtils]: 12: Hoare triple {2526#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2526#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-17 22:48:55,358 INFO L280 TraceCheckUtils]: 13: Hoare triple {2526#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2527#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:55,359 INFO L280 TraceCheckUtils]: 14: Hoare triple {2527#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2527#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:55,361 INFO L280 TraceCheckUtils]: 15: Hoare triple {2527#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2528#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:55,362 INFO L280 TraceCheckUtils]: 16: Hoare triple {2528#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {2529#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:55,363 INFO L280 TraceCheckUtils]: 17: Hoare triple {2529#(not (= |init_#in~size| 1000000))} assume true; {2529#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:55,365 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2529#(not (= |init_#in~size| 1000000))} {2501#true} #76#return; {2502#false} is VALID [2020-07-17 22:48:55,365 INFO L280 TraceCheckUtils]: 19: Hoare triple {2502#false} ~i~1 := 0; {2502#false} is VALID [2020-07-17 22:48:55,365 INFO L280 TraceCheckUtils]: 20: Hoare triple {2502#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2502#false} is VALID [2020-07-17 22:48:55,365 INFO L280 TraceCheckUtils]: 21: Hoare triple {2502#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2502#false} is VALID [2020-07-17 22:48:55,366 INFO L280 TraceCheckUtils]: 22: Hoare triple {2502#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2502#false} is VALID [2020-07-17 22:48:55,366 INFO L280 TraceCheckUtils]: 23: Hoare triple {2502#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2502#false} is VALID [2020-07-17 22:48:55,366 INFO L280 TraceCheckUtils]: 24: Hoare triple {2502#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2502#false} is VALID [2020-07-17 22:48:55,366 INFO L280 TraceCheckUtils]: 25: Hoare triple {2502#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2502#false} is VALID [2020-07-17 22:48:55,366 INFO L280 TraceCheckUtils]: 26: Hoare triple {2502#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2502#false} is VALID [2020-07-17 22:48:55,367 INFO L280 TraceCheckUtils]: 27: Hoare triple {2502#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2502#false} is VALID [2020-07-17 22:48:55,367 INFO L280 TraceCheckUtils]: 28: Hoare triple {2502#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2502#false} is VALID [2020-07-17 22:48:55,367 INFO L280 TraceCheckUtils]: 29: Hoare triple {2502#false} assume !(~i~1 < 1000000); {2502#false} is VALID [2020-07-17 22:48:55,367 INFO L280 TraceCheckUtils]: 30: Hoare triple {2502#false} ~i~1 := 0; {2502#false} is VALID [2020-07-17 22:48:55,367 INFO L280 TraceCheckUtils]: 31: Hoare triple {2502#false} assume !!(~i~1 < 1000000); {2502#false} is VALID [2020-07-17 22:48:55,368 INFO L280 TraceCheckUtils]: 32: Hoare triple {2502#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2502#false} is VALID [2020-07-17 22:48:55,368 INFO L263 TraceCheckUtils]: 33: Hoare triple {2502#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {2501#true} is VALID [2020-07-17 22:48:55,368 INFO L280 TraceCheckUtils]: 34: Hoare triple {2501#true} ~cond := #in~cond; {2501#true} is VALID [2020-07-17 22:48:55,368 INFO L280 TraceCheckUtils]: 35: Hoare triple {2501#true} assume !(0 == ~cond); {2501#true} is VALID [2020-07-17 22:48:55,368 INFO L280 TraceCheckUtils]: 36: Hoare triple {2501#true} assume true; {2501#true} is VALID [2020-07-17 22:48:55,369 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2501#true} {2502#false} #78#return; {2502#false} is VALID [2020-07-17 22:48:55,369 INFO L280 TraceCheckUtils]: 38: Hoare triple {2502#false} havoc #t~mem5.base, #t~mem5.offset; {2502#false} is VALID [2020-07-17 22:48:55,369 INFO L280 TraceCheckUtils]: 39: Hoare triple {2502#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2502#false} is VALID [2020-07-17 22:48:55,369 INFO L280 TraceCheckUtils]: 40: Hoare triple {2502#false} assume !!(~i~1 < 1000000); {2502#false} is VALID [2020-07-17 22:48:55,369 INFO L280 TraceCheckUtils]: 41: Hoare triple {2502#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2502#false} is VALID [2020-07-17 22:48:55,370 INFO L263 TraceCheckUtils]: 42: Hoare triple {2502#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {2502#false} is VALID [2020-07-17 22:48:55,370 INFO L280 TraceCheckUtils]: 43: Hoare triple {2502#false} ~cond := #in~cond; {2502#false} is VALID [2020-07-17 22:48:55,370 INFO L280 TraceCheckUtils]: 44: Hoare triple {2502#false} assume 0 == ~cond; {2502#false} is VALID [2020-07-17 22:48:55,370 INFO L280 TraceCheckUtils]: 45: Hoare triple {2502#false} assume !false; {2502#false} is VALID [2020-07-17 22:48:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-17 22:48:55,374 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128536246] [2020-07-17 22:48:55,374 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73026485] [2020-07-17 22:48:55,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:55,441 INFO L264 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:48:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:55,466 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:55,680 INFO L263 TraceCheckUtils]: 0: Hoare triple {2501#true} call ULTIMATE.init(); {2501#true} is VALID [2020-07-17 22:48:55,681 INFO L280 TraceCheckUtils]: 1: Hoare triple {2501#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2501#true} is VALID [2020-07-17 22:48:55,681 INFO L280 TraceCheckUtils]: 2: Hoare triple {2501#true} assume true; {2501#true} is VALID [2020-07-17 22:48:55,681 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2501#true} {2501#true} #80#return; {2501#true} is VALID [2020-07-17 22:48:55,681 INFO L263 TraceCheckUtils]: 4: Hoare triple {2501#true} call #t~ret6 := main(); {2501#true} is VALID [2020-07-17 22:48:55,682 INFO L280 TraceCheckUtils]: 5: Hoare triple {2501#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {2501#true} is VALID [2020-07-17 22:48:55,682 INFO L263 TraceCheckUtils]: 6: Hoare triple {2501#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {2501#true} is VALID [2020-07-17 22:48:55,682 INFO L280 TraceCheckUtils]: 7: Hoare triple {2501#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {2554#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} is VALID [2020-07-17 22:48:55,683 INFO L280 TraceCheckUtils]: 8: Hoare triple {2554#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2554#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} is VALID [2020-07-17 22:48:55,684 INFO L280 TraceCheckUtils]: 9: Hoare triple {2554#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2561#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} is VALID [2020-07-17 22:48:55,685 INFO L280 TraceCheckUtils]: 10: Hoare triple {2561#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2561#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} is VALID [2020-07-17 22:48:55,686 INFO L280 TraceCheckUtils]: 11: Hoare triple {2561#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2568#(and (<= |init_#in~size| init_~size) (<= init_~i~0 2))} is VALID [2020-07-17 22:48:55,687 INFO L280 TraceCheckUtils]: 12: Hoare triple {2568#(and (<= |init_#in~size| init_~size) (<= init_~i~0 2))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2568#(and (<= |init_#in~size| init_~size) (<= init_~i~0 2))} is VALID [2020-07-17 22:48:55,688 INFO L280 TraceCheckUtils]: 13: Hoare triple {2568#(and (<= |init_#in~size| init_~size) (<= init_~i~0 2))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2575#(and (<= |init_#in~size| init_~size) (<= init_~i~0 3))} is VALID [2020-07-17 22:48:55,689 INFO L280 TraceCheckUtils]: 14: Hoare triple {2575#(and (<= |init_#in~size| init_~size) (<= init_~i~0 3))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2575#(and (<= |init_#in~size| init_~size) (<= init_~i~0 3))} is VALID [2020-07-17 22:48:55,690 INFO L280 TraceCheckUtils]: 15: Hoare triple {2575#(and (<= |init_#in~size| init_~size) (<= init_~i~0 3))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2582#(and (<= init_~i~0 4) (<= |init_#in~size| init_~size))} is VALID [2020-07-17 22:48:55,691 INFO L280 TraceCheckUtils]: 16: Hoare triple {2582#(and (<= init_~i~0 4) (<= |init_#in~size| init_~size))} assume !(~i~0 < ~size); {2586#(<= |init_#in~size| 4)} is VALID [2020-07-17 22:48:55,691 INFO L280 TraceCheckUtils]: 17: Hoare triple {2586#(<= |init_#in~size| 4)} assume true; {2586#(<= |init_#in~size| 4)} is VALID [2020-07-17 22:48:55,692 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2586#(<= |init_#in~size| 4)} {2501#true} #76#return; {2502#false} is VALID [2020-07-17 22:48:55,693 INFO L280 TraceCheckUtils]: 19: Hoare triple {2502#false} ~i~1 := 0; {2502#false} is VALID [2020-07-17 22:48:55,693 INFO L280 TraceCheckUtils]: 20: Hoare triple {2502#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2502#false} is VALID [2020-07-17 22:48:55,693 INFO L280 TraceCheckUtils]: 21: Hoare triple {2502#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2502#false} is VALID [2020-07-17 22:48:55,693 INFO L280 TraceCheckUtils]: 22: Hoare triple {2502#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2502#false} is VALID [2020-07-17 22:48:55,693 INFO L280 TraceCheckUtils]: 23: Hoare triple {2502#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2502#false} is VALID [2020-07-17 22:48:55,694 INFO L280 TraceCheckUtils]: 24: Hoare triple {2502#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2502#false} is VALID [2020-07-17 22:48:55,694 INFO L280 TraceCheckUtils]: 25: Hoare triple {2502#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2502#false} is VALID [2020-07-17 22:48:55,694 INFO L280 TraceCheckUtils]: 26: Hoare triple {2502#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2502#false} is VALID [2020-07-17 22:48:55,694 INFO L280 TraceCheckUtils]: 27: Hoare triple {2502#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2502#false} is VALID [2020-07-17 22:48:55,695 INFO L280 TraceCheckUtils]: 28: Hoare triple {2502#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2502#false} is VALID [2020-07-17 22:48:55,695 INFO L280 TraceCheckUtils]: 29: Hoare triple {2502#false} assume !(~i~1 < 1000000); {2502#false} is VALID [2020-07-17 22:48:55,695 INFO L280 TraceCheckUtils]: 30: Hoare triple {2502#false} ~i~1 := 0; {2502#false} is VALID [2020-07-17 22:48:55,695 INFO L280 TraceCheckUtils]: 31: Hoare triple {2502#false} assume !!(~i~1 < 1000000); {2502#false} is VALID [2020-07-17 22:48:55,695 INFO L280 TraceCheckUtils]: 32: Hoare triple {2502#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2502#false} is VALID [2020-07-17 22:48:55,696 INFO L263 TraceCheckUtils]: 33: Hoare triple {2502#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {2502#false} is VALID [2020-07-17 22:48:55,696 INFO L280 TraceCheckUtils]: 34: Hoare triple {2502#false} ~cond := #in~cond; {2502#false} is VALID [2020-07-17 22:48:55,696 INFO L280 TraceCheckUtils]: 35: Hoare triple {2502#false} assume !(0 == ~cond); {2502#false} is VALID [2020-07-17 22:48:55,696 INFO L280 TraceCheckUtils]: 36: Hoare triple {2502#false} assume true; {2502#false} is VALID [2020-07-17 22:48:55,696 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2502#false} {2502#false} #78#return; {2502#false} is VALID [2020-07-17 22:48:55,697 INFO L280 TraceCheckUtils]: 38: Hoare triple {2502#false} havoc #t~mem5.base, #t~mem5.offset; {2502#false} is VALID [2020-07-17 22:48:55,697 INFO L280 TraceCheckUtils]: 39: Hoare triple {2502#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2502#false} is VALID [2020-07-17 22:48:55,697 INFO L280 TraceCheckUtils]: 40: Hoare triple {2502#false} assume !!(~i~1 < 1000000); {2502#false} is VALID [2020-07-17 22:48:55,697 INFO L280 TraceCheckUtils]: 41: Hoare triple {2502#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2502#false} is VALID [2020-07-17 22:48:55,697 INFO L263 TraceCheckUtils]: 42: Hoare triple {2502#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {2502#false} is VALID [2020-07-17 22:48:55,698 INFO L280 TraceCheckUtils]: 43: Hoare triple {2502#false} ~cond := #in~cond; {2502#false} is VALID [2020-07-17 22:48:55,698 INFO L280 TraceCheckUtils]: 44: Hoare triple {2502#false} assume 0 == ~cond; {2502#false} is VALID [2020-07-17 22:48:55,698 INFO L280 TraceCheckUtils]: 45: Hoare triple {2502#false} assume !false; {2502#false} is VALID [2020-07-17 22:48:55,700 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-17 22:48:55,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:48:55,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2020-07-17 22:48:55,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581643302] [2020-07-17 22:48:55,704 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2020-07-17 22:48:55,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:55,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-17 22:48:55,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:55,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-17 22:48:55,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:55,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-17 22:48:55,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-07-17 22:48:55,768 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 16 states. [2020-07-17 22:48:56,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:56,583 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2020-07-17 22:48:56,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:48:56,583 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2020-07-17 22:48:56,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-17 22:48:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2020-07-17 22:48:56,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-17 22:48:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2020-07-17 22:48:56,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 60 transitions. [2020-07-17 22:48:56,661 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:56,663 INFO L225 Difference]: With dead ends: 84 [2020-07-17 22:48:56,663 INFO L226 Difference]: Without dead ends: 52 [2020-07-17 22:48:56,664 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2020-07-17 22:48:56,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-17 22:48:56,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2020-07-17 22:48:56,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:56,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2020-07-17 22:48:56,715 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2020-07-17 22:48:56,715 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2020-07-17 22:48:56,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:56,717 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-17 22:48:56,717 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-17 22:48:56,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:56,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:56,718 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2020-07-17 22:48:56,718 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2020-07-17 22:48:56,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:56,719 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-17 22:48:56,719 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-17 22:48:56,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:56,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:56,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:56,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:56,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-17 22:48:56,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2020-07-17 22:48:56,722 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 46 [2020-07-17 22:48:56,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:56,722 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2020-07-17 22:48:56,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-17 22:48:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2020-07-17 22:48:56,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-17 22:48:56,723 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:56,723 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:48:56,929 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:56,930 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:56,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:56,931 INFO L82 PathProgramCache]: Analyzing trace with hash -538278827, now seen corresponding path program 2 times [2020-07-17 22:48:56,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:56,932 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082465709] [2020-07-17 22:48:56,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:56,993 INFO L280 TraceCheckUtils]: 0: Hoare triple {3006#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2983#true} is VALID [2020-07-17 22:48:56,993 INFO L280 TraceCheckUtils]: 1: Hoare triple {2983#true} assume true; {2983#true} is VALID [2020-07-17 22:48:56,994 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2983#true} {2983#true} #80#return; {2983#true} is VALID [2020-07-17 22:48:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:57,313 INFO L280 TraceCheckUtils]: 0: Hoare triple {3007#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {3008#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:57,314 INFO L280 TraceCheckUtils]: 1: Hoare triple {3008#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3008#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:57,315 INFO L280 TraceCheckUtils]: 2: Hoare triple {3008#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3009#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:57,317 INFO L280 TraceCheckUtils]: 3: Hoare triple {3009#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3009#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:57,318 INFO L280 TraceCheckUtils]: 4: Hoare triple {3009#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3010#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-17 22:48:57,319 INFO L280 TraceCheckUtils]: 5: Hoare triple {3010#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3010#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-17 22:48:57,319 INFO L280 TraceCheckUtils]: 6: Hoare triple {3010#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3011#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:57,320 INFO L280 TraceCheckUtils]: 7: Hoare triple {3011#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3011#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:57,321 INFO L280 TraceCheckUtils]: 8: Hoare triple {3011#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3012#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:57,321 INFO L280 TraceCheckUtils]: 9: Hoare triple {3012#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3012#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:57,322 INFO L280 TraceCheckUtils]: 10: Hoare triple {3012#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3013#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:57,323 INFO L280 TraceCheckUtils]: 11: Hoare triple {3013#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {3014#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:57,323 INFO L280 TraceCheckUtils]: 12: Hoare triple {3014#(not (= |init_#in~size| 1000000))} assume true; {3014#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:57,325 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3014#(not (= |init_#in~size| 1000000))} {2983#true} #76#return; {2984#false} is VALID [2020-07-17 22:48:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:57,330 INFO L280 TraceCheckUtils]: 0: Hoare triple {2983#true} ~cond := #in~cond; {2983#true} is VALID [2020-07-17 22:48:57,330 INFO L280 TraceCheckUtils]: 1: Hoare triple {2983#true} assume !(0 == ~cond); {2983#true} is VALID [2020-07-17 22:48:57,330 INFO L280 TraceCheckUtils]: 2: Hoare triple {2983#true} assume true; {2983#true} is VALID [2020-07-17 22:48:57,330 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2983#true} {2984#false} #78#return; {2984#false} is VALID [2020-07-17 22:48:57,331 INFO L263 TraceCheckUtils]: 0: Hoare triple {2983#true} call ULTIMATE.init(); {3006#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:48:57,331 INFO L280 TraceCheckUtils]: 1: Hoare triple {3006#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2983#true} is VALID [2020-07-17 22:48:57,331 INFO L280 TraceCheckUtils]: 2: Hoare triple {2983#true} assume true; {2983#true} is VALID [2020-07-17 22:48:57,331 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2983#true} {2983#true} #80#return; {2983#true} is VALID [2020-07-17 22:48:57,332 INFO L263 TraceCheckUtils]: 4: Hoare triple {2983#true} call #t~ret6 := main(); {2983#true} is VALID [2020-07-17 22:48:57,332 INFO L280 TraceCheckUtils]: 5: Hoare triple {2983#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {2983#true} is VALID [2020-07-17 22:48:57,333 INFO L263 TraceCheckUtils]: 6: Hoare triple {2983#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {3007#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:48:57,334 INFO L280 TraceCheckUtils]: 7: Hoare triple {3007#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {3008#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:57,334 INFO L280 TraceCheckUtils]: 8: Hoare triple {3008#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3008#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:57,335 INFO L280 TraceCheckUtils]: 9: Hoare triple {3008#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3009#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:57,339 INFO L280 TraceCheckUtils]: 10: Hoare triple {3009#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3009#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:57,340 INFO L280 TraceCheckUtils]: 11: Hoare triple {3009#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3010#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-17 22:48:57,341 INFO L280 TraceCheckUtils]: 12: Hoare triple {3010#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3010#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-17 22:48:57,342 INFO L280 TraceCheckUtils]: 13: Hoare triple {3010#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3011#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:57,342 INFO L280 TraceCheckUtils]: 14: Hoare triple {3011#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3011#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:57,343 INFO L280 TraceCheckUtils]: 15: Hoare triple {3011#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3012#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:57,344 INFO L280 TraceCheckUtils]: 16: Hoare triple {3012#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3012#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:57,345 INFO L280 TraceCheckUtils]: 17: Hoare triple {3012#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3013#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:57,345 INFO L280 TraceCheckUtils]: 18: Hoare triple {3013#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {3014#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:57,346 INFO L280 TraceCheckUtils]: 19: Hoare triple {3014#(not (= |init_#in~size| 1000000))} assume true; {3014#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:57,347 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3014#(not (= |init_#in~size| 1000000))} {2983#true} #76#return; {2984#false} is VALID [2020-07-17 22:48:57,347 INFO L280 TraceCheckUtils]: 21: Hoare triple {2984#false} ~i~1 := 0; {2984#false} is VALID [2020-07-17 22:48:57,347 INFO L280 TraceCheckUtils]: 22: Hoare triple {2984#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2984#false} is VALID [2020-07-17 22:48:57,348 INFO L280 TraceCheckUtils]: 23: Hoare triple {2984#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2984#false} is VALID [2020-07-17 22:48:57,348 INFO L280 TraceCheckUtils]: 24: Hoare triple {2984#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2984#false} is VALID [2020-07-17 22:48:57,348 INFO L280 TraceCheckUtils]: 25: Hoare triple {2984#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2984#false} is VALID [2020-07-17 22:48:57,348 INFO L280 TraceCheckUtils]: 26: Hoare triple {2984#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2984#false} is VALID [2020-07-17 22:48:57,348 INFO L280 TraceCheckUtils]: 27: Hoare triple {2984#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2984#false} is VALID [2020-07-17 22:48:57,348 INFO L280 TraceCheckUtils]: 28: Hoare triple {2984#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2984#false} is VALID [2020-07-17 22:48:57,348 INFO L280 TraceCheckUtils]: 29: Hoare triple {2984#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2984#false} is VALID [2020-07-17 22:48:57,348 INFO L280 TraceCheckUtils]: 30: Hoare triple {2984#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2984#false} is VALID [2020-07-17 22:48:57,349 INFO L280 TraceCheckUtils]: 31: Hoare triple {2984#false} assume !(~i~1 < 1000000); {2984#false} is VALID [2020-07-17 22:48:57,349 INFO L280 TraceCheckUtils]: 32: Hoare triple {2984#false} ~i~1 := 0; {2984#false} is VALID [2020-07-17 22:48:57,349 INFO L280 TraceCheckUtils]: 33: Hoare triple {2984#false} assume !!(~i~1 < 1000000); {2984#false} is VALID [2020-07-17 22:48:57,349 INFO L280 TraceCheckUtils]: 34: Hoare triple {2984#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2984#false} is VALID [2020-07-17 22:48:57,349 INFO L263 TraceCheckUtils]: 35: Hoare triple {2984#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {2983#true} is VALID [2020-07-17 22:48:57,349 INFO L280 TraceCheckUtils]: 36: Hoare triple {2983#true} ~cond := #in~cond; {2983#true} is VALID [2020-07-17 22:48:57,349 INFO L280 TraceCheckUtils]: 37: Hoare triple {2983#true} assume !(0 == ~cond); {2983#true} is VALID [2020-07-17 22:48:57,350 INFO L280 TraceCheckUtils]: 38: Hoare triple {2983#true} assume true; {2983#true} is VALID [2020-07-17 22:48:57,350 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2983#true} {2984#false} #78#return; {2984#false} is VALID [2020-07-17 22:48:57,350 INFO L280 TraceCheckUtils]: 40: Hoare triple {2984#false} havoc #t~mem5.base, #t~mem5.offset; {2984#false} is VALID [2020-07-17 22:48:57,350 INFO L280 TraceCheckUtils]: 41: Hoare triple {2984#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2984#false} is VALID [2020-07-17 22:48:57,350 INFO L280 TraceCheckUtils]: 42: Hoare triple {2984#false} assume !!(~i~1 < 1000000); {2984#false} is VALID [2020-07-17 22:48:57,350 INFO L280 TraceCheckUtils]: 43: Hoare triple {2984#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2984#false} is VALID [2020-07-17 22:48:57,350 INFO L263 TraceCheckUtils]: 44: Hoare triple {2984#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {2984#false} is VALID [2020-07-17 22:48:57,350 INFO L280 TraceCheckUtils]: 45: Hoare triple {2984#false} ~cond := #in~cond; {2984#false} is VALID [2020-07-17 22:48:57,351 INFO L280 TraceCheckUtils]: 46: Hoare triple {2984#false} assume 0 == ~cond; {2984#false} is VALID [2020-07-17 22:48:57,351 INFO L280 TraceCheckUtils]: 47: Hoare triple {2984#false} assume !false; {2984#false} is VALID [2020-07-17 22:48:57,353 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-17 22:48:57,354 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082465709] [2020-07-17 22:48:57,354 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241759472] [2020-07-17 22:48:57,354 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:57,402 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:48:57,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:48:57,404 INFO L264 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-17 22:48:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:57,429 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:57,698 INFO L263 TraceCheckUtils]: 0: Hoare triple {2983#true} call ULTIMATE.init(); {2983#true} is VALID [2020-07-17 22:48:57,699 INFO L280 TraceCheckUtils]: 1: Hoare triple {2983#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2983#true} is VALID [2020-07-17 22:48:57,699 INFO L280 TraceCheckUtils]: 2: Hoare triple {2983#true} assume true; {2983#true} is VALID [2020-07-17 22:48:57,699 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2983#true} {2983#true} #80#return; {2983#true} is VALID [2020-07-17 22:48:57,699 INFO L263 TraceCheckUtils]: 4: Hoare triple {2983#true} call #t~ret6 := main(); {2983#true} is VALID [2020-07-17 22:48:57,700 INFO L280 TraceCheckUtils]: 5: Hoare triple {2983#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {2983#true} is VALID [2020-07-17 22:48:57,700 INFO L263 TraceCheckUtils]: 6: Hoare triple {2983#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {2983#true} is VALID [2020-07-17 22:48:57,702 INFO L280 TraceCheckUtils]: 7: Hoare triple {2983#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {3039#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} is VALID [2020-07-17 22:48:57,710 INFO L280 TraceCheckUtils]: 8: Hoare triple {3039#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3039#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} is VALID [2020-07-17 22:48:57,711 INFO L280 TraceCheckUtils]: 9: Hoare triple {3039#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3046#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} is VALID [2020-07-17 22:48:57,712 INFO L280 TraceCheckUtils]: 10: Hoare triple {3046#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3046#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} is VALID [2020-07-17 22:48:57,713 INFO L280 TraceCheckUtils]: 11: Hoare triple {3046#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3053#(and (<= |init_#in~size| init_~size) (<= init_~i~0 2))} is VALID [2020-07-17 22:48:57,714 INFO L280 TraceCheckUtils]: 12: Hoare triple {3053#(and (<= |init_#in~size| init_~size) (<= init_~i~0 2))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3053#(and (<= |init_#in~size| init_~size) (<= init_~i~0 2))} is VALID [2020-07-17 22:48:57,715 INFO L280 TraceCheckUtils]: 13: Hoare triple {3053#(and (<= |init_#in~size| init_~size) (<= init_~i~0 2))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3060#(and (<= |init_#in~size| init_~size) (<= init_~i~0 3))} is VALID [2020-07-17 22:48:57,716 INFO L280 TraceCheckUtils]: 14: Hoare triple {3060#(and (<= |init_#in~size| init_~size) (<= init_~i~0 3))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3060#(and (<= |init_#in~size| init_~size) (<= init_~i~0 3))} is VALID [2020-07-17 22:48:57,717 INFO L280 TraceCheckUtils]: 15: Hoare triple {3060#(and (<= |init_#in~size| init_~size) (<= init_~i~0 3))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3067#(and (<= init_~i~0 4) (<= |init_#in~size| init_~size))} is VALID [2020-07-17 22:48:57,718 INFO L280 TraceCheckUtils]: 16: Hoare triple {3067#(and (<= init_~i~0 4) (<= |init_#in~size| init_~size))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3067#(and (<= init_~i~0 4) (<= |init_#in~size| init_~size))} is VALID [2020-07-17 22:48:57,719 INFO L280 TraceCheckUtils]: 17: Hoare triple {3067#(and (<= init_~i~0 4) (<= |init_#in~size| init_~size))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3074#(and (<= |init_#in~size| init_~size) (<= init_~i~0 5))} is VALID [2020-07-17 22:48:57,719 INFO L280 TraceCheckUtils]: 18: Hoare triple {3074#(and (<= |init_#in~size| init_~size) (<= init_~i~0 5))} assume !(~i~0 < ~size); {3078#(<= |init_#in~size| 5)} is VALID [2020-07-17 22:48:57,720 INFO L280 TraceCheckUtils]: 19: Hoare triple {3078#(<= |init_#in~size| 5)} assume true; {3078#(<= |init_#in~size| 5)} is VALID [2020-07-17 22:48:57,721 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3078#(<= |init_#in~size| 5)} {2983#true} #76#return; {2984#false} is VALID [2020-07-17 22:48:57,721 INFO L280 TraceCheckUtils]: 21: Hoare triple {2984#false} ~i~1 := 0; {2984#false} is VALID [2020-07-17 22:48:57,721 INFO L280 TraceCheckUtils]: 22: Hoare triple {2984#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2984#false} is VALID [2020-07-17 22:48:57,721 INFO L280 TraceCheckUtils]: 23: Hoare triple {2984#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2984#false} is VALID [2020-07-17 22:48:57,721 INFO L280 TraceCheckUtils]: 24: Hoare triple {2984#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2984#false} is VALID [2020-07-17 22:48:57,721 INFO L280 TraceCheckUtils]: 25: Hoare triple {2984#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2984#false} is VALID [2020-07-17 22:48:57,721 INFO L280 TraceCheckUtils]: 26: Hoare triple {2984#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2984#false} is VALID [2020-07-17 22:48:57,722 INFO L280 TraceCheckUtils]: 27: Hoare triple {2984#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2984#false} is VALID [2020-07-17 22:48:57,722 INFO L280 TraceCheckUtils]: 28: Hoare triple {2984#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2984#false} is VALID [2020-07-17 22:48:57,722 INFO L280 TraceCheckUtils]: 29: Hoare triple {2984#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2984#false} is VALID [2020-07-17 22:48:57,722 INFO L280 TraceCheckUtils]: 30: Hoare triple {2984#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2984#false} is VALID [2020-07-17 22:48:57,722 INFO L280 TraceCheckUtils]: 31: Hoare triple {2984#false} assume !(~i~1 < 1000000); {2984#false} is VALID [2020-07-17 22:48:57,723 INFO L280 TraceCheckUtils]: 32: Hoare triple {2984#false} ~i~1 := 0; {2984#false} is VALID [2020-07-17 22:48:57,723 INFO L280 TraceCheckUtils]: 33: Hoare triple {2984#false} assume !!(~i~1 < 1000000); {2984#false} is VALID [2020-07-17 22:48:57,723 INFO L280 TraceCheckUtils]: 34: Hoare triple {2984#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2984#false} is VALID [2020-07-17 22:48:57,723 INFO L263 TraceCheckUtils]: 35: Hoare triple {2984#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {2984#false} is VALID [2020-07-17 22:48:57,723 INFO L280 TraceCheckUtils]: 36: Hoare triple {2984#false} ~cond := #in~cond; {2984#false} is VALID [2020-07-17 22:48:57,723 INFO L280 TraceCheckUtils]: 37: Hoare triple {2984#false} assume !(0 == ~cond); {2984#false} is VALID [2020-07-17 22:48:57,724 INFO L280 TraceCheckUtils]: 38: Hoare triple {2984#false} assume true; {2984#false} is VALID [2020-07-17 22:48:57,724 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2984#false} {2984#false} #78#return; {2984#false} is VALID [2020-07-17 22:48:57,724 INFO L280 TraceCheckUtils]: 40: Hoare triple {2984#false} havoc #t~mem5.base, #t~mem5.offset; {2984#false} is VALID [2020-07-17 22:48:57,724 INFO L280 TraceCheckUtils]: 41: Hoare triple {2984#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2984#false} is VALID [2020-07-17 22:48:57,724 INFO L280 TraceCheckUtils]: 42: Hoare triple {2984#false} assume !!(~i~1 < 1000000); {2984#false} is VALID [2020-07-17 22:48:57,725 INFO L280 TraceCheckUtils]: 43: Hoare triple {2984#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2984#false} is VALID [2020-07-17 22:48:57,725 INFO L263 TraceCheckUtils]: 44: Hoare triple {2984#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {2984#false} is VALID [2020-07-17 22:48:57,725 INFO L280 TraceCheckUtils]: 45: Hoare triple {2984#false} ~cond := #in~cond; {2984#false} is VALID [2020-07-17 22:48:57,725 INFO L280 TraceCheckUtils]: 46: Hoare triple {2984#false} assume 0 == ~cond; {2984#false} is VALID [2020-07-17 22:48:57,725 INFO L280 TraceCheckUtils]: 47: Hoare triple {2984#false} assume !false; {2984#false} is VALID [2020-07-17 22:48:57,728 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-17 22:48:57,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:48:57,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2020-07-17 22:48:57,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796990342] [2020-07-17 22:48:57,729 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2020-07-17 22:48:57,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:57,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-17 22:48:57,811 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:57,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-17 22:48:57,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:57,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-17 22:48:57,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2020-07-17 22:48:57,813 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 18 states. [2020-07-17 22:48:58,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:58,734 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2020-07-17 22:48:58,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 22:48:58,734 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2020-07-17 22:48:58,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-17 22:48:58,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2020-07-17 22:48:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-17 22:48:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2020-07-17 22:48:58,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 62 transitions. [2020-07-17 22:48:58,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:58,825 INFO L225 Difference]: With dead ends: 86 [2020-07-17 22:48:58,825 INFO L226 Difference]: Without dead ends: 54 [2020-07-17 22:48:58,826 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2020-07-17 22:48:58,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-17 22:48:58,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2020-07-17 22:48:58,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:58,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2020-07-17 22:48:58,890 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2020-07-17 22:48:58,890 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2020-07-17 22:48:58,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:58,892 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2020-07-17 22:48:58,892 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2020-07-17 22:48:58,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:58,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:58,893 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2020-07-17 22:48:58,893 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2020-07-17 22:48:58,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:58,895 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2020-07-17 22:48:58,896 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2020-07-17 22:48:58,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:58,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:58,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:58,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:58,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-17 22:48:58,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2020-07-17 22:48:58,898 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 48 [2020-07-17 22:48:58,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:58,899 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2020-07-17 22:48:58,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-17 22:48:58,899 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-17 22:48:58,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-17 22:48:58,900 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:58,900 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:48:59,113 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-17 22:48:59,114 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:59,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:59,115 INFO L82 PathProgramCache]: Analyzing trace with hash 2002384471, now seen corresponding path program 3 times [2020-07-17 22:48:59,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:59,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680588581] [2020-07-17 22:48:59,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:59,177 INFO L280 TraceCheckUtils]: 0: Hoare triple {3512#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3487#true} is VALID [2020-07-17 22:48:59,177 INFO L280 TraceCheckUtils]: 1: Hoare triple {3487#true} assume true; {3487#true} is VALID [2020-07-17 22:48:59,177 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3487#true} {3487#true} #80#return; {3487#true} is VALID [2020-07-17 22:48:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:59,529 INFO L280 TraceCheckUtils]: 0: Hoare triple {3513#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {3514#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:59,531 INFO L280 TraceCheckUtils]: 1: Hoare triple {3514#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3514#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:59,532 INFO L280 TraceCheckUtils]: 2: Hoare triple {3514#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3515#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:59,532 INFO L280 TraceCheckUtils]: 3: Hoare triple {3515#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3515#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:59,533 INFO L280 TraceCheckUtils]: 4: Hoare triple {3515#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3516#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-17 22:48:59,534 INFO L280 TraceCheckUtils]: 5: Hoare triple {3516#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3516#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-17 22:48:59,535 INFO L280 TraceCheckUtils]: 6: Hoare triple {3516#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3517#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:59,536 INFO L280 TraceCheckUtils]: 7: Hoare triple {3517#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3517#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:59,537 INFO L280 TraceCheckUtils]: 8: Hoare triple {3517#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3518#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:59,538 INFO L280 TraceCheckUtils]: 9: Hoare triple {3518#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3518#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:59,546 INFO L280 TraceCheckUtils]: 10: Hoare triple {3518#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3519#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:59,548 INFO L280 TraceCheckUtils]: 11: Hoare triple {3519#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3519#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:59,549 INFO L280 TraceCheckUtils]: 12: Hoare triple {3519#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3520#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 6)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:59,550 INFO L280 TraceCheckUtils]: 13: Hoare triple {3520#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 6)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {3521#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:59,551 INFO L280 TraceCheckUtils]: 14: Hoare triple {3521#(not (= |init_#in~size| 1000000))} assume true; {3521#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:59,552 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {3521#(not (= |init_#in~size| 1000000))} {3487#true} #76#return; {3488#false} is VALID [2020-07-17 22:48:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:59,559 INFO L280 TraceCheckUtils]: 0: Hoare triple {3487#true} ~cond := #in~cond; {3487#true} is VALID [2020-07-17 22:48:59,559 INFO L280 TraceCheckUtils]: 1: Hoare triple {3487#true} assume !(0 == ~cond); {3487#true} is VALID [2020-07-17 22:48:59,559 INFO L280 TraceCheckUtils]: 2: Hoare triple {3487#true} assume true; {3487#true} is VALID [2020-07-17 22:48:59,559 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3487#true} {3488#false} #78#return; {3488#false} is VALID [2020-07-17 22:48:59,560 INFO L263 TraceCheckUtils]: 0: Hoare triple {3487#true} call ULTIMATE.init(); {3512#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:48:59,560 INFO L280 TraceCheckUtils]: 1: Hoare triple {3512#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3487#true} is VALID [2020-07-17 22:48:59,560 INFO L280 TraceCheckUtils]: 2: Hoare triple {3487#true} assume true; {3487#true} is VALID [2020-07-17 22:48:59,561 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3487#true} {3487#true} #80#return; {3487#true} is VALID [2020-07-17 22:48:59,561 INFO L263 TraceCheckUtils]: 4: Hoare triple {3487#true} call #t~ret6 := main(); {3487#true} is VALID [2020-07-17 22:48:59,561 INFO L280 TraceCheckUtils]: 5: Hoare triple {3487#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {3487#true} is VALID [2020-07-17 22:48:59,562 INFO L263 TraceCheckUtils]: 6: Hoare triple {3487#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {3513#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:48:59,563 INFO L280 TraceCheckUtils]: 7: Hoare triple {3513#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {3514#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:59,564 INFO L280 TraceCheckUtils]: 8: Hoare triple {3514#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3514#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:59,565 INFO L280 TraceCheckUtils]: 9: Hoare triple {3514#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3515#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:59,566 INFO L280 TraceCheckUtils]: 10: Hoare triple {3515#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3515#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:59,567 INFO L280 TraceCheckUtils]: 11: Hoare triple {3515#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3516#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-17 22:48:59,568 INFO L280 TraceCheckUtils]: 12: Hoare triple {3516#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3516#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-17 22:48:59,569 INFO L280 TraceCheckUtils]: 13: Hoare triple {3516#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3517#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:59,570 INFO L280 TraceCheckUtils]: 14: Hoare triple {3517#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3517#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:59,571 INFO L280 TraceCheckUtils]: 15: Hoare triple {3517#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3518#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:59,572 INFO L280 TraceCheckUtils]: 16: Hoare triple {3518#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3518#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:59,573 INFO L280 TraceCheckUtils]: 17: Hoare triple {3518#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3519#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:59,574 INFO L280 TraceCheckUtils]: 18: Hoare triple {3519#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3519#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:59,575 INFO L280 TraceCheckUtils]: 19: Hoare triple {3519#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3520#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 6)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-17 22:48:59,576 INFO L280 TraceCheckUtils]: 20: Hoare triple {3520#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 6)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {3521#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:59,577 INFO L280 TraceCheckUtils]: 21: Hoare triple {3521#(not (= |init_#in~size| 1000000))} assume true; {3521#(not (= |init_#in~size| 1000000))} is VALID [2020-07-17 22:48:59,578 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3521#(not (= |init_#in~size| 1000000))} {3487#true} #76#return; {3488#false} is VALID [2020-07-17 22:48:59,578 INFO L280 TraceCheckUtils]: 23: Hoare triple {3488#false} ~i~1 := 0; {3488#false} is VALID [2020-07-17 22:48:59,578 INFO L280 TraceCheckUtils]: 24: Hoare triple {3488#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {3488#false} is VALID [2020-07-17 22:48:59,578 INFO L280 TraceCheckUtils]: 25: Hoare triple {3488#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {3488#false} is VALID [2020-07-17 22:48:59,579 INFO L280 TraceCheckUtils]: 26: Hoare triple {3488#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3488#false} is VALID [2020-07-17 22:48:59,579 INFO L280 TraceCheckUtils]: 27: Hoare triple {3488#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {3488#false} is VALID [2020-07-17 22:48:59,579 INFO L280 TraceCheckUtils]: 28: Hoare triple {3488#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {3488#false} is VALID [2020-07-17 22:48:59,579 INFO L280 TraceCheckUtils]: 29: Hoare triple {3488#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3488#false} is VALID [2020-07-17 22:48:59,579 INFO L280 TraceCheckUtils]: 30: Hoare triple {3488#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {3488#false} is VALID [2020-07-17 22:48:59,579 INFO L280 TraceCheckUtils]: 31: Hoare triple {3488#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {3488#false} is VALID [2020-07-17 22:48:59,580 INFO L280 TraceCheckUtils]: 32: Hoare triple {3488#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3488#false} is VALID [2020-07-17 22:48:59,580 INFO L280 TraceCheckUtils]: 33: Hoare triple {3488#false} assume !(~i~1 < 1000000); {3488#false} is VALID [2020-07-17 22:48:59,580 INFO L280 TraceCheckUtils]: 34: Hoare triple {3488#false} ~i~1 := 0; {3488#false} is VALID [2020-07-17 22:48:59,580 INFO L280 TraceCheckUtils]: 35: Hoare triple {3488#false} assume !!(~i~1 < 1000000); {3488#false} is VALID [2020-07-17 22:48:59,580 INFO L280 TraceCheckUtils]: 36: Hoare triple {3488#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {3488#false} is VALID [2020-07-17 22:48:59,581 INFO L263 TraceCheckUtils]: 37: Hoare triple {3488#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {3487#true} is VALID [2020-07-17 22:48:59,581 INFO L280 TraceCheckUtils]: 38: Hoare triple {3487#true} ~cond := #in~cond; {3487#true} is VALID [2020-07-17 22:48:59,581 INFO L280 TraceCheckUtils]: 39: Hoare triple {3487#true} assume !(0 == ~cond); {3487#true} is VALID [2020-07-17 22:48:59,581 INFO L280 TraceCheckUtils]: 40: Hoare triple {3487#true} assume true; {3487#true} is VALID [2020-07-17 22:48:59,581 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {3487#true} {3488#false} #78#return; {3488#false} is VALID [2020-07-17 22:48:59,582 INFO L280 TraceCheckUtils]: 42: Hoare triple {3488#false} havoc #t~mem5.base, #t~mem5.offset; {3488#false} is VALID [2020-07-17 22:48:59,582 INFO L280 TraceCheckUtils]: 43: Hoare triple {3488#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3488#false} is VALID [2020-07-17 22:48:59,582 INFO L280 TraceCheckUtils]: 44: Hoare triple {3488#false} assume !!(~i~1 < 1000000); {3488#false} is VALID [2020-07-17 22:48:59,582 INFO L280 TraceCheckUtils]: 45: Hoare triple {3488#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {3488#false} is VALID [2020-07-17 22:48:59,582 INFO L263 TraceCheckUtils]: 46: Hoare triple {3488#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {3488#false} is VALID [2020-07-17 22:48:59,582 INFO L280 TraceCheckUtils]: 47: Hoare triple {3488#false} ~cond := #in~cond; {3488#false} is VALID [2020-07-17 22:48:59,583 INFO L280 TraceCheckUtils]: 48: Hoare triple {3488#false} assume 0 == ~cond; {3488#false} is VALID [2020-07-17 22:48:59,583 INFO L280 TraceCheckUtils]: 49: Hoare triple {3488#false} assume !false; {3488#false} is VALID [2020-07-17 22:48:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-17 22:48:59,588 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680588581] [2020-07-17 22:48:59,588 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660549579] [2020-07-17 22:48:59,588 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:59,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-17 22:48:59,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:48:59,656 INFO L264 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 24 conjunts are in the unsatisfiable core [2020-07-17 22:48:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:59,674 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:59,755 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2020-07-17 22:48:59,755 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:48:59,764 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:48:59,766 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:48:59,766 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2020-07-17 22:48:59,769 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:48:59,769 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_9|, |init_#t~malloc1.base|]. (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_9| |init_#in~a.base| (store (select |v_#memory_$Pointer$.base_9| |init_#in~a.base|) (+ |init_#in~a.offset| (* init_~i~0 4)) |init_#t~malloc1.base|))) (< init_~i~0 init_~size) (= |init_#in~size| init_~size) (not (= 0 |init_#t~malloc1.base|))) [2020-07-17 22:48:59,769 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* init_~i~0 4))))) (< init_~i~0 init_~size) (= |init_#in~size| init_~size)) [2020-07-17 22:49:00,103 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:00,104 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2020-07-17 22:49:00,107 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:00,120 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-17 22:49:00,131 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:00,140 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:49:00,163 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-17 22:49:00,163 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:27 [2020-07-17 22:49:00,167 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:00,168 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, |main_~#a~0.base|, |main_~#a~0.offset|, v_init_~i~0_17]. (let ((.cse0 (select |#memory_$Pointer$.base| |main_~#a~0.base|))) (and (not (= 0 (select .cse0 (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (= |main_#t~mem3.base| (select .cse0 (+ (* main_~i~1 4) |main_~#a~0.offset|))) (<= 999999 v_init_~i~0_17) (< main_~i~1 1000000))) [2020-07-17 22:49:00,168 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#a~0.offset|, v_init_~i~0_17]. (and (or (not (= 0 |main_#t~mem3.base|)) (not (= (+ (* main_~i~1 4) |main_~#a~0.offset|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17) (< main_~i~1 1000000)) [2020-07-17 22:49:00,171 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:49:00,313 INFO L263 TraceCheckUtils]: 0: Hoare triple {3487#true} call ULTIMATE.init(); {3487#true} is VALID [2020-07-17 22:49:00,313 INFO L280 TraceCheckUtils]: 1: Hoare triple {3487#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3487#true} is VALID [2020-07-17 22:49:00,313 INFO L280 TraceCheckUtils]: 2: Hoare triple {3487#true} assume true; {3487#true} is VALID [2020-07-17 22:49:00,314 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3487#true} {3487#true} #80#return; {3487#true} is VALID [2020-07-17 22:49:00,314 INFO L263 TraceCheckUtils]: 4: Hoare triple {3487#true} call #t~ret6 := main(); {3487#true} is VALID [2020-07-17 22:49:00,314 INFO L280 TraceCheckUtils]: 5: Hoare triple {3487#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {3487#true} is VALID [2020-07-17 22:49:00,314 INFO L263 TraceCheckUtils]: 6: Hoare triple {3487#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {3487#true} is VALID [2020-07-17 22:49:00,315 INFO L280 TraceCheckUtils]: 7: Hoare triple {3487#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2020-07-17 22:49:00,316 INFO L280 TraceCheckUtils]: 8: Hoare triple {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2020-07-17 22:49:00,317 INFO L280 TraceCheckUtils]: 9: Hoare triple {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2020-07-17 22:49:00,318 INFO L280 TraceCheckUtils]: 10: Hoare triple {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2020-07-17 22:49:00,322 INFO L280 TraceCheckUtils]: 11: Hoare triple {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2020-07-17 22:49:00,323 INFO L280 TraceCheckUtils]: 12: Hoare triple {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2020-07-17 22:49:00,323 INFO L280 TraceCheckUtils]: 13: Hoare triple {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2020-07-17 22:49:00,324 INFO L280 TraceCheckUtils]: 14: Hoare triple {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2020-07-17 22:49:00,325 INFO L280 TraceCheckUtils]: 15: Hoare triple {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2020-07-17 22:49:00,326 INFO L280 TraceCheckUtils]: 16: Hoare triple {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2020-07-17 22:49:00,326 INFO L280 TraceCheckUtils]: 17: Hoare triple {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2020-07-17 22:49:00,328 INFO L280 TraceCheckUtils]: 18: Hoare triple {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3580#(and (= |init_#in~size| init_~size) (< init_~i~0 init_~size) (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* init_~i~0 4))))))} is VALID [2020-07-17 22:49:00,329 INFO L280 TraceCheckUtils]: 19: Hoare triple {3580#(and (= |init_#in~size| init_~size) (< init_~i~0 init_~size) (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* init_~i~0 4))))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3584#(and (exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* v_init_~i~0_17 4))))) (<= init_~i~0 (+ v_init_~i~0_17 1)) (< v_init_~i~0_17 init_~size))) (= |init_#in~size| init_~size))} is VALID [2020-07-17 22:49:00,332 INFO L280 TraceCheckUtils]: 20: Hoare triple {3584#(and (exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* v_init_~i~0_17 4))))) (<= init_~i~0 (+ v_init_~i~0_17 1)) (< v_init_~i~0_17 init_~size))) (= |init_#in~size| init_~size))} assume !(~i~0 < ~size); {3588#(exists ((v_init_~i~0_17 Int)) (and (<= |init_#in~size| (+ v_init_~i~0_17 1)) (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* v_init_~i~0_17 4))))) (< v_init_~i~0_17 |init_#in~size|)))} is VALID [2020-07-17 22:49:00,332 INFO L280 TraceCheckUtils]: 21: Hoare triple {3588#(exists ((v_init_~i~0_17 Int)) (and (<= |init_#in~size| (+ v_init_~i~0_17 1)) (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* v_init_~i~0_17 4))))) (< v_init_~i~0_17 |init_#in~size|)))} assume true; {3588#(exists ((v_init_~i~0_17 Int)) (and (<= |init_#in~size| (+ v_init_~i~0_17 1)) (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* v_init_~i~0_17 4))))) (< v_init_~i~0_17 |init_#in~size|)))} is VALID [2020-07-17 22:49:00,334 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3588#(exists ((v_init_~i~0_17 Int)) (and (<= |init_#in~size| (+ v_init_~i~0_17 1)) (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* v_init_~i~0_17 4))))) (< v_init_~i~0_17 |init_#in~size|)))} {3487#true} #76#return; {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} is VALID [2020-07-17 22:49:00,335 INFO L280 TraceCheckUtils]: 23: Hoare triple {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} ~i~1 := 0; {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} is VALID [2020-07-17 22:49:00,335 INFO L280 TraceCheckUtils]: 24: Hoare triple {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} is VALID [2020-07-17 22:49:00,336 INFO L280 TraceCheckUtils]: 25: Hoare triple {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} is VALID [2020-07-17 22:49:00,337 INFO L280 TraceCheckUtils]: 26: Hoare triple {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} is VALID [2020-07-17 22:49:00,337 INFO L280 TraceCheckUtils]: 27: Hoare triple {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} is VALID [2020-07-17 22:49:00,338 INFO L280 TraceCheckUtils]: 28: Hoare triple {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} is VALID [2020-07-17 22:49:00,338 INFO L280 TraceCheckUtils]: 29: Hoare triple {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} is VALID [2020-07-17 22:49:00,341 INFO L280 TraceCheckUtils]: 30: Hoare triple {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {3620#(and (exists ((v_init_~i~0_17 Int)) (and (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17) (or (not (= 0 |main_#t~mem3.base|)) (not (= (* 4 main_~i~1) (* 4 v_init_~i~0_17)))))) (< main_~i~1 1000000))} is VALID [2020-07-17 22:49:00,342 INFO L280 TraceCheckUtils]: 31: Hoare triple {3620#(and (exists ((v_init_~i~0_17 Int)) (and (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17) (or (not (= 0 |main_#t~mem3.base|)) (not (= (* 4 main_~i~1) (* 4 v_init_~i~0_17)))))) (< main_~i~1 1000000))} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {3624#(<= main_~i~1 999998)} is VALID [2020-07-17 22:49:00,343 INFO L280 TraceCheckUtils]: 32: Hoare triple {3624#(<= main_~i~1 999998)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3628#(<= main_~i~1 999999)} is VALID [2020-07-17 22:49:00,343 INFO L280 TraceCheckUtils]: 33: Hoare triple {3628#(<= main_~i~1 999999)} assume !(~i~1 < 1000000); {3488#false} is VALID [2020-07-17 22:49:00,344 INFO L280 TraceCheckUtils]: 34: Hoare triple {3488#false} ~i~1 := 0; {3488#false} is VALID [2020-07-17 22:49:00,344 INFO L280 TraceCheckUtils]: 35: Hoare triple {3488#false} assume !!(~i~1 < 1000000); {3488#false} is VALID [2020-07-17 22:49:00,344 INFO L280 TraceCheckUtils]: 36: Hoare triple {3488#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {3488#false} is VALID [2020-07-17 22:49:00,344 INFO L263 TraceCheckUtils]: 37: Hoare triple {3488#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {3488#false} is VALID [2020-07-17 22:49:00,344 INFO L280 TraceCheckUtils]: 38: Hoare triple {3488#false} ~cond := #in~cond; {3488#false} is VALID [2020-07-17 22:49:00,345 INFO L280 TraceCheckUtils]: 39: Hoare triple {3488#false} assume !(0 == ~cond); {3488#false} is VALID [2020-07-17 22:49:00,345 INFO L280 TraceCheckUtils]: 40: Hoare triple {3488#false} assume true; {3488#false} is VALID [2020-07-17 22:49:00,345 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {3488#false} {3488#false} #78#return; {3488#false} is VALID [2020-07-17 22:49:00,345 INFO L280 TraceCheckUtils]: 42: Hoare triple {3488#false} havoc #t~mem5.base, #t~mem5.offset; {3488#false} is VALID [2020-07-17 22:49:00,345 INFO L280 TraceCheckUtils]: 43: Hoare triple {3488#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3488#false} is VALID [2020-07-17 22:49:00,345 INFO L280 TraceCheckUtils]: 44: Hoare triple {3488#false} assume !!(~i~1 < 1000000); {3488#false} is VALID [2020-07-17 22:49:00,346 INFO L280 TraceCheckUtils]: 45: Hoare triple {3488#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {3488#false} is VALID [2020-07-17 22:49:00,346 INFO L263 TraceCheckUtils]: 46: Hoare triple {3488#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {3488#false} is VALID [2020-07-17 22:49:00,346 INFO L280 TraceCheckUtils]: 47: Hoare triple {3488#false} ~cond := #in~cond; {3488#false} is VALID [2020-07-17 22:49:00,346 INFO L280 TraceCheckUtils]: 48: Hoare triple {3488#false} assume 0 == ~cond; {3488#false} is VALID [2020-07-17 22:49:00,346 INFO L280 TraceCheckUtils]: 49: Hoare triple {3488#false} assume !false; {3488#false} is VALID [2020-07-17 22:49:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-07-17 22:49:00,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:49:00,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2020-07-17 22:49:00,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891636606] [2020-07-17 22:49:00,356 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2020-07-17 22:49:00,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:00,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-17 22:49:00,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:00,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-17 22:49:00,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:00,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-17 22:49:00,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2020-07-17 22:49:00,436 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 20 states. [2020-07-17 22:49:02,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:02,414 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2020-07-17 22:49:02,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-17 22:49:02,415 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2020-07-17 22:49:02,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:02,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-17 22:49:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 54 transitions. [2020-07-17 22:49:02,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-17 22:49:02,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 54 transitions. [2020-07-17 22:49:02,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 54 transitions. [2020-07-17 22:49:02,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:02,544 INFO L225 Difference]: With dead ends: 69 [2020-07-17 22:49:02,544 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:49:02,545 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2020-07-17 22:49:02,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:49:02,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:49:02,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:02,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:49:02,546 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:49:02,546 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:49:02,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:02,546 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:49:02,547 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:49:02,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:02,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:02,547 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:49:02,547 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:49:02,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:02,547 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:49:02,547 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:49:02,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:02,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:02,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:02,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:02,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:49:02,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:49:02,548 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2020-07-17 22:49:02,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:02,548 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:49:02,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-17 22:49:02,548 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:49:02,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:02,749 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:02,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:49:03,062 INFO L264 CegarLoopResult]: At program point initENTRY(lines 9 16) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 22:49:03,062 INFO L268 CegarLoopResult]: For program point initEXIT(lines 9 16) no Hoare annotation was computed. [2020-07-17 22:49:03,062 INFO L268 CegarLoopResult]: For program point L12-2(lines 12 15) no Hoare annotation was computed. [2020-07-17 22:49:03,062 INFO L264 CegarLoopResult]: At program point L12-3(lines 12 15) the Hoare annotation is: (let ((.cse0 (= init_~a.base |init_#in~a.base|)) (.cse1 (= |init_#in~size| init_~size)) (.cse2 (= init_~a.offset |init_#in~a.offset|))) (or (and (exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* v_init_~i~0_17 4))))) (<= init_~i~0 (+ v_init_~i~0_17 1)) (< v_init_~i~0_17 init_~size))) .cse0 .cse1 .cse2) (and (<= init_~i~0 0) (= |#valid| |old(#valid)|) .cse0 .cse1 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) .cse2 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))) [2020-07-17 22:49:03,063 INFO L268 CegarLoopResult]: For program point L12-4(lines 9 16) no Hoare annotation was computed. [2020-07-17 22:49:03,063 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:49:03,063 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-17 22:49:03,063 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:49:03,063 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:49:03,063 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:49:03,063 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:49:03,064 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:49:03,064 INFO L268 CegarLoopResult]: For program point L33(lines 33 34) no Hoare annotation was computed. [2020-07-17 22:49:03,064 INFO L268 CegarLoopResult]: For program point L31-2(lines 31 35) no Hoare annotation was computed. [2020-07-17 22:49:03,064 INFO L264 CegarLoopResult]: At program point L31-3(lines 31 35) the Hoare annotation is: (<= 1 main_~flag~0) [2020-07-17 22:49:03,064 INFO L268 CegarLoopResult]: For program point L31-4(lines 31 35) no Hoare annotation was computed. [2020-07-17 22:49:03,064 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 17 37) no Hoare annotation was computed. [2020-07-17 22:49:03,065 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= 0 main_~flag~0) (= 0 |main_~#a~0.offset|)) [2020-07-17 22:49:03,065 INFO L268 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2020-07-17 22:49:03,065 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 17 37) no Hoare annotation was computed. [2020-07-17 22:49:03,065 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: false [2020-07-17 22:49:03,065 INFO L268 CegarLoopResult]: For program point L34-1(line 34) no Hoare annotation was computed. [2020-07-17 22:49:03,065 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 17 37) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 22:49:03,065 INFO L268 CegarLoopResult]: For program point L26(lines 26 29) no Hoare annotation was computed. [2020-07-17 22:49:03,065 INFO L268 CegarLoopResult]: For program point L24-2(lines 24 30) no Hoare annotation was computed. [2020-07-17 22:49:03,066 INFO L264 CegarLoopResult]: At program point L24-3(lines 24 30) the Hoare annotation is: (let ((.cse0 (exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))) (.cse1 (= 0 main_~flag~0)) (.cse2 (= 0 |main_~#a~0.offset|))) (or (and .cse0 (<= main_~i~1 999999) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) .cse1 .cse2) (and .cse0 (= 0 main_~i~1) .cse1 .cse2) (<= 1 main_~flag~0))) [2020-07-17 22:49:03,066 INFO L268 CegarLoopResult]: For program point L24-4(lines 24 30) no Hoare annotation was computed. [2020-07-17 22:49:03,066 INFO L268 CegarLoopResult]: For program point L2-1(line 2) no Hoare annotation was computed. [2020-07-17 22:49:03,066 INFO L268 CegarLoopResult]: For program point L2-3(line 2) no Hoare annotation was computed. [2020-07-17 22:49:03,066 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(line 2) the Hoare annotation is: true [2020-07-17 22:49:03,066 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(line 2) no Hoare annotation was computed. [2020-07-17 22:49:03,066 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2) no Hoare annotation was computed. [2020-07-17 22:49:03,066 INFO L268 CegarLoopResult]: For program point L2(line 2) no Hoare annotation was computed. [2020-07-17 22:49:03,072 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:49:03,073 WARN L170 areAnnotationChecker]: L2 has no Hoare annotation [2020-07-17 22:49:03,073 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2020-07-17 22:49:03,074 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2020-07-17 22:49:03,074 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-17 22:49:03,074 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:49:03,074 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:49:03,074 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:49:03,075 WARN L170 areAnnotationChecker]: L2 has no Hoare annotation [2020-07-17 22:49:03,075 WARN L170 areAnnotationChecker]: L2 has no Hoare annotation [2020-07-17 22:49:03,075 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2020-07-17 22:49:03,075 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-17 22:49:03,075 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:49:03,075 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:49:03,076 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:49:03,076 WARN L170 areAnnotationChecker]: L2-1 has no Hoare annotation [2020-07-17 22:49:03,076 WARN L170 areAnnotationChecker]: L2-1 has no Hoare annotation [2020-07-17 22:49:03,076 WARN L170 areAnnotationChecker]: L2-3 has no Hoare annotation [2020-07-17 22:49:03,076 WARN L170 areAnnotationChecker]: initEXIT has no Hoare annotation [2020-07-17 22:49:03,076 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2020-07-17 22:49:03,076 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2020-07-17 22:49:03,076 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-17 22:49:03,077 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:49:03,077 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2020-07-17 22:49:03,077 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-17 22:49:03,077 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-17 22:49:03,077 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-17 22:49:03,078 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-17 22:49:03,078 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-17 22:49:03,078 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-17 22:49:03,078 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2020-07-17 22:49:03,078 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2020-07-17 22:49:03,078 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-17 22:49:03,078 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-17 22:49:03,078 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-17 22:49:03,079 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:49:03,079 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-17 22:49:03,079 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:49:03,079 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:49:03,090 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,092 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:49:03,092 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,092 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,093 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,094 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,094 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,094 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,095 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,096 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:49:03,097 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,097 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,098 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,098 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,098 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,099 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,103 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,103 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,104 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,104 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,105 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,105 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,105 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:49:03,105 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:49:03,106 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,106 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,106 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,108 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-17 22:49:03,108 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-17 22:49:03,108 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,108 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,108 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,109 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,109 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,109 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,110 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,110 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,110 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:49:03,110 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:49:03,111 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,111 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,111 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,111 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-17 22:49:03,112 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-17 22:49:03,112 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,112 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:49:03 BoogieIcfgContainer [2020-07-17 22:49:03,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:49:03,116 INFO L168 Benchmark]: Toolchain (without parser) took 19033.78 ms. Allocated memory was 140.5 MB in the beginning and 392.2 MB in the end (delta: 251.7 MB). Free memory was 101.6 MB in the beginning and 322.8 MB in the end (delta: -221.2 MB). Peak memory consumption was 30.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:03,117 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-17 22:49:03,117 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.98 ms. Allocated memory is still 140.5 MB. Free memory was 101.2 MB in the beginning and 90.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:03,118 INFO L168 Benchmark]: Boogie Preprocessor took 128.26 ms. Allocated memory was 140.5 MB in the beginning and 201.3 MB in the end (delta: 60.8 MB). Free memory was 90.4 MB in the beginning and 178.7 MB in the end (delta: -88.3 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:03,118 INFO L168 Benchmark]: RCFGBuilder took 488.03 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 154.9 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:03,119 INFO L168 Benchmark]: TraceAbstraction took 18112.68 ms. Allocated memory was 201.3 MB in the beginning and 392.2 MB in the end (delta: 190.8 MB). Free memory was 154.9 MB in the beginning and 322.8 MB in the end (delta: -167.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:03,121 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 298.98 ms. Allocated memory is still 140.5 MB. Free memory was 101.2 MB in the beginning and 90.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 128.26 ms. Allocated memory was 140.5 MB in the beginning and 201.3 MB in the end (delta: 60.8 MB). Free memory was 90.4 MB in the beginning and 178.7 MB in the end (delta: -88.3 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 488.03 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 154.9 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18112.68 ms. Allocated memory was 201.3 MB in the beginning and 392.2 MB in the end (delta: 190.8 MB). Free memory was 154.9 MB in the beginning and 322.8 MB in the end (delta: -167.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 1 <= flag - InvariantResult [Line: 24]: Loop Invariant [2020-07-17 22:49:03,130 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,131 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:49:03,132 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,132 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,133 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,133 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,133 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,133 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,134 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,134 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,134 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,135 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,135 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:49:03,135 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,135 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,136 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,136 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,136 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,136 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,137 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,137 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,137 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((\exists v_init_~i~0_17 : int :: (!(0 == #memory_$Pointer$[a][v_init_~i~0_17 * 4 + a]) && v_init_~i~0_17 < 1000000) && 999999 <= v_init_~i~0_17) && i <= 999999) && 0 == #memory_$Pointer$[a][a]) && 0 == #memory_$Pointer$[a][a]) && 0 == flag) && 0 == a) || ((((\exists v_init_~i~0_17 : int :: (!(0 == #memory_$Pointer$[a][v_init_~i~0_17 * 4 + a]) && v_init_~i~0_17 < 1000000) && 999999 <= v_init_~i~0_17) && 0 == i) && 0 == flag) && 0 == a)) || 1 <= flag - InvariantResult [Line: 12]: Loop Invariant [2020-07-17 22:49:03,138 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,139 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,139 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,139 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:49:03,139 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:49:03,139 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,140 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,140 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,140 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-17 22:49:03,140 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-17 22:49:03,140 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,140 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,141 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,142 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-17 22:49:03,142 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,142 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:49:03,142 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:49:03,143 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:49:03,143 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,143 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,143 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,143 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-17 22:49:03,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-17 22:49:03,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:49:03,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((\exists v_init_~i~0_17 : int :: (!(0 == #memory_$Pointer$[a][a + v_init_~i~0_17 * 4]) && i <= v_init_~i~0_17 + 1) && v_init_~i~0_17 < size) && a == a) && \old(size) == size) && a == a) || (((((((i <= 0 && \valid == \old(\valid)) && a == a) && \old(size) == size) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(unknown-#length-unknown) == unknown-#length-unknown) && a == a) && #memory_$Pointer$ == \old(#memory_$Pointer$)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 17.6s, OverallIterations: 11, TraceHistogramMax: 6, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 276 SDtfs, 238 SDslu, 777 SDs, 0 SdLazy, 928 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 484 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 47 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 24 PreInvPairs, 37 NumberOfFragments, 186 HoareAnnotationTreeSize, 24 FomulaSimplifications, 417 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 36 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 682 NumberOfCodeBlocks, 666 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 662 ConstructedInterpolants, 12 QuantifiedInterpolants, 103213 SizeOfPredicates, 26 NumberOfNonLiveVariables, 1307 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 20 InterpolantComputations, 5 PerfectInterpolantSequences, 207/386 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...