/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-industry-pattern/array_of_struct_ptr_flag_init.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:47:07,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:47:07,119 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:47:07,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:47:07,137 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:47:07,139 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:47:07,140 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:47:07,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:47:07,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:47:07,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:47:07,158 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:47:07,160 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:47:07,160 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:47:07,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:47:07,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:47:07,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:47:07,166 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:47:07,168 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:47:07,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:47:07,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:47:07,178 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:47:07,181 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:47:07,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:47:07,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:47:07,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:47:07,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:47:07,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:47:07,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:47:07,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:47:07,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:47:07,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:47:07,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:47:07,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:47:07,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:47:07,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:47:07,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:47:07,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:47:07,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:47:07,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:47:07,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:47:07,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:47:07,197 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:47:07,224 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:47:07,224 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:47:07,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:47:07,228 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:47:07,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:47:07,229 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:47:07,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:47:07,230 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:47:07,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:47:07,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:47:07,230 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:47:07,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:47:07,231 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:47:07,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:47:07,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:47:07,231 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:47:07,231 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:47:07,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:47:07,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:07,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:47:07,236 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:47:07,236 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:47:07,236 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:47:07,505 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:47:07,518 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:47:07,521 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:47:07,523 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:47:07,523 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:47:07,524 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init.i [2020-07-18 00:47:07,602 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c5b8514/09896720c35d4d9e98d08c8954bfc5f9/FLAGdf3e857b5 [2020-07-18 00:47:08,102 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:47:08,103 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init.i [2020-07-18 00:47:08,109 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c5b8514/09896720c35d4d9e98d08c8954bfc5f9/FLAGdf3e857b5 [2020-07-18 00:47:08,497 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c5b8514/09896720c35d4d9e98d08c8954bfc5f9 [2020-07-18 00:47:08,507 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:47:08,510 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:47:08,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:08,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:47:08,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:47:08,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:08" (1/1) ... [2020-07-18 00:47:08,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@113bc861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:08, skipping insertion in model container [2020-07-18 00:47:08,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:08" (1/1) ... [2020-07-18 00:47:08,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:47:08,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:47:08,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:08,751 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:47:08,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:08,791 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:47:08,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:08 WrapperNode [2020-07-18 00:47:08,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:08,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:47:08,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:47:08,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:47:08,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:08" (1/1) ... [2020-07-18 00:47:08,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:08" (1/1) ... [2020-07-18 00:47:08,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:08" (1/1) ... [2020-07-18 00:47:08,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:08" (1/1) ... [2020-07-18 00:47:08,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:08" (1/1) ... [2020-07-18 00:47:08,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:08" (1/1) ... [2020-07-18 00:47:08,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:08" (1/1) ... [2020-07-18 00:47:08,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:47:08,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:47:08,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:47:08,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:47:08,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:08" (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-18 00:47:08,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:47:08,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:47:08,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:47:08,991 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2020-07-18 00:47:08,991 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:47:08,991 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 00:47:08,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:47:08,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:47:08,991 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-07-18 00:47:08,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 00:47:08,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-18 00:47:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:47:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 00:47:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-18 00:47:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:47:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:47:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:47:09,407 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:47:09,407 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-18 00:47:09,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:09 BoogieIcfgContainer [2020-07-18 00:47:09,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:47:09,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:47:09,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:47:09,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:47:09,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:47:08" (1/3) ... [2020-07-18 00:47:09,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6d973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:09, skipping insertion in model container [2020-07-18 00:47:09,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:08" (2/3) ... [2020-07-18 00:47:09,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6d973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:09, skipping insertion in model container [2020-07-18 00:47:09,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:09" (3/3) ... [2020-07-18 00:47:09,423 INFO L109 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init.i [2020-07-18 00:47:09,433 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:47:09,443 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:47:09,455 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:47:09,473 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:47:09,473 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:47:09,473 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:47:09,473 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:47:09,474 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:47:09,474 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:47:09,474 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:47:09,474 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:47:09,492 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2020-07-18 00:47:09,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-18 00:47:09,504 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:09,505 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-18 00:47:09,506 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:09,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:09,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1392671971, now seen corresponding path program 1 times [2020-07-18 00:47:09,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:09,522 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1805262650] [2020-07-18 00:47:09,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:09,759 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-18 00:47:09,760 INFO L280 TraceCheckUtils]: 1: Hoare triple {59#true} #valid := #valid[0 := 0]; {59#true} is VALID [2020-07-18 00:47:09,760 INFO L280 TraceCheckUtils]: 2: Hoare triple {59#true} assume 0 < #StackHeapBarrier; {59#true} is VALID [2020-07-18 00:47:09,761 INFO L280 TraceCheckUtils]: 3: Hoare triple {59#true} assume true; {59#true} is VALID [2020-07-18 00:47:09,761 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {59#true} {59#true} #99#return; {59#true} is VALID [2020-07-18 00:47:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:09,803 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-18 00:47:09,804 INFO L280 TraceCheckUtils]: 1: Hoare triple {59#true} ~size := #in~size; {59#true} is VALID [2020-07-18 00:47:09,805 INFO L280 TraceCheckUtils]: 2: Hoare triple {59#true} havoc ~i~0; {59#true} is VALID [2020-07-18 00:47:09,805 INFO L280 TraceCheckUtils]: 3: Hoare triple {59#true} ~i~0 := 0; {59#true} is VALID [2020-07-18 00:47:09,825 INFO L280 TraceCheckUtils]: 4: Hoare triple {59#true} assume !true; {60#false} is VALID [2020-07-18 00:47:09,825 INFO L280 TraceCheckUtils]: 5: Hoare triple {60#false} assume true; {60#false} is VALID [2020-07-18 00:47:09,826 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {60#false} {59#true} #103#return; {60#false} is VALID [2020-07-18 00:47:09,828 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-18 00:47:09,828 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-18 00:47:09,829 INFO L280 TraceCheckUtils]: 2: Hoare triple {59#true} #valid := #valid[0 := 0]; {59#true} is VALID [2020-07-18 00:47:09,829 INFO L280 TraceCheckUtils]: 3: Hoare triple {59#true} assume 0 < #StackHeapBarrier; {59#true} is VALID [2020-07-18 00:47:09,829 INFO L280 TraceCheckUtils]: 4: Hoare triple {59#true} assume true; {59#true} is VALID [2020-07-18 00:47:09,830 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {59#true} {59#true} #99#return; {59#true} is VALID [2020-07-18 00:47:09,830 INFO L263 TraceCheckUtils]: 6: Hoare triple {59#true} call #t~ret6 := main(); {59#true} is VALID [2020-07-18 00:47:09,831 INFO L280 TraceCheckUtils]: 7: Hoare triple {59#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000); srcloc: mainENTRY {59#true} is VALID [2020-07-18 00:47:09,831 INFO L280 TraceCheckUtils]: 8: Hoare triple {59#true} havoc ~i~1; {59#true} is VALID [2020-07-18 00:47:09,831 INFO L280 TraceCheckUtils]: 9: Hoare triple {59#true} havoc ~flag~0; {59#true} is VALID [2020-07-18 00:47:09,832 INFO L280 TraceCheckUtils]: 10: Hoare triple {59#true} ~flag~0 := 0; {59#true} is VALID [2020-07-18 00:47:09,835 INFO L263 TraceCheckUtils]: 11: Hoare triple {59#true} call init(~#a~0.base, ~#a~0.offset, 100000); {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-18 00:47:09,835 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-18 00:47:09,836 INFO L280 TraceCheckUtils]: 13: Hoare triple {59#true} ~size := #in~size; {59#true} is VALID [2020-07-18 00:47:09,836 INFO L280 TraceCheckUtils]: 14: Hoare triple {59#true} havoc ~i~0; {59#true} is VALID [2020-07-18 00:47:09,837 INFO L280 TraceCheckUtils]: 15: Hoare triple {59#true} ~i~0 := 0; {59#true} is VALID [2020-07-18 00:47:09,838 INFO L280 TraceCheckUtils]: 16: Hoare triple {59#true} assume !true; {60#false} is VALID [2020-07-18 00:47:09,839 INFO L280 TraceCheckUtils]: 17: Hoare triple {60#false} assume true; {60#false} is VALID [2020-07-18 00:47:09,839 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {60#false} {59#true} #103#return; {60#false} is VALID [2020-07-18 00:47:09,839 INFO L280 TraceCheckUtils]: 19: Hoare triple {60#false} ~i~1 := 0; {60#false} is VALID [2020-07-18 00:47:09,840 INFO L280 TraceCheckUtils]: 20: Hoare triple {60#false} assume !(~i~1 < 100000); {60#false} is VALID [2020-07-18 00:47:09,840 INFO L280 TraceCheckUtils]: 21: Hoare triple {60#false} ~i~1 := 0; {60#false} is VALID [2020-07-18 00:47:09,841 INFO L280 TraceCheckUtils]: 22: Hoare triple {60#false} assume !!(~i~1 < 100000); {60#false} is VALID [2020-07-18 00:47:09,841 INFO L280 TraceCheckUtils]: 23: Hoare triple {60#false} assume 0 == ~flag~0; {60#false} is VALID [2020-07-18 00:47:09,842 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-18 00:47:09,842 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-18 00:47:09,843 INFO L280 TraceCheckUtils]: 26: Hoare triple {60#false} ~cond := #in~cond; {60#false} is VALID [2020-07-18 00:47:09,843 INFO L280 TraceCheckUtils]: 27: Hoare triple {60#false} assume 0 == ~cond; {60#false} is VALID [2020-07-18 00:47:09,844 INFO L280 TraceCheckUtils]: 28: Hoare triple {60#false} assume !false; {60#false} is VALID [2020-07-18 00:47:09,848 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-18 00:47:09,851 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:09,853 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1805262650] [2020-07-18 00:47:09,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:09,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:47:09,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033407019] [2020-07-18 00:47:09,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-18 00:47:09,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:09,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:47:09,930 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-18 00:47:09,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:47:09,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:09,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:47:09,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:47:09,943 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 4 states. [2020-07-18 00:47:10,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:10,411 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions. [2020-07-18 00:47:10,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:47:10,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-18 00:47:10,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:10,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:47:10,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2020-07-18 00:47:10,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:47:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2020-07-18 00:47:10,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2020-07-18 00:47:10,580 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-18 00:47:10,595 INFO L225 Difference]: With dead ends: 94 [2020-07-18 00:47:10,596 INFO L226 Difference]: Without dead ends: 53 [2020-07-18 00:47:10,599 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:47:10,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-18 00:47:10,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2020-07-18 00:47:10,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:10,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 49 states. [2020-07-18 00:47:10,689 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 49 states. [2020-07-18 00:47:10,690 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 49 states. [2020-07-18 00:47:10,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:10,696 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2020-07-18 00:47:10,696 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2020-07-18 00:47:10,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:10,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:10,697 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 53 states. [2020-07-18 00:47:10,698 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 53 states. [2020-07-18 00:47:10,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:10,703 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2020-07-18 00:47:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2020-07-18 00:47:10,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:10,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:10,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:10,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-18 00:47:10,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2020-07-18 00:47:10,710 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 29 [2020-07-18 00:47:10,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:10,711 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2020-07-18 00:47:10,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:47:10,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 53 transitions. [2020-07-18 00:47:10,778 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-18 00:47:10,778 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2020-07-18 00:47:10,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-18 00:47:10,780 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:10,780 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-18 00:47:10,781 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:47:10,781 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:10,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:10,782 INFO L82 PathProgramCache]: Analyzing trace with hash 31734745, now seen corresponding path program 1 times [2020-07-18 00:47:10,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:10,782 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2079795196] [2020-07-18 00:47:10,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:10,904 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-18 00:47:10,905 INFO L280 TraceCheckUtils]: 1: Hoare triple {472#true} #valid := #valid[0 := 0]; {472#true} is VALID [2020-07-18 00:47:10,905 INFO L280 TraceCheckUtils]: 2: Hoare triple {472#true} assume 0 < #StackHeapBarrier; {472#true} is VALID [2020-07-18 00:47:10,905 INFO L280 TraceCheckUtils]: 3: Hoare triple {472#true} assume true; {472#true} is VALID [2020-07-18 00:47:10,906 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {472#true} {472#true} #99#return; {472#true} is VALID [2020-07-18 00:47:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:11,077 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-18 00:47:11,078 INFO L280 TraceCheckUtils]: 1: Hoare triple {472#true} ~size := #in~size; {488#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} is VALID [2020-07-18 00:47:11,080 INFO L280 TraceCheckUtils]: 2: Hoare triple {488#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} havoc ~i~0; {488#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} is VALID [2020-07-18 00:47:11,081 INFO L280 TraceCheckUtils]: 3: Hoare triple {488#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} ~i~0 := 0; {489#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-18 00:47:11,084 INFO L280 TraceCheckUtils]: 4: Hoare triple {489#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} assume !(~i~0 < ~size); {490#(not (= |init_#in~size| 100000))} is VALID [2020-07-18 00:47:11,088 INFO L280 TraceCheckUtils]: 5: Hoare triple {490#(not (= |init_#in~size| 100000))} assume true; {490#(not (= |init_#in~size| 100000))} is VALID [2020-07-18 00:47:11,091 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {490#(not (= |init_#in~size| 100000))} {472#true} #103#return; {473#false} is VALID [2020-07-18 00:47:11,094 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-18 00:47:11,095 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-18 00:47:11,095 INFO L280 TraceCheckUtils]: 2: Hoare triple {472#true} #valid := #valid[0 := 0]; {472#true} is VALID [2020-07-18 00:47:11,095 INFO L280 TraceCheckUtils]: 3: Hoare triple {472#true} assume 0 < #StackHeapBarrier; {472#true} is VALID [2020-07-18 00:47:11,096 INFO L280 TraceCheckUtils]: 4: Hoare triple {472#true} assume true; {472#true} is VALID [2020-07-18 00:47:11,096 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {472#true} {472#true} #99#return; {472#true} is VALID [2020-07-18 00:47:11,096 INFO L263 TraceCheckUtils]: 6: Hoare triple {472#true} call #t~ret6 := main(); {472#true} is VALID [2020-07-18 00:47:11,097 INFO L280 TraceCheckUtils]: 7: Hoare triple {472#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000); srcloc: mainENTRY {472#true} is VALID [2020-07-18 00:47:11,097 INFO L280 TraceCheckUtils]: 8: Hoare triple {472#true} havoc ~i~1; {472#true} is VALID [2020-07-18 00:47:11,098 INFO L280 TraceCheckUtils]: 9: Hoare triple {472#true} havoc ~flag~0; {472#true} is VALID [2020-07-18 00:47:11,100 INFO L280 TraceCheckUtils]: 10: Hoare triple {472#true} ~flag~0 := 0; {472#true} is VALID [2020-07-18 00:47:11,102 INFO L263 TraceCheckUtils]: 11: Hoare triple {472#true} call init(~#a~0.base, ~#a~0.offset, 100000); {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-18 00:47:11,103 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-18 00:47:11,104 INFO L280 TraceCheckUtils]: 13: Hoare triple {472#true} ~size := #in~size; {488#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} is VALID [2020-07-18 00:47:11,105 INFO L280 TraceCheckUtils]: 14: Hoare triple {488#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} havoc ~i~0; {488#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} is VALID [2020-07-18 00:47:11,106 INFO L280 TraceCheckUtils]: 15: Hoare triple {488#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} ~i~0 := 0; {489#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-18 00:47:11,107 INFO L280 TraceCheckUtils]: 16: Hoare triple {489#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} assume !(~i~0 < ~size); {490#(not (= |init_#in~size| 100000))} is VALID [2020-07-18 00:47:11,108 INFO L280 TraceCheckUtils]: 17: Hoare triple {490#(not (= |init_#in~size| 100000))} assume true; {490#(not (= |init_#in~size| 100000))} is VALID [2020-07-18 00:47:11,110 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {490#(not (= |init_#in~size| 100000))} {472#true} #103#return; {473#false} is VALID [2020-07-18 00:47:11,111 INFO L280 TraceCheckUtils]: 19: Hoare triple {473#false} ~i~1 := 0; {473#false} is VALID [2020-07-18 00:47:11,111 INFO L280 TraceCheckUtils]: 20: Hoare triple {473#false} assume !(~i~1 < 100000); {473#false} is VALID [2020-07-18 00:47:11,112 INFO L280 TraceCheckUtils]: 21: Hoare triple {473#false} ~i~1 := 0; {473#false} is VALID [2020-07-18 00:47:11,112 INFO L280 TraceCheckUtils]: 22: Hoare triple {473#false} assume !!(~i~1 < 100000); {473#false} is VALID [2020-07-18 00:47:11,113 INFO L280 TraceCheckUtils]: 23: Hoare triple {473#false} assume 0 == ~flag~0; {473#false} is VALID [2020-07-18 00:47:11,114 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-18 00:47:11,114 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-18 00:47:11,115 INFO L280 TraceCheckUtils]: 26: Hoare triple {473#false} ~cond := #in~cond; {473#false} is VALID [2020-07-18 00:47:11,116 INFO L280 TraceCheckUtils]: 27: Hoare triple {473#false} assume 0 == ~cond; {473#false} is VALID [2020-07-18 00:47:11,117 INFO L280 TraceCheckUtils]: 28: Hoare triple {473#false} assume !false; {473#false} is VALID [2020-07-18 00:47:11,121 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-18 00:47:11,144 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:11,145 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2079795196] [2020-07-18 00:47:11,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:11,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 00:47:11,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601645931] [2020-07-18 00:47:11,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-07-18 00:47:11,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:11,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 00:47:11,196 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-18 00:47:11,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 00:47:11,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:11,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 00:47:11,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:47:11,197 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 8 states. [2020-07-18 00:47:11,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:11,929 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2020-07-18 00:47:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-18 00:47:11,930 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-07-18 00:47:11,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:11,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:47:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2020-07-18 00:47:11,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:47:11,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2020-07-18 00:47:11,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 89 transitions. [2020-07-18 00:47:12,079 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-18 00:47:12,086 INFO L225 Difference]: With dead ends: 81 [2020-07-18 00:47:12,086 INFO L226 Difference]: Without dead ends: 54 [2020-07-18 00:47:12,088 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-07-18 00:47:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-18 00:47:12,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2020-07-18 00:47:12,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:12,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 50 states. [2020-07-18 00:47:12,197 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 50 states. [2020-07-18 00:47:12,197 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 50 states. [2020-07-18 00:47:12,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:12,201 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-07-18 00:47:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-07-18 00:47:12,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:12,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:12,202 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 54 states. [2020-07-18 00:47:12,203 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 54 states. [2020-07-18 00:47:12,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:12,206 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-07-18 00:47:12,206 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-07-18 00:47:12,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:12,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:12,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:12,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:12,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-18 00:47:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2020-07-18 00:47:12,211 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 29 [2020-07-18 00:47:12,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:12,211 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2020-07-18 00:47:12,211 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 00:47:12,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2020-07-18 00:47:12,290 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-18 00:47:12,291 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-07-18 00:47:12,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-18 00:47:12,292 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:12,292 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-18 00:47:12,292 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:47:12,293 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:12,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:12,293 INFO L82 PathProgramCache]: Analyzing trace with hash -579567659, now seen corresponding path program 1 times [2020-07-18 00:47:12,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:12,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [47295315] [2020-07-18 00:47:12,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:12,403 INFO L280 TraceCheckUtils]: 0: Hoare triple {893#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {873#true} is VALID [2020-07-18 00:47:12,403 INFO L280 TraceCheckUtils]: 1: Hoare triple {873#true} #valid := #valid[0 := 0]; {873#true} is VALID [2020-07-18 00:47:12,404 INFO L280 TraceCheckUtils]: 2: Hoare triple {873#true} assume 0 < #StackHeapBarrier; {873#true} is VALID [2020-07-18 00:47:12,404 INFO L280 TraceCheckUtils]: 3: Hoare triple {873#true} assume true; {873#true} is VALID [2020-07-18 00:47:12,404 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {873#true} {873#true} #99#return; {873#true} is VALID [2020-07-18 00:47:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:12,613 INFO L280 TraceCheckUtils]: 0: Hoare triple {894#(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; {873#true} is VALID [2020-07-18 00:47:12,614 INFO L280 TraceCheckUtils]: 1: Hoare triple {873#true} ~size := #in~size; {895#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} is VALID [2020-07-18 00:47:12,615 INFO L280 TraceCheckUtils]: 2: Hoare triple {895#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} havoc ~i~0; {895#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} is VALID [2020-07-18 00:47:12,616 INFO L280 TraceCheckUtils]: 3: Hoare triple {895#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} ~i~0 := 0; {896#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-18 00:47:12,616 INFO L280 TraceCheckUtils]: 4: Hoare triple {896#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} assume !!(~i~0 < ~size); {896#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-18 00:47:12,617 INFO L280 TraceCheckUtils]: 5: Hoare triple {896#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4); srcloc: L14 {896#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-18 00:47:12,618 INFO L280 TraceCheckUtils]: 6: Hoare triple {896#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} SUMMARY for call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); srcloc: L14-1 {896#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-18 00:47:12,619 INFO L280 TraceCheckUtils]: 7: Hoare triple {896#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} #t~post0 := ~i~0; {897#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= |init_#t~post0| 0)))} is VALID [2020-07-18 00:47:12,620 INFO L280 TraceCheckUtils]: 8: Hoare triple {897#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= |init_#t~post0| 0)))} ~i~0 := 1 + #t~post0; {898#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-18 00:47:12,621 INFO L280 TraceCheckUtils]: 9: Hoare triple {898#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} havoc #t~post0; {898#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-18 00:47:12,622 INFO L280 TraceCheckUtils]: 10: Hoare triple {898#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} assume !(~i~0 < ~size); {899#(not (= |init_#in~size| 100000))} is VALID [2020-07-18 00:47:12,623 INFO L280 TraceCheckUtils]: 11: Hoare triple {899#(not (= |init_#in~size| 100000))} assume true; {899#(not (= |init_#in~size| 100000))} is VALID [2020-07-18 00:47:12,623 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {899#(not (= |init_#in~size| 100000))} {873#true} #103#return; {874#false} is VALID [2020-07-18 00:47:12,632 INFO L263 TraceCheckUtils]: 0: Hoare triple {873#true} call ULTIMATE.init(); {893#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:47:12,632 INFO L280 TraceCheckUtils]: 1: Hoare triple {893#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {873#true} is VALID [2020-07-18 00:47:12,633 INFO L280 TraceCheckUtils]: 2: Hoare triple {873#true} #valid := #valid[0 := 0]; {873#true} is VALID [2020-07-18 00:47:12,633 INFO L280 TraceCheckUtils]: 3: Hoare triple {873#true} assume 0 < #StackHeapBarrier; {873#true} is VALID [2020-07-18 00:47:12,633 INFO L280 TraceCheckUtils]: 4: Hoare triple {873#true} assume true; {873#true} is VALID [2020-07-18 00:47:12,633 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {873#true} {873#true} #99#return; {873#true} is VALID [2020-07-18 00:47:12,634 INFO L263 TraceCheckUtils]: 6: Hoare triple {873#true} call #t~ret6 := main(); {873#true} is VALID [2020-07-18 00:47:12,634 INFO L280 TraceCheckUtils]: 7: Hoare triple {873#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000); srcloc: mainENTRY {873#true} is VALID [2020-07-18 00:47:12,634 INFO L280 TraceCheckUtils]: 8: Hoare triple {873#true} havoc ~i~1; {873#true} is VALID [2020-07-18 00:47:12,635 INFO L280 TraceCheckUtils]: 9: Hoare triple {873#true} havoc ~flag~0; {873#true} is VALID [2020-07-18 00:47:12,635 INFO L280 TraceCheckUtils]: 10: Hoare triple {873#true} ~flag~0 := 0; {873#true} is VALID [2020-07-18 00:47:12,639 INFO L263 TraceCheckUtils]: 11: Hoare triple {873#true} call init(~#a~0.base, ~#a~0.offset, 100000); {894#(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-18 00:47:12,639 INFO L280 TraceCheckUtils]: 12: Hoare triple {894#(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; {873#true} is VALID [2020-07-18 00:47:12,640 INFO L280 TraceCheckUtils]: 13: Hoare triple {873#true} ~size := #in~size; {895#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} is VALID [2020-07-18 00:47:12,641 INFO L280 TraceCheckUtils]: 14: Hoare triple {895#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} havoc ~i~0; {895#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} is VALID [2020-07-18 00:47:12,642 INFO L280 TraceCheckUtils]: 15: Hoare triple {895#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} ~i~0 := 0; {896#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-18 00:47:12,643 INFO L280 TraceCheckUtils]: 16: Hoare triple {896#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} assume !!(~i~0 < ~size); {896#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-18 00:47:12,643 INFO L280 TraceCheckUtils]: 17: Hoare triple {896#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4); srcloc: L14 {896#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-18 00:47:12,644 INFO L280 TraceCheckUtils]: 18: Hoare triple {896#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} SUMMARY for call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); srcloc: L14-1 {896#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-18 00:47:12,645 INFO L280 TraceCheckUtils]: 19: Hoare triple {896#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} #t~post0 := ~i~0; {897#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= |init_#t~post0| 0)))} is VALID [2020-07-18 00:47:12,646 INFO L280 TraceCheckUtils]: 20: Hoare triple {897#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= |init_#t~post0| 0)))} ~i~0 := 1 + #t~post0; {898#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-18 00:47:12,650 INFO L280 TraceCheckUtils]: 21: Hoare triple {898#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} havoc #t~post0; {898#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-18 00:47:12,655 INFO L280 TraceCheckUtils]: 22: Hoare triple {898#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} assume !(~i~0 < ~size); {899#(not (= |init_#in~size| 100000))} is VALID [2020-07-18 00:47:12,656 INFO L280 TraceCheckUtils]: 23: Hoare triple {899#(not (= |init_#in~size| 100000))} assume true; {899#(not (= |init_#in~size| 100000))} is VALID [2020-07-18 00:47:12,657 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {899#(not (= |init_#in~size| 100000))} {873#true} #103#return; {874#false} is VALID [2020-07-18 00:47:12,657 INFO L280 TraceCheckUtils]: 25: Hoare triple {874#false} ~i~1 := 0; {874#false} is VALID [2020-07-18 00:47:12,658 INFO L280 TraceCheckUtils]: 26: Hoare triple {874#false} assume !(~i~1 < 100000); {874#false} is VALID [2020-07-18 00:47:12,658 INFO L280 TraceCheckUtils]: 27: Hoare triple {874#false} ~i~1 := 0; {874#false} is VALID [2020-07-18 00:47:12,658 INFO L280 TraceCheckUtils]: 28: Hoare triple {874#false} assume !!(~i~1 < 100000); {874#false} is VALID [2020-07-18 00:47:12,658 INFO L280 TraceCheckUtils]: 29: Hoare triple {874#false} assume 0 == ~flag~0; {874#false} is VALID [2020-07-18 00:47:12,659 INFO L280 TraceCheckUtils]: 30: Hoare triple {874#false} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); srcloc: L34 {874#false} is VALID [2020-07-18 00:47:12,659 INFO L263 TraceCheckUtils]: 31: Hoare triple {874#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {874#false} is VALID [2020-07-18 00:47:12,659 INFO L280 TraceCheckUtils]: 32: Hoare triple {874#false} ~cond := #in~cond; {874#false} is VALID [2020-07-18 00:47:12,660 INFO L280 TraceCheckUtils]: 33: Hoare triple {874#false} assume 0 == ~cond; {874#false} is VALID [2020-07-18 00:47:12,660 INFO L280 TraceCheckUtils]: 34: Hoare triple {874#false} assume !false; {874#false} is VALID [2020-07-18 00:47:12,663 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-18 00:47:12,681 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:12,681 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [47295315] [2020-07-18 00:47:12,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:12,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-18 00:47:12,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132613528] [2020-07-18 00:47:12,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2020-07-18 00:47:12,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:12,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-18 00:47:12,727 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-18 00:47:12,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-18 00:47:12,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:12,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-18 00:47:12,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-18 00:47:12,729 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 10 states. [2020-07-18 00:47:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:13,681 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2020-07-18 00:47:13,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 00:47:13,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2020-07-18 00:47:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:13,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 00:47:13,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 95 transitions. [2020-07-18 00:47:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 00:47:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 95 transitions. [2020-07-18 00:47:13,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 95 transitions. [2020-07-18 00:47:13,796 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-18 00:47:13,799 INFO L225 Difference]: With dead ends: 87 [2020-07-18 00:47:13,799 INFO L226 Difference]: Without dead ends: 60 [2020-07-18 00:47:13,800 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2020-07-18 00:47:13,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-18 00:47:13,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2020-07-18 00:47:13,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:13,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 56 states. [2020-07-18 00:47:13,885 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 56 states. [2020-07-18 00:47:13,885 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 56 states. [2020-07-18 00:47:13,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:13,890 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-18 00:47:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-07-18 00:47:13,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:13,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:13,892 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 60 states. [2020-07-18 00:47:13,893 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 60 states. [2020-07-18 00:47:13,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:13,898 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-18 00:47:13,898 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-07-18 00:47:13,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:13,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:13,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:13,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-18 00:47:13,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2020-07-18 00:47:13,907 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 35 [2020-07-18 00:47:13,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:13,908 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2020-07-18 00:47:13,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-18 00:47:13,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 60 transitions. [2020-07-18 00:47:13,993 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-18 00:47:13,993 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2020-07-18 00:47:13,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-18 00:47:13,996 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:13,997 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-18 00:47:13,997 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:47:13,997 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:13,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:13,997 INFO L82 PathProgramCache]: Analyzing trace with hash 556324561, now seen corresponding path program 2 times [2020-07-18 00:47:13,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:13,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1820963338] [2020-07-18 00:47:13,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:14,109 INFO L280 TraceCheckUtils]: 0: Hoare triple {1349#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1322#true} is VALID [2020-07-18 00:47:14,109 INFO L280 TraceCheckUtils]: 1: Hoare triple {1322#true} #valid := #valid[0 := 0]; {1322#true} is VALID [2020-07-18 00:47:14,110 INFO L280 TraceCheckUtils]: 2: Hoare triple {1322#true} assume 0 < #StackHeapBarrier; {1322#true} is VALID [2020-07-18 00:47:14,110 INFO L280 TraceCheckUtils]: 3: Hoare triple {1322#true} assume true; {1322#true} is VALID [2020-07-18 00:47:14,110 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1322#true} {1322#true} #99#return; {1322#true} is VALID [2020-07-18 00:47:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:14,138 INFO L280 TraceCheckUtils]: 0: Hoare triple {1350#(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; {1322#true} is VALID [2020-07-18 00:47:14,138 INFO L280 TraceCheckUtils]: 1: Hoare triple {1322#true} ~size := #in~size; {1322#true} is VALID [2020-07-18 00:47:14,139 INFO L280 TraceCheckUtils]: 2: Hoare triple {1322#true} havoc ~i~0; {1322#true} is VALID [2020-07-18 00:47:14,139 INFO L280 TraceCheckUtils]: 3: Hoare triple {1322#true} ~i~0 := 0; {1322#true} is VALID [2020-07-18 00:47:14,139 INFO L280 TraceCheckUtils]: 4: Hoare triple {1322#true} assume !!(~i~0 < ~size); {1322#true} is VALID [2020-07-18 00:47:14,140 INFO L280 TraceCheckUtils]: 5: Hoare triple {1322#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4); srcloc: L14 {1322#true} is VALID [2020-07-18 00:47:14,140 INFO L280 TraceCheckUtils]: 6: Hoare triple {1322#true} SUMMARY for call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); srcloc: L14-1 {1322#true} is VALID [2020-07-18 00:47:14,140 INFO L280 TraceCheckUtils]: 7: Hoare triple {1322#true} #t~post0 := ~i~0; {1322#true} is VALID [2020-07-18 00:47:14,140 INFO L280 TraceCheckUtils]: 8: Hoare triple {1322#true} ~i~0 := 1 + #t~post0; {1322#true} is VALID [2020-07-18 00:47:14,141 INFO L280 TraceCheckUtils]: 9: Hoare triple {1322#true} havoc #t~post0; {1322#true} is VALID [2020-07-18 00:47:14,141 INFO L280 TraceCheckUtils]: 10: Hoare triple {1322#true} assume !!(~i~0 < ~size); {1322#true} is VALID [2020-07-18 00:47:14,141 INFO L280 TraceCheckUtils]: 11: Hoare triple {1322#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4); srcloc: L14 {1322#true} is VALID [2020-07-18 00:47:14,141 INFO L280 TraceCheckUtils]: 12: Hoare triple {1322#true} SUMMARY for call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); srcloc: L14-1 {1322#true} is VALID [2020-07-18 00:47:14,142 INFO L280 TraceCheckUtils]: 13: Hoare triple {1322#true} #t~post0 := ~i~0; {1322#true} is VALID [2020-07-18 00:47:14,142 INFO L280 TraceCheckUtils]: 14: Hoare triple {1322#true} ~i~0 := 1 + #t~post0; {1322#true} is VALID [2020-07-18 00:47:14,142 INFO L280 TraceCheckUtils]: 15: Hoare triple {1322#true} havoc #t~post0; {1322#true} is VALID [2020-07-18 00:47:14,142 INFO L280 TraceCheckUtils]: 16: Hoare triple {1322#true} assume !(~i~0 < ~size); {1322#true} is VALID [2020-07-18 00:47:14,143 INFO L280 TraceCheckUtils]: 17: Hoare triple {1322#true} assume true; {1322#true} is VALID [2020-07-18 00:47:14,143 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1322#true} {1322#true} #103#return; {1322#true} is VALID [2020-07-18 00:47:14,144 INFO L263 TraceCheckUtils]: 0: Hoare triple {1322#true} call ULTIMATE.init(); {1349#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:47:14,145 INFO L280 TraceCheckUtils]: 1: Hoare triple {1349#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1322#true} is VALID [2020-07-18 00:47:14,145 INFO L280 TraceCheckUtils]: 2: Hoare triple {1322#true} #valid := #valid[0 := 0]; {1322#true} is VALID [2020-07-18 00:47:14,145 INFO L280 TraceCheckUtils]: 3: Hoare triple {1322#true} assume 0 < #StackHeapBarrier; {1322#true} is VALID [2020-07-18 00:47:14,145 INFO L280 TraceCheckUtils]: 4: Hoare triple {1322#true} assume true; {1322#true} is VALID [2020-07-18 00:47:14,146 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1322#true} {1322#true} #99#return; {1322#true} is VALID [2020-07-18 00:47:14,146 INFO L263 TraceCheckUtils]: 6: Hoare triple {1322#true} call #t~ret6 := main(); {1322#true} is VALID [2020-07-18 00:47:14,146 INFO L280 TraceCheckUtils]: 7: Hoare triple {1322#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000); srcloc: mainENTRY {1322#true} is VALID [2020-07-18 00:47:14,146 INFO L280 TraceCheckUtils]: 8: Hoare triple {1322#true} havoc ~i~1; {1322#true} is VALID [2020-07-18 00:47:14,147 INFO L280 TraceCheckUtils]: 9: Hoare triple {1322#true} havoc ~flag~0; {1322#true} is VALID [2020-07-18 00:47:14,147 INFO L280 TraceCheckUtils]: 10: Hoare triple {1322#true} ~flag~0 := 0; {1322#true} is VALID [2020-07-18 00:47:14,148 INFO L263 TraceCheckUtils]: 11: Hoare triple {1322#true} call init(~#a~0.base, ~#a~0.offset, 100000); {1350#(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-18 00:47:14,148 INFO L280 TraceCheckUtils]: 12: Hoare triple {1350#(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; {1322#true} is VALID [2020-07-18 00:47:14,149 INFO L280 TraceCheckUtils]: 13: Hoare triple {1322#true} ~size := #in~size; {1322#true} is VALID [2020-07-18 00:47:14,149 INFO L280 TraceCheckUtils]: 14: Hoare triple {1322#true} havoc ~i~0; {1322#true} is VALID [2020-07-18 00:47:14,149 INFO L280 TraceCheckUtils]: 15: Hoare triple {1322#true} ~i~0 := 0; {1322#true} is VALID [2020-07-18 00:47:14,149 INFO L280 TraceCheckUtils]: 16: Hoare triple {1322#true} assume !!(~i~0 < ~size); {1322#true} is VALID [2020-07-18 00:47:14,150 INFO L280 TraceCheckUtils]: 17: Hoare triple {1322#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4); srcloc: L14 {1322#true} is VALID [2020-07-18 00:47:14,150 INFO L280 TraceCheckUtils]: 18: Hoare triple {1322#true} SUMMARY for call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); srcloc: L14-1 {1322#true} is VALID [2020-07-18 00:47:14,150 INFO L280 TraceCheckUtils]: 19: Hoare triple {1322#true} #t~post0 := ~i~0; {1322#true} is VALID [2020-07-18 00:47:14,150 INFO L280 TraceCheckUtils]: 20: Hoare triple {1322#true} ~i~0 := 1 + #t~post0; {1322#true} is VALID [2020-07-18 00:47:14,150 INFO L280 TraceCheckUtils]: 21: Hoare triple {1322#true} havoc #t~post0; {1322#true} is VALID [2020-07-18 00:47:14,151 INFO L280 TraceCheckUtils]: 22: Hoare triple {1322#true} assume !!(~i~0 < ~size); {1322#true} is VALID [2020-07-18 00:47:14,151 INFO L280 TraceCheckUtils]: 23: Hoare triple {1322#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4); srcloc: L14 {1322#true} is VALID [2020-07-18 00:47:14,151 INFO L280 TraceCheckUtils]: 24: Hoare triple {1322#true} SUMMARY for call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); srcloc: L14-1 {1322#true} is VALID [2020-07-18 00:47:14,151 INFO L280 TraceCheckUtils]: 25: Hoare triple {1322#true} #t~post0 := ~i~0; {1322#true} is VALID [2020-07-18 00:47:14,152 INFO L280 TraceCheckUtils]: 26: Hoare triple {1322#true} ~i~0 := 1 + #t~post0; {1322#true} is VALID [2020-07-18 00:47:14,152 INFO L280 TraceCheckUtils]: 27: Hoare triple {1322#true} havoc #t~post0; {1322#true} is VALID [2020-07-18 00:47:14,152 INFO L280 TraceCheckUtils]: 28: Hoare triple {1322#true} assume !(~i~0 < ~size); {1322#true} is VALID [2020-07-18 00:47:14,152 INFO L280 TraceCheckUtils]: 29: Hoare triple {1322#true} assume true; {1322#true} is VALID [2020-07-18 00:47:14,152 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1322#true} {1322#true} #103#return; {1322#true} is VALID [2020-07-18 00:47:14,153 INFO L280 TraceCheckUtils]: 31: Hoare triple {1322#true} ~i~1 := 0; {1348#(= 0 main_~i~1)} is VALID [2020-07-18 00:47:14,153 INFO L280 TraceCheckUtils]: 32: Hoare triple {1348#(= 0 main_~i~1)} assume !(~i~1 < 100000); {1323#false} is VALID [2020-07-18 00:47:14,154 INFO L280 TraceCheckUtils]: 33: Hoare triple {1323#false} ~i~1 := 0; {1323#false} is VALID [2020-07-18 00:47:14,154 INFO L280 TraceCheckUtils]: 34: Hoare triple {1323#false} assume !!(~i~1 < 100000); {1323#false} is VALID [2020-07-18 00:47:14,154 INFO L280 TraceCheckUtils]: 35: Hoare triple {1323#false} assume 0 == ~flag~0; {1323#false} is VALID [2020-07-18 00:47:14,154 INFO L280 TraceCheckUtils]: 36: Hoare triple {1323#false} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); srcloc: L34 {1323#false} is VALID [2020-07-18 00:47:14,155 INFO L263 TraceCheckUtils]: 37: Hoare triple {1323#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {1323#false} is VALID [2020-07-18 00:47:14,155 INFO L280 TraceCheckUtils]: 38: Hoare triple {1323#false} ~cond := #in~cond; {1323#false} is VALID [2020-07-18 00:47:14,155 INFO L280 TraceCheckUtils]: 39: Hoare triple {1323#false} assume 0 == ~cond; {1323#false} is VALID [2020-07-18 00:47:14,156 INFO L280 TraceCheckUtils]: 40: Hoare triple {1323#false} assume !false; {1323#false} is VALID [2020-07-18 00:47:14,157 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-18 00:47:14,160 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:14,160 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1820963338] [2020-07-18 00:47:14,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:14,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:47:14,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660202279] [2020-07-18 00:47:14,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-07-18 00:47:14,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:14,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:47:14,200 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-18 00:47:14,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:47:14,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:14,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:47:14,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:47:14,202 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2020-07-18 00:47:14,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:14,646 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2020-07-18 00:47:14,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:47:14,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-07-18 00:47:14,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:14,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:14,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2020-07-18 00:47:14,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:14,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2020-07-18 00:47:14,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 90 transitions. [2020-07-18 00:47:14,745 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-18 00:47:14,748 INFO L225 Difference]: With dead ends: 86 [2020-07-18 00:47:14,748 INFO L226 Difference]: Without dead ends: 71 [2020-07-18 00:47:14,749 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:47:14,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-07-18 00:47:14,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 57. [2020-07-18 00:47:14,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:14,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 57 states. [2020-07-18 00:47:14,844 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 57 states. [2020-07-18 00:47:14,844 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 57 states. [2020-07-18 00:47:14,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:14,849 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-18 00:47:14,849 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2020-07-18 00:47:14,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:14,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:14,850 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 71 states. [2020-07-18 00:47:14,850 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 71 states. [2020-07-18 00:47:14,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:14,854 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-18 00:47:14,854 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2020-07-18 00:47:14,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:14,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:14,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:14,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:14,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-18 00:47:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2020-07-18 00:47:14,858 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 41 [2020-07-18 00:47:14,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:14,858 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2020-07-18 00:47:14,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:47:14,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 61 transitions. [2020-07-18 00:47:14,948 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-18 00:47:14,949 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2020-07-18 00:47:14,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-18 00:47:14,950 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:14,951 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-18 00:47:14,951 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:47:14,951 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:14,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:14,952 INFO L82 PathProgramCache]: Analyzing trace with hash 272366111, now seen corresponding path program 1 times [2020-07-18 00:47:14,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:14,952 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [760709176] [2020-07-18 00:47:14,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:14,968 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:47:14,969 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:458) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:290) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:191) 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-18 00:47:14,974 INFO L168 Benchmark]: Toolchain (without parser) took 6464.95 ms. Allocated memory was 139.5 MB in the beginning and 296.2 MB in the end (delta: 156.8 MB). Free memory was 103.9 MB in the beginning and 261.9 MB in the end (delta: -158.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 00:47:14,975 INFO L168 Benchmark]: CDTParser took 0.31 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: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 00:47:14,976 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.49 ms. Allocated memory is still 139.5 MB. Free memory was 103.4 MB in the beginning and 92.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:14,976 INFO L168 Benchmark]: Boogie Preprocessor took 138.57 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.7 MB in the beginning and 181.4 MB in the end (delta: -88.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:14,977 INFO L168 Benchmark]: RCFGBuilder took 480.29 ms. Allocated memory is still 203.9 MB. Free memory was 181.4 MB in the beginning and 155.3 MB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:14,978 INFO L168 Benchmark]: TraceAbstraction took 5558.48 ms. Allocated memory was 203.9 MB in the beginning and 296.2 MB in the end (delta: 92.3 MB). Free memory was 154.6 MB in the beginning and 261.9 MB in the end (delta: -107.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 00:47:14,984 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 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: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 281.49 ms. Allocated memory is still 139.5 MB. Free memory was 103.4 MB in the beginning and 92.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.57 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.7 MB in the beginning and 181.4 MB in the end (delta: -88.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 480.29 ms. Allocated memory is still 203.9 MB. Free memory was 181.4 MB in the beginning and 155.3 MB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5558.48 ms. Allocated memory was 203.9 MB in the beginning and 296.2 MB in the end (delta: 92.3 MB). Free memory was 154.6 MB in the beginning and 261.9 MB in the end (delta: -107.3 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:458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...