/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/loop-acceleration/array_3-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 17:37:46,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 17:37:46,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 17:37:46,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 17:37:46,998 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 17:37:46,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 17:37:47,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 17:37:47,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 17:37:47,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 17:37:47,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 17:37:47,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 17:37:47,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 17:37:47,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 17:37:47,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 17:37:47,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 17:37:47,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 17:37:47,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 17:37:47,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 17:37:47,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 17:37:47,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 17:37:47,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 17:37:47,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 17:37:47,042 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 17:37:47,043 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 17:37:47,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 17:37:47,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 17:37:47,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 17:37:47,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 17:37:47,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 17:37:47,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 17:37:47,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 17:37:47,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 17:37:47,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 17:37:47,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 17:37:47,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 17:37:47,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 17:37:47,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 17:37:47,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 17:37:47,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 17:37:47,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 17:37:47,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 17:37:47,058 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 17:37:47,086 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 17:37:47,086 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 17:37:47,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 17:37:47,088 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 17:37:47,088 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 17:37:47,088 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 17:37:47,088 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 17:37:47,089 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 17:37:47,089 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 17:37:47,089 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 17:37:47,089 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 17:37:47,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 17:37:47,090 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 17:37:47,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 17:37:47,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 17:37:47,090 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 17:37:47,090 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 17:37:47,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 17:37:47,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 17:37:47,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 17:37:47,091 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 17:37:47,091 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 17:37:47,091 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 17:37:47,364 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 17:37:47,377 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 17:37:47,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 17:37:47,382 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 17:37:47,382 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 17:37:47,383 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_3-1.i [2020-07-08 17:37:47,457 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af490f9bd/67cea93160d04dd9b23f39fcf910a1f3/FLAGff961766a [2020-07-08 17:37:47,895 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 17:37:47,896 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_3-1.i [2020-07-08 17:37:47,902 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af490f9bd/67cea93160d04dd9b23f39fcf910a1f3/FLAGff961766a [2020-07-08 17:37:48,329 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af490f9bd/67cea93160d04dd9b23f39fcf910a1f3 [2020-07-08 17:37:48,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 17:37:48,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 17:37:48,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 17:37:48,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 17:37:48,348 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 17:37:48,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:37:48" (1/1) ... [2020-07-08 17:37:48,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@106af91f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:48, skipping insertion in model container [2020-07-08 17:37:48,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:37:48" (1/1) ... [2020-07-08 17:37:48,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 17:37:48,384 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 17:37:48,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:37:48,552 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 17:37:48,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:37:48,592 INFO L208 MainTranslator]: Completed translation [2020-07-08 17:37:48,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:48 WrapperNode [2020-07-08 17:37:48,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 17:37:48,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 17:37:48,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 17:37:48,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 17:37:48,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:48" (1/1) ... [2020-07-08 17:37:48,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:48" (1/1) ... [2020-07-08 17:37:48,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:48" (1/1) ... [2020-07-08 17:37:48,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:48" (1/1) ... [2020-07-08 17:37:48,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:48" (1/1) ... [2020-07-08 17:37:48,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:48" (1/1) ... [2020-07-08 17:37:48,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:48" (1/1) ... [2020-07-08 17:37:48,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 17:37:48,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 17:37:48,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 17:37:48,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 17:37:48,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:48" (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-08 17:37:48,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 17:37:48,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 17:37:48,779 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 17:37:48,779 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 17:37:48,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 17:37:48,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 17:37:48,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 17:37:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 17:37:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 17:37:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 17:37:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 17:37:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 17:37:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 17:37:48,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 17:37:49,080 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 17:37:49,080 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-08 17:37:49,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:37:49 BoogieIcfgContainer [2020-07-08 17:37:49,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 17:37:49,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 17:37:49,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 17:37:49,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 17:37:49,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 05:37:48" (1/3) ... [2020-07-08 17:37:49,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5c56d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:37:49, skipping insertion in model container [2020-07-08 17:37:49,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:48" (2/3) ... [2020-07-08 17:37:49,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5c56d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:37:49, skipping insertion in model container [2020-07-08 17:37:49,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:37:49" (3/3) ... [2020-07-08 17:37:49,093 INFO L109 eAbstractionObserver]: Analyzing ICFG array_3-1.i [2020-07-08 17:37:49,106 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 17:37:49,114 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 17:37:49,131 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 17:37:49,156 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 17:37:49,157 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 17:37:49,157 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 17:37:49,157 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 17:37:49,157 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 17:37:49,157 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 17:37:49,158 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 17:37:49,158 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 17:37:49,175 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-07-08 17:37:49,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-08 17:37:49,185 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:49,186 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:37:49,187 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:49,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:49,194 INFO L82 PathProgramCache]: Analyzing trace with hash -2145994368, now seen corresponding path program 1 times [2020-07-08 17:37:49,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:49,207 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [136338257] [2020-07-08 17:37:49,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:49,407 INFO L280 TraceCheckUtils]: 0: Hoare triple {49#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {42#true} is VALID [2020-07-08 17:37:49,408 INFO L280 TraceCheckUtils]: 1: Hoare triple {42#true} #valid := #valid[0 := 0]; {42#true} is VALID [2020-07-08 17:37:49,409 INFO L280 TraceCheckUtils]: 2: Hoare triple {42#true} assume 0 < #StackHeapBarrier; {42#true} is VALID [2020-07-08 17:37:49,409 INFO L280 TraceCheckUtils]: 3: Hoare triple {42#true} assume true; {42#true} is VALID [2020-07-08 17:37:49,410 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {42#true} {42#true} #68#return; {42#true} is VALID [2020-07-08 17:37:49,414 INFO L263 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {49#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 17:37:49,414 INFO L280 TraceCheckUtils]: 1: Hoare triple {49#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {42#true} is VALID [2020-07-08 17:37:49,415 INFO L280 TraceCheckUtils]: 2: Hoare triple {42#true} #valid := #valid[0 := 0]; {42#true} is VALID [2020-07-08 17:37:49,415 INFO L280 TraceCheckUtils]: 3: Hoare triple {42#true} assume 0 < #StackHeapBarrier; {42#true} is VALID [2020-07-08 17:37:49,415 INFO L280 TraceCheckUtils]: 4: Hoare triple {42#true} assume true; {42#true} is VALID [2020-07-08 17:37:49,416 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {42#true} {42#true} #68#return; {42#true} is VALID [2020-07-08 17:37:49,416 INFO L263 TraceCheckUtils]: 6: Hoare triple {42#true} call #t~ret4 := main(); {42#true} is VALID [2020-07-08 17:37:49,417 INFO L280 TraceCheckUtils]: 7: Hoare triple {42#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096); srcloc: mainENTRY {42#true} is VALID [2020-07-08 17:37:49,417 INFO L280 TraceCheckUtils]: 8: Hoare triple {42#true} havoc ~i~0; {42#true} is VALID [2020-07-08 17:37:49,418 INFO L280 TraceCheckUtils]: 9: Hoare triple {42#true} ~i~0 := 0; {42#true} is VALID [2020-07-08 17:37:49,419 INFO L280 TraceCheckUtils]: 10: Hoare triple {42#true} assume !true; {43#false} is VALID [2020-07-08 17:37:49,420 INFO L280 TraceCheckUtils]: 11: Hoare triple {43#false} ~i~0 := 0; {43#false} is VALID [2020-07-08 17:37:49,420 INFO L280 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2020-07-08 17:37:49,421 INFO L263 TraceCheckUtils]: 13: Hoare triple {43#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {43#false} is VALID [2020-07-08 17:37:49,421 INFO L280 TraceCheckUtils]: 14: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2020-07-08 17:37:49,422 INFO L280 TraceCheckUtils]: 15: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2020-07-08 17:37:49,422 INFO L280 TraceCheckUtils]: 16: Hoare triple {43#false} assume !false; {43#false} is VALID [2020-07-08 17:37:49,425 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-08 17:37:49,425 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:49,428 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [136338257] [2020-07-08 17:37:49,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:49,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 17:37:49,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401790008] [2020-07-08 17:37:49,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-08 17:37:49,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:49,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 17:37:49,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:49,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 17:37:49,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:49,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 17:37:49,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 17:37:49,492 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2020-07-08 17:37:49,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:49,723 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2020-07-08 17:37:49,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 17:37:49,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-08 17:37:49,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:49,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 17:37:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2020-07-08 17:37:49,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 17:37:49,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2020-07-08 17:37:49,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2020-07-08 17:37:49,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:49,871 INFO L225 Difference]: With dead ends: 61 [2020-07-08 17:37:49,871 INFO L226 Difference]: Without dead ends: 31 [2020-07-08 17:37:49,880 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 17:37:49,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-08 17:37:49,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-08 17:37:49,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:49,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-08 17:37:49,965 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-08 17:37:49,966 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-08 17:37:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:49,979 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-08 17:37:49,980 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-08 17:37:49,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:49,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:49,981 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-08 17:37:49,994 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-08 17:37:50,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:50,001 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-08 17:37:50,001 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-08 17:37:50,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:50,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:50,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:50,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:50,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-08 17:37:50,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2020-07-08 17:37:50,010 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 17 [2020-07-08 17:37:50,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:50,011 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2020-07-08 17:37:50,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 17:37:50,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2020-07-08 17:37:50,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:50,060 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-08 17:37:50,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-08 17:37:50,062 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:50,063 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:37:50,063 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 17:37:50,063 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:50,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:50,064 INFO L82 PathProgramCache]: Analyzing trace with hash 2141881988, now seen corresponding path program 1 times [2020-07-08 17:37:50,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:50,065 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [418134206] [2020-07-08 17:37:50,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:50,155 INFO L280 TraceCheckUtils]: 0: Hoare triple {306#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {298#true} is VALID [2020-07-08 17:37:50,156 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#true} #valid := #valid[0 := 0]; {298#true} is VALID [2020-07-08 17:37:50,156 INFO L280 TraceCheckUtils]: 2: Hoare triple {298#true} assume 0 < #StackHeapBarrier; {298#true} is VALID [2020-07-08 17:37:50,157 INFO L280 TraceCheckUtils]: 3: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-08 17:37:50,157 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {298#true} {298#true} #68#return; {298#true} is VALID [2020-07-08 17:37:50,158 INFO L263 TraceCheckUtils]: 0: Hoare triple {298#true} call ULTIMATE.init(); {306#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 17:37:50,159 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {298#true} is VALID [2020-07-08 17:37:50,159 INFO L280 TraceCheckUtils]: 2: Hoare triple {298#true} #valid := #valid[0 := 0]; {298#true} is VALID [2020-07-08 17:37:50,159 INFO L280 TraceCheckUtils]: 3: Hoare triple {298#true} assume 0 < #StackHeapBarrier; {298#true} is VALID [2020-07-08 17:37:50,160 INFO L280 TraceCheckUtils]: 4: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-08 17:37:50,160 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {298#true} {298#true} #68#return; {298#true} is VALID [2020-07-08 17:37:50,160 INFO L263 TraceCheckUtils]: 6: Hoare triple {298#true} call #t~ret4 := main(); {298#true} is VALID [2020-07-08 17:37:50,161 INFO L280 TraceCheckUtils]: 7: Hoare triple {298#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096); srcloc: mainENTRY {298#true} is VALID [2020-07-08 17:37:50,161 INFO L280 TraceCheckUtils]: 8: Hoare triple {298#true} havoc ~i~0; {298#true} is VALID [2020-07-08 17:37:50,162 INFO L280 TraceCheckUtils]: 9: Hoare triple {298#true} ~i~0 := 0; {305#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:50,163 INFO L280 TraceCheckUtils]: 10: Hoare triple {305#(= 0 main_~i~0)} assume !(~i~0 < 1024); {299#false} is VALID [2020-07-08 17:37:50,163 INFO L280 TraceCheckUtils]: 11: Hoare triple {299#false} ~i~0 := 0; {299#false} is VALID [2020-07-08 17:37:50,163 INFO L280 TraceCheckUtils]: 12: Hoare triple {299#false} SUMMARY for call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); srcloc: L17-8 {299#false} is VALID [2020-07-08 17:37:50,164 INFO L280 TraceCheckUtils]: 13: Hoare triple {299#false} assume !(0 != #t~mem3); {299#false} is VALID [2020-07-08 17:37:50,164 INFO L280 TraceCheckUtils]: 14: Hoare triple {299#false} havoc #t~mem3; {299#false} is VALID [2020-07-08 17:37:50,164 INFO L263 TraceCheckUtils]: 15: Hoare triple {299#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {299#false} is VALID [2020-07-08 17:37:50,165 INFO L280 TraceCheckUtils]: 16: Hoare triple {299#false} ~cond := #in~cond; {299#false} is VALID [2020-07-08 17:37:50,165 INFO L280 TraceCheckUtils]: 17: Hoare triple {299#false} assume 0 == ~cond; {299#false} is VALID [2020-07-08 17:37:50,165 INFO L280 TraceCheckUtils]: 18: Hoare triple {299#false} assume !false; {299#false} is VALID [2020-07-08 17:37:50,167 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-08 17:37:50,168 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:50,168 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [418134206] [2020-07-08 17:37:50,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:50,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 17:37:50,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152999443] [2020-07-08 17:37:50,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-08 17:37:50,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:50,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 17:37:50,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:50,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 17:37:50,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:50,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 17:37:50,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 17:37:50,194 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 4 states. [2020-07-08 17:37:50,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:50,416 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2020-07-08 17:37:50,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 17:37:50,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-08 17:37:50,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:50,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 17:37:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2020-07-08 17:37:50,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 17:37:50,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2020-07-08 17:37:50,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 65 transitions. [2020-07-08 17:37:50,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:50,521 INFO L225 Difference]: With dead ends: 59 [2020-07-08 17:37:50,521 INFO L226 Difference]: Without dead ends: 45 [2020-07-08 17:37:50,524 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 17:37:50,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-08 17:37:50,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2020-07-08 17:37:50,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:50,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 36 states. [2020-07-08 17:37:50,566 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 36 states. [2020-07-08 17:37:50,567 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 36 states. [2020-07-08 17:37:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:50,571 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2020-07-08 17:37:50,571 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-07-08 17:37:50,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:50,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:50,572 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 45 states. [2020-07-08 17:37:50,572 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 45 states. [2020-07-08 17:37:50,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:50,582 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2020-07-08 17:37:50,583 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-07-08 17:37:50,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:50,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:50,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:50,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-08 17:37:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2020-07-08 17:37:50,592 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 19 [2020-07-08 17:37:50,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:50,592 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2020-07-08 17:37:50,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 17:37:50,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 39 transitions. [2020-07-08 17:37:50,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:50,639 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2020-07-08 17:37:50,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 17:37:50,640 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:50,640 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] [2020-07-08 17:37:50,641 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 17:37:50,641 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:50,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:50,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1000622251, now seen corresponding path program 1 times [2020-07-08 17:37:50,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:50,642 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1762996157] [2020-07-08 17:37:50,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:50,807 INFO L280 TraceCheckUtils]: 0: Hoare triple {599#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {589#true} is VALID [2020-07-08 17:37:50,808 INFO L280 TraceCheckUtils]: 1: Hoare triple {589#true} #valid := #valid[0 := 0]; {589#true} is VALID [2020-07-08 17:37:50,808 INFO L280 TraceCheckUtils]: 2: Hoare triple {589#true} assume 0 < #StackHeapBarrier; {589#true} is VALID [2020-07-08 17:37:50,808 INFO L280 TraceCheckUtils]: 3: Hoare triple {589#true} assume true; {589#true} is VALID [2020-07-08 17:37:50,809 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {589#true} {589#true} #68#return; {589#true} is VALID [2020-07-08 17:37:50,810 INFO L263 TraceCheckUtils]: 0: Hoare triple {589#true} call ULTIMATE.init(); {599#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 17:37:50,811 INFO L280 TraceCheckUtils]: 1: Hoare triple {599#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {589#true} is VALID [2020-07-08 17:37:50,811 INFO L280 TraceCheckUtils]: 2: Hoare triple {589#true} #valid := #valid[0 := 0]; {589#true} is VALID [2020-07-08 17:37:50,811 INFO L280 TraceCheckUtils]: 3: Hoare triple {589#true} assume 0 < #StackHeapBarrier; {589#true} is VALID [2020-07-08 17:37:50,812 INFO L280 TraceCheckUtils]: 4: Hoare triple {589#true} assume true; {589#true} is VALID [2020-07-08 17:37:50,812 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {589#true} {589#true} #68#return; {589#true} is VALID [2020-07-08 17:37:50,812 INFO L263 TraceCheckUtils]: 6: Hoare triple {589#true} call #t~ret4 := main(); {589#true} is VALID [2020-07-08 17:37:50,813 INFO L280 TraceCheckUtils]: 7: Hoare triple {589#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096); srcloc: mainENTRY {589#true} is VALID [2020-07-08 17:37:50,813 INFO L280 TraceCheckUtils]: 8: Hoare triple {589#true} havoc ~i~0; {589#true} is VALID [2020-07-08 17:37:50,814 INFO L280 TraceCheckUtils]: 9: Hoare triple {589#true} ~i~0 := 0; {596#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:50,815 INFO L280 TraceCheckUtils]: 10: Hoare triple {596#(= 0 main_~i~0)} assume !!(~i~0 < 1024); {596#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:50,816 INFO L280 TraceCheckUtils]: 11: Hoare triple {596#(= 0 main_~i~0)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {596#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:50,817 INFO L280 TraceCheckUtils]: 12: Hoare triple {596#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); srcloc: L14-1 {596#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:50,817 INFO L280 TraceCheckUtils]: 13: Hoare triple {596#(= 0 main_~i~0)} havoc #t~nondet1; {596#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:50,818 INFO L280 TraceCheckUtils]: 14: Hoare triple {596#(= 0 main_~i~0)} #t~post0 := ~i~0; {597#(= |main_#t~post0| 0)} is VALID [2020-07-08 17:37:50,819 INFO L280 TraceCheckUtils]: 15: Hoare triple {597#(= |main_#t~post0| 0)} ~i~0 := 1 + #t~post0; {598#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:50,820 INFO L280 TraceCheckUtils]: 16: Hoare triple {598#(<= main_~i~0 1)} havoc #t~post0; {598#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:50,821 INFO L280 TraceCheckUtils]: 17: Hoare triple {598#(<= main_~i~0 1)} assume !(~i~0 < 1024); {590#false} is VALID [2020-07-08 17:37:50,821 INFO L280 TraceCheckUtils]: 18: Hoare triple {590#false} ~i~0 := 0; {590#false} is VALID [2020-07-08 17:37:50,821 INFO L280 TraceCheckUtils]: 19: Hoare triple {590#false} SUMMARY for call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); srcloc: L17-8 {590#false} is VALID [2020-07-08 17:37:50,822 INFO L280 TraceCheckUtils]: 20: Hoare triple {590#false} assume !(0 != #t~mem3); {590#false} is VALID [2020-07-08 17:37:50,822 INFO L280 TraceCheckUtils]: 21: Hoare triple {590#false} havoc #t~mem3; {590#false} is VALID [2020-07-08 17:37:50,823 INFO L263 TraceCheckUtils]: 22: Hoare triple {590#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {590#false} is VALID [2020-07-08 17:37:50,823 INFO L280 TraceCheckUtils]: 23: Hoare triple {590#false} ~cond := #in~cond; {590#false} is VALID [2020-07-08 17:37:50,823 INFO L280 TraceCheckUtils]: 24: Hoare triple {590#false} assume 0 == ~cond; {590#false} is VALID [2020-07-08 17:37:50,824 INFO L280 TraceCheckUtils]: 25: Hoare triple {590#false} assume !false; {590#false} is VALID [2020-07-08 17:37:50,825 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-08 17:37:50,826 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:50,826 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1762996157] [2020-07-08 17:37:50,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:50,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 17:37:50,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716742757] [2020-07-08 17:37:50,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-08 17:37:50,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:50,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 17:37:50,858 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:50,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 17:37:50,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:50,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 17:37:50,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-08 17:37:50,860 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 6 states. [2020-07-08 17:37:51,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:51,178 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2020-07-08 17:37:51,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 17:37:51,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-08 17:37:51,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:51,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 17:37:51,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2020-07-08 17:37:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 17:37:51,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2020-07-08 17:37:51,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 71 transitions. [2020-07-08 17:37:51,256 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:51,258 INFO L225 Difference]: With dead ends: 70 [2020-07-08 17:37:51,259 INFO L226 Difference]: Without dead ends: 52 [2020-07-08 17:37:51,259 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-08 17:37:51,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-08 17:37:51,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2020-07-08 17:37:51,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:51,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 43 states. [2020-07-08 17:37:51,293 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 43 states. [2020-07-08 17:37:51,294 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 43 states. [2020-07-08 17:37:51,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:51,301 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2020-07-08 17:37:51,302 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2020-07-08 17:37:51,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:51,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:51,303 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 52 states. [2020-07-08 17:37:51,303 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 52 states. [2020-07-08 17:37:51,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:51,306 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2020-07-08 17:37:51,306 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2020-07-08 17:37:51,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:51,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:51,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:51,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:51,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-08 17:37:51,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2020-07-08 17:37:51,312 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 26 [2020-07-08 17:37:51,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:51,313 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2020-07-08 17:37:51,313 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 17:37:51,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 46 transitions. [2020-07-08 17:37:51,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:51,363 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2020-07-08 17:37:51,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-08 17:37:51,364 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:51,364 INFO L422 BasicCegarLoop]: trace histogram [2, 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] [2020-07-08 17:37:51,364 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 17:37:51,365 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:51,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:51,365 INFO L82 PathProgramCache]: Analyzing trace with hash 231352676, now seen corresponding path program 2 times [2020-07-08 17:37:51,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:51,366 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1665021216] [2020-07-08 17:37:51,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:51,489 INFO L280 TraceCheckUtils]: 0: Hoare triple {948#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {936#true} is VALID [2020-07-08 17:37:51,490 INFO L280 TraceCheckUtils]: 1: Hoare triple {936#true} #valid := #valid[0 := 0]; {936#true} is VALID [2020-07-08 17:37:51,490 INFO L280 TraceCheckUtils]: 2: Hoare triple {936#true} assume 0 < #StackHeapBarrier; {936#true} is VALID [2020-07-08 17:37:51,490 INFO L280 TraceCheckUtils]: 3: Hoare triple {936#true} assume true; {936#true} is VALID [2020-07-08 17:37:51,490 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {936#true} {936#true} #68#return; {936#true} is VALID [2020-07-08 17:37:51,491 INFO L263 TraceCheckUtils]: 0: Hoare triple {936#true} call ULTIMATE.init(); {948#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 17:37:51,492 INFO L280 TraceCheckUtils]: 1: Hoare triple {948#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {936#true} is VALID [2020-07-08 17:37:51,492 INFO L280 TraceCheckUtils]: 2: Hoare triple {936#true} #valid := #valid[0 := 0]; {936#true} is VALID [2020-07-08 17:37:51,492 INFO L280 TraceCheckUtils]: 3: Hoare triple {936#true} assume 0 < #StackHeapBarrier; {936#true} is VALID [2020-07-08 17:37:51,492 INFO L280 TraceCheckUtils]: 4: Hoare triple {936#true} assume true; {936#true} is VALID [2020-07-08 17:37:51,493 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {936#true} {936#true} #68#return; {936#true} is VALID [2020-07-08 17:37:51,493 INFO L263 TraceCheckUtils]: 6: Hoare triple {936#true} call #t~ret4 := main(); {936#true} is VALID [2020-07-08 17:37:51,493 INFO L280 TraceCheckUtils]: 7: Hoare triple {936#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096); srcloc: mainENTRY {936#true} is VALID [2020-07-08 17:37:51,493 INFO L280 TraceCheckUtils]: 8: Hoare triple {936#true} havoc ~i~0; {936#true} is VALID [2020-07-08 17:37:51,494 INFO L280 TraceCheckUtils]: 9: Hoare triple {936#true} ~i~0 := 0; {943#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:51,494 INFO L280 TraceCheckUtils]: 10: Hoare triple {943#(= 0 main_~i~0)} assume !!(~i~0 < 1024); {943#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:51,495 INFO L280 TraceCheckUtils]: 11: Hoare triple {943#(= 0 main_~i~0)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {943#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:51,495 INFO L280 TraceCheckUtils]: 12: Hoare triple {943#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); srcloc: L14-1 {943#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:51,496 INFO L280 TraceCheckUtils]: 13: Hoare triple {943#(= 0 main_~i~0)} havoc #t~nondet1; {943#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:51,496 INFO L280 TraceCheckUtils]: 14: Hoare triple {943#(= 0 main_~i~0)} #t~post0 := ~i~0; {944#(= |main_#t~post0| 0)} is VALID [2020-07-08 17:37:51,497 INFO L280 TraceCheckUtils]: 15: Hoare triple {944#(= |main_#t~post0| 0)} ~i~0 := 1 + #t~post0; {945#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:51,498 INFO L280 TraceCheckUtils]: 16: Hoare triple {945#(<= main_~i~0 1)} havoc #t~post0; {945#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:51,498 INFO L280 TraceCheckUtils]: 17: Hoare triple {945#(<= main_~i~0 1)} assume !!(~i~0 < 1024); {945#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:51,499 INFO L280 TraceCheckUtils]: 18: Hoare triple {945#(<= main_~i~0 1)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {945#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:51,499 INFO L280 TraceCheckUtils]: 19: Hoare triple {945#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); srcloc: L14-1 {945#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:51,500 INFO L280 TraceCheckUtils]: 20: Hoare triple {945#(<= main_~i~0 1)} havoc #t~nondet1; {945#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:51,500 INFO L280 TraceCheckUtils]: 21: Hoare triple {945#(<= main_~i~0 1)} #t~post0 := ~i~0; {946#(<= |main_#t~post0| 1)} is VALID [2020-07-08 17:37:51,501 INFO L280 TraceCheckUtils]: 22: Hoare triple {946#(<= |main_#t~post0| 1)} ~i~0 := 1 + #t~post0; {947#(<= main_~i~0 2)} is VALID [2020-07-08 17:37:51,503 INFO L280 TraceCheckUtils]: 23: Hoare triple {947#(<= main_~i~0 2)} havoc #t~post0; {947#(<= main_~i~0 2)} is VALID [2020-07-08 17:37:51,504 INFO L280 TraceCheckUtils]: 24: Hoare triple {947#(<= main_~i~0 2)} assume !(~i~0 < 1024); {937#false} is VALID [2020-07-08 17:37:51,505 INFO L280 TraceCheckUtils]: 25: Hoare triple {937#false} ~i~0 := 0; {937#false} is VALID [2020-07-08 17:37:51,505 INFO L280 TraceCheckUtils]: 26: Hoare triple {937#false} SUMMARY for call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); srcloc: L17-8 {937#false} is VALID [2020-07-08 17:37:51,506 INFO L280 TraceCheckUtils]: 27: Hoare triple {937#false} assume !(0 != #t~mem3); {937#false} is VALID [2020-07-08 17:37:51,506 INFO L280 TraceCheckUtils]: 28: Hoare triple {937#false} havoc #t~mem3; {937#false} is VALID [2020-07-08 17:37:51,507 INFO L263 TraceCheckUtils]: 29: Hoare triple {937#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {937#false} is VALID [2020-07-08 17:37:51,507 INFO L280 TraceCheckUtils]: 30: Hoare triple {937#false} ~cond := #in~cond; {937#false} is VALID [2020-07-08 17:37:51,507 INFO L280 TraceCheckUtils]: 31: Hoare triple {937#false} assume 0 == ~cond; {937#false} is VALID [2020-07-08 17:37:51,508 INFO L280 TraceCheckUtils]: 32: Hoare triple {937#false} assume !false; {937#false} is VALID [2020-07-08 17:37:51,509 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-08 17:37:51,510 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:51,510 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1665021216] [2020-07-08 17:37:51,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:51,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 17:37:51,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890074990] [2020-07-08 17:37:51,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2020-07-08 17:37:51,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:51,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 17:37:51,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:51,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 17:37:51,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:51,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 17:37:51,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-08 17:37:51,551 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 8 states. [2020-07-08 17:37:51,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:51,941 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2020-07-08 17:37:51,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 17:37:51,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2020-07-08 17:37:51,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:51,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 17:37:51,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 78 transitions. [2020-07-08 17:37:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 17:37:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 78 transitions. [2020-07-08 17:37:51,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 78 transitions. [2020-07-08 17:37:52,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:52,023 INFO L225 Difference]: With dead ends: 77 [2020-07-08 17:37:52,023 INFO L226 Difference]: Without dead ends: 59 [2020-07-08 17:37:52,024 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-07-08 17:37:52,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-08 17:37:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2020-07-08 17:37:52,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:52,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 50 states. [2020-07-08 17:37:52,073 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 50 states. [2020-07-08 17:37:52,073 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 50 states. [2020-07-08 17:37:52,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:52,077 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2020-07-08 17:37:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2020-07-08 17:37:52,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:52,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:52,078 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 59 states. [2020-07-08 17:37:52,078 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 59 states. [2020-07-08 17:37:52,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:52,081 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2020-07-08 17:37:52,081 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2020-07-08 17:37:52,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:52,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:52,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:52,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:52,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-08 17:37:52,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2020-07-08 17:37:52,085 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 33 [2020-07-08 17:37:52,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:52,085 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2020-07-08 17:37:52,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 17:37:52,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 53 transitions. [2020-07-08 17:37:52,145 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-08 17:37:52,146 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2020-07-08 17:37:52,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-08 17:37:52,147 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:52,147 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:37:52,148 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 17:37:52,148 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:52,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:52,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1221138549, now seen corresponding path program 3 times [2020-07-08 17:37:52,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:52,149 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [631701679] [2020-07-08 17:37:52,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:52,246 INFO L280 TraceCheckUtils]: 0: Hoare triple {1341#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1331#true} is VALID [2020-07-08 17:37:52,247 INFO L280 TraceCheckUtils]: 1: Hoare triple {1331#true} #valid := #valid[0 := 0]; {1331#true} is VALID [2020-07-08 17:37:52,247 INFO L280 TraceCheckUtils]: 2: Hoare triple {1331#true} assume 0 < #StackHeapBarrier; {1331#true} is VALID [2020-07-08 17:37:52,247 INFO L280 TraceCheckUtils]: 3: Hoare triple {1331#true} assume true; {1331#true} is VALID [2020-07-08 17:37:52,247 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1331#true} {1331#true} #68#return; {1331#true} is VALID [2020-07-08 17:37:52,248 INFO L263 TraceCheckUtils]: 0: Hoare triple {1331#true} call ULTIMATE.init(); {1341#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 17:37:52,248 INFO L280 TraceCheckUtils]: 1: Hoare triple {1341#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1331#true} is VALID [2020-07-08 17:37:52,249 INFO L280 TraceCheckUtils]: 2: Hoare triple {1331#true} #valid := #valid[0 := 0]; {1331#true} is VALID [2020-07-08 17:37:52,249 INFO L280 TraceCheckUtils]: 3: Hoare triple {1331#true} assume 0 < #StackHeapBarrier; {1331#true} is VALID [2020-07-08 17:37:52,249 INFO L280 TraceCheckUtils]: 4: Hoare triple {1331#true} assume true; {1331#true} is VALID [2020-07-08 17:37:52,249 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1331#true} {1331#true} #68#return; {1331#true} is VALID [2020-07-08 17:37:52,250 INFO L263 TraceCheckUtils]: 6: Hoare triple {1331#true} call #t~ret4 := main(); {1331#true} is VALID [2020-07-08 17:37:52,250 INFO L280 TraceCheckUtils]: 7: Hoare triple {1331#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096); srcloc: mainENTRY {1331#true} is VALID [2020-07-08 17:37:52,250 INFO L280 TraceCheckUtils]: 8: Hoare triple {1331#true} havoc ~i~0; {1331#true} is VALID [2020-07-08 17:37:52,251 INFO L280 TraceCheckUtils]: 9: Hoare triple {1331#true} ~i~0 := 0; {1331#true} is VALID [2020-07-08 17:37:52,251 INFO L280 TraceCheckUtils]: 10: Hoare triple {1331#true} assume !!(~i~0 < 1024); {1331#true} is VALID [2020-07-08 17:37:52,251 INFO L280 TraceCheckUtils]: 11: Hoare triple {1331#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1331#true} is VALID [2020-07-08 17:37:52,251 INFO L280 TraceCheckUtils]: 12: Hoare triple {1331#true} SUMMARY for call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); srcloc: L14-1 {1331#true} is VALID [2020-07-08 17:37:52,252 INFO L280 TraceCheckUtils]: 13: Hoare triple {1331#true} havoc #t~nondet1; {1331#true} is VALID [2020-07-08 17:37:52,252 INFO L280 TraceCheckUtils]: 14: Hoare triple {1331#true} #t~post0 := ~i~0; {1331#true} is VALID [2020-07-08 17:37:52,252 INFO L280 TraceCheckUtils]: 15: Hoare triple {1331#true} ~i~0 := 1 + #t~post0; {1331#true} is VALID [2020-07-08 17:37:52,252 INFO L280 TraceCheckUtils]: 16: Hoare triple {1331#true} havoc #t~post0; {1331#true} is VALID [2020-07-08 17:37:52,252 INFO L280 TraceCheckUtils]: 17: Hoare triple {1331#true} assume !!(~i~0 < 1024); {1331#true} is VALID [2020-07-08 17:37:52,253 INFO L280 TraceCheckUtils]: 18: Hoare triple {1331#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1331#true} is VALID [2020-07-08 17:37:52,253 INFO L280 TraceCheckUtils]: 19: Hoare triple {1331#true} SUMMARY for call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); srcloc: L14-1 {1331#true} is VALID [2020-07-08 17:37:52,253 INFO L280 TraceCheckUtils]: 20: Hoare triple {1331#true} havoc #t~nondet1; {1331#true} is VALID [2020-07-08 17:37:52,253 INFO L280 TraceCheckUtils]: 21: Hoare triple {1331#true} #t~post0 := ~i~0; {1331#true} is VALID [2020-07-08 17:37:52,254 INFO L280 TraceCheckUtils]: 22: Hoare triple {1331#true} ~i~0 := 1 + #t~post0; {1331#true} is VALID [2020-07-08 17:37:52,254 INFO L280 TraceCheckUtils]: 23: Hoare triple {1331#true} havoc #t~post0; {1331#true} is VALID [2020-07-08 17:37:52,254 INFO L280 TraceCheckUtils]: 24: Hoare triple {1331#true} assume !!(~i~0 < 1024); {1331#true} is VALID [2020-07-08 17:37:52,254 INFO L280 TraceCheckUtils]: 25: Hoare triple {1331#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1331#true} is VALID [2020-07-08 17:37:52,255 INFO L280 TraceCheckUtils]: 26: Hoare triple {1331#true} SUMMARY for call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); srcloc: L14-1 {1331#true} is VALID [2020-07-08 17:37:52,255 INFO L280 TraceCheckUtils]: 27: Hoare triple {1331#true} havoc #t~nondet1; {1331#true} is VALID [2020-07-08 17:37:52,255 INFO L280 TraceCheckUtils]: 28: Hoare triple {1331#true} #t~post0 := ~i~0; {1331#true} is VALID [2020-07-08 17:37:52,255 INFO L280 TraceCheckUtils]: 29: Hoare triple {1331#true} ~i~0 := 1 + #t~post0; {1331#true} is VALID [2020-07-08 17:37:52,256 INFO L280 TraceCheckUtils]: 30: Hoare triple {1331#true} havoc #t~post0; {1331#true} is VALID [2020-07-08 17:37:52,256 INFO L280 TraceCheckUtils]: 31: Hoare triple {1331#true} assume !(~i~0 < 1024); {1331#true} is VALID [2020-07-08 17:37:52,257 INFO L280 TraceCheckUtils]: 32: Hoare triple {1331#true} ~i~0 := 0; {1338#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:52,257 INFO L280 TraceCheckUtils]: 33: Hoare triple {1338#(= 0 main_~i~0)} SUMMARY for call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); srcloc: L17-8 {1338#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:52,258 INFO L280 TraceCheckUtils]: 34: Hoare triple {1338#(= 0 main_~i~0)} assume !(0 != #t~mem3); {1338#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:52,259 INFO L280 TraceCheckUtils]: 35: Hoare triple {1338#(= 0 main_~i~0)} havoc #t~mem3; {1338#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:52,259 INFO L263 TraceCheckUtils]: 36: Hoare triple {1338#(= 0 main_~i~0)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1339#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:37:52,260 INFO L280 TraceCheckUtils]: 37: Hoare triple {1339#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1340#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:37:52,261 INFO L280 TraceCheckUtils]: 38: Hoare triple {1340#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1332#false} is VALID [2020-07-08 17:37:52,261 INFO L280 TraceCheckUtils]: 39: Hoare triple {1332#false} assume !false; {1332#false} is VALID [2020-07-08 17:37:52,263 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-08 17:37:52,263 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:52,263 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [631701679] [2020-07-08 17:37:52,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:52,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 17:37:52,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849928767] [2020-07-08 17:37:52,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-07-08 17:37:52,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:52,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 17:37:52,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:52,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 17:37:52,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:52,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 17:37:52,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 17:37:52,302 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 6 states. [2020-07-08 17:37:52,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:52,603 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2020-07-08 17:37:52,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 17:37:52,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-07-08 17:37:52,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:52,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 17:37:52,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2020-07-08 17:37:52,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 17:37:52,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2020-07-08 17:37:52,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2020-07-08 17:37:52,661 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:52,662 INFO L225 Difference]: With dead ends: 58 [2020-07-08 17:37:52,662 INFO L226 Difference]: Without dead ends: 52 [2020-07-08 17:37:52,663 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-08 17:37:52,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-08 17:37:52,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2020-07-08 17:37:52,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:52,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 50 states. [2020-07-08 17:37:52,714 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 50 states. [2020-07-08 17:37:52,714 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 50 states. [2020-07-08 17:37:52,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:52,717 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-08 17:37:52,717 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-08 17:37:52,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:52,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:52,720 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 52 states. [2020-07-08 17:37:52,720 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 52 states. [2020-07-08 17:37:52,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:52,726 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-08 17:37:52,726 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-08 17:37:52,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:52,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:52,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:52,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:52,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-08 17:37:52,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2020-07-08 17:37:52,730 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 40 [2020-07-08 17:37:52,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:52,731 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2020-07-08 17:37:52,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 17:37:52,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 52 transitions. [2020-07-08 17:37:52,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2020-07-08 17:37:52,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-08 17:37:52,785 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:52,786 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:37:52,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 17:37:52,786 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:52,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:52,787 INFO L82 PathProgramCache]: Analyzing trace with hash -842063729, now seen corresponding path program 1 times [2020-07-08 17:37:52,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:52,787 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [404589464] [2020-07-08 17:37:52,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:52,803 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 17:37:52,804 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-08 17:37:52,813 INFO L168 Benchmark]: Toolchain (without parser) took 4469.09 ms. Allocated memory was 137.4 MB in the beginning and 281.5 MB in the end (delta: 144.2 MB). Free memory was 101.0 MB in the beginning and 227.1 MB in the end (delta: -126.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:52,817 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 137.4 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-08 17:37:52,821 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.84 ms. Allocated memory is still 137.4 MB. Free memory was 100.5 MB in the beginning and 90.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:52,821 INFO L168 Benchmark]: Boogie Preprocessor took 126.37 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 90.5 MB in the beginning and 178.9 MB in the end (delta: -88.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:52,822 INFO L168 Benchmark]: RCFGBuilder took 363.96 ms. Allocated memory is still 200.8 MB. Free memory was 178.9 MB in the beginning and 158.8 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:52,824 INFO L168 Benchmark]: TraceAbstraction took 3722.80 ms. Allocated memory was 200.8 MB in the beginning and 281.5 MB in the end (delta: 80.7 MB). Free memory was 158.1 MB in the beginning and 227.1 MB in the end (delta: -69.0 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:52,829 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.26 ms. Allocated memory is still 137.4 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 248.84 ms. Allocated memory is still 137.4 MB. Free memory was 100.5 MB in the beginning and 90.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.37 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 90.5 MB in the beginning and 178.9 MB in the end (delta: -88.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 363.96 ms. Allocated memory is still 200.8 MB. Free memory was 178.9 MB in the beginning and 158.8 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3722.80 ms. Allocated memory was 200.8 MB in the beginning and 281.5 MB in the end (delta: 80.7 MB). Free memory was 158.1 MB in the beginning and 227.1 MB in the end (delta: -69.0 MB). Peak memory consumption was 11.7 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...