/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/array-lopstr16/flag_loopdep.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:20:43,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:20:43,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:20:43,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:20:43,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:20:43,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:20:43,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:20:43,283 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:20:43,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:20:43,291 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:20:43,293 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:20:43,296 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:20:43,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:20:43,298 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:20:43,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:20:43,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:20:43,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:20:43,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:20:43,306 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:20:43,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:20:43,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:20:43,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:20:43,322 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:20:43,323 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:20:43,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:20:43,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:20:43,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:20:43,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:20:43,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:20:43,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:20:43,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:20:43,332 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:20:43,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:20:43,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:20:43,335 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:20:43,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:20:43,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:20:43,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:20:43,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:20:43,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:20:43,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:20:43,339 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:20:43,371 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:20:43,371 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:20:43,373 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:20:43,373 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:20:43,373 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:20:43,373 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:20:43,373 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:20:43,374 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:20:43,374 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:20:43,374 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:20:43,374 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:20:43,374 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:20:43,374 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:20:43,375 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:20:43,375 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:20:43,375 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:20:43,377 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:20:43,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:20:43,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:20:43,378 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:20:43,378 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:20:43,378 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:20:43,379 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:20:43,662 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:20:43,681 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:20:43,685 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:20:43,686 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:20:43,687 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:20:43,688 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-10 20:20:43,772 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61dff7e63/c8547c9a40ed4b6fa08d6e6afefd0e30/FLAG7192ad398 [2020-07-10 20:20:44,255 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:20:44,256 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-lopstr16/flag_loopdep.i [2020-07-10 20:20:44,263 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61dff7e63/c8547c9a40ed4b6fa08d6e6afefd0e30/FLAG7192ad398 [2020-07-10 20:20:44,603 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61dff7e63/c8547c9a40ed4b6fa08d6e6afefd0e30 [2020-07-10 20:20:44,613 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:20:44,615 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:20:44,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:20:44,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:20:44,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:20:44,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:20:44" (1/1) ... [2020-07-10 20:20:44,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c1cf721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:44, skipping insertion in model container [2020-07-10 20:20:44,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:20:44" (1/1) ... [2020-07-10 20:20:44,632 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:20:44,651 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:20:44,862 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:20:44,872 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:20:44,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:20:44,915 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:20:44,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:44 WrapperNode [2020-07-10 20:20:44,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:20:44,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:20:44,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:20:44,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:20:45,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:44" (1/1) ... [2020-07-10 20:20:45,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:44" (1/1) ... [2020-07-10 20:20:45,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:44" (1/1) ... [2020-07-10 20:20:45,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:44" (1/1) ... [2020-07-10 20:20:45,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:44" (1/1) ... [2020-07-10 20:20:45,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:44" (1/1) ... [2020-07-10 20:20:45,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:44" (1/1) ... [2020-07-10 20:20:45,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:20:45,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:20:45,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:20:45,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:20:45,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20: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-10 20:20:45,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:20:45,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:20:45,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:20:45,121 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2020-07-10 20:20:45,121 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:20:45,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:20:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:20:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 20:20:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_pointer [2020-07-10 20:20:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-07-10 20:20:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 20:20:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 20:20:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:20:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:20:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 20:20:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:20:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:20:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:20:45,494 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:20:45,494 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 20:20:45,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:20:45 BoogieIcfgContainer [2020-07-10 20:20:45,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:20:45,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:20:45,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:20:45,504 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:20:45,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:20:44" (1/3) ... [2020-07-10 20:20:45,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a86725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:20:45, skipping insertion in model container [2020-07-10 20:20:45,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:44" (2/3) ... [2020-07-10 20:20:45,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a86725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:20:45, skipping insertion in model container [2020-07-10 20:20:45,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:20:45" (3/3) ... [2020-07-10 20:20:45,508 INFO L109 eAbstractionObserver]: Analyzing ICFG flag_loopdep.i [2020-07-10 20:20:45,518 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:20:45,536 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:20:45,550 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:20:45,574 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:20:45,575 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:20:45,575 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:20:45,575 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:20:45,575 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:20:45,576 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:20:45,576 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:20:45,576 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:20:45,594 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2020-07-10 20:20:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 20:20:45,606 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:45,607 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, 1, 1, 1, 1] [2020-07-10 20:20:45,608 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:45,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:45,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2004589429, now seen corresponding path program 1 times [2020-07-10 20:20:45,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:45,626 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [254158944] [2020-07-10 20:20:45,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:45,879 INFO L280 TraceCheckUtils]: 0: Hoare triple {73#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {59#true} is VALID [2020-07-10 20:20:45,879 INFO L280 TraceCheckUtils]: 1: Hoare triple {59#true} #valid := #valid[0 := 0]; {59#true} is VALID [2020-07-10 20:20:45,880 INFO L280 TraceCheckUtils]: 2: Hoare triple {59#true} assume 0 < #StackHeapBarrier; {59#true} is VALID [2020-07-10 20:20:45,880 INFO L280 TraceCheckUtils]: 3: Hoare triple {59#true} assume true; {59#true} is VALID [2020-07-10 20:20:45,881 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {59#true} {59#true} #103#return; {59#true} is VALID [2020-07-10 20:20:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:45,922 INFO L280 TraceCheckUtils]: 0: Hoare triple {74#(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; {59#true} is VALID [2020-07-10 20:20:45,922 INFO L280 TraceCheckUtils]: 1: Hoare triple {59#true} ~size := #in~size; {59#true} is VALID [2020-07-10 20:20:45,923 INFO L280 TraceCheckUtils]: 2: Hoare triple {59#true} havoc ~i~0; {59#true} is VALID [2020-07-10 20:20:45,923 INFO L280 TraceCheckUtils]: 3: Hoare triple {59#true} ~i~0 := 0; {59#true} is VALID [2020-07-10 20:20:45,925 INFO L280 TraceCheckUtils]: 4: Hoare triple {59#true} assume !true; {60#false} is VALID [2020-07-10 20:20:45,925 INFO L280 TraceCheckUtils]: 5: Hoare triple {60#false} assume true; {60#false} is VALID [2020-07-10 20:20:45,925 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {60#false} {59#true} #99#return; {60#false} is VALID [2020-07-10 20:20:45,928 INFO L263 TraceCheckUtils]: 0: Hoare triple {59#true} call ULTIMATE.init(); {73#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:20:45,928 INFO L280 TraceCheckUtils]: 1: Hoare triple {73#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {59#true} is VALID [2020-07-10 20:20:45,929 INFO L280 TraceCheckUtils]: 2: Hoare triple {59#true} #valid := #valid[0 := 0]; {59#true} is VALID [2020-07-10 20:20:45,929 INFO L280 TraceCheckUtils]: 3: Hoare triple {59#true} assume 0 < #StackHeapBarrier; {59#true} is VALID [2020-07-10 20:20:45,930 INFO L280 TraceCheckUtils]: 4: Hoare triple {59#true} assume true; {59#true} is VALID [2020-07-10 20:20:45,930 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {59#true} {59#true} #103#return; {59#true} is VALID [2020-07-10 20:20:45,930 INFO L263 TraceCheckUtils]: 6: Hoare triple {59#true} call #t~ret6 := main(); {59#true} is VALID [2020-07-10 20:20:45,931 INFO L280 TraceCheckUtils]: 7: Hoare triple {59#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000); srcloc: mainENTRY {59#true} is VALID [2020-07-10 20:20:45,931 INFO L280 TraceCheckUtils]: 8: Hoare triple {59#true} havoc ~i~1; {59#true} is VALID [2020-07-10 20:20:45,932 INFO L280 TraceCheckUtils]: 9: Hoare triple {59#true} havoc ~flag~0; {59#true} is VALID [2020-07-10 20:20:45,932 INFO L280 TraceCheckUtils]: 10: Hoare triple {59#true} ~flag~0 := 0; {59#true} is VALID [2020-07-10 20:20:45,935 INFO L263 TraceCheckUtils]: 11: Hoare triple {59#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {74#(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-10 20:20:45,936 INFO L280 TraceCheckUtils]: 12: Hoare triple {74#(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; {59#true} is VALID [2020-07-10 20:20:45,936 INFO L280 TraceCheckUtils]: 13: Hoare triple {59#true} ~size := #in~size; {59#true} is VALID [2020-07-10 20:20:45,937 INFO L280 TraceCheckUtils]: 14: Hoare triple {59#true} havoc ~i~0; {59#true} is VALID [2020-07-10 20:20:45,937 INFO L280 TraceCheckUtils]: 15: Hoare triple {59#true} ~i~0 := 0; {59#true} is VALID [2020-07-10 20:20:45,938 INFO L280 TraceCheckUtils]: 16: Hoare triple {59#true} assume !true; {60#false} is VALID [2020-07-10 20:20:45,939 INFO L280 TraceCheckUtils]: 17: Hoare triple {60#false} assume true; {60#false} is VALID [2020-07-10 20:20:45,939 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {60#false} {59#true} #99#return; {60#false} is VALID [2020-07-10 20:20:45,940 INFO L280 TraceCheckUtils]: 19: Hoare triple {60#false} ~i~1 := 0; {60#false} is VALID [2020-07-10 20:20:45,940 INFO L280 TraceCheckUtils]: 20: Hoare triple {60#false} assume !(~i~1 < 1000000); {60#false} is VALID [2020-07-10 20:20:45,941 INFO L280 TraceCheckUtils]: 21: Hoare triple {60#false} ~i~1 := 0; {60#false} is VALID [2020-07-10 20:20:45,941 INFO L280 TraceCheckUtils]: 22: Hoare triple {60#false} assume !!(~i~1 < 1000000); {60#false} is VALID [2020-07-10 20:20:45,942 INFO L280 TraceCheckUtils]: 23: Hoare triple {60#false} assume 0 == ~flag~0; {60#false} is VALID [2020-07-10 20:20:45,942 INFO L280 TraceCheckUtils]: 24: Hoare triple {60#false} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); srcloc: L34 {60#false} is VALID [2020-07-10 20:20:45,943 INFO L263 TraceCheckUtils]: 25: Hoare triple {60#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {60#false} is VALID [2020-07-10 20:20:45,943 INFO L280 TraceCheckUtils]: 26: Hoare triple {60#false} ~cond := #in~cond; {60#false} is VALID [2020-07-10 20:20:45,943 INFO L280 TraceCheckUtils]: 27: Hoare triple {60#false} assume 0 == ~cond; {60#false} is VALID [2020-07-10 20:20:45,944 INFO L280 TraceCheckUtils]: 28: Hoare triple {60#false} assume !false; {60#false} is VALID [2020-07-10 20:20:45,948 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-10 20:20:45,949 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:45,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [254158944] [2020-07-10 20:20:45,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:45,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 20:20:45,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125101538] [2020-07-10 20:20:45,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-10 20:20:45,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:45,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 20:20:46,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:46,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 20:20:46,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:46,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 20:20:46,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 20:20:46,057 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 4 states. [2020-07-10 20:20:46,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:46,635 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions. [2020-07-10 20:20:46,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 20:20:46,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-10 20:20:46,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:46,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:20:46,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2020-07-10 20:20:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:20:46,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2020-07-10 20:20:46,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2020-07-10 20:20:46,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:46,818 INFO L225 Difference]: With dead ends: 94 [2020-07-10 20:20:46,819 INFO L226 Difference]: Without dead ends: 53 [2020-07-10 20:20:46,823 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-10 20:20:46,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-10 20:20:46,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2020-07-10 20:20:46,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:46,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 49 states. [2020-07-10 20:20:46,913 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 49 states. [2020-07-10 20:20:46,913 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 49 states. [2020-07-10 20:20:46,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:46,920 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2020-07-10 20:20:46,920 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2020-07-10 20:20:46,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:46,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:46,921 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 53 states. [2020-07-10 20:20:46,921 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 53 states. [2020-07-10 20:20:46,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:46,927 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2020-07-10 20:20:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2020-07-10 20:20:46,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:46,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:46,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:46,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:46,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-10 20:20:46,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2020-07-10 20:20:46,934 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 29 [2020-07-10 20:20:46,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:46,935 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2020-07-10 20:20:46,935 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 20:20:46,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 53 transitions. [2020-07-10 20:20:47,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:47,002 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2020-07-10 20:20:47,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 20:20:47,004 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:47,004 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, 1, 1, 1, 1] [2020-07-10 20:20:47,004 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:20:47,005 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:47,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:47,005 INFO L82 PathProgramCache]: Analyzing trace with hash 929440641, now seen corresponding path program 1 times [2020-07-10 20:20:47,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:47,006 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1123272653] [2020-07-10 20:20:47,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:47,098 INFO L280 TraceCheckUtils]: 0: Hoare triple {486#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {472#true} is VALID [2020-07-10 20:20:47,098 INFO L280 TraceCheckUtils]: 1: Hoare triple {472#true} #valid := #valid[0 := 0]; {472#true} is VALID [2020-07-10 20:20:47,098 INFO L280 TraceCheckUtils]: 2: Hoare triple {472#true} assume 0 < #StackHeapBarrier; {472#true} is VALID [2020-07-10 20:20:47,099 INFO L280 TraceCheckUtils]: 3: Hoare triple {472#true} assume true; {472#true} is VALID [2020-07-10 20:20:47,099 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {472#true} {472#true} #103#return; {472#true} is VALID [2020-07-10 20:20:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:47,269 INFO L280 TraceCheckUtils]: 0: Hoare triple {487#(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; {472#true} is VALID [2020-07-10 20:20:47,271 INFO L280 TraceCheckUtils]: 1: Hoare triple {472#true} ~size := #in~size; {488#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} is VALID [2020-07-10 20:20:47,272 INFO L280 TraceCheckUtils]: 2: Hoare triple {488#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} havoc ~i~0; {488#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} is VALID [2020-07-10 20:20:47,273 INFO L280 TraceCheckUtils]: 3: Hoare triple {488#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} ~i~0 := 0; {489#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 20:20:47,274 INFO L280 TraceCheckUtils]: 4: Hoare triple {489#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {490#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 20:20:47,275 INFO L280 TraceCheckUtils]: 5: Hoare triple {490#(not (= |init_#in~size| 1000000))} assume true; {490#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 20:20:47,276 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {490#(not (= |init_#in~size| 1000000))} {472#true} #99#return; {473#false} is VALID [2020-07-10 20:20:47,278 INFO L263 TraceCheckUtils]: 0: Hoare triple {472#true} call ULTIMATE.init(); {486#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:20:47,278 INFO L280 TraceCheckUtils]: 1: Hoare triple {486#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {472#true} is VALID [2020-07-10 20:20:47,278 INFO L280 TraceCheckUtils]: 2: Hoare triple {472#true} #valid := #valid[0 := 0]; {472#true} is VALID [2020-07-10 20:20:47,279 INFO L280 TraceCheckUtils]: 3: Hoare triple {472#true} assume 0 < #StackHeapBarrier; {472#true} is VALID [2020-07-10 20:20:47,279 INFO L280 TraceCheckUtils]: 4: Hoare triple {472#true} assume true; {472#true} is VALID [2020-07-10 20:20:47,279 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {472#true} {472#true} #103#return; {472#true} is VALID [2020-07-10 20:20:47,280 INFO L263 TraceCheckUtils]: 6: Hoare triple {472#true} call #t~ret6 := main(); {472#true} is VALID [2020-07-10 20:20:47,280 INFO L280 TraceCheckUtils]: 7: Hoare triple {472#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000); srcloc: mainENTRY {472#true} is VALID [2020-07-10 20:20:47,281 INFO L280 TraceCheckUtils]: 8: Hoare triple {472#true} havoc ~i~1; {472#true} is VALID [2020-07-10 20:20:47,281 INFO L280 TraceCheckUtils]: 9: Hoare triple {472#true} havoc ~flag~0; {472#true} is VALID [2020-07-10 20:20:47,281 INFO L280 TraceCheckUtils]: 10: Hoare triple {472#true} ~flag~0 := 0; {472#true} is VALID [2020-07-10 20:20:47,283 INFO L263 TraceCheckUtils]: 11: Hoare triple {472#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {487#(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-10 20:20:47,284 INFO L280 TraceCheckUtils]: 12: Hoare triple {487#(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; {472#true} is VALID [2020-07-10 20:20:47,285 INFO L280 TraceCheckUtils]: 13: Hoare triple {472#true} ~size := #in~size; {488#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} is VALID [2020-07-10 20:20:47,285 INFO L280 TraceCheckUtils]: 14: Hoare triple {488#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} havoc ~i~0; {488#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} is VALID [2020-07-10 20:20:47,287 INFO L280 TraceCheckUtils]: 15: Hoare triple {488#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} ~i~0 := 0; {489#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 20:20:47,288 INFO L280 TraceCheckUtils]: 16: Hoare triple {489#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {490#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 20:20:47,288 INFO L280 TraceCheckUtils]: 17: Hoare triple {490#(not (= |init_#in~size| 1000000))} assume true; {490#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 20:20:47,290 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {490#(not (= |init_#in~size| 1000000))} {472#true} #99#return; {473#false} is VALID [2020-07-10 20:20:47,290 INFO L280 TraceCheckUtils]: 19: Hoare triple {473#false} ~i~1 := 0; {473#false} is VALID [2020-07-10 20:20:47,291 INFO L280 TraceCheckUtils]: 20: Hoare triple {473#false} assume !(~i~1 < 1000000); {473#false} is VALID [2020-07-10 20:20:47,291 INFO L280 TraceCheckUtils]: 21: Hoare triple {473#false} ~i~1 := 0; {473#false} is VALID [2020-07-10 20:20:47,291 INFO L280 TraceCheckUtils]: 22: Hoare triple {473#false} assume !!(~i~1 < 1000000); {473#false} is VALID [2020-07-10 20:20:47,292 INFO L280 TraceCheckUtils]: 23: Hoare triple {473#false} assume 0 == ~flag~0; {473#false} is VALID [2020-07-10 20:20:47,292 INFO L280 TraceCheckUtils]: 24: Hoare triple {473#false} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); srcloc: L34 {473#false} is VALID [2020-07-10 20:20:47,292 INFO L263 TraceCheckUtils]: 25: Hoare triple {473#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {473#false} is VALID [2020-07-10 20:20:47,293 INFO L280 TraceCheckUtils]: 26: Hoare triple {473#false} ~cond := #in~cond; {473#false} is VALID [2020-07-10 20:20:47,293 INFO L280 TraceCheckUtils]: 27: Hoare triple {473#false} assume 0 == ~cond; {473#false} is VALID [2020-07-10 20:20:47,293 INFO L280 TraceCheckUtils]: 28: Hoare triple {473#false} assume !false; {473#false} is VALID [2020-07-10 20:20:47,296 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-10 20:20:47,296 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:47,297 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1123272653] [2020-07-10 20:20:47,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:47,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 20:20:47,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773930168] [2020-07-10 20:20:47,299 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2020-07-10 20:20:47,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:47,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 20:20:47,335 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:47,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 20:20:47,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:47,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 20:20:47,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:20:47,337 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 7 states. [2020-07-10 20:20:47,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:47,958 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2020-07-10 20:20:47,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 20:20:47,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2020-07-10 20:20:47,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:47,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:20:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2020-07-10 20:20:47,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:20:47,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2020-07-10 20:20:47,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 89 transitions. [2020-07-10 20:20:48,093 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-10 20:20:48,096 INFO L225 Difference]: With dead ends: 81 [2020-07-10 20:20:48,097 INFO L226 Difference]: Without dead ends: 54 [2020-07-10 20:20:48,101 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-10 20:20:48,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-10 20:20:48,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2020-07-10 20:20:48,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:48,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 50 states. [2020-07-10 20:20:48,193 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 50 states. [2020-07-10 20:20:48,193 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 50 states. [2020-07-10 20:20:48,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:48,197 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-07-10 20:20:48,197 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-07-10 20:20:48,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:48,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:48,198 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 54 states. [2020-07-10 20:20:48,198 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 54 states. [2020-07-10 20:20:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:48,202 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-07-10 20:20:48,202 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-07-10 20:20:48,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:48,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:48,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:48,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:48,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-10 20:20:48,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2020-07-10 20:20:48,207 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 29 [2020-07-10 20:20:48,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:48,207 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2020-07-10 20:20:48,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 20:20:48,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2020-07-10 20:20:48,264 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-10 20:20:48,264 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-07-10 20:20:48,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-10 20:20:48,266 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:48,266 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:20:48,266 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:20:48,266 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:48,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:48,267 INFO L82 PathProgramCache]: Analyzing trace with hash -300797571, now seen corresponding path program 1 times [2020-07-10 20:20:48,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:48,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1544951247] [2020-07-10 20:20:48,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:48,362 INFO L280 TraceCheckUtils]: 0: Hoare triple {892#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {872#true} is VALID [2020-07-10 20:20:48,362 INFO L280 TraceCheckUtils]: 1: Hoare triple {872#true} #valid := #valid[0 := 0]; {872#true} is VALID [2020-07-10 20:20:48,363 INFO L280 TraceCheckUtils]: 2: Hoare triple {872#true} assume 0 < #StackHeapBarrier; {872#true} is VALID [2020-07-10 20:20:48,363 INFO L280 TraceCheckUtils]: 3: Hoare triple {872#true} assume true; {872#true} is VALID [2020-07-10 20:20:48,363 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {872#true} {872#true} #103#return; {872#true} is VALID [2020-07-10 20:20:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:48,571 INFO L280 TraceCheckUtils]: 0: Hoare triple {893#(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; {872#true} is VALID [2020-07-10 20:20:48,572 INFO L280 TraceCheckUtils]: 1: Hoare triple {872#true} ~size := #in~size; {894#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} is VALID [2020-07-10 20:20:48,572 INFO L280 TraceCheckUtils]: 2: Hoare triple {894#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} havoc ~i~0; {894#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} is VALID [2020-07-10 20:20:48,577 INFO L280 TraceCheckUtils]: 3: Hoare triple {894#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} ~i~0 := 0; {895#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 20:20:48,578 INFO L280 TraceCheckUtils]: 4: Hoare triple {895#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size); {895#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 20:20:48,579 INFO L280 TraceCheckUtils]: 5: Hoare triple {895#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4); srcloc: L14 {895#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 20:20:48,580 INFO L280 TraceCheckUtils]: 6: Hoare triple {895#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} SUMMARY for call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); srcloc: L14-1 {895#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 20:20:48,581 INFO L280 TraceCheckUtils]: 7: Hoare triple {895#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0; {896#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= |init_#t~post0| 0)))} is VALID [2020-07-10 20:20:48,582 INFO L280 TraceCheckUtils]: 8: Hoare triple {896#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= |init_#t~post0| 0)))} ~i~0 := 1 + #t~post0; {897#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 20:20:48,583 INFO L280 TraceCheckUtils]: 9: Hoare triple {897#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} havoc #t~post0; {897#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 20:20:48,584 INFO L280 TraceCheckUtils]: 10: Hoare triple {897#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {898#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 20:20:48,584 INFO L280 TraceCheckUtils]: 11: Hoare triple {898#(not (= |init_#in~size| 1000000))} assume true; {898#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 20:20:48,585 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {898#(not (= |init_#in~size| 1000000))} {872#true} #99#return; {873#false} is VALID [2020-07-10 20:20:48,587 INFO L263 TraceCheckUtils]: 0: Hoare triple {872#true} call ULTIMATE.init(); {892#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:20:48,588 INFO L280 TraceCheckUtils]: 1: Hoare triple {892#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {872#true} is VALID [2020-07-10 20:20:48,588 INFO L280 TraceCheckUtils]: 2: Hoare triple {872#true} #valid := #valid[0 := 0]; {872#true} is VALID [2020-07-10 20:20:48,588 INFO L280 TraceCheckUtils]: 3: Hoare triple {872#true} assume 0 < #StackHeapBarrier; {872#true} is VALID [2020-07-10 20:20:48,589 INFO L280 TraceCheckUtils]: 4: Hoare triple {872#true} assume true; {872#true} is VALID [2020-07-10 20:20:48,589 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {872#true} {872#true} #103#return; {872#true} is VALID [2020-07-10 20:20:48,590 INFO L263 TraceCheckUtils]: 6: Hoare triple {872#true} call #t~ret6 := main(); {872#true} is VALID [2020-07-10 20:20:48,590 INFO L280 TraceCheckUtils]: 7: Hoare triple {872#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000); srcloc: mainENTRY {872#true} is VALID [2020-07-10 20:20:48,590 INFO L280 TraceCheckUtils]: 8: Hoare triple {872#true} havoc ~i~1; {872#true} is VALID [2020-07-10 20:20:48,591 INFO L280 TraceCheckUtils]: 9: Hoare triple {872#true} havoc ~flag~0; {872#true} is VALID [2020-07-10 20:20:48,591 INFO L280 TraceCheckUtils]: 10: Hoare triple {872#true} ~flag~0 := 0; {872#true} is VALID [2020-07-10 20:20:48,593 INFO L263 TraceCheckUtils]: 11: Hoare triple {872#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {893#(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-10 20:20:48,594 INFO L280 TraceCheckUtils]: 12: Hoare triple {893#(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; {872#true} is VALID [2020-07-10 20:20:48,595 INFO L280 TraceCheckUtils]: 13: Hoare triple {872#true} ~size := #in~size; {894#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} is VALID [2020-07-10 20:20:48,595 INFO L280 TraceCheckUtils]: 14: Hoare triple {894#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} havoc ~i~0; {894#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} is VALID [2020-07-10 20:20:48,596 INFO L280 TraceCheckUtils]: 15: Hoare triple {894#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} ~i~0 := 0; {895#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 20:20:48,597 INFO L280 TraceCheckUtils]: 16: Hoare triple {895#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size); {895#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 20:20:48,597 INFO L280 TraceCheckUtils]: 17: Hoare triple {895#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4); srcloc: L14 {895#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 20:20:48,598 INFO L280 TraceCheckUtils]: 18: Hoare triple {895#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} SUMMARY for call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); srcloc: L14-1 {895#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 20:20:48,599 INFO L280 TraceCheckUtils]: 19: Hoare triple {895#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0; {896#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= |init_#t~post0| 0)))} is VALID [2020-07-10 20:20:48,599 INFO L280 TraceCheckUtils]: 20: Hoare triple {896#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= |init_#t~post0| 0)))} ~i~0 := 1 + #t~post0; {897#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 20:20:48,601 INFO L280 TraceCheckUtils]: 21: Hoare triple {897#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} havoc #t~post0; {897#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 20:20:48,609 INFO L280 TraceCheckUtils]: 22: Hoare triple {897#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {898#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 20:20:48,610 INFO L280 TraceCheckUtils]: 23: Hoare triple {898#(not (= |init_#in~size| 1000000))} assume true; {898#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 20:20:48,612 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {898#(not (= |init_#in~size| 1000000))} {872#true} #99#return; {873#false} is VALID [2020-07-10 20:20:48,612 INFO L280 TraceCheckUtils]: 25: Hoare triple {873#false} ~i~1 := 0; {873#false} is VALID [2020-07-10 20:20:48,613 INFO L280 TraceCheckUtils]: 26: Hoare triple {873#false} assume !(~i~1 < 1000000); {873#false} is VALID [2020-07-10 20:20:48,613 INFO L280 TraceCheckUtils]: 27: Hoare triple {873#false} ~i~1 := 0; {873#false} is VALID [2020-07-10 20:20:48,613 INFO L280 TraceCheckUtils]: 28: Hoare triple {873#false} assume !!(~i~1 < 1000000); {873#false} is VALID [2020-07-10 20:20:48,613 INFO L280 TraceCheckUtils]: 29: Hoare triple {873#false} assume 0 == ~flag~0; {873#false} is VALID [2020-07-10 20:20:48,614 INFO L280 TraceCheckUtils]: 30: Hoare triple {873#false} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); srcloc: L34 {873#false} is VALID [2020-07-10 20:20:48,614 INFO L263 TraceCheckUtils]: 31: Hoare triple {873#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {873#false} is VALID [2020-07-10 20:20:48,614 INFO L280 TraceCheckUtils]: 32: Hoare triple {873#false} ~cond := #in~cond; {873#false} is VALID [2020-07-10 20:20:48,614 INFO L280 TraceCheckUtils]: 33: Hoare triple {873#false} assume 0 == ~cond; {873#false} is VALID [2020-07-10 20:20:48,614 INFO L280 TraceCheckUtils]: 34: Hoare triple {873#false} assume !false; {873#false} is VALID [2020-07-10 20:20:48,617 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-10 20:20:48,618 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:48,618 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1544951247] [2020-07-10 20:20:48,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:48,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 20:20:48,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872972671] [2020-07-10 20:20:48,619 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2020-07-10 20:20:48,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:48,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 20:20:48,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:48,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 20:20:48,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:48,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 20:20:48,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-10 20:20:48,658 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 9 states. [2020-07-10 20:20:49,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:49,460 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2020-07-10 20:20:49,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 20:20:49,460 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2020-07-10 20:20:49,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:49,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:20:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 95 transitions. [2020-07-10 20:20:49,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:20:49,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 95 transitions. [2020-07-10 20:20:49,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 95 transitions. [2020-07-10 20:20:49,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:49,592 INFO L225 Difference]: With dead ends: 87 [2020-07-10 20:20:49,593 INFO L226 Difference]: Without dead ends: 60 [2020-07-10 20:20:49,593 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-07-10 20:20:49,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-10 20:20:49,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2020-07-10 20:20:49,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:49,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 56 states. [2020-07-10 20:20:49,682 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 56 states. [2020-07-10 20:20:49,682 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 56 states. [2020-07-10 20:20:49,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:49,685 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-10 20:20:49,685 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-07-10 20:20:49,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:49,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:49,687 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 60 states. [2020-07-10 20:20:49,687 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 60 states. [2020-07-10 20:20:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:49,690 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-10 20:20:49,690 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-07-10 20:20:49,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:49,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:49,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:49,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:49,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-10 20:20:49,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2020-07-10 20:20:49,694 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 35 [2020-07-10 20:20:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:49,694 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2020-07-10 20:20:49,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 20:20:49,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 60 transitions. [2020-07-10 20:20:49,793 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-10 20:20:49,793 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2020-07-10 20:20:49,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-10 20:20:49,794 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:49,795 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:20:49,795 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:20:49,795 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:49,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:49,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1218260359, now seen corresponding path program 2 times [2020-07-10 20:20:49,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:49,796 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1989625572] [2020-07-10 20:20:49,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:49,925 INFO L280 TraceCheckUtils]: 0: Hoare triple {1347#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1320#true} is VALID [2020-07-10 20:20:49,925 INFO L280 TraceCheckUtils]: 1: Hoare triple {1320#true} #valid := #valid[0 := 0]; {1320#true} is VALID [2020-07-10 20:20:49,925 INFO L280 TraceCheckUtils]: 2: Hoare triple {1320#true} assume 0 < #StackHeapBarrier; {1320#true} is VALID [2020-07-10 20:20:49,926 INFO L280 TraceCheckUtils]: 3: Hoare triple {1320#true} assume true; {1320#true} is VALID [2020-07-10 20:20:49,926 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1320#true} {1320#true} #103#return; {1320#true} is VALID [2020-07-10 20:20:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:49,950 INFO L280 TraceCheckUtils]: 0: Hoare triple {1348#(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; {1320#true} is VALID [2020-07-10 20:20:49,950 INFO L280 TraceCheckUtils]: 1: Hoare triple {1320#true} ~size := #in~size; {1320#true} is VALID [2020-07-10 20:20:49,950 INFO L280 TraceCheckUtils]: 2: Hoare triple {1320#true} havoc ~i~0; {1320#true} is VALID [2020-07-10 20:20:49,951 INFO L280 TraceCheckUtils]: 3: Hoare triple {1320#true} ~i~0 := 0; {1320#true} is VALID [2020-07-10 20:20:49,951 INFO L280 TraceCheckUtils]: 4: Hoare triple {1320#true} assume !!(~i~0 < ~size); {1320#true} is VALID [2020-07-10 20:20:49,951 INFO L280 TraceCheckUtils]: 5: Hoare triple {1320#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4); srcloc: L14 {1320#true} is VALID [2020-07-10 20:20:49,951 INFO L280 TraceCheckUtils]: 6: Hoare triple {1320#true} SUMMARY for call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); srcloc: L14-1 {1320#true} is VALID [2020-07-10 20:20:49,952 INFO L280 TraceCheckUtils]: 7: Hoare triple {1320#true} #t~post0 := ~i~0; {1320#true} is VALID [2020-07-10 20:20:49,952 INFO L280 TraceCheckUtils]: 8: Hoare triple {1320#true} ~i~0 := 1 + #t~post0; {1320#true} is VALID [2020-07-10 20:20:49,952 INFO L280 TraceCheckUtils]: 9: Hoare triple {1320#true} havoc #t~post0; {1320#true} is VALID [2020-07-10 20:20:49,952 INFO L280 TraceCheckUtils]: 10: Hoare triple {1320#true} assume !!(~i~0 < ~size); {1320#true} is VALID [2020-07-10 20:20:49,953 INFO L280 TraceCheckUtils]: 11: Hoare triple {1320#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4); srcloc: L14 {1320#true} is VALID [2020-07-10 20:20:49,953 INFO L280 TraceCheckUtils]: 12: Hoare triple {1320#true} SUMMARY for call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); srcloc: L14-1 {1320#true} is VALID [2020-07-10 20:20:49,953 INFO L280 TraceCheckUtils]: 13: Hoare triple {1320#true} #t~post0 := ~i~0; {1320#true} is VALID [2020-07-10 20:20:49,953 INFO L280 TraceCheckUtils]: 14: Hoare triple {1320#true} ~i~0 := 1 + #t~post0; {1320#true} is VALID [2020-07-10 20:20:49,954 INFO L280 TraceCheckUtils]: 15: Hoare triple {1320#true} havoc #t~post0; {1320#true} is VALID [2020-07-10 20:20:49,954 INFO L280 TraceCheckUtils]: 16: Hoare triple {1320#true} assume !(~i~0 < ~size); {1320#true} is VALID [2020-07-10 20:20:49,954 INFO L280 TraceCheckUtils]: 17: Hoare triple {1320#true} assume true; {1320#true} is VALID [2020-07-10 20:20:49,954 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1320#true} {1320#true} #99#return; {1320#true} is VALID [2020-07-10 20:20:49,956 INFO L263 TraceCheckUtils]: 0: Hoare triple {1320#true} call ULTIMATE.init(); {1347#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:20:49,956 INFO L280 TraceCheckUtils]: 1: Hoare triple {1347#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1320#true} is VALID [2020-07-10 20:20:49,956 INFO L280 TraceCheckUtils]: 2: Hoare triple {1320#true} #valid := #valid[0 := 0]; {1320#true} is VALID [2020-07-10 20:20:49,957 INFO L280 TraceCheckUtils]: 3: Hoare triple {1320#true} assume 0 < #StackHeapBarrier; {1320#true} is VALID [2020-07-10 20:20:49,957 INFO L280 TraceCheckUtils]: 4: Hoare triple {1320#true} assume true; {1320#true} is VALID [2020-07-10 20:20:49,957 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1320#true} {1320#true} #103#return; {1320#true} is VALID [2020-07-10 20:20:49,957 INFO L263 TraceCheckUtils]: 6: Hoare triple {1320#true} call #t~ret6 := main(); {1320#true} is VALID [2020-07-10 20:20:49,958 INFO L280 TraceCheckUtils]: 7: Hoare triple {1320#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000); srcloc: mainENTRY {1320#true} is VALID [2020-07-10 20:20:49,958 INFO L280 TraceCheckUtils]: 8: Hoare triple {1320#true} havoc ~i~1; {1320#true} is VALID [2020-07-10 20:20:49,958 INFO L280 TraceCheckUtils]: 9: Hoare triple {1320#true} havoc ~flag~0; {1320#true} is VALID [2020-07-10 20:20:49,958 INFO L280 TraceCheckUtils]: 10: Hoare triple {1320#true} ~flag~0 := 0; {1320#true} is VALID [2020-07-10 20:20:49,960 INFO L263 TraceCheckUtils]: 11: Hoare triple {1320#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {1348#(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-10 20:20:49,960 INFO L280 TraceCheckUtils]: 12: Hoare triple {1348#(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; {1320#true} is VALID [2020-07-10 20:20:49,960 INFO L280 TraceCheckUtils]: 13: Hoare triple {1320#true} ~size := #in~size; {1320#true} is VALID [2020-07-10 20:20:49,960 INFO L280 TraceCheckUtils]: 14: Hoare triple {1320#true} havoc ~i~0; {1320#true} is VALID [2020-07-10 20:20:49,961 INFO L280 TraceCheckUtils]: 15: Hoare triple {1320#true} ~i~0 := 0; {1320#true} is VALID [2020-07-10 20:20:49,961 INFO L280 TraceCheckUtils]: 16: Hoare triple {1320#true} assume !!(~i~0 < ~size); {1320#true} is VALID [2020-07-10 20:20:49,961 INFO L280 TraceCheckUtils]: 17: Hoare triple {1320#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4); srcloc: L14 {1320#true} is VALID [2020-07-10 20:20:49,961 INFO L280 TraceCheckUtils]: 18: Hoare triple {1320#true} SUMMARY for call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); srcloc: L14-1 {1320#true} is VALID [2020-07-10 20:20:49,962 INFO L280 TraceCheckUtils]: 19: Hoare triple {1320#true} #t~post0 := ~i~0; {1320#true} is VALID [2020-07-10 20:20:49,962 INFO L280 TraceCheckUtils]: 20: Hoare triple {1320#true} ~i~0 := 1 + #t~post0; {1320#true} is VALID [2020-07-10 20:20:49,962 INFO L280 TraceCheckUtils]: 21: Hoare triple {1320#true} havoc #t~post0; {1320#true} is VALID [2020-07-10 20:20:49,963 INFO L280 TraceCheckUtils]: 22: Hoare triple {1320#true} assume !!(~i~0 < ~size); {1320#true} is VALID [2020-07-10 20:20:49,963 INFO L280 TraceCheckUtils]: 23: Hoare triple {1320#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4); srcloc: L14 {1320#true} is VALID [2020-07-10 20:20:49,963 INFO L280 TraceCheckUtils]: 24: Hoare triple {1320#true} SUMMARY for call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); srcloc: L14-1 {1320#true} is VALID [2020-07-10 20:20:49,963 INFO L280 TraceCheckUtils]: 25: Hoare triple {1320#true} #t~post0 := ~i~0; {1320#true} is VALID [2020-07-10 20:20:49,964 INFO L280 TraceCheckUtils]: 26: Hoare triple {1320#true} ~i~0 := 1 + #t~post0; {1320#true} is VALID [2020-07-10 20:20:49,964 INFO L280 TraceCheckUtils]: 27: Hoare triple {1320#true} havoc #t~post0; {1320#true} is VALID [2020-07-10 20:20:49,964 INFO L280 TraceCheckUtils]: 28: Hoare triple {1320#true} assume !(~i~0 < ~size); {1320#true} is VALID [2020-07-10 20:20:49,964 INFO L280 TraceCheckUtils]: 29: Hoare triple {1320#true} assume true; {1320#true} is VALID [2020-07-10 20:20:49,965 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1320#true} {1320#true} #99#return; {1320#true} is VALID [2020-07-10 20:20:49,965 INFO L280 TraceCheckUtils]: 31: Hoare triple {1320#true} ~i~1 := 0; {1346#(= 0 main_~i~1)} is VALID [2020-07-10 20:20:49,966 INFO L280 TraceCheckUtils]: 32: Hoare triple {1346#(= 0 main_~i~1)} assume !(~i~1 < 1000000); {1321#false} is VALID [2020-07-10 20:20:49,966 INFO L280 TraceCheckUtils]: 33: Hoare triple {1321#false} ~i~1 := 0; {1321#false} is VALID [2020-07-10 20:20:49,966 INFO L280 TraceCheckUtils]: 34: Hoare triple {1321#false} assume !!(~i~1 < 1000000); {1321#false} is VALID [2020-07-10 20:20:49,967 INFO L280 TraceCheckUtils]: 35: Hoare triple {1321#false} assume 0 == ~flag~0; {1321#false} is VALID [2020-07-10 20:20:49,967 INFO L280 TraceCheckUtils]: 36: Hoare triple {1321#false} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); srcloc: L34 {1321#false} is VALID [2020-07-10 20:20:49,967 INFO L263 TraceCheckUtils]: 37: Hoare triple {1321#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {1321#false} is VALID [2020-07-10 20:20:49,967 INFO L280 TraceCheckUtils]: 38: Hoare triple {1321#false} ~cond := #in~cond; {1321#false} is VALID [2020-07-10 20:20:49,968 INFO L280 TraceCheckUtils]: 39: Hoare triple {1321#false} assume 0 == ~cond; {1321#false} is VALID [2020-07-10 20:20:49,968 INFO L280 TraceCheckUtils]: 40: Hoare triple {1321#false} assume !false; {1321#false} is VALID [2020-07-10 20:20:49,970 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-10 20:20:49,970 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:49,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1989625572] [2020-07-10 20:20:49,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:49,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:20:49,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93035363] [2020-07-10 20:20:49,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-07-10 20:20:49,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:49,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:20:50,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:50,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:20:50,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:50,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:20:50,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:20:50,007 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2020-07-10 20:20:50,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:50,424 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2020-07-10 20:20:50,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 20:20:50,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-07-10 20:20:50,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:50,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:20:50,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2020-07-10 20:20:50,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:20:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2020-07-10 20:20:50,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 90 transitions. [2020-07-10 20:20:50,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:50,513 INFO L225 Difference]: With dead ends: 86 [2020-07-10 20:20:50,513 INFO L226 Difference]: Without dead ends: 71 [2020-07-10 20:20:50,514 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:20:50,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-07-10 20:20:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 57. [2020-07-10 20:20:50,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:50,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 57 states. [2020-07-10 20:20:50,590 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 57 states. [2020-07-10 20:20:50,590 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 57 states. [2020-07-10 20:20:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:50,594 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-10 20:20:50,594 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2020-07-10 20:20:50,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:50,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:50,595 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 71 states. [2020-07-10 20:20:50,595 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 71 states. [2020-07-10 20:20:50,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:50,599 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-10 20:20:50,599 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2020-07-10 20:20:50,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:50,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:50,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:50,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:50,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-10 20:20:50,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2020-07-10 20:20:50,603 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 41 [2020-07-10 20:20:50,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:50,603 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2020-07-10 20:20:50,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:20:50,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 61 transitions. [2020-07-10 20:20:50,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:50,676 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2020-07-10 20:20:50,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-10 20:20:50,678 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:50,678 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:20:50,679 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:20:50,679 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:50,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:50,679 INFO L82 PathProgramCache]: Analyzing trace with hash -632447720, now seen corresponding path program 1 times [2020-07-10 20:20:50,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:50,680 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1191362807] [2020-07-10 20:20:50,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:50,706 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 20:20:50,707 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 20:20:50,713 INFO L168 Benchmark]: Toolchain (without parser) took 6098.15 ms. Allocated memory was 139.5 MB in the beginning and 295.2 MB in the end (delta: 155.7 MB). Free memory was 103.4 MB in the beginning and 264.3 MB in the end (delta: -160.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 20:20:50,715 INFO L168 Benchmark]: CDTParser took 1.02 ms. Allocated memory is still 139.5 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-10 20:20:50,716 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.82 ms. Allocated memory is still 139.5 MB. Free memory was 103.2 MB in the beginning and 92.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:50,719 INFO L168 Benchmark]: Boogie Preprocessor took 133.21 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 92.4 MB in the beginning and 181.5 MB in the end (delta: -89.1 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:50,724 INFO L168 Benchmark]: RCFGBuilder took 450.06 ms. Allocated memory is still 203.9 MB. Free memory was 181.5 MB in the beginning and 154.6 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:50,728 INFO L168 Benchmark]: TraceAbstraction took 5209.61 ms. Allocated memory was 203.9 MB in the beginning and 295.2 MB in the end (delta: 91.2 MB). Free memory was 154.6 MB in the beginning and 264.3 MB in the end (delta: -109.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 20:20:50,738 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 1.02 ms. Allocated memory is still 139.5 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 299.82 ms. Allocated memory is still 139.5 MB. Free memory was 103.2 MB in the beginning and 92.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.21 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 92.4 MB in the beginning and 181.5 MB in the end (delta: -89.1 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 450.06 ms. Allocated memory is still 203.9 MB. Free memory was 181.5 MB in the beginning and 154.6 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5209.61 ms. Allocated memory was 203.9 MB in the beginning and 295.2 MB in the end (delta: 91.2 MB). Free memory was 154.6 MB in the beginning and 264.3 MB in the end (delta: -109.7 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...