/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-8fc6572 [2020-07-10 20:20:41,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:20:41,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:20:41,495 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:20:41,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:20:41,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:20:41,499 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:20:41,501 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:20:41,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:20:41,504 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:20:41,505 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:20:41,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:20:41,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:20:41,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:20:41,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:20:41,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:20:41,512 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:20:41,513 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:20:41,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:20:41,518 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:20:41,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:20:41,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:20:41,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:20:41,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:20:41,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:20:41,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:20:41,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:20:41,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:20:41,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:20:41,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:20:41,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:20:41,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:20:41,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:20:41,535 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:20:41,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:20:41,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:20:41,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:20:41,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:20:41,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:20:41,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:20:41,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:20:41,541 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:20:41,557 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:20:41,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:20:41,561 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:20:41,561 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:20:41,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:20:41,561 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:20:41,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:20:41,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:20:41,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:20:41,562 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:20:41,563 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:20:41,563 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:20:41,563 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:20:41,563 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:20:41,563 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:20:41,564 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:20:41,564 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:20:41,564 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:20:41,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:20:41,564 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:20:41,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:20:41,565 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:20:41,565 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:20:41,891 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:20:41,907 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:20:41,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:20:41,912 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:20:41,913 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:20:41,914 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-10 20:20:41,998 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85c0c73db/a6083182da7248eb89dc7b0de7f7686c/FLAGeec94bf88 [2020-07-10 20:20:42,504 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:20:42,505 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init.i [2020-07-10 20:20:42,515 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85c0c73db/a6083182da7248eb89dc7b0de7f7686c/FLAGeec94bf88 [2020-07-10 20:20:42,815 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85c0c73db/a6083182da7248eb89dc7b0de7f7686c [2020-07-10 20:20:42,825 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:20:42,828 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:20:42,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:20:42,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:20:42,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:20:42,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:20:42" (1/1) ... [2020-07-10 20:20:42,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67e202a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:42, skipping insertion in model container [2020-07-10 20:20:42,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:20:42" (1/1) ... [2020-07-10 20:20:42,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:20:42,866 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:20:43,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:20:43,114 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:20:43,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:20:43,158 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:20:43,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:43 WrapperNode [2020-07-10 20:20:43,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:20:43,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:20:43,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:20:43,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:20:43,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:43" (1/1) ... [2020-07-10 20:20:43,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:43" (1/1) ... [2020-07-10 20:20:43,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:43" (1/1) ... [2020-07-10 20:20:43,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:43" (1/1) ... [2020-07-10 20:20:43,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:43" (1/1) ... [2020-07-10 20:20:43,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:43" (1/1) ... [2020-07-10 20:20:43,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:43" (1/1) ... [2020-07-10 20:20:43,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:20:43,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:20:43,309 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:20:43,310 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:20:43,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:20:43,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:20:43,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:20:43,396 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:20:43,396 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2020-07-10 20:20:43,396 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:20:43,396 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 20:20:43,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:20:43,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:20:43,397 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-07-10 20:20:43,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 20:20:43,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 20:20:43,398 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:20:43,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:20:43,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 20:20:43,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:20:43,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:20:43,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:20:43,906 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:20:43,906 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 20:20:43,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:20:43 BoogieIcfgContainer [2020-07-10 20:20:43,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:20:43,913 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:20:43,914 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:20:43,918 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:20:43,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:20:42" (1/3) ... [2020-07-10 20:20:43,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac1b2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:20:43, skipping insertion in model container [2020-07-10 20:20:43,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:43" (2/3) ... [2020-07-10 20:20:43,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac1b2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:20:43, skipping insertion in model container [2020-07-10 20:20:43,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:20:43" (3/3) ... [2020-07-10 20:20:43,923 INFO L109 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init.i [2020-07-10 20:20:43,935 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:20:43,946 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:20:43,959 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:20:43,981 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:20:43,982 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:20:43,982 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:20:43,982 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:20:43,983 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:20:43,983 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:20:43,983 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:20:43,983 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:20:44,006 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2020-07-10 20:20:44,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 20:20:44,025 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:44,026 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:20:44,026 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:44,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:44,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1392671971, now seen corresponding path program 1 times [2020-07-10 20:20:44,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:44,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [817741942] [2020-07-10 20:20:44,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:44,319 INFO L280 TraceCheckUtils]: 0: Hoare triple {73#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {59#true} is VALID [2020-07-10 20:20:44,320 INFO L280 TraceCheckUtils]: 1: Hoare triple {59#true} #valid := #valid[0 := 0]; {59#true} is VALID [2020-07-10 20:20:44,320 INFO L280 TraceCheckUtils]: 2: Hoare triple {59#true} assume 0 < #StackHeapBarrier; {59#true} is VALID [2020-07-10 20:20:44,321 INFO L280 TraceCheckUtils]: 3: Hoare triple {59#true} assume true; {59#true} is VALID [2020-07-10 20:20:44,322 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {59#true} {59#true} #99#return; {59#true} is VALID [2020-07-10 20:20:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:44,370 INFO L280 TraceCheckUtils]: 0: Hoare triple {74#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {59#true} is VALID [2020-07-10 20:20:44,371 INFO L280 TraceCheckUtils]: 1: Hoare triple {59#true} ~size := #in~size; {59#true} is VALID [2020-07-10 20:20:44,372 INFO L280 TraceCheckUtils]: 2: Hoare triple {59#true} havoc ~i~0; {59#true} is VALID [2020-07-10 20:20:44,372 INFO L280 TraceCheckUtils]: 3: Hoare triple {59#true} ~i~0 := 0; {59#true} is VALID [2020-07-10 20:20:44,374 INFO L280 TraceCheckUtils]: 4: Hoare triple {59#true} assume !true; {60#false} is VALID [2020-07-10 20:20:44,374 INFO L280 TraceCheckUtils]: 5: Hoare triple {60#false} assume true; {60#false} is VALID [2020-07-10 20:20:44,375 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {60#false} {59#true} #103#return; {60#false} is VALID [2020-07-10 20:20:44,377 INFO L263 TraceCheckUtils]: 0: Hoare triple {59#true} call ULTIMATE.init(); {73#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:20:44,378 INFO L280 TraceCheckUtils]: 1: Hoare triple {73#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {59#true} is VALID [2020-07-10 20:20:44,378 INFO L280 TraceCheckUtils]: 2: Hoare triple {59#true} #valid := #valid[0 := 0]; {59#true} is VALID [2020-07-10 20:20:44,379 INFO L280 TraceCheckUtils]: 3: Hoare triple {59#true} assume 0 < #StackHeapBarrier; {59#true} is VALID [2020-07-10 20:20:44,379 INFO L280 TraceCheckUtils]: 4: Hoare triple {59#true} assume true; {59#true} is VALID [2020-07-10 20:20:44,380 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {59#true} {59#true} #99#return; {59#true} is VALID [2020-07-10 20:20:44,380 INFO L263 TraceCheckUtils]: 6: Hoare triple {59#true} call #t~ret6 := main(); {59#true} is VALID [2020-07-10 20:20:44,381 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-10 20:20:44,381 INFO L280 TraceCheckUtils]: 8: Hoare triple {59#true} havoc ~i~1; {59#true} is VALID [2020-07-10 20:20:44,382 INFO L280 TraceCheckUtils]: 9: Hoare triple {59#true} havoc ~flag~0; {59#true} is VALID [2020-07-10 20:20:44,382 INFO L280 TraceCheckUtils]: 10: Hoare triple {59#true} ~flag~0 := 0; {59#true} is VALID [2020-07-10 20:20:44,385 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-10 20:20:44,386 INFO L280 TraceCheckUtils]: 12: Hoare triple {74#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {59#true} is VALID [2020-07-10 20:20:44,387 INFO L280 TraceCheckUtils]: 13: Hoare triple {59#true} ~size := #in~size; {59#true} is VALID [2020-07-10 20:20:44,387 INFO L280 TraceCheckUtils]: 14: Hoare triple {59#true} havoc ~i~0; {59#true} is VALID [2020-07-10 20:20:44,387 INFO L280 TraceCheckUtils]: 15: Hoare triple {59#true} ~i~0 := 0; {59#true} is VALID [2020-07-10 20:20:44,389 INFO L280 TraceCheckUtils]: 16: Hoare triple {59#true} assume !true; {60#false} is VALID [2020-07-10 20:20:44,389 INFO L280 TraceCheckUtils]: 17: Hoare triple {60#false} assume true; {60#false} is VALID [2020-07-10 20:20:44,390 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {60#false} {59#true} #103#return; {60#false} is VALID [2020-07-10 20:20:44,390 INFO L280 TraceCheckUtils]: 19: Hoare triple {60#false} ~i~1 := 0; {60#false} is VALID [2020-07-10 20:20:44,391 INFO L280 TraceCheckUtils]: 20: Hoare triple {60#false} assume !(~i~1 < 100000); {60#false} is VALID [2020-07-10 20:20:44,391 INFO L280 TraceCheckUtils]: 21: Hoare triple {60#false} ~i~1 := 0; {60#false} is VALID [2020-07-10 20:20:44,392 INFO L280 TraceCheckUtils]: 22: Hoare triple {60#false} assume !!(~i~1 < 100000); {60#false} is VALID [2020-07-10 20:20:44,392 INFO L280 TraceCheckUtils]: 23: Hoare triple {60#false} assume 0 == ~flag~0; {60#false} is VALID [2020-07-10 20:20:44,393 INFO L280 TraceCheckUtils]: 24: Hoare triple {60#false} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); srcloc: L34 {60#false} is VALID [2020-07-10 20:20:44,393 INFO L263 TraceCheckUtils]: 25: Hoare triple {60#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {60#false} is VALID [2020-07-10 20:20:44,394 INFO L280 TraceCheckUtils]: 26: Hoare triple {60#false} ~cond := #in~cond; {60#false} is VALID [2020-07-10 20:20:44,394 INFO L280 TraceCheckUtils]: 27: Hoare triple {60#false} assume 0 == ~cond; {60#false} is VALID [2020-07-10 20:20:44,395 INFO L280 TraceCheckUtils]: 28: Hoare triple {60#false} assume !false; {60#false} is VALID [2020-07-10 20:20:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:20:44,402 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:44,405 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [817741942] [2020-07-10 20:20:44,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:44,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 20:20:44,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188269365] [2020-07-10 20:20:44,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-10 20:20:44,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:44,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 20:20:44,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:44,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 20:20:44,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:44,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 20:20:44,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 20:20:44,507 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 4 states. [2020-07-10 20:20:45,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:45,134 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions. [2020-07-10 20:20:45,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 20:20:45,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-10 20:20:45,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:45,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:20:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2020-07-10 20:20:45,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:20:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2020-07-10 20:20:45,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2020-07-10 20:20:45,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:45,345 INFO L225 Difference]: With dead ends: 94 [2020-07-10 20:20:45,345 INFO L226 Difference]: Without dead ends: 53 [2020-07-10 20:20:45,356 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:20:45,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-10 20:20:45,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2020-07-10 20:20:45,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:45,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 49 states. [2020-07-10 20:20:45,492 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 49 states. [2020-07-10 20:20:45,492 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 49 states. [2020-07-10 20:20:45,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:45,511 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2020-07-10 20:20:45,511 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2020-07-10 20:20:45,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:45,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:45,513 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 53 states. [2020-07-10 20:20:45,514 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 53 states. [2020-07-10 20:20:45,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:45,523 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2020-07-10 20:20:45,524 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2020-07-10 20:20:45,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:45,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:45,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:45,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:45,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-10 20:20:45,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2020-07-10 20:20:45,546 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 29 [2020-07-10 20:20:45,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:45,547 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2020-07-10 20:20:45,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 20:20:45,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 53 transitions. [2020-07-10 20:20:45,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:45,627 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2020-07-10 20:20:45,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 20:20:45,629 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:45,629 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:20:45,630 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:20:45,630 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:45,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:45,631 INFO L82 PathProgramCache]: Analyzing trace with hash 31734745, now seen corresponding path program 1 times [2020-07-10 20:20:45,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:45,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1481396427] [2020-07-10 20:20:45,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:45,803 INFO L280 TraceCheckUtils]: 0: Hoare triple {486#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {472#true} is VALID [2020-07-10 20:20:45,804 INFO L280 TraceCheckUtils]: 1: Hoare triple {472#true} #valid := #valid[0 := 0]; {472#true} is VALID [2020-07-10 20:20:45,804 INFO L280 TraceCheckUtils]: 2: Hoare triple {472#true} assume 0 < #StackHeapBarrier; {472#true} is VALID [2020-07-10 20:20:45,805 INFO L280 TraceCheckUtils]: 3: Hoare triple {472#true} assume true; {472#true} is VALID [2020-07-10 20:20:45,805 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {472#true} {472#true} #99#return; {472#true} is VALID [2020-07-10 20:20:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:45,987 INFO L280 TraceCheckUtils]: 0: Hoare triple {487#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {472#true} is VALID [2020-07-10 20:20:45,988 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-10 20:20:45,990 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-10 20:20:45,991 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-10 20:20:45,993 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-10 20:20:45,994 INFO L280 TraceCheckUtils]: 5: Hoare triple {490#(not (= |init_#in~size| 100000))} assume true; {490#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 20:20:45,996 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {490#(not (= |init_#in~size| 100000))} {472#true} #103#return; {473#false} is VALID [2020-07-10 20:20:45,998 INFO L263 TraceCheckUtils]: 0: Hoare triple {472#true} call ULTIMATE.init(); {486#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:20:45,999 INFO L280 TraceCheckUtils]: 1: Hoare triple {486#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {472#true} is VALID [2020-07-10 20:20:45,999 INFO L280 TraceCheckUtils]: 2: Hoare triple {472#true} #valid := #valid[0 := 0]; {472#true} is VALID [2020-07-10 20:20:46,000 INFO L280 TraceCheckUtils]: 3: Hoare triple {472#true} assume 0 < #StackHeapBarrier; {472#true} is VALID [2020-07-10 20:20:46,000 INFO L280 TraceCheckUtils]: 4: Hoare triple {472#true} assume true; {472#true} is VALID [2020-07-10 20:20:46,000 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {472#true} {472#true} #99#return; {472#true} is VALID [2020-07-10 20:20:46,001 INFO L263 TraceCheckUtils]: 6: Hoare triple {472#true} call #t~ret6 := main(); {472#true} is VALID [2020-07-10 20:20:46,001 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-10 20:20:46,002 INFO L280 TraceCheckUtils]: 8: Hoare triple {472#true} havoc ~i~1; {472#true} is VALID [2020-07-10 20:20:46,002 INFO L280 TraceCheckUtils]: 9: Hoare triple {472#true} havoc ~flag~0; {472#true} is VALID [2020-07-10 20:20:46,002 INFO L280 TraceCheckUtils]: 10: Hoare triple {472#true} ~flag~0 := 0; {472#true} is VALID [2020-07-10 20:20:46,004 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-10 20:20:46,005 INFO L280 TraceCheckUtils]: 12: Hoare triple {487#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {472#true} is VALID [2020-07-10 20:20:46,006 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-10 20:20:46,007 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-10 20:20:46,009 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-10 20:20:46,010 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-10 20:20:46,011 INFO L280 TraceCheckUtils]: 17: Hoare triple {490#(not (= |init_#in~size| 100000))} assume true; {490#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 20:20:46,013 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {490#(not (= |init_#in~size| 100000))} {472#true} #103#return; {473#false} is VALID [2020-07-10 20:20:46,013 INFO L280 TraceCheckUtils]: 19: Hoare triple {473#false} ~i~1 := 0; {473#false} is VALID [2020-07-10 20:20:46,014 INFO L280 TraceCheckUtils]: 20: Hoare triple {473#false} assume !(~i~1 < 100000); {473#false} is VALID [2020-07-10 20:20:46,014 INFO L280 TraceCheckUtils]: 21: Hoare triple {473#false} ~i~1 := 0; {473#false} is VALID [2020-07-10 20:20:46,014 INFO L280 TraceCheckUtils]: 22: Hoare triple {473#false} assume !!(~i~1 < 100000); {473#false} is VALID [2020-07-10 20:20:46,015 INFO L280 TraceCheckUtils]: 23: Hoare triple {473#false} assume 0 == ~flag~0; {473#false} is VALID [2020-07-10 20:20:46,015 INFO L280 TraceCheckUtils]: 24: Hoare triple {473#false} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); srcloc: L34 {473#false} is VALID [2020-07-10 20:20:46,016 INFO L263 TraceCheckUtils]: 25: Hoare triple {473#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {473#false} is VALID [2020-07-10 20:20:46,016 INFO L280 TraceCheckUtils]: 26: Hoare triple {473#false} ~cond := #in~cond; {473#false} is VALID [2020-07-10 20:20:46,016 INFO L280 TraceCheckUtils]: 27: Hoare triple {473#false} assume 0 == ~cond; {473#false} is VALID [2020-07-10 20:20:46,017 INFO L280 TraceCheckUtils]: 28: Hoare triple {473#false} assume !false; {473#false} is VALID [2020-07-10 20:20:46,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:20:46,020 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:46,021 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1481396427] [2020-07-10 20:20:46,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:46,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 20:20:46,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707012593] [2020-07-10 20:20:46,024 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2020-07-10 20:20:46,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:46,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 20:20:46,066 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:46,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 20:20:46,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:46,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 20:20:46,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:20:46,067 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 7 states. [2020-07-10 20:20:46,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:46,882 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2020-07-10 20:20:46,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 20:20:46,883 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2020-07-10 20:20:46,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:46,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:20:46,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2020-07-10 20:20:46,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:20:46,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2020-07-10 20:20:46,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 89 transitions. [2020-07-10 20:20:47,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:47,027 INFO L225 Difference]: With dead ends: 81 [2020-07-10 20:20:47,027 INFO L226 Difference]: Without dead ends: 54 [2020-07-10 20:20:47,029 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-10 20:20:47,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-10 20:20:47,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2020-07-10 20:20:47,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:47,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 50 states. [2020-07-10 20:20:47,100 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 50 states. [2020-07-10 20:20:47,100 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 50 states. [2020-07-10 20:20:47,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:47,105 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-07-10 20:20:47,105 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-07-10 20:20:47,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:47,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:47,106 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 54 states. [2020-07-10 20:20:47,106 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 54 states. [2020-07-10 20:20:47,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:47,110 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-07-10 20:20:47,110 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-07-10 20:20:47,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:47,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:47,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:47,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:47,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-10 20:20:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2020-07-10 20:20:47,115 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 29 [2020-07-10 20:20:47,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:47,115 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2020-07-10 20:20:47,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 20:20:47,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2020-07-10 20:20:47,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:47,209 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-07-10 20:20:47,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-10 20:20:47,211 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:47,211 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:20:47,212 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:20:47,212 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:47,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:47,212 INFO L82 PathProgramCache]: Analyzing trace with hash -579567659, now seen corresponding path program 1 times [2020-07-10 20:20:47,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:47,213 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [460883625] [2020-07-10 20:20:47,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:47,317 INFO L280 TraceCheckUtils]: 0: Hoare triple {892#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {872#true} is VALID [2020-07-10 20:20:47,317 INFO L280 TraceCheckUtils]: 1: Hoare triple {872#true} #valid := #valid[0 := 0]; {872#true} is VALID [2020-07-10 20:20:47,318 INFO L280 TraceCheckUtils]: 2: Hoare triple {872#true} assume 0 < #StackHeapBarrier; {872#true} is VALID [2020-07-10 20:20:47,318 INFO L280 TraceCheckUtils]: 3: Hoare triple {872#true} assume true; {872#true} is VALID [2020-07-10 20:20:47,318 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {872#true} {872#true} #99#return; {872#true} is VALID [2020-07-10 20:20:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:47,540 INFO L280 TraceCheckUtils]: 0: Hoare triple {893#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {872#true} is VALID [2020-07-10 20:20:47,544 INFO L280 TraceCheckUtils]: 1: Hoare triple {872#true} ~size := #in~size; {894#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} is VALID [2020-07-10 20:20:47,545 INFO L280 TraceCheckUtils]: 2: Hoare triple {894#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} havoc ~i~0; {894#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} is VALID [2020-07-10 20:20:47,546 INFO L280 TraceCheckUtils]: 3: Hoare triple {894#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} ~i~0 := 0; {895#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 20:20:47,547 INFO L280 TraceCheckUtils]: 4: Hoare triple {895#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} assume !!(~i~0 < ~size); {895#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 20:20:47,548 INFO L280 TraceCheckUtils]: 5: Hoare triple {895#(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 {895#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 20:20:47,549 INFO L280 TraceCheckUtils]: 6: Hoare triple {895#(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 {895#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 20:20:47,550 INFO L280 TraceCheckUtils]: 7: Hoare triple {895#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} #t~post0 := ~i~0; {896#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= |init_#t~post0| 0)))} is VALID [2020-07-10 20:20:47,551 INFO L280 TraceCheckUtils]: 8: Hoare triple {896#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= |init_#t~post0| 0)))} ~i~0 := 1 + #t~post0; {897#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 20:20:47,552 INFO L280 TraceCheckUtils]: 9: Hoare triple {897#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} havoc #t~post0; {897#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 20:20:47,553 INFO L280 TraceCheckUtils]: 10: Hoare triple {897#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} assume !(~i~0 < ~size); {898#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 20:20:47,554 INFO L280 TraceCheckUtils]: 11: Hoare triple {898#(not (= |init_#in~size| 100000))} assume true; {898#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 20:20:47,555 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {898#(not (= |init_#in~size| 100000))} {872#true} #103#return; {873#false} is VALID [2020-07-10 20:20:47,558 INFO L263 TraceCheckUtils]: 0: Hoare triple {872#true} call ULTIMATE.init(); {892#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:20:47,558 INFO L280 TraceCheckUtils]: 1: Hoare triple {892#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {872#true} is VALID [2020-07-10 20:20:47,559 INFO L280 TraceCheckUtils]: 2: Hoare triple {872#true} #valid := #valid[0 := 0]; {872#true} is VALID [2020-07-10 20:20:47,559 INFO L280 TraceCheckUtils]: 3: Hoare triple {872#true} assume 0 < #StackHeapBarrier; {872#true} is VALID [2020-07-10 20:20:47,559 INFO L280 TraceCheckUtils]: 4: Hoare triple {872#true} assume true; {872#true} is VALID [2020-07-10 20:20:47,560 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {872#true} {872#true} #99#return; {872#true} is VALID [2020-07-10 20:20:47,560 INFO L263 TraceCheckUtils]: 6: Hoare triple {872#true} call #t~ret6 := main(); {872#true} is VALID [2020-07-10 20:20:47,560 INFO L280 TraceCheckUtils]: 7: Hoare triple {872#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000); srcloc: mainENTRY {872#true} is VALID [2020-07-10 20:20:47,561 INFO L280 TraceCheckUtils]: 8: Hoare triple {872#true} havoc ~i~1; {872#true} is VALID [2020-07-10 20:20:47,561 INFO L280 TraceCheckUtils]: 9: Hoare triple {872#true} havoc ~flag~0; {872#true} is VALID [2020-07-10 20:20:47,561 INFO L280 TraceCheckUtils]: 10: Hoare triple {872#true} ~flag~0 := 0; {872#true} is VALID [2020-07-10 20:20:47,569 INFO L263 TraceCheckUtils]: 11: Hoare triple {872#true} call init(~#a~0.base, ~#a~0.offset, 100000); {893#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 20:20:47,570 INFO L280 TraceCheckUtils]: 12: Hoare triple {893#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {872#true} is VALID [2020-07-10 20:20:47,571 INFO L280 TraceCheckUtils]: 13: Hoare triple {872#true} ~size := #in~size; {894#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} is VALID [2020-07-10 20:20:47,571 INFO L280 TraceCheckUtils]: 14: Hoare triple {894#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} havoc ~i~0; {894#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} is VALID [2020-07-10 20:20:47,572 INFO L280 TraceCheckUtils]: 15: Hoare triple {894#(or (= 100000 init_~size) (= |init_#in~size| init_~size))} ~i~0 := 0; {895#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 20:20:47,573 INFO L280 TraceCheckUtils]: 16: Hoare triple {895#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} assume !!(~i~0 < ~size); {895#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 20:20:47,574 INFO L280 TraceCheckUtils]: 17: Hoare triple {895#(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 {895#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 20:20:47,574 INFO L280 TraceCheckUtils]: 18: Hoare triple {895#(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 {895#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 20:20:47,575 INFO L280 TraceCheckUtils]: 19: Hoare triple {895#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} #t~post0 := ~i~0; {896#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= |init_#t~post0| 0)))} is VALID [2020-07-10 20:20:47,576 INFO L280 TraceCheckUtils]: 20: Hoare triple {896#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= |init_#t~post0| 0)))} ~i~0 := 1 + #t~post0; {897#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 20:20:47,584 INFO L280 TraceCheckUtils]: 21: Hoare triple {897#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} havoc #t~post0; {897#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 20:20:47,587 INFO L280 TraceCheckUtils]: 22: Hoare triple {897#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} assume !(~i~0 < ~size); {898#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 20:20:47,588 INFO L280 TraceCheckUtils]: 23: Hoare triple {898#(not (= |init_#in~size| 100000))} assume true; {898#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 20:20:47,589 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {898#(not (= |init_#in~size| 100000))} {872#true} #103#return; {873#false} is VALID [2020-07-10 20:20:47,590 INFO L280 TraceCheckUtils]: 25: Hoare triple {873#false} ~i~1 := 0; {873#false} is VALID [2020-07-10 20:20:47,590 INFO L280 TraceCheckUtils]: 26: Hoare triple {873#false} assume !(~i~1 < 100000); {873#false} is VALID [2020-07-10 20:20:47,590 INFO L280 TraceCheckUtils]: 27: Hoare triple {873#false} ~i~1 := 0; {873#false} is VALID [2020-07-10 20:20:47,591 INFO L280 TraceCheckUtils]: 28: Hoare triple {873#false} assume !!(~i~1 < 100000); {873#false} is VALID [2020-07-10 20:20:47,591 INFO L280 TraceCheckUtils]: 29: Hoare triple {873#false} assume 0 == ~flag~0; {873#false} is VALID [2020-07-10 20:20:47,591 INFO L280 TraceCheckUtils]: 30: Hoare triple {873#false} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); srcloc: L34 {873#false} is VALID [2020-07-10 20:20:47,591 INFO L263 TraceCheckUtils]: 31: Hoare triple {873#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {873#false} is VALID [2020-07-10 20:20:47,592 INFO L280 TraceCheckUtils]: 32: Hoare triple {873#false} ~cond := #in~cond; {873#false} is VALID [2020-07-10 20:20:47,592 INFO L280 TraceCheckUtils]: 33: Hoare triple {873#false} assume 0 == ~cond; {873#false} is VALID [2020-07-10 20:20:47,592 INFO L280 TraceCheckUtils]: 34: Hoare triple {873#false} assume !false; {873#false} is VALID [2020-07-10 20:20:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:20:47,596 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:47,596 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [460883625] [2020-07-10 20:20:47,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:47,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 20:20:47,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894766089] [2020-07-10 20:20:47,597 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2020-07-10 20:20:47,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:47,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 20:20:47,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:47,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 20:20:47,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:47,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 20:20:47,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-10 20:20:47,636 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 9 states. [2020-07-10 20:20:48,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:48,534 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2020-07-10 20:20:48,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 20:20:48,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2020-07-10 20:20:48,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:48,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:20:48,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 95 transitions. [2020-07-10 20:20:48,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:20:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 95 transitions. [2020-07-10 20:20:48,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 95 transitions. [2020-07-10 20:20:48,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:48,661 INFO L225 Difference]: With dead ends: 87 [2020-07-10 20:20:48,661 INFO L226 Difference]: Without dead ends: 60 [2020-07-10 20:20:48,664 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-07-10 20:20:48,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-10 20:20:48,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2020-07-10 20:20:48,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:48,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 56 states. [2020-07-10 20:20:48,757 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 56 states. [2020-07-10 20:20:48,757 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 56 states. [2020-07-10 20:20:48,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:48,761 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-10 20:20:48,761 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-07-10 20:20:48,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:48,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:48,762 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 60 states. [2020-07-10 20:20:48,762 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 60 states. [2020-07-10 20:20:48,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:48,765 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-10 20:20:48,765 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-07-10 20:20:48,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:48,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:48,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:48,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:48,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-10 20:20:48,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2020-07-10 20:20:48,769 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 35 [2020-07-10 20:20:48,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:48,770 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2020-07-10 20:20:48,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 20:20:48,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 60 transitions. [2020-07-10 20:20:48,856 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2020-07-10 20:20:48,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-10 20:20:48,858 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:48,859 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:20:48,859 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:20:48,859 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:48,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:48,860 INFO L82 PathProgramCache]: Analyzing trace with hash 556324561, now seen corresponding path program 2 times [2020-07-10 20:20:48,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:48,860 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1433382770] [2020-07-10 20:20:48,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:48,950 INFO L280 TraceCheckUtils]: 0: Hoare triple {1347#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1320#true} is VALID [2020-07-10 20:20:48,951 INFO L280 TraceCheckUtils]: 1: Hoare triple {1320#true} #valid := #valid[0 := 0]; {1320#true} is VALID [2020-07-10 20:20:48,951 INFO L280 TraceCheckUtils]: 2: Hoare triple {1320#true} assume 0 < #StackHeapBarrier; {1320#true} is VALID [2020-07-10 20:20:48,951 INFO L280 TraceCheckUtils]: 3: Hoare triple {1320#true} assume true; {1320#true} is VALID [2020-07-10 20:20:48,952 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1320#true} {1320#true} #99#return; {1320#true} is VALID [2020-07-10 20:20:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:48,984 INFO L280 TraceCheckUtils]: 0: Hoare triple {1348#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1320#true} is VALID [2020-07-10 20:20:48,984 INFO L280 TraceCheckUtils]: 1: Hoare triple {1320#true} ~size := #in~size; {1320#true} is VALID [2020-07-10 20:20:48,985 INFO L280 TraceCheckUtils]: 2: Hoare triple {1320#true} havoc ~i~0; {1320#true} is VALID [2020-07-10 20:20:48,985 INFO L280 TraceCheckUtils]: 3: Hoare triple {1320#true} ~i~0 := 0; {1320#true} is VALID [2020-07-10 20:20:48,985 INFO L280 TraceCheckUtils]: 4: Hoare triple {1320#true} assume !!(~i~0 < ~size); {1320#true} is VALID [2020-07-10 20:20:48,986 INFO L280 TraceCheckUtils]: 5: Hoare triple {1320#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4); srcloc: L14 {1320#true} is VALID [2020-07-10 20:20:48,986 INFO L280 TraceCheckUtils]: 6: Hoare triple {1320#true} SUMMARY for call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); srcloc: L14-1 {1320#true} is VALID [2020-07-10 20:20:48,986 INFO L280 TraceCheckUtils]: 7: Hoare triple {1320#true} #t~post0 := ~i~0; {1320#true} is VALID [2020-07-10 20:20:48,986 INFO L280 TraceCheckUtils]: 8: Hoare triple {1320#true} ~i~0 := 1 + #t~post0; {1320#true} is VALID [2020-07-10 20:20:48,987 INFO L280 TraceCheckUtils]: 9: Hoare triple {1320#true} havoc #t~post0; {1320#true} is VALID [2020-07-10 20:20:48,987 INFO L280 TraceCheckUtils]: 10: Hoare triple {1320#true} assume !!(~i~0 < ~size); {1320#true} is VALID [2020-07-10 20:20:48,987 INFO L280 TraceCheckUtils]: 11: Hoare triple {1320#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4); srcloc: L14 {1320#true} is VALID [2020-07-10 20:20:48,988 INFO L280 TraceCheckUtils]: 12: Hoare triple {1320#true} SUMMARY for call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); srcloc: L14-1 {1320#true} is VALID [2020-07-10 20:20:48,988 INFO L280 TraceCheckUtils]: 13: Hoare triple {1320#true} #t~post0 := ~i~0; {1320#true} is VALID [2020-07-10 20:20:48,988 INFO L280 TraceCheckUtils]: 14: Hoare triple {1320#true} ~i~0 := 1 + #t~post0; {1320#true} is VALID [2020-07-10 20:20:48,989 INFO L280 TraceCheckUtils]: 15: Hoare triple {1320#true} havoc #t~post0; {1320#true} is VALID [2020-07-10 20:20:48,989 INFO L280 TraceCheckUtils]: 16: Hoare triple {1320#true} assume !(~i~0 < ~size); {1320#true} is VALID [2020-07-10 20:20:48,989 INFO L280 TraceCheckUtils]: 17: Hoare triple {1320#true} assume true; {1320#true} is VALID [2020-07-10 20:20:48,989 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1320#true} {1320#true} #103#return; {1320#true} is VALID [2020-07-10 20:20:48,991 INFO L263 TraceCheckUtils]: 0: Hoare triple {1320#true} call ULTIMATE.init(); {1347#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:20:48,992 INFO L280 TraceCheckUtils]: 1: Hoare triple {1347#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1320#true} is VALID [2020-07-10 20:20:48,992 INFO L280 TraceCheckUtils]: 2: Hoare triple {1320#true} #valid := #valid[0 := 0]; {1320#true} is VALID [2020-07-10 20:20:48,992 INFO L280 TraceCheckUtils]: 3: Hoare triple {1320#true} assume 0 < #StackHeapBarrier; {1320#true} is VALID [2020-07-10 20:20:48,992 INFO L280 TraceCheckUtils]: 4: Hoare triple {1320#true} assume true; {1320#true} is VALID [2020-07-10 20:20:48,993 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1320#true} {1320#true} #99#return; {1320#true} is VALID [2020-07-10 20:20:48,993 INFO L263 TraceCheckUtils]: 6: Hoare triple {1320#true} call #t~ret6 := main(); {1320#true} is VALID [2020-07-10 20:20:48,993 INFO L280 TraceCheckUtils]: 7: Hoare triple {1320#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000); srcloc: mainENTRY {1320#true} is VALID [2020-07-10 20:20:48,993 INFO L280 TraceCheckUtils]: 8: Hoare triple {1320#true} havoc ~i~1; {1320#true} is VALID [2020-07-10 20:20:48,993 INFO L280 TraceCheckUtils]: 9: Hoare triple {1320#true} havoc ~flag~0; {1320#true} is VALID [2020-07-10 20:20:48,994 INFO L280 TraceCheckUtils]: 10: Hoare triple {1320#true} ~flag~0 := 0; {1320#true} is VALID [2020-07-10 20:20:48,995 INFO L263 TraceCheckUtils]: 11: Hoare triple {1320#true} call init(~#a~0.base, ~#a~0.offset, 100000); {1348#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 20:20:48,995 INFO L280 TraceCheckUtils]: 12: Hoare triple {1348#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1320#true} is VALID [2020-07-10 20:20:48,996 INFO L280 TraceCheckUtils]: 13: Hoare triple {1320#true} ~size := #in~size; {1320#true} is VALID [2020-07-10 20:20:48,996 INFO L280 TraceCheckUtils]: 14: Hoare triple {1320#true} havoc ~i~0; {1320#true} is VALID [2020-07-10 20:20:48,996 INFO L280 TraceCheckUtils]: 15: Hoare triple {1320#true} ~i~0 := 0; {1320#true} is VALID [2020-07-10 20:20:48,997 INFO L280 TraceCheckUtils]: 16: Hoare triple {1320#true} assume !!(~i~0 < ~size); {1320#true} is VALID [2020-07-10 20:20:48,997 INFO L280 TraceCheckUtils]: 17: Hoare triple {1320#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4); srcloc: L14 {1320#true} is VALID [2020-07-10 20:20:48,997 INFO L280 TraceCheckUtils]: 18: Hoare triple {1320#true} SUMMARY for call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); srcloc: L14-1 {1320#true} is VALID [2020-07-10 20:20:48,997 INFO L280 TraceCheckUtils]: 19: Hoare triple {1320#true} #t~post0 := ~i~0; {1320#true} is VALID [2020-07-10 20:20:48,998 INFO L280 TraceCheckUtils]: 20: Hoare triple {1320#true} ~i~0 := 1 + #t~post0; {1320#true} is VALID [2020-07-10 20:20:48,998 INFO L280 TraceCheckUtils]: 21: Hoare triple {1320#true} havoc #t~post0; {1320#true} is VALID [2020-07-10 20:20:48,998 INFO L280 TraceCheckUtils]: 22: Hoare triple {1320#true} assume !!(~i~0 < ~size); {1320#true} is VALID [2020-07-10 20:20:48,998 INFO L280 TraceCheckUtils]: 23: Hoare triple {1320#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4); srcloc: L14 {1320#true} is VALID [2020-07-10 20:20:48,998 INFO L280 TraceCheckUtils]: 24: Hoare triple {1320#true} SUMMARY for call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); srcloc: L14-1 {1320#true} is VALID [2020-07-10 20:20:48,999 INFO L280 TraceCheckUtils]: 25: Hoare triple {1320#true} #t~post0 := ~i~0; {1320#true} is VALID [2020-07-10 20:20:48,999 INFO L280 TraceCheckUtils]: 26: Hoare triple {1320#true} ~i~0 := 1 + #t~post0; {1320#true} is VALID [2020-07-10 20:20:48,999 INFO L280 TraceCheckUtils]: 27: Hoare triple {1320#true} havoc #t~post0; {1320#true} is VALID [2020-07-10 20:20:48,999 INFO L280 TraceCheckUtils]: 28: Hoare triple {1320#true} assume !(~i~0 < ~size); {1320#true} is VALID [2020-07-10 20:20:49,000 INFO L280 TraceCheckUtils]: 29: Hoare triple {1320#true} assume true; {1320#true} is VALID [2020-07-10 20:20:49,000 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1320#true} {1320#true} #103#return; {1320#true} is VALID [2020-07-10 20:20:49,001 INFO L280 TraceCheckUtils]: 31: Hoare triple {1320#true} ~i~1 := 0; {1346#(= 0 main_~i~1)} is VALID [2020-07-10 20:20:49,002 INFO L280 TraceCheckUtils]: 32: Hoare triple {1346#(= 0 main_~i~1)} assume !(~i~1 < 100000); {1321#false} is VALID [2020-07-10 20:20:49,002 INFO L280 TraceCheckUtils]: 33: Hoare triple {1321#false} ~i~1 := 0; {1321#false} is VALID [2020-07-10 20:20:49,002 INFO L280 TraceCheckUtils]: 34: Hoare triple {1321#false} assume !!(~i~1 < 100000); {1321#false} is VALID [2020-07-10 20:20:49,003 INFO L280 TraceCheckUtils]: 35: Hoare triple {1321#false} assume 0 == ~flag~0; {1321#false} is VALID [2020-07-10 20:20:49,003 INFO L280 TraceCheckUtils]: 36: Hoare triple {1321#false} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); srcloc: L34 {1321#false} is VALID [2020-07-10 20:20:49,003 INFO L263 TraceCheckUtils]: 37: Hoare triple {1321#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {1321#false} is VALID [2020-07-10 20:20:49,004 INFO L280 TraceCheckUtils]: 38: Hoare triple {1321#false} ~cond := #in~cond; {1321#false} is VALID [2020-07-10 20:20:49,004 INFO L280 TraceCheckUtils]: 39: Hoare triple {1321#false} assume 0 == ~cond; {1321#false} is VALID [2020-07-10 20:20:49,004 INFO L280 TraceCheckUtils]: 40: Hoare triple {1321#false} assume !false; {1321#false} is VALID [2020-07-10 20:20:49,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:20:49,007 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:49,008 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1433382770] [2020-07-10 20:20:49,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:49,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:20:49,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851884474] [2020-07-10 20:20:49,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-07-10 20:20:49,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:49,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:20:49,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:49,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:20:49,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:49,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:20:49,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:20:49,058 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2020-07-10 20:20:49,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:49,505 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2020-07-10 20:20:49,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 20:20:49,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-07-10 20:20:49,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:49,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:20:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2020-07-10 20:20:49,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:20:49,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2020-07-10 20:20:49,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 90 transitions. [2020-07-10 20:20:49,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:49,622 INFO L225 Difference]: With dead ends: 86 [2020-07-10 20:20:49,622 INFO L226 Difference]: Without dead ends: 71 [2020-07-10 20:20:49,624 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:20:49,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-07-10 20:20:49,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 57. [2020-07-10 20:20:49,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:49,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 57 states. [2020-07-10 20:20:49,716 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 57 states. [2020-07-10 20:20:49,716 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 57 states. [2020-07-10 20:20:49,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:49,720 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-10 20:20:49,721 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2020-07-10 20:20:49,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:49,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:49,722 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 71 states. [2020-07-10 20:20:49,722 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 71 states. [2020-07-10 20:20:49,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:49,726 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-10 20:20:49,726 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2020-07-10 20:20:49,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:49,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:49,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:49,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:49,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-10 20:20:49,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2020-07-10 20:20:49,729 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 41 [2020-07-10 20:20:49,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:49,730 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2020-07-10 20:20:49,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:20:49,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 61 transitions. [2020-07-10 20:20:49,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:49,824 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2020-07-10 20:20:49,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-10 20:20:49,825 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:49,826 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:20:49,826 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:20:49,826 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:49,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:49,827 INFO L82 PathProgramCache]: Analyzing trace with hash 272366111, now seen corresponding path program 1 times [2020-07-10 20:20:49,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:49,827 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2077110337] [2020-07-10 20:20:49,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:49,850 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 20:20:49,851 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 20:20:49,857 INFO L168 Benchmark]: Toolchain (without parser) took 7029.56 ms. Allocated memory was 140.5 MB in the beginning and 282.6 MB in the end (delta: 142.1 MB). Free memory was 101.6 MB in the beginning and 141.8 MB in the end (delta: -40.3 MB). Peak memory consumption was 101.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:49,858 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 140.5 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-10 20:20:49,859 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.46 ms. Allocated memory is still 140.5 MB. Free memory was 101.4 MB in the beginning and 90.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:49,860 INFO L168 Benchmark]: Boogie Preprocessor took 148.45 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 90.7 MB in the beginning and 180.4 MB in the end (delta: -89.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:49,861 INFO L168 Benchmark]: RCFGBuilder took 602.94 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 154.1 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:49,864 INFO L168 Benchmark]: TraceAbstraction took 5941.19 ms. Allocated memory was 202.9 MB in the beginning and 282.6 MB in the end (delta: 79.7 MB). Free memory was 153.5 MB in the beginning and 141.8 MB in the end (delta: 11.6 MB). Peak memory consumption was 91.3 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:49,868 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.39 ms. Allocated memory is still 140.5 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 330.46 ms. Allocated memory is still 140.5 MB. Free memory was 101.4 MB in the beginning and 90.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 148.45 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 90.7 MB in the beginning and 180.4 MB in the end (delta: -89.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 602.94 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 154.1 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5941.19 ms. Allocated memory was 202.9 MB in the beginning and 282.6 MB in the end (delta: 79.7 MB). Free memory was 153.5 MB in the beginning and 141.8 MB in the end (delta: 11.6 MB). Peak memory consumption was 91.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...