/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/res2of.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:21:24,069 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:21:24,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:21:24,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:21:24,093 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:21:24,096 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:21:24,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:21:24,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:21:24,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:21:24,102 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:21:24,103 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:21:24,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:21:24,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:21:24,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:21:24,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:21:24,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:21:24,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:21:24,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:21:24,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:21:24,113 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:21:24,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:21:24,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:21:24,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:21:24,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:21:24,120 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:21:24,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:21:24,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:21:24,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:21:24,122 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:21:24,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:21:24,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:21:24,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:21:24,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:21:24,126 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:21:24,127 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:21:24,127 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:21:24,128 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:21:24,128 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:21:24,128 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:21:24,129 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:21:24,130 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:21:24,131 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:21:24,140 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:21:24,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:21:24,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:21:24,142 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:21:24,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:21:24,142 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:21:24,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:21:24,143 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:21:24,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:21:24,143 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:21:24,143 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:21:24,144 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:21:24,144 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:21:24,144 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:21:24,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:21:24,144 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:21:24,145 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:21:24,145 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:21:24,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:24,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:21:24,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:21:24,146 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:21:24,146 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:21:24,442 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:21:24,457 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:21:24,460 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:21:24,462 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:21:24,462 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:21:24,463 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/res2of.c [2020-07-10 20:21:24,536 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3091c50e7/31837aa2d4124476b338d3079bc203fe/FLAGcb07630c6 [2020-07-10 20:21:25,002 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:21:25,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/res2of.c [2020-07-10 20:21:25,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3091c50e7/31837aa2d4124476b338d3079bc203fe/FLAGcb07630c6 [2020-07-10 20:21:25,352 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3091c50e7/31837aa2d4124476b338d3079bc203fe [2020-07-10 20:21:25,363 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:21:25,365 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:21:25,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:25,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:21:25,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:21:25,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:25" (1/1) ... [2020-07-10 20:21:25,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@565cb1f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:25, skipping insertion in model container [2020-07-10 20:21:25,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:25" (1/1) ... [2020-07-10 20:21:25,384 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:21:25,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:21:25,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:25,626 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:21:25,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:25,673 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:21:25,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:25 WrapperNode [2020-07-10 20:21:25,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:25,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:21:25,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:21:25,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:21:25,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:25" (1/1) ... [2020-07-10 20:21:25,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:25" (1/1) ... [2020-07-10 20:21:25,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:25" (1/1) ... [2020-07-10 20:21:25,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:25" (1/1) ... [2020-07-10 20:21:25,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:25" (1/1) ... [2020-07-10 20:21:25,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:25" (1/1) ... [2020-07-10 20:21:25,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:25" (1/1) ... [2020-07-10 20:21:25,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:21:25,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:21:25,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:21:25,805 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:21:25,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:25,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:21:25,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:21:25,871 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:21:25,871 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:21:25,871 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:21:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:21:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:21:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:21:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:21:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:21:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 20:21:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:21:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:21:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 20:21:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:21:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:21:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:21:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:21:25,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:21:26,459 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:21:26,460 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-10 20:21:26,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:26 BoogieIcfgContainer [2020-07-10 20:21:26,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:21:26,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:21:26,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:21:26,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:21:26,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:21:25" (1/3) ... [2020-07-10 20:21:26,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7affd746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:26, skipping insertion in model container [2020-07-10 20:21:26,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:25" (2/3) ... [2020-07-10 20:21:26,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7affd746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:26, skipping insertion in model container [2020-07-10 20:21:26,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:26" (3/3) ... [2020-07-10 20:21:26,475 INFO L109 eAbstractionObserver]: Analyzing ICFG res2of.c [2020-07-10 20:21:26,486 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:21:26,495 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:21:26,511 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:21:26,531 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:21:26,531 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:21:26,532 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:21:26,532 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:21:26,532 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:21:26,532 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:21:26,533 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:21:26,533 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:21:26,549 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2020-07-10 20:21:26,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-10 20:21:26,561 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:26,562 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, 1] [2020-07-10 20:21:26,562 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:26,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:26,568 INFO L82 PathProgramCache]: Analyzing trace with hash -386797637, now seen corresponding path program 1 times [2020-07-10 20:21:26,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:26,576 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1875010836] [2020-07-10 20:21:26,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:26,859 INFO L280 TraceCheckUtils]: 0: Hoare triple {107#(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; {95#true} is VALID [2020-07-10 20:21:26,860 INFO L280 TraceCheckUtils]: 1: Hoare triple {95#true} #valid := #valid[0 := 0]; {95#true} is VALID [2020-07-10 20:21:26,860 INFO L280 TraceCheckUtils]: 2: Hoare triple {95#true} assume 0 < #StackHeapBarrier; {95#true} is VALID [2020-07-10 20:21:26,861 INFO L280 TraceCheckUtils]: 3: Hoare triple {95#true} ~N~0 := 0; {95#true} is VALID [2020-07-10 20:21:26,861 INFO L280 TraceCheckUtils]: 4: Hoare triple {95#true} assume true; {95#true} is VALID [2020-07-10 20:21:26,862 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {95#true} {95#true} #172#return; {95#true} is VALID [2020-07-10 20:21:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:26,872 INFO L280 TraceCheckUtils]: 0: Hoare triple {95#true} ~cond := #in~cond; {95#true} is VALID [2020-07-10 20:21:26,873 INFO L280 TraceCheckUtils]: 1: Hoare triple {95#true} assume !(0 == ~cond); {95#true} is VALID [2020-07-10 20:21:26,873 INFO L280 TraceCheckUtils]: 2: Hoare triple {95#true} assume true; {95#true} is VALID [2020-07-10 20:21:26,874 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {95#true} {95#true} #168#return; {95#true} is VALID [2020-07-10 20:21:26,876 INFO L263 TraceCheckUtils]: 0: Hoare triple {95#true} call ULTIMATE.init(); {107#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:21:26,876 INFO L280 TraceCheckUtils]: 1: Hoare triple {107#(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; {95#true} is VALID [2020-07-10 20:21:26,877 INFO L280 TraceCheckUtils]: 2: Hoare triple {95#true} #valid := #valid[0 := 0]; {95#true} is VALID [2020-07-10 20:21:26,877 INFO L280 TraceCheckUtils]: 3: Hoare triple {95#true} assume 0 < #StackHeapBarrier; {95#true} is VALID [2020-07-10 20:21:26,878 INFO L280 TraceCheckUtils]: 4: Hoare triple {95#true} ~N~0 := 0; {95#true} is VALID [2020-07-10 20:21:26,878 INFO L280 TraceCheckUtils]: 5: Hoare triple {95#true} assume true; {95#true} is VALID [2020-07-10 20:21:26,879 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {95#true} {95#true} #172#return; {95#true} is VALID [2020-07-10 20:21:26,879 INFO L263 TraceCheckUtils]: 7: Hoare triple {95#true} call #t~ret17 := main(); {95#true} is VALID [2020-07-10 20:21:26,879 INFO L280 TraceCheckUtils]: 8: Hoare triple {95#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {95#true} is VALID [2020-07-10 20:21:26,880 INFO L280 TraceCheckUtils]: 9: Hoare triple {95#true} ~N~0 := #t~nondet0; {95#true} is VALID [2020-07-10 20:21:26,880 INFO L280 TraceCheckUtils]: 10: Hoare triple {95#true} havoc #t~nondet0; {95#true} is VALID [2020-07-10 20:21:26,881 INFO L280 TraceCheckUtils]: 11: Hoare triple {95#true} assume !(~N~0 <= 0); {95#true} is VALID [2020-07-10 20:21:26,881 INFO L263 TraceCheckUtils]: 12: Hoare triple {95#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {95#true} is VALID [2020-07-10 20:21:26,881 INFO L280 TraceCheckUtils]: 13: Hoare triple {95#true} ~cond := #in~cond; {95#true} is VALID [2020-07-10 20:21:26,882 INFO L280 TraceCheckUtils]: 14: Hoare triple {95#true} assume !(0 == ~cond); {95#true} is VALID [2020-07-10 20:21:26,882 INFO L280 TraceCheckUtils]: 15: Hoare triple {95#true} assume true; {95#true} is VALID [2020-07-10 20:21:26,882 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {95#true} {95#true} #168#return; {95#true} is VALID [2020-07-10 20:21:26,883 INFO L280 TraceCheckUtils]: 17: Hoare triple {95#true} havoc ~i~0; {95#true} is VALID [2020-07-10 20:21:26,883 INFO L280 TraceCheckUtils]: 18: Hoare triple {95#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {95#true} is VALID [2020-07-10 20:21:26,884 INFO L280 TraceCheckUtils]: 19: Hoare triple {95#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {95#true} is VALID [2020-07-10 20:21:26,884 INFO L280 TraceCheckUtils]: 20: Hoare triple {95#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {95#true} is VALID [2020-07-10 20:21:26,884 INFO L280 TraceCheckUtils]: 21: Hoare triple {95#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L28 {95#true} is VALID [2020-07-10 20:21:26,885 INFO L280 TraceCheckUtils]: 22: Hoare triple {95#true} ~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset; {95#true} is VALID [2020-07-10 20:21:26,885 INFO L280 TraceCheckUtils]: 23: Hoare triple {95#true} SUMMARY for call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L29 {95#true} is VALID [2020-07-10 20:21:26,886 INFO L280 TraceCheckUtils]: 24: Hoare triple {95#true} ~c~0.base, ~c~0.offset := #t~malloc3.base, #t~malloc3.offset; {95#true} is VALID [2020-07-10 20:21:26,886 INFO L280 TraceCheckUtils]: 25: Hoare triple {95#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L31 {95#true} is VALID [2020-07-10 20:21:26,886 INFO L280 TraceCheckUtils]: 26: Hoare triple {95#true} ~i~0 := 0; {95#true} is VALID [2020-07-10 20:21:26,887 INFO L280 TraceCheckUtils]: 27: Hoare triple {95#true} assume !(~i~0 < ~N~0); {95#true} is VALID [2020-07-10 20:21:26,887 INFO L280 TraceCheckUtils]: 28: Hoare triple {95#true} ~i~0 := 0; {95#true} is VALID [2020-07-10 20:21:26,887 INFO L280 TraceCheckUtils]: 29: Hoare triple {95#true} assume !(~i~0 < ~N~0); {95#true} is VALID [2020-07-10 20:21:26,888 INFO L280 TraceCheckUtils]: 30: Hoare triple {95#true} ~i~0 := 0; {95#true} is VALID [2020-07-10 20:21:26,888 INFO L280 TraceCheckUtils]: 31: Hoare triple {95#true} assume !(~i~0 < ~N~0); {95#true} is VALID [2020-07-10 20:21:26,888 INFO L280 TraceCheckUtils]: 32: Hoare triple {95#true} ~i~0 := 0; {95#true} is VALID [2020-07-10 20:21:26,890 INFO L280 TraceCheckUtils]: 33: Hoare triple {95#true} assume !true; {96#false} is VALID [2020-07-10 20:21:26,890 INFO L280 TraceCheckUtils]: 34: Hoare triple {96#false} ~i~0 := 0; {96#false} is VALID [2020-07-10 20:21:26,890 INFO L280 TraceCheckUtils]: 35: Hoare triple {96#false} assume !true; {96#false} is VALID [2020-07-10 20:21:26,891 INFO L280 TraceCheckUtils]: 36: Hoare triple {96#false} ~i~0 := 0; {96#false} is VALID [2020-07-10 20:21:26,891 INFO L280 TraceCheckUtils]: 37: Hoare triple {96#false} assume !true; {96#false} is VALID [2020-07-10 20:21:26,891 INFO L280 TraceCheckUtils]: 38: Hoare triple {96#false} SUMMARY for call #t~mem16 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L57-6 {96#false} is VALID [2020-07-10 20:21:26,892 INFO L263 TraceCheckUtils]: 39: Hoare triple {96#false} call __VERIFIER_assert((if #t~mem16 <= 2 * ~N~0 then 1 else 0)); {96#false} is VALID [2020-07-10 20:21:26,892 INFO L280 TraceCheckUtils]: 40: Hoare triple {96#false} ~cond := #in~cond; {96#false} is VALID [2020-07-10 20:21:26,892 INFO L280 TraceCheckUtils]: 41: Hoare triple {96#false} assume 0 == ~cond; {96#false} is VALID [2020-07-10 20:21:26,893 INFO L280 TraceCheckUtils]: 42: Hoare triple {96#false} assume !false; {96#false} is VALID [2020-07-10 20:21:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:21:26,900 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:26,903 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1875010836] [2020-07-10 20:21:26,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:26,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:21:26,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771276121] [2020-07-10 20:21:26,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2020-07-10 20:21:26,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:26,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:21:27,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:27,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:21:27,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:27,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:21:27,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:21:27,016 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 3 states. [2020-07-10 20:21:27,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:27,568 INFO L93 Difference]: Finished difference Result 167 states and 194 transitions. [2020-07-10 20:21:27,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:21:27,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2020-07-10 20:21:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:27,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:27,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2020-07-10 20:21:27,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2020-07-10 20:21:27,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 194 transitions. [2020-07-10 20:21:27,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:27,837 INFO L225 Difference]: With dead ends: 167 [2020-07-10 20:21:27,837 INFO L226 Difference]: Without dead ends: 80 [2020-07-10 20:21:27,841 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10 20:21:27,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-10 20:21:27,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-07-10 20:21:27,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:27,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 80 states. [2020-07-10 20:21:27,948 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2020-07-10 20:21:27,948 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2020-07-10 20:21:27,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:27,955 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2020-07-10 20:21:27,956 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2020-07-10 20:21:27,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:27,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:27,957 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2020-07-10 20:21:27,958 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2020-07-10 20:21:27,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:27,964 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2020-07-10 20:21:27,965 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2020-07-10 20:21:27,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:27,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:27,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:27,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:27,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-10 20:21:27,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2020-07-10 20:21:27,973 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 43 [2020-07-10 20:21:27,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:27,974 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2020-07-10 20:21:27,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:21:27,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 80 states and 85 transitions. [2020-07-10 20:21:28,080 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:28,080 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2020-07-10 20:21:28,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-10 20:21:28,082 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:28,083 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, 1] [2020-07-10 20:21:28,083 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:21:28,083 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:28,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:28,084 INFO L82 PathProgramCache]: Analyzing trace with hash 614001090, now seen corresponding path program 1 times [2020-07-10 20:21:28,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:28,084 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [896584304] [2020-07-10 20:21:28,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:28,283 INFO L280 TraceCheckUtils]: 0: Hoare triple {778#(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; {764#true} is VALID [2020-07-10 20:21:28,284 INFO L280 TraceCheckUtils]: 1: Hoare triple {764#true} #valid := #valid[0 := 0]; {764#true} is VALID [2020-07-10 20:21:28,284 INFO L280 TraceCheckUtils]: 2: Hoare triple {764#true} assume 0 < #StackHeapBarrier; {764#true} is VALID [2020-07-10 20:21:28,285 INFO L280 TraceCheckUtils]: 3: Hoare triple {764#true} ~N~0 := 0; {764#true} is VALID [2020-07-10 20:21:28,285 INFO L280 TraceCheckUtils]: 4: Hoare triple {764#true} assume true; {764#true} is VALID [2020-07-10 20:21:28,285 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {764#true} {764#true} #172#return; {764#true} is VALID [2020-07-10 20:21:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:28,293 INFO L280 TraceCheckUtils]: 0: Hoare triple {764#true} ~cond := #in~cond; {764#true} is VALID [2020-07-10 20:21:28,294 INFO L280 TraceCheckUtils]: 1: Hoare triple {764#true} assume !(0 == ~cond); {764#true} is VALID [2020-07-10 20:21:28,294 INFO L280 TraceCheckUtils]: 2: Hoare triple {764#true} assume true; {764#true} is VALID [2020-07-10 20:21:28,295 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {764#true} {772#(<= 1 ~N~0)} #168#return; {772#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:28,296 INFO L263 TraceCheckUtils]: 0: Hoare triple {764#true} call ULTIMATE.init(); {778#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:21:28,297 INFO L280 TraceCheckUtils]: 1: Hoare triple {778#(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; {764#true} is VALID [2020-07-10 20:21:28,297 INFO L280 TraceCheckUtils]: 2: Hoare triple {764#true} #valid := #valid[0 := 0]; {764#true} is VALID [2020-07-10 20:21:28,297 INFO L280 TraceCheckUtils]: 3: Hoare triple {764#true} assume 0 < #StackHeapBarrier; {764#true} is VALID [2020-07-10 20:21:28,298 INFO L280 TraceCheckUtils]: 4: Hoare triple {764#true} ~N~0 := 0; {764#true} is VALID [2020-07-10 20:21:28,298 INFO L280 TraceCheckUtils]: 5: Hoare triple {764#true} assume true; {764#true} is VALID [2020-07-10 20:21:28,298 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {764#true} {764#true} #172#return; {764#true} is VALID [2020-07-10 20:21:28,299 INFO L263 TraceCheckUtils]: 7: Hoare triple {764#true} call #t~ret17 := main(); {764#true} is VALID [2020-07-10 20:21:28,299 INFO L280 TraceCheckUtils]: 8: Hoare triple {764#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {764#true} is VALID [2020-07-10 20:21:28,299 INFO L280 TraceCheckUtils]: 9: Hoare triple {764#true} ~N~0 := #t~nondet0; {764#true} is VALID [2020-07-10 20:21:28,300 INFO L280 TraceCheckUtils]: 10: Hoare triple {764#true} havoc #t~nondet0; {764#true} is VALID [2020-07-10 20:21:28,301 INFO L280 TraceCheckUtils]: 11: Hoare triple {764#true} assume !(~N~0 <= 0); {772#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:28,301 INFO L263 TraceCheckUtils]: 12: Hoare triple {772#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {764#true} is VALID [2020-07-10 20:21:28,301 INFO L280 TraceCheckUtils]: 13: Hoare triple {764#true} ~cond := #in~cond; {764#true} is VALID [2020-07-10 20:21:28,302 INFO L280 TraceCheckUtils]: 14: Hoare triple {764#true} assume !(0 == ~cond); {764#true} is VALID [2020-07-10 20:21:28,302 INFO L280 TraceCheckUtils]: 15: Hoare triple {764#true} assume true; {764#true} is VALID [2020-07-10 20:21:28,303 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {764#true} {772#(<= 1 ~N~0)} #168#return; {772#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:28,304 INFO L280 TraceCheckUtils]: 17: Hoare triple {772#(<= 1 ~N~0)} havoc ~i~0; {772#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:28,304 INFO L280 TraceCheckUtils]: 18: Hoare triple {772#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {772#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:28,305 INFO L280 TraceCheckUtils]: 19: Hoare triple {772#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {772#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:28,306 INFO L280 TraceCheckUtils]: 20: Hoare triple {772#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {772#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:28,307 INFO L280 TraceCheckUtils]: 21: Hoare triple {772#(<= 1 ~N~0)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L28 {772#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:28,307 INFO L280 TraceCheckUtils]: 22: Hoare triple {772#(<= 1 ~N~0)} ~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset; {772#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:28,308 INFO L280 TraceCheckUtils]: 23: Hoare triple {772#(<= 1 ~N~0)} SUMMARY for call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L29 {772#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:28,309 INFO L280 TraceCheckUtils]: 24: Hoare triple {772#(<= 1 ~N~0)} ~c~0.base, ~c~0.offset := #t~malloc3.base, #t~malloc3.offset; {772#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:28,310 INFO L280 TraceCheckUtils]: 25: Hoare triple {772#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L31 {772#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:28,311 INFO L280 TraceCheckUtils]: 26: Hoare triple {772#(<= 1 ~N~0)} ~i~0 := 0; {777#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 20:21:28,312 INFO L280 TraceCheckUtils]: 27: Hoare triple {777#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {765#false} is VALID [2020-07-10 20:21:28,312 INFO L280 TraceCheckUtils]: 28: Hoare triple {765#false} ~i~0 := 0; {765#false} is VALID [2020-07-10 20:21:28,313 INFO L280 TraceCheckUtils]: 29: Hoare triple {765#false} assume !(~i~0 < ~N~0); {765#false} is VALID [2020-07-10 20:21:28,313 INFO L280 TraceCheckUtils]: 30: Hoare triple {765#false} ~i~0 := 0; {765#false} is VALID [2020-07-10 20:21:28,313 INFO L280 TraceCheckUtils]: 31: Hoare triple {765#false} assume !(~i~0 < ~N~0); {765#false} is VALID [2020-07-10 20:21:28,314 INFO L280 TraceCheckUtils]: 32: Hoare triple {765#false} ~i~0 := 0; {765#false} is VALID [2020-07-10 20:21:28,314 INFO L280 TraceCheckUtils]: 33: Hoare triple {765#false} assume !(~i~0 < ~N~0); {765#false} is VALID [2020-07-10 20:21:28,314 INFO L280 TraceCheckUtils]: 34: Hoare triple {765#false} ~i~0 := 0; {765#false} is VALID [2020-07-10 20:21:28,315 INFO L280 TraceCheckUtils]: 35: Hoare triple {765#false} assume !(~i~0 < ~N~0); {765#false} is VALID [2020-07-10 20:21:28,315 INFO L280 TraceCheckUtils]: 36: Hoare triple {765#false} ~i~0 := 0; {765#false} is VALID [2020-07-10 20:21:28,315 INFO L280 TraceCheckUtils]: 37: Hoare triple {765#false} assume !(~i~0 < ~N~0); {765#false} is VALID [2020-07-10 20:21:28,315 INFO L280 TraceCheckUtils]: 38: Hoare triple {765#false} SUMMARY for call #t~mem16 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L57-6 {765#false} is VALID [2020-07-10 20:21:28,316 INFO L263 TraceCheckUtils]: 39: Hoare triple {765#false} call __VERIFIER_assert((if #t~mem16 <= 2 * ~N~0 then 1 else 0)); {765#false} is VALID [2020-07-10 20:21:28,316 INFO L280 TraceCheckUtils]: 40: Hoare triple {765#false} ~cond := #in~cond; {765#false} is VALID [2020-07-10 20:21:28,316 INFO L280 TraceCheckUtils]: 41: Hoare triple {765#false} assume 0 == ~cond; {765#false} is VALID [2020-07-10 20:21:28,317 INFO L280 TraceCheckUtils]: 42: Hoare triple {765#false} assume !false; {765#false} is VALID [2020-07-10 20:21:28,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:21:28,321 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:28,321 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [896584304] [2020-07-10 20:21:28,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:28,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:21:28,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234415276] [2020-07-10 20:21:28,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-07-10 20:21:28,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:28,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:21:28,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:28,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:21:28,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:28,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:21:28,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:21:28,373 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 5 states. [2020-07-10 20:21:29,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:29,080 INFO L93 Difference]: Finished difference Result 164 states and 179 transitions. [2020-07-10 20:21:29,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:21:29,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-07-10 20:21:29,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:29,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:29,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2020-07-10 20:21:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2020-07-10 20:21:29,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 179 transitions. [2020-07-10 20:21:29,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:29,300 INFO L225 Difference]: With dead ends: 164 [2020-07-10 20:21:29,300 INFO L226 Difference]: Without dead ends: 116 [2020-07-10 20:21:29,302 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:21:29,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-07-10 20:21:29,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 86. [2020-07-10 20:21:29,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:29,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 86 states. [2020-07-10 20:21:29,439 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 86 states. [2020-07-10 20:21:29,439 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 86 states. [2020-07-10 20:21:29,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:29,452 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2020-07-10 20:21:29,452 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2020-07-10 20:21:29,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:29,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:29,454 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 116 states. [2020-07-10 20:21:29,454 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 116 states. [2020-07-10 20:21:29,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:29,469 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2020-07-10 20:21:29,469 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2020-07-10 20:21:29,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:29,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:29,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:29,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:29,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-07-10 20:21:29,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2020-07-10 20:21:29,482 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 43 [2020-07-10 20:21:29,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:29,483 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2020-07-10 20:21:29,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:21:29,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 86 states and 91 transitions. [2020-07-10 20:21:29,619 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-10 20:21:29,619 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2020-07-10 20:21:29,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-07-10 20:21:29,622 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:29,623 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, 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, 1] [2020-07-10 20:21:29,623 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:21:29,623 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:29,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:29,624 INFO L82 PathProgramCache]: Analyzing trace with hash -849907375, now seen corresponding path program 1 times [2020-07-10 20:21:29,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:29,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1057339346] [2020-07-10 20:21:29,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:29,653 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:21:29,654 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 20:21:29,660 INFO L168 Benchmark]: Toolchain (without parser) took 4294.40 ms. Allocated memory was 135.3 MB in the beginning and 263.2 MB in the end (delta: 127.9 MB). Free memory was 100.1 MB in the beginning and 107.6 MB in the end (delta: -7.5 MB). Peak memory consumption was 120.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:29,661 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 135.3 MB. Free memory is still 118.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 20:21:29,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.45 ms. Allocated memory is still 135.3 MB. Free memory was 99.6 MB in the beginning and 88.1 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:29,663 INFO L168 Benchmark]: Boogie Preprocessor took 130.25 ms. Allocated memory was 135.3 MB in the beginning and 212.3 MB in the end (delta: 77.1 MB). Free memory was 88.1 MB in the beginning and 196.3 MB in the end (delta: -108.2 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:29,664 INFO L168 Benchmark]: RCFGBuilder took 660.28 ms. Allocated memory is still 212.3 MB. Free memory was 196.3 MB in the beginning and 156.9 MB in the end (delta: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:29,665 INFO L168 Benchmark]: TraceAbstraction took 3190.44 ms. Allocated memory was 212.3 MB in the beginning and 263.2 MB in the end (delta: 50.9 MB). Free memory was 156.9 MB in the beginning and 107.6 MB in the end (delta: 49.3 MB). Peak memory consumption was 100.1 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:29,668 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.25 ms. Allocated memory is still 135.3 MB. Free memory is still 118.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 307.45 ms. Allocated memory is still 135.3 MB. Free memory was 99.6 MB in the beginning and 88.1 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.25 ms. Allocated memory was 135.3 MB in the beginning and 212.3 MB in the end (delta: 77.1 MB). Free memory was 88.1 MB in the beginning and 196.3 MB in the end (delta: -108.2 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 660.28 ms. Allocated memory is still 212.3 MB. Free memory was 196.3 MB in the beginning and 156.9 MB in the end (delta: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3190.44 ms. Allocated memory was 212.3 MB in the beginning and 263.2 MB in the end (delta: 50.9 MB). Free memory was 156.9 MB in the beginning and 107.6 MB in the end (delta: 49.3 MB). Peak memory consumption was 100.1 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...