/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-fpi/brs2f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:47:09,018 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:47:09,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:47:09,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:47:09,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:47:09,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:47:09,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:47:09,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:47:09,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:47:09,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:47:09,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:47:09,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:47:09,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:47:09,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:47:09,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:47:09,070 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:47:09,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:47:09,072 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:47:09,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:47:09,078 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:47:09,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:47:09,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:47:09,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:47:09,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:47:09,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:47:09,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:47:09,094 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:47:09,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:47:09,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:47:09,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:47:09,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:47:09,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:47:09,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:47:09,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:47:09,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:47:09,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:47:09,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:47:09,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:47:09,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:47:09,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:47:09,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:47:09,107 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:47:09,132 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:47:09,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:47:09,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:47:09,135 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:47:09,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:47:09,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:47:09,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:47:09,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:47:09,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:47:09,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:47:09,137 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:47:09,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:47:09,137 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:47:09,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:47:09,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:47:09,140 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:47:09,140 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:47:09,140 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:47:09,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:09,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:47:09,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:47:09,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:47:09,144 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:47:09,466 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:47:09,479 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:47:09,483 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:47:09,484 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:47:09,485 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:47:09,486 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/brs2f.c [2020-07-18 00:47:09,559 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22c5bb059/ef44c6d6070d4707a765b9b600485359/FLAG1ce22f34c [2020-07-18 00:47:10,001 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:47:10,002 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs2f.c [2020-07-18 00:47:10,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22c5bb059/ef44c6d6070d4707a765b9b600485359/FLAG1ce22f34c [2020-07-18 00:47:10,355 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22c5bb059/ef44c6d6070d4707a765b9b600485359 [2020-07-18 00:47:10,366 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:47:10,369 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:47:10,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:10,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:47:10,374 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:47:10,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:10" (1/1) ... [2020-07-18 00:47:10,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ac0970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:10, skipping insertion in model container [2020-07-18 00:47:10,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:10" (1/1) ... [2020-07-18 00:47:10,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:47:10,406 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:47:10,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:10,605 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:47:10,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:10,646 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:47:10,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:10 WrapperNode [2020-07-18 00:47:10,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:10,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:47:10,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:47:10,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:47:10,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:10" (1/1) ... [2020-07-18 00:47:10,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:10" (1/1) ... [2020-07-18 00:47:10,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:10" (1/1) ... [2020-07-18 00:47:10,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:10" (1/1) ... [2020-07-18 00:47:10,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:10" (1/1) ... [2020-07-18 00:47:10,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:10" (1/1) ... [2020-07-18 00:47:10,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:10" (1/1) ... [2020-07-18 00:47:10,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:47:10,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:47:10,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:47:10,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:47:10,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:10,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:47:10,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:47:10,845 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 00:47:10,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:47:10,845 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:47:10,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:47:10,845 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:47:10,845 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 00:47:10,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:47:10,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:47:10,845 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 00:47:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:47:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 00:47:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 00:47:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:47:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:47:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:47:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:47:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:47:11,310 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:47:11,311 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-18 00:47:11,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:11 BoogieIcfgContainer [2020-07-18 00:47:11,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:47:11,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:47:11,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:47:11,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:47:11,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:47:10" (1/3) ... [2020-07-18 00:47:11,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57845847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:11, skipping insertion in model container [2020-07-18 00:47:11,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:10" (2/3) ... [2020-07-18 00:47:11,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57845847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:11, skipping insertion in model container [2020-07-18 00:47:11,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:11" (3/3) ... [2020-07-18 00:47:11,325 INFO L109 eAbstractionObserver]: Analyzing ICFG brs2f.c [2020-07-18 00:47:11,336 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:47:11,345 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:47:11,360 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:47:11,383 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:47:11,383 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:47:11,384 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:47:11,384 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:47:11,384 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:47:11,384 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:47:11,384 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:47:11,385 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:47:11,400 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2020-07-18 00:47:11,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-18 00:47:11,415 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:11,416 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] [2020-07-18 00:47:11,417 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:11,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:11,424 INFO L82 PathProgramCache]: Analyzing trace with hash 221259408, now seen corresponding path program 1 times [2020-07-18 00:47:11,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:11,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [491662408] [2020-07-18 00:47:11,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:11,702 INFO L280 TraceCheckUtils]: 0: Hoare triple {74#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {62#true} is VALID [2020-07-18 00:47:11,702 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} #valid := #valid[0 := 0]; {62#true} is VALID [2020-07-18 00:47:11,703 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} assume 0 < #StackHeapBarrier; {62#true} is VALID [2020-07-18 00:47:11,703 INFO L280 TraceCheckUtils]: 3: Hoare triple {62#true} ~N~0 := 0; {62#true} is VALID [2020-07-18 00:47:11,704 INFO L280 TraceCheckUtils]: 4: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-18 00:47:11,705 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {62#true} {62#true} #103#return; {62#true} is VALID [2020-07-18 00:47:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:11,715 INFO L280 TraceCheckUtils]: 0: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2020-07-18 00:47:11,716 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} assume !(0 == ~cond); {62#true} is VALID [2020-07-18 00:47:11,716 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-18 00:47:11,716 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {62#true} {62#true} #99#return; {62#true} is VALID [2020-07-18 00:47:11,719 INFO L263 TraceCheckUtils]: 0: Hoare triple {62#true} call ULTIMATE.init(); {74#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:47:11,719 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {62#true} is VALID [2020-07-18 00:47:11,720 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} #valid := #valid[0 := 0]; {62#true} is VALID [2020-07-18 00:47:11,720 INFO L280 TraceCheckUtils]: 3: Hoare triple {62#true} assume 0 < #StackHeapBarrier; {62#true} is VALID [2020-07-18 00:47:11,720 INFO L280 TraceCheckUtils]: 4: Hoare triple {62#true} ~N~0 := 0; {62#true} is VALID [2020-07-18 00:47:11,721 INFO L280 TraceCheckUtils]: 5: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-18 00:47:11,721 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {62#true} {62#true} #103#return; {62#true} is VALID [2020-07-18 00:47:11,722 INFO L263 TraceCheckUtils]: 7: Hoare triple {62#true} call #t~ret7 := main(); {62#true} is VALID [2020-07-18 00:47:11,722 INFO L280 TraceCheckUtils]: 8: Hoare triple {62#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {62#true} is VALID [2020-07-18 00:47:11,723 INFO L280 TraceCheckUtils]: 9: Hoare triple {62#true} ~N~0 := #t~nondet0; {62#true} is VALID [2020-07-18 00:47:11,723 INFO L280 TraceCheckUtils]: 10: Hoare triple {62#true} havoc #t~nondet0; {62#true} is VALID [2020-07-18 00:47:11,724 INFO L280 TraceCheckUtils]: 11: Hoare triple {62#true} assume !(~N~0 <= 0); {62#true} is VALID [2020-07-18 00:47:11,724 INFO L263 TraceCheckUtils]: 12: Hoare triple {62#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {62#true} is VALID [2020-07-18 00:47:11,724 INFO L280 TraceCheckUtils]: 13: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2020-07-18 00:47:11,725 INFO L280 TraceCheckUtils]: 14: Hoare triple {62#true} assume !(0 == ~cond); {62#true} is VALID [2020-07-18 00:47:11,725 INFO L280 TraceCheckUtils]: 15: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-18 00:47:11,726 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {62#true} {62#true} #99#return; {62#true} is VALID [2020-07-18 00:47:11,726 INFO L280 TraceCheckUtils]: 17: Hoare triple {62#true} havoc ~i~0; {62#true} is VALID [2020-07-18 00:47:11,727 INFO L280 TraceCheckUtils]: 18: Hoare triple {62#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {62#true} is VALID [2020-07-18 00:47:11,727 INFO L280 TraceCheckUtils]: 19: Hoare triple {62#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {62#true} is VALID [2020-07-18 00:47:11,727 INFO L280 TraceCheckUtils]: 20: Hoare triple {62#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {62#true} is VALID [2020-07-18 00:47:11,728 INFO L280 TraceCheckUtils]: 21: Hoare triple {62#true} ~i~0 := 0; {62#true} is VALID [2020-07-18 00:47:11,729 INFO L280 TraceCheckUtils]: 22: Hoare triple {62#true} assume !true; {63#false} is VALID [2020-07-18 00:47:11,730 INFO L280 TraceCheckUtils]: 23: Hoare triple {63#false} ~i~0 := 0; {63#false} is VALID [2020-07-18 00:47:11,730 INFO L280 TraceCheckUtils]: 24: Hoare triple {63#false} assume !(~i~0 < ~N~0); {63#false} is VALID [2020-07-18 00:47:11,731 INFO L280 TraceCheckUtils]: 25: Hoare triple {63#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {63#false} is VALID [2020-07-18 00:47:11,731 INFO L263 TraceCheckUtils]: 26: Hoare triple {63#false} call __VERIFIER_assert((if #t~mem6 <= 2 * ~N~0 then 1 else 0)); {63#false} is VALID [2020-07-18 00:47:11,731 INFO L280 TraceCheckUtils]: 27: Hoare triple {63#false} ~cond := #in~cond; {63#false} is VALID [2020-07-18 00:47:11,732 INFO L280 TraceCheckUtils]: 28: Hoare triple {63#false} assume 0 == ~cond; {63#false} is VALID [2020-07-18 00:47:11,732 INFO L280 TraceCheckUtils]: 29: Hoare triple {63#false} assume !false; {63#false} is VALID [2020-07-18 00:47:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:47:11,739 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:11,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [491662408] [2020-07-18 00:47:11,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:11,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:47:11,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834682984] [2020-07-18 00:47:11,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-18 00:47:11,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:11,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:47:11,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:11,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:47:11,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:11,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:47:11,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:47:11,829 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2020-07-18 00:47:12,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:12,214 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2020-07-18 00:47:12,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:47:12,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-18 00:47:12,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:12,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:47:12,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2020-07-18 00:47:12,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:47:12,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2020-07-18 00:47:12,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 116 transitions. [2020-07-18 00:47:12,407 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:12,438 INFO L225 Difference]: With dead ends: 101 [2020-07-18 00:47:12,438 INFO L226 Difference]: Without dead ends: 47 [2020-07-18 00:47:12,444 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-18 00:47:12,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-18 00:47:12,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-18 00:47:12,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:12,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2020-07-18 00:47:12,532 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-18 00:47:12,532 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-18 00:47:12,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:12,538 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-07-18 00:47:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-18 00:47:12,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:12,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:12,539 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-18 00:47:12,540 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-18 00:47:12,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:12,545 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-07-18 00:47:12,545 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-18 00:47:12,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:12,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:12,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:12,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:12,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-18 00:47:12,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2020-07-18 00:47:12,553 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 30 [2020-07-18 00:47:12,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:12,554 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2020-07-18 00:47:12,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:47:12,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2020-07-18 00:47:12,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:12,620 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-18 00:47:12,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-18 00:47:12,622 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:12,622 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] [2020-07-18 00:47:12,623 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:47:12,623 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:12,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:12,624 INFO L82 PathProgramCache]: Analyzing trace with hash -151091841, now seen corresponding path program 1 times [2020-07-18 00:47:12,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:12,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [220783274] [2020-07-18 00:47:12,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:12,778 INFO L280 TraceCheckUtils]: 0: Hoare triple {481#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {467#true} is VALID [2020-07-18 00:47:12,778 INFO L280 TraceCheckUtils]: 1: Hoare triple {467#true} #valid := #valid[0 := 0]; {467#true} is VALID [2020-07-18 00:47:12,779 INFO L280 TraceCheckUtils]: 2: Hoare triple {467#true} assume 0 < #StackHeapBarrier; {467#true} is VALID [2020-07-18 00:47:12,779 INFO L280 TraceCheckUtils]: 3: Hoare triple {467#true} ~N~0 := 0; {467#true} is VALID [2020-07-18 00:47:12,780 INFO L280 TraceCheckUtils]: 4: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-18 00:47:12,780 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {467#true} {467#true} #103#return; {467#true} is VALID [2020-07-18 00:47:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:12,798 INFO L280 TraceCheckUtils]: 0: Hoare triple {467#true} ~cond := #in~cond; {467#true} is VALID [2020-07-18 00:47:12,799 INFO L280 TraceCheckUtils]: 1: Hoare triple {467#true} assume !(0 == ~cond); {467#true} is VALID [2020-07-18 00:47:12,799 INFO L280 TraceCheckUtils]: 2: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-18 00:47:12,801 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {467#true} {475#(<= 1 ~N~0)} #99#return; {475#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:12,806 INFO L263 TraceCheckUtils]: 0: Hoare triple {467#true} call ULTIMATE.init(); {481#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:47:12,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {481#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {467#true} is VALID [2020-07-18 00:47:12,807 INFO L280 TraceCheckUtils]: 2: Hoare triple {467#true} #valid := #valid[0 := 0]; {467#true} is VALID [2020-07-18 00:47:12,808 INFO L280 TraceCheckUtils]: 3: Hoare triple {467#true} assume 0 < #StackHeapBarrier; {467#true} is VALID [2020-07-18 00:47:12,808 INFO L280 TraceCheckUtils]: 4: Hoare triple {467#true} ~N~0 := 0; {467#true} is VALID [2020-07-18 00:47:12,808 INFO L280 TraceCheckUtils]: 5: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-18 00:47:12,809 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {467#true} {467#true} #103#return; {467#true} is VALID [2020-07-18 00:47:12,809 INFO L263 TraceCheckUtils]: 7: Hoare triple {467#true} call #t~ret7 := main(); {467#true} is VALID [2020-07-18 00:47:12,809 INFO L280 TraceCheckUtils]: 8: Hoare triple {467#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {467#true} is VALID [2020-07-18 00:47:12,810 INFO L280 TraceCheckUtils]: 9: Hoare triple {467#true} ~N~0 := #t~nondet0; {467#true} is VALID [2020-07-18 00:47:12,810 INFO L280 TraceCheckUtils]: 10: Hoare triple {467#true} havoc #t~nondet0; {467#true} is VALID [2020-07-18 00:47:12,811 INFO L280 TraceCheckUtils]: 11: Hoare triple {467#true} assume !(~N~0 <= 0); {475#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:12,811 INFO L263 TraceCheckUtils]: 12: Hoare triple {475#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {467#true} is VALID [2020-07-18 00:47:12,812 INFO L280 TraceCheckUtils]: 13: Hoare triple {467#true} ~cond := #in~cond; {467#true} is VALID [2020-07-18 00:47:12,812 INFO L280 TraceCheckUtils]: 14: Hoare triple {467#true} assume !(0 == ~cond); {467#true} is VALID [2020-07-18 00:47:12,812 INFO L280 TraceCheckUtils]: 15: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-18 00:47:12,815 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {467#true} {475#(<= 1 ~N~0)} #99#return; {475#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:12,816 INFO L280 TraceCheckUtils]: 17: Hoare triple {475#(<= 1 ~N~0)} havoc ~i~0; {475#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:12,817 INFO L280 TraceCheckUtils]: 18: Hoare triple {475#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {475#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:12,817 INFO L280 TraceCheckUtils]: 19: Hoare triple {475#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {475#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:12,818 INFO L280 TraceCheckUtils]: 20: Hoare triple {475#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {475#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:12,819 INFO L280 TraceCheckUtils]: 21: Hoare triple {475#(<= 1 ~N~0)} ~i~0 := 0; {480#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-18 00:47:12,820 INFO L280 TraceCheckUtils]: 22: Hoare triple {480#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {468#false} is VALID [2020-07-18 00:47:12,820 INFO L280 TraceCheckUtils]: 23: Hoare triple {468#false} ~i~0 := 0; {468#false} is VALID [2020-07-18 00:47:12,821 INFO L280 TraceCheckUtils]: 24: Hoare triple {468#false} assume !(~i~0 < ~N~0); {468#false} is VALID [2020-07-18 00:47:12,821 INFO L280 TraceCheckUtils]: 25: Hoare triple {468#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {468#false} is VALID [2020-07-18 00:47:12,821 INFO L263 TraceCheckUtils]: 26: Hoare triple {468#false} call __VERIFIER_assert((if #t~mem6 <= 2 * ~N~0 then 1 else 0)); {468#false} is VALID [2020-07-18 00:47:12,822 INFO L280 TraceCheckUtils]: 27: Hoare triple {468#false} ~cond := #in~cond; {468#false} is VALID [2020-07-18 00:47:12,822 INFO L280 TraceCheckUtils]: 28: Hoare triple {468#false} assume 0 == ~cond; {468#false} is VALID [2020-07-18 00:47:12,823 INFO L280 TraceCheckUtils]: 29: Hoare triple {468#false} assume !false; {468#false} is VALID [2020-07-18 00:47:12,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-18 00:47:12,832 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:12,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [220783274] [2020-07-18 00:47:12,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:12,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:47:12,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67443786] [2020-07-18 00:47:12,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-18 00:47:12,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:12,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:47:12,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:12,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:47:12,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:12,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:47:12,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:47:12,888 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 5 states. [2020-07-18 00:47:13,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:13,296 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2020-07-18 00:47:13,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:47:13,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-18 00:47:13,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2020-07-18 00:47:13,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2020-07-18 00:47:13,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 91 transitions. [2020-07-18 00:47:13,408 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:13,410 INFO L225 Difference]: With dead ends: 81 [2020-07-18 00:47:13,411 INFO L226 Difference]: Without dead ends: 56 [2020-07-18 00:47:13,413 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:47:13,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-18 00:47:13,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2020-07-18 00:47:13,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:13,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 51 states. [2020-07-18 00:47:13,505 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 51 states. [2020-07-18 00:47:13,505 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 51 states. [2020-07-18 00:47:13,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:13,509 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2020-07-18 00:47:13,510 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-07-18 00:47:13,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:13,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:13,511 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 56 states. [2020-07-18 00:47:13,511 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 56 states. [2020-07-18 00:47:13,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:13,515 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2020-07-18 00:47:13,515 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-07-18 00:47:13,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:13,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:13,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:13,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-18 00:47:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2020-07-18 00:47:13,520 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 30 [2020-07-18 00:47:13,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:13,520 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2020-07-18 00:47:13,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:47:13,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 54 transitions. [2020-07-18 00:47:13,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:13,584 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-07-18 00:47:13,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-18 00:47:13,585 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:13,585 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:47:13,586 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:47:13,586 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:13,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:13,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1707000309, now seen corresponding path program 1 times [2020-07-18 00:47:13,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:13,587 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [391026888] [2020-07-18 00:47:13,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:13,623 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:47:13,624 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:458) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:290) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-18 00:47:13,630 INFO L168 Benchmark]: Toolchain (without parser) took 3261.95 ms. Allocated memory was 138.4 MB in the beginning and 245.4 MB in the end (delta: 107.0 MB). Free memory was 103.1 MB in the beginning and 150.9 MB in the end (delta: -47.7 MB). Peak memory consumption was 59.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:13,631 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.4 MB. Free memory is still 121.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 00:47:13,632 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.16 ms. Allocated memory is still 138.4 MB. Free memory was 102.7 MB in the beginning and 92.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:13,633 INFO L168 Benchmark]: Boogie Preprocessor took 133.52 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 92.1 MB in the beginning and 180.4 MB in the end (delta: -88.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:13,634 INFO L168 Benchmark]: RCFGBuilder took 534.33 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 152.1 MB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:13,634 INFO L168 Benchmark]: TraceAbstraction took 2310.10 ms. Allocated memory was 202.9 MB in the beginning and 245.4 MB in the end (delta: 42.5 MB). Free memory was 152.1 MB in the beginning and 150.9 MB in the end (delta: 1.2 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:13,638 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.19 ms. Allocated memory is still 138.4 MB. Free memory is still 121.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 277.16 ms. Allocated memory is still 138.4 MB. Free memory was 102.7 MB in the beginning and 92.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.52 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 92.1 MB in the beginning and 180.4 MB in the end (delta: -88.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 534.33 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 152.1 MB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2310.10 ms. Allocated memory was 202.9 MB in the beginning and 245.4 MB in the end (delta: 42.5 MB). Free memory was 152.1 MB in the beginning and 150.9 MB in the end (delta: 1.2 MB). Peak memory consumption was 43.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:458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...