/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/sina4f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:47:40,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:47:40,129 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:47:40,141 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:47:40,141 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:47:40,142 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:47:40,143 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:47:40,145 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:47:40,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:47:40,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:47:40,149 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:47:40,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:47:40,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:47:40,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:47:40,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:47:40,153 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:47:40,154 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:47:40,155 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:47:40,156 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:47:40,158 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:47:40,159 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:47:40,160 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:47:40,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:47:40,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:47:40,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:47:40,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:47:40,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:47:40,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:47:40,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:47:40,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:47:40,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:47:40,168 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:47:40,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:47:40,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:47:40,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:47:40,171 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:47:40,171 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:47:40,172 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:47:40,172 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:47:40,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:47:40,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:47:40,174 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:40,186 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:47:40,186 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:47:40,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:47:40,188 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:47:40,189 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:47:40,189 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:47:40,189 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:47:40,189 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:47:40,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:47:40,190 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:47:40,190 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:47:40,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:47:40,190 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:47:40,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:47:40,191 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:47:40,191 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:47:40,191 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:47:40,191 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:47:40,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:40,192 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:47:40,192 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:47:40,192 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:47:40,193 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:47:40,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:47:40,485 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:47:40,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:47:40,489 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:47:40,489 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:47:40,490 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/sina4f.c [2020-07-18 00:47:40,561 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47bd50647/c3307ea9c98b43efb18dbb3b970d527c/FLAGfa9059655 [2020-07-18 00:47:40,956 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:47:40,957 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina4f.c [2020-07-18 00:47:40,963 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47bd50647/c3307ea9c98b43efb18dbb3b970d527c/FLAGfa9059655 [2020-07-18 00:47:41,379 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47bd50647/c3307ea9c98b43efb18dbb3b970d527c [2020-07-18 00:47:41,389 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:47:41,392 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:47:41,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:41,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:47:41,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:47:41,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:41" (1/1) ... [2020-07-18 00:47:41,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb4b3c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:41, skipping insertion in model container [2020-07-18 00:47:41,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:41" (1/1) ... [2020-07-18 00:47:41,409 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:47:41,426 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:47:41,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:41,621 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:47:41,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:41,757 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:47:41,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:41 WrapperNode [2020-07-18 00:47:41,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:41,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:47:41,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:47:41,759 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:47:41,771 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:41" (1/1) ... [2020-07-18 00:47:41,771 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:41" (1/1) ... [2020-07-18 00:47:41,779 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:41" (1/1) ... [2020-07-18 00:47:41,779 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:41" (1/1) ... [2020-07-18 00:47:41,792 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:41" (1/1) ... [2020-07-18 00:47:41,802 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:41" (1/1) ... [2020-07-18 00:47:41,804 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:41" (1/1) ... [2020-07-18 00:47:41,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:47:41,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:47:41,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:47:41,807 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:47:41,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:41" (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:41,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:47:41,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:47:41,872 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 00:47:41,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:47:41,872 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:47:41,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:47:41,872 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:47:41,872 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 00:47:41,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:47:41,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:47:41,873 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 00:47:41,873 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:47:41,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 00:47:41,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 00:47:41,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:47:41,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:47:41,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:47:41,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:47:41,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:47:42,395 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:47:42,395 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-18 00:47:42,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:42 BoogieIcfgContainer [2020-07-18 00:47:42,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:47:42,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:47:42,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:47:42,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:47:42,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:47:41" (1/3) ... [2020-07-18 00:47:42,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@abf6478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:42, skipping insertion in model container [2020-07-18 00:47:42,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:41" (2/3) ... [2020-07-18 00:47:42,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@abf6478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:42, skipping insertion in model container [2020-07-18 00:47:42,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:42" (3/3) ... [2020-07-18 00:47:42,408 INFO L109 eAbstractionObserver]: Analyzing ICFG sina4f.c [2020-07-18 00:47:42,418 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:47:42,426 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:47:42,439 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:47:42,458 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:47:42,458 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:47:42,459 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:47:42,459 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:47:42,459 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:47:42,459 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:47:42,459 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:47:42,460 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:47:42,476 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2020-07-18 00:47:42,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-18 00:47:42,487 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:42,488 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] [2020-07-18 00:47:42,489 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:42,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:42,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1015859133, now seen corresponding path program 1 times [2020-07-18 00:47:42,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:42,505 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1031350161] [2020-07-18 00:47:42,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:42,747 INFO L280 TraceCheckUtils]: 0: Hoare triple {96#(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; {84#true} is VALID [2020-07-18 00:47:42,748 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} #valid := #valid[0 := 0]; {84#true} is VALID [2020-07-18 00:47:42,748 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} assume 0 < #StackHeapBarrier; {84#true} is VALID [2020-07-18 00:47:42,749 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#true} ~N~0 := 0; {84#true} is VALID [2020-07-18 00:47:42,749 INFO L280 TraceCheckUtils]: 4: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-18 00:47:42,750 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {84#true} {84#true} #150#return; {84#true} is VALID [2020-07-18 00:47:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:42,759 INFO L280 TraceCheckUtils]: 0: Hoare triple {84#true} ~cond := #in~cond; {84#true} is VALID [2020-07-18 00:47:42,760 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} assume !(0 == ~cond); {84#true} is VALID [2020-07-18 00:47:42,761 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-18 00:47:42,761 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {84#true} {84#true} #146#return; {84#true} is VALID [2020-07-18 00:47:42,763 INFO L263 TraceCheckUtils]: 0: Hoare triple {84#true} call ULTIMATE.init(); {96#(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:42,764 INFO L280 TraceCheckUtils]: 1: Hoare triple {96#(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; {84#true} is VALID [2020-07-18 00:47:42,764 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} #valid := #valid[0 := 0]; {84#true} is VALID [2020-07-18 00:47:42,764 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#true} assume 0 < #StackHeapBarrier; {84#true} is VALID [2020-07-18 00:47:42,765 INFO L280 TraceCheckUtils]: 4: Hoare triple {84#true} ~N~0 := 0; {84#true} is VALID [2020-07-18 00:47:42,765 INFO L280 TraceCheckUtils]: 5: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-18 00:47:42,766 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {84#true} {84#true} #150#return; {84#true} is VALID [2020-07-18 00:47:42,766 INFO L263 TraceCheckUtils]: 7: Hoare triple {84#true} call #t~ret14 := main(); {84#true} is VALID [2020-07-18 00:47:42,767 INFO L280 TraceCheckUtils]: 8: Hoare triple {84#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {84#true} is VALID [2020-07-18 00:47:42,767 INFO L280 TraceCheckUtils]: 9: Hoare triple {84#true} ~N~0 := #t~nondet0; {84#true} is VALID [2020-07-18 00:47:42,768 INFO L280 TraceCheckUtils]: 10: Hoare triple {84#true} havoc #t~nondet0; {84#true} is VALID [2020-07-18 00:47:42,768 INFO L280 TraceCheckUtils]: 11: Hoare triple {84#true} assume !(~N~0 <= 0); {84#true} is VALID [2020-07-18 00:47:42,769 INFO L263 TraceCheckUtils]: 12: Hoare triple {84#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {84#true} is VALID [2020-07-18 00:47:42,769 INFO L280 TraceCheckUtils]: 13: Hoare triple {84#true} ~cond := #in~cond; {84#true} is VALID [2020-07-18 00:47:42,770 INFO L280 TraceCheckUtils]: 14: Hoare triple {84#true} assume !(0 == ~cond); {84#true} is VALID [2020-07-18 00:47:42,770 INFO L280 TraceCheckUtils]: 15: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-18 00:47:42,770 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {84#true} {84#true} #146#return; {84#true} is VALID [2020-07-18 00:47:42,771 INFO L280 TraceCheckUtils]: 17: Hoare triple {84#true} havoc ~i~0; {84#true} is VALID [2020-07-18 00:47:42,771 INFO L280 TraceCheckUtils]: 18: Hoare triple {84#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {84#true} is VALID [2020-07-18 00:47:42,772 INFO L280 TraceCheckUtils]: 19: Hoare triple {84#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {84#true} is VALID [2020-07-18 00:47:42,772 INFO L280 TraceCheckUtils]: 20: Hoare triple {84#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {84#true} is VALID [2020-07-18 00:47:42,773 INFO L280 TraceCheckUtils]: 21: Hoare triple {84#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L28 {84#true} is VALID [2020-07-18 00:47:42,773 INFO L280 TraceCheckUtils]: 22: Hoare triple {84#true} ~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset; {84#true} is VALID [2020-07-18 00:47:42,774 INFO L280 TraceCheckUtils]: 23: Hoare triple {84#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L30 {84#true} is VALID [2020-07-18 00:47:42,774 INFO L280 TraceCheckUtils]: 24: Hoare triple {84#true} ~i~0 := 0; {84#true} is VALID [2020-07-18 00:47:42,775 INFO L280 TraceCheckUtils]: 25: Hoare triple {84#true} assume !true; {85#false} is VALID [2020-07-18 00:47:42,776 INFO L280 TraceCheckUtils]: 26: Hoare triple {85#false} ~i~0 := 0; {85#false} is VALID [2020-07-18 00:47:42,776 INFO L280 TraceCheckUtils]: 27: Hoare triple {85#false} assume !(~i~0 < ~N~0); {85#false} is VALID [2020-07-18 00:47:42,777 INFO L280 TraceCheckUtils]: 28: Hoare triple {85#false} ~i~0 := 0; {85#false} is VALID [2020-07-18 00:47:42,777 INFO L280 TraceCheckUtils]: 29: Hoare triple {85#false} assume !true; {85#false} is VALID [2020-07-18 00:47:42,777 INFO L280 TraceCheckUtils]: 30: Hoare triple {85#false} ~i~0 := 0; {85#false} is VALID [2020-07-18 00:47:42,778 INFO L280 TraceCheckUtils]: 31: Hoare triple {85#false} assume !true; {85#false} is VALID [2020-07-18 00:47:42,778 INFO L280 TraceCheckUtils]: 32: Hoare triple {85#false} ~i~0 := 0; {85#false} is VALID [2020-07-18 00:47:42,778 INFO L280 TraceCheckUtils]: 33: Hoare triple {85#false} assume !!(~i~0 < ~N~0); {85#false} is VALID [2020-07-18 00:47:42,779 INFO L280 TraceCheckUtils]: 34: Hoare triple {85#false} SUMMARY for call #t~mem13 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); srcloc: L53 {85#false} is VALID [2020-07-18 00:47:42,779 INFO L263 TraceCheckUtils]: 35: Hoare triple {85#false} call __VERIFIER_assert((if #t~mem13 == ~N~0 then 1 else 0)); {85#false} is VALID [2020-07-18 00:47:42,780 INFO L280 TraceCheckUtils]: 36: Hoare triple {85#false} ~cond := #in~cond; {85#false} is VALID [2020-07-18 00:47:42,780 INFO L280 TraceCheckUtils]: 37: Hoare triple {85#false} assume 0 == ~cond; {85#false} is VALID [2020-07-18 00:47:42,780 INFO L280 TraceCheckUtils]: 38: Hoare triple {85#false} assume !false; {85#false} is VALID [2020-07-18 00:47:42,788 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:42,790 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:42,792 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1031350161] [2020-07-18 00:47:42,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:42,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:47:42,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926841118] [2020-07-18 00:47:42,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-07-18 00:47:42,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:42,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:47:42,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:42,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:47:42,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:42,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:47:42,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:47:42,883 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 3 states. [2020-07-18 00:47:43,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:43,306 INFO L93 Difference]: Finished difference Result 145 states and 168 transitions. [2020-07-18 00:47:43,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:47:43,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-07-18 00:47:43,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:43,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:47:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-18 00:47:43,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:47:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-18 00:47:43,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2020-07-18 00:47:43,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:43,535 INFO L225 Difference]: With dead ends: 145 [2020-07-18 00:47:43,536 INFO L226 Difference]: Without dead ends: 72 [2020-07-18 00:47:43,540 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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:43,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-18 00:47:43,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-07-18 00:47:43,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:43,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2020-07-18 00:47:43,641 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2020-07-18 00:47:43,641 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2020-07-18 00:47:43,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:43,648 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2020-07-18 00:47:43,648 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2020-07-18 00:47:43,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:43,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:43,650 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2020-07-18 00:47:43,650 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2020-07-18 00:47:43,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:43,656 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2020-07-18 00:47:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2020-07-18 00:47:43,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:43,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:43,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:43,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:43,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-18 00:47:43,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2020-07-18 00:47:43,664 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 39 [2020-07-18 00:47:43,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:43,665 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2020-07-18 00:47:43,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:47:43,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 76 transitions. [2020-07-18 00:47:43,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:43,761 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2020-07-18 00:47:43,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-18 00:47:43,763 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:43,763 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] [2020-07-18 00:47:43,763 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:47:43,763 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:43,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:43,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1834550526, now seen corresponding path program 1 times [2020-07-18 00:47:43,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:43,765 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1187047533] [2020-07-18 00:47:43,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:43,895 INFO L280 TraceCheckUtils]: 0: Hoare triple {691#(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; {677#true} is VALID [2020-07-18 00:47:43,895 INFO L280 TraceCheckUtils]: 1: Hoare triple {677#true} #valid := #valid[0 := 0]; {677#true} is VALID [2020-07-18 00:47:43,895 INFO L280 TraceCheckUtils]: 2: Hoare triple {677#true} assume 0 < #StackHeapBarrier; {677#true} is VALID [2020-07-18 00:47:43,896 INFO L280 TraceCheckUtils]: 3: Hoare triple {677#true} ~N~0 := 0; {677#true} is VALID [2020-07-18 00:47:43,896 INFO L280 TraceCheckUtils]: 4: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-18 00:47:43,897 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {677#true} {677#true} #150#return; {677#true} is VALID [2020-07-18 00:47:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:43,904 INFO L280 TraceCheckUtils]: 0: Hoare triple {677#true} ~cond := #in~cond; {677#true} is VALID [2020-07-18 00:47:43,905 INFO L280 TraceCheckUtils]: 1: Hoare triple {677#true} assume !(0 == ~cond); {677#true} is VALID [2020-07-18 00:47:43,905 INFO L280 TraceCheckUtils]: 2: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-18 00:47:43,907 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {677#true} {685#(<= 1 ~N~0)} #146#return; {685#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:43,908 INFO L263 TraceCheckUtils]: 0: Hoare triple {677#true} call ULTIMATE.init(); {691#(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:43,908 INFO L280 TraceCheckUtils]: 1: Hoare triple {691#(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; {677#true} is VALID [2020-07-18 00:47:43,909 INFO L280 TraceCheckUtils]: 2: Hoare triple {677#true} #valid := #valid[0 := 0]; {677#true} is VALID [2020-07-18 00:47:43,909 INFO L280 TraceCheckUtils]: 3: Hoare triple {677#true} assume 0 < #StackHeapBarrier; {677#true} is VALID [2020-07-18 00:47:43,909 INFO L280 TraceCheckUtils]: 4: Hoare triple {677#true} ~N~0 := 0; {677#true} is VALID [2020-07-18 00:47:43,910 INFO L280 TraceCheckUtils]: 5: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-18 00:47:43,910 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {677#true} {677#true} #150#return; {677#true} is VALID [2020-07-18 00:47:43,911 INFO L263 TraceCheckUtils]: 7: Hoare triple {677#true} call #t~ret14 := main(); {677#true} is VALID [2020-07-18 00:47:43,911 INFO L280 TraceCheckUtils]: 8: Hoare triple {677#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {677#true} is VALID [2020-07-18 00:47:43,911 INFO L280 TraceCheckUtils]: 9: Hoare triple {677#true} ~N~0 := #t~nondet0; {677#true} is VALID [2020-07-18 00:47:43,912 INFO L280 TraceCheckUtils]: 10: Hoare triple {677#true} havoc #t~nondet0; {677#true} is VALID [2020-07-18 00:47:43,913 INFO L280 TraceCheckUtils]: 11: Hoare triple {677#true} assume !(~N~0 <= 0); {685#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:43,913 INFO L263 TraceCheckUtils]: 12: Hoare triple {685#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {677#true} is VALID [2020-07-18 00:47:43,913 INFO L280 TraceCheckUtils]: 13: Hoare triple {677#true} ~cond := #in~cond; {677#true} is VALID [2020-07-18 00:47:43,914 INFO L280 TraceCheckUtils]: 14: Hoare triple {677#true} assume !(0 == ~cond); {677#true} is VALID [2020-07-18 00:47:43,914 INFO L280 TraceCheckUtils]: 15: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-18 00:47:43,915 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {677#true} {685#(<= 1 ~N~0)} #146#return; {685#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:43,916 INFO L280 TraceCheckUtils]: 17: Hoare triple {685#(<= 1 ~N~0)} havoc ~i~0; {685#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:43,917 INFO L280 TraceCheckUtils]: 18: Hoare triple {685#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {685#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:43,918 INFO L280 TraceCheckUtils]: 19: Hoare triple {685#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {685#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:43,918 INFO L280 TraceCheckUtils]: 20: Hoare triple {685#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {685#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:43,919 INFO L280 TraceCheckUtils]: 21: Hoare triple {685#(<= 1 ~N~0)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L28 {685#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:43,920 INFO L280 TraceCheckUtils]: 22: Hoare triple {685#(<= 1 ~N~0)} ~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset; {685#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:43,921 INFO L280 TraceCheckUtils]: 23: Hoare triple {685#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L30 {685#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:43,922 INFO L280 TraceCheckUtils]: 24: Hoare triple {685#(<= 1 ~N~0)} ~i~0 := 0; {690#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-18 00:47:43,923 INFO L280 TraceCheckUtils]: 25: Hoare triple {690#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {678#false} is VALID [2020-07-18 00:47:43,923 INFO L280 TraceCheckUtils]: 26: Hoare triple {678#false} ~i~0 := 0; {678#false} is VALID [2020-07-18 00:47:43,924 INFO L280 TraceCheckUtils]: 27: Hoare triple {678#false} assume !(~i~0 < ~N~0); {678#false} is VALID [2020-07-18 00:47:43,924 INFO L280 TraceCheckUtils]: 28: Hoare triple {678#false} ~i~0 := 0; {678#false} is VALID [2020-07-18 00:47:43,924 INFO L280 TraceCheckUtils]: 29: Hoare triple {678#false} assume !(~i~0 < ~N~0); {678#false} is VALID [2020-07-18 00:47:43,925 INFO L280 TraceCheckUtils]: 30: Hoare triple {678#false} ~i~0 := 0; {678#false} is VALID [2020-07-18 00:47:43,925 INFO L280 TraceCheckUtils]: 31: Hoare triple {678#false} assume !(~i~0 < ~N~0); {678#false} is VALID [2020-07-18 00:47:43,926 INFO L280 TraceCheckUtils]: 32: Hoare triple {678#false} ~i~0 := 0; {678#false} is VALID [2020-07-18 00:47:43,926 INFO L280 TraceCheckUtils]: 33: Hoare triple {678#false} assume !!(~i~0 < ~N~0); {678#false} is VALID [2020-07-18 00:47:43,926 INFO L280 TraceCheckUtils]: 34: Hoare triple {678#false} SUMMARY for call #t~mem13 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); srcloc: L53 {678#false} is VALID [2020-07-18 00:47:43,927 INFO L263 TraceCheckUtils]: 35: Hoare triple {678#false} call __VERIFIER_assert((if #t~mem13 == ~N~0 then 1 else 0)); {678#false} is VALID [2020-07-18 00:47:43,927 INFO L280 TraceCheckUtils]: 36: Hoare triple {678#false} ~cond := #in~cond; {678#false} is VALID [2020-07-18 00:47:43,927 INFO L280 TraceCheckUtils]: 37: Hoare triple {678#false} assume 0 == ~cond; {678#false} is VALID [2020-07-18 00:47:43,928 INFO L280 TraceCheckUtils]: 38: Hoare triple {678#false} assume !false; {678#false} is VALID [2020-07-18 00:47:43,931 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:43,938 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:43,939 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1187047533] [2020-07-18 00:47:43,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:43,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:47:43,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975609951] [2020-07-18 00:47:43,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-07-18 00:47:43,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:43,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:47:44,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:44,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:47:44,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:44,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:47:44,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:47:44,002 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 5 states. [2020-07-18 00:47:44,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:44,569 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2020-07-18 00:47:44,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:47:44,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-07-18 00:47:44,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2020-07-18 00:47:44,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:44,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2020-07-18 00:47:44,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 158 transitions. [2020-07-18 00:47:44,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:44,790 INFO L225 Difference]: With dead ends: 146 [2020-07-18 00:47:44,791 INFO L226 Difference]: Without dead ends: 104 [2020-07-18 00:47:44,792 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 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:44,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-07-18 00:47:44,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 76. [2020-07-18 00:47:44,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:44,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 76 states. [2020-07-18 00:47:44,914 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 76 states. [2020-07-18 00:47:44,914 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 76 states. [2020-07-18 00:47:44,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:44,920 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2020-07-18 00:47:44,921 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2020-07-18 00:47:44,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:44,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:44,922 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 104 states. [2020-07-18 00:47:44,922 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 104 states. [2020-07-18 00:47:44,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:44,928 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2020-07-18 00:47:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2020-07-18 00:47:44,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:44,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:44,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:44,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-18 00:47:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2020-07-18 00:47:44,933 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 39 [2020-07-18 00:47:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:44,934 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2020-07-18 00:47:44,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:47:44,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 80 transitions. [2020-07-18 00:47:45,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:45,041 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2020-07-18 00:47:45,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-18 00:47:45,043 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:45,044 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] [2020-07-18 00:47:45,044 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:47:45,044 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:45,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:45,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1779508689, now seen corresponding path program 1 times [2020-07-18 00:47:45,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:45,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1809152640] [2020-07-18 00:47:45,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:45,087 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:47:45,088 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:45,095 INFO L168 Benchmark]: Toolchain (without parser) took 3702.49 ms. Allocated memory was 141.6 MB in the beginning and 248.0 MB in the end (delta: 106.4 MB). Free memory was 102.5 MB in the beginning and 170.2 MB in the end (delta: -67.7 MB). Peak memory consumption was 38.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:45,097 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 141.6 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 00:47:45,098 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.66 ms. Allocated memory was 141.6 MB in the beginning and 202.4 MB in the end (delta: 60.8 MB). Free memory was 102.1 MB in the beginning and 181.4 MB in the end (delta: -79.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:45,099 INFO L168 Benchmark]: Boogie Preprocessor took 48.40 ms. Allocated memory is still 202.4 MB. Free memory was 181.4 MB in the beginning and 179.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:45,100 INFO L168 Benchmark]: RCFGBuilder took 593.03 ms. Allocated memory is still 202.4 MB. Free memory was 179.0 MB in the beginning and 144.1 MB in the end (delta: 34.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:45,102 INFO L168 Benchmark]: TraceAbstraction took 2689.60 ms. Allocated memory was 202.4 MB in the beginning and 248.0 MB in the end (delta: 45.6 MB). Free memory was 143.5 MB in the beginning and 170.2 MB in the end (delta: -26.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:45,114 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 141.6 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 364.66 ms. Allocated memory was 141.6 MB in the beginning and 202.4 MB in the end (delta: 60.8 MB). Free memory was 102.1 MB in the beginning and 181.4 MB in the end (delta: -79.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.40 ms. Allocated memory is still 202.4 MB. Free memory was 181.4 MB in the beginning and 179.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 593.03 ms. Allocated memory is still 202.4 MB. Free memory was 179.0 MB in the beginning and 144.1 MB in the end (delta: 34.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2689.60 ms. Allocated memory was 202.4 MB in the beginning and 248.0 MB in the end (delta: 45.6 MB). Free memory was 143.5 MB in the beginning and 170.2 MB in the end (delta: -26.7 MB). Peak memory consumption was 18.9 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...