/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/sina5f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:21:39,178 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:21:39,181 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:21:39,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:21:39,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:21:39,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:21:39,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:21:39,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:21:39,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:21:39,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:21:39,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:21:39,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:21:39,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:21:39,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:21:39,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:21:39,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:21:39,211 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:21:39,212 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:21:39,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:21:39,219 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:21:39,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:21:39,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:21:39,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:21:39,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:21:39,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:21:39,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:21:39,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:21:39,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:21:39,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:21:39,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:21:39,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:21:39,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:21:39,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:21:39,241 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:21:39,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:21:39,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:21:39,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:21:39,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:21:39,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:21:39,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:21:39,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:21:39,252 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:39,270 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:21:39,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:21:39,272 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:21:39,272 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:21:39,272 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:21:39,272 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:21:39,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:21:39,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:21:39,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:21:39,273 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:21:39,274 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:21:39,274 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:21:39,275 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:21:39,275 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:21:39,275 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:21:39,275 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:21:39,275 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:21:39,275 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:21:39,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:39,276 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:21:39,276 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:21:39,276 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:21:39,276 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:21:39,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:21:39,573 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:21:39,579 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:21:39,580 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:21:39,581 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:21:39,582 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/sina5f.c [2020-07-10 20:21:39,658 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cf32a184/01c3e4901e304941ad8e518d3c637eea/FLAG0030d3618 [2020-07-10 20:21:40,202 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:21:40,203 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina5f.c [2020-07-10 20:21:40,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cf32a184/01c3e4901e304941ad8e518d3c637eea/FLAG0030d3618 [2020-07-10 20:21:40,495 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cf32a184/01c3e4901e304941ad8e518d3c637eea [2020-07-10 20:21:40,504 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:21:40,505 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:21:40,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:40,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:21:40,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:21:40,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:40" (1/1) ... [2020-07-10 20:21:40,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36a9796e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:40, skipping insertion in model container [2020-07-10 20:21:40,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:40" (1/1) ... [2020-07-10 20:21:40,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:21:40,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:21:40,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:40,758 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:21:40,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:40,815 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:21:40,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:40 WrapperNode [2020-07-10 20:21:40,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:40,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:21:40,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:21:40,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:21:40,925 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:40" (1/1) ... [2020-07-10 20:21:40,925 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:40" (1/1) ... [2020-07-10 20:21:40,935 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:40" (1/1) ... [2020-07-10 20:21:40,940 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:40" (1/1) ... [2020-07-10 20:21:40,955 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:40" (1/1) ... [2020-07-10 20:21:40,971 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:40" (1/1) ... [2020-07-10 20:21:40,974 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:40" (1/1) ... [2020-07-10 20:21:40,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:21:40,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:21:40,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:21:40,980 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:21:40,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:40" (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:41,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:21:41,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:21:41,047 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:21:41,047 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:21:41,047 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:21:41,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:21:41,047 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:21:41,047 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:21:41,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:21:41,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:21:41,048 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 20:21:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:21:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:21:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 20:21:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:21:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:21:41,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:21:41,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:21:41,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:21:41,586 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:21:41,586 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-10 20:21:41,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:41 BoogieIcfgContainer [2020-07-10 20:21:41,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:21:41,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:21:41,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:21:41,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:21:41,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:21:40" (1/3) ... [2020-07-10 20:21:41,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c855271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:41, skipping insertion in model container [2020-07-10 20:21:41,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:40" (2/3) ... [2020-07-10 20:21:41,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c855271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:41, skipping insertion in model container [2020-07-10 20:21:41,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:41" (3/3) ... [2020-07-10 20:21:41,602 INFO L109 eAbstractionObserver]: Analyzing ICFG sina5f.c [2020-07-10 20:21:41,615 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:21:41,625 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:21:41,641 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:21:41,668 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:21:41,668 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:21:41,668 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:21:41,669 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:21:41,669 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:21:41,669 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:21:41,670 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:21:41,670 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:21:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2020-07-10 20:21:41,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-10 20:21:41,705 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:41,706 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] [2020-07-10 20:21:41,707 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:41,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:41,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1932017966, now seen corresponding path program 1 times [2020-07-10 20:21:41,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:41,726 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [783155232] [2020-07-10 20:21:41,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:42,016 INFO L280 TraceCheckUtils]: 0: Hoare triple {104#(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; {92#true} is VALID [2020-07-10 20:21:42,017 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#true} #valid := #valid[0 := 0]; {92#true} is VALID [2020-07-10 20:21:42,018 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#true} assume 0 < #StackHeapBarrier; {92#true} is VALID [2020-07-10 20:21:42,018 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#true} ~N~0 := 0; {92#true} is VALID [2020-07-10 20:21:42,019 INFO L280 TraceCheckUtils]: 4: Hoare triple {92#true} assume true; {92#true} is VALID [2020-07-10 20:21:42,020 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {92#true} {92#true} #169#return; {92#true} is VALID [2020-07-10 20:21:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:42,032 INFO L280 TraceCheckUtils]: 0: Hoare triple {92#true} ~cond := #in~cond; {92#true} is VALID [2020-07-10 20:21:42,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#true} assume !(0 == ~cond); {92#true} is VALID [2020-07-10 20:21:42,034 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#true} assume true; {92#true} is VALID [2020-07-10 20:21:42,034 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {92#true} {92#true} #165#return; {92#true} is VALID [2020-07-10 20:21:42,036 INFO L263 TraceCheckUtils]: 0: Hoare triple {92#true} call ULTIMATE.init(); {104#(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:42,037 INFO L280 TraceCheckUtils]: 1: Hoare triple {104#(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; {92#true} is VALID [2020-07-10 20:21:42,038 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#true} #valid := #valid[0 := 0]; {92#true} is VALID [2020-07-10 20:21:42,038 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#true} assume 0 < #StackHeapBarrier; {92#true} is VALID [2020-07-10 20:21:42,038 INFO L280 TraceCheckUtils]: 4: Hoare triple {92#true} ~N~0 := 0; {92#true} is VALID [2020-07-10 20:21:42,039 INFO L280 TraceCheckUtils]: 5: Hoare triple {92#true} assume true; {92#true} is VALID [2020-07-10 20:21:42,039 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {92#true} {92#true} #169#return; {92#true} is VALID [2020-07-10 20:21:42,040 INFO L263 TraceCheckUtils]: 7: Hoare triple {92#true} call #t~ret16 := main(); {92#true} is VALID [2020-07-10 20:21:42,040 INFO L280 TraceCheckUtils]: 8: Hoare triple {92#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {92#true} is VALID [2020-07-10 20:21:42,041 INFO L280 TraceCheckUtils]: 9: Hoare triple {92#true} ~N~0 := #t~nondet0; {92#true} is VALID [2020-07-10 20:21:42,041 INFO L280 TraceCheckUtils]: 10: Hoare triple {92#true} havoc #t~nondet0; {92#true} is VALID [2020-07-10 20:21:42,042 INFO L280 TraceCheckUtils]: 11: Hoare triple {92#true} assume !(~N~0 <= 0); {92#true} is VALID [2020-07-10 20:21:42,042 INFO L263 TraceCheckUtils]: 12: Hoare triple {92#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {92#true} is VALID [2020-07-10 20:21:42,043 INFO L280 TraceCheckUtils]: 13: Hoare triple {92#true} ~cond := #in~cond; {92#true} is VALID [2020-07-10 20:21:42,043 INFO L280 TraceCheckUtils]: 14: Hoare triple {92#true} assume !(0 == ~cond); {92#true} is VALID [2020-07-10 20:21:42,043 INFO L280 TraceCheckUtils]: 15: Hoare triple {92#true} assume true; {92#true} is VALID [2020-07-10 20:21:42,044 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {92#true} {92#true} #165#return; {92#true} is VALID [2020-07-10 20:21:42,044 INFO L280 TraceCheckUtils]: 17: Hoare triple {92#true} havoc ~i~0; {92#true} is VALID [2020-07-10 20:21:42,044 INFO L280 TraceCheckUtils]: 18: Hoare triple {92#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {92#true} is VALID [2020-07-10 20:21:42,045 INFO L280 TraceCheckUtils]: 19: Hoare triple {92#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {92#true} is VALID [2020-07-10 20:21:42,045 INFO L280 TraceCheckUtils]: 20: Hoare triple {92#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {92#true} is VALID [2020-07-10 20:21:42,046 INFO L280 TraceCheckUtils]: 21: Hoare triple {92#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L28 {92#true} is VALID [2020-07-10 20:21:42,046 INFO L280 TraceCheckUtils]: 22: Hoare triple {92#true} ~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset; {92#true} is VALID [2020-07-10 20:21:42,046 INFO L280 TraceCheckUtils]: 23: Hoare triple {92#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L30 {92#true} is VALID [2020-07-10 20:21:42,047 INFO L280 TraceCheckUtils]: 24: Hoare triple {92#true} ~i~0 := 0; {92#true} is VALID [2020-07-10 20:21:42,048 INFO L280 TraceCheckUtils]: 25: Hoare triple {92#true} assume !true; {93#false} is VALID [2020-07-10 20:21:42,048 INFO L280 TraceCheckUtils]: 26: Hoare triple {93#false} ~i~0 := 0; {93#false} is VALID [2020-07-10 20:21:42,049 INFO L280 TraceCheckUtils]: 27: Hoare triple {93#false} assume !(~i~0 < ~N~0); {93#false} is VALID [2020-07-10 20:21:42,049 INFO L280 TraceCheckUtils]: 28: Hoare triple {93#false} ~i~0 := 0; {93#false} is VALID [2020-07-10 20:21:42,049 INFO L280 TraceCheckUtils]: 29: Hoare triple {93#false} assume !(~i~0 < ~N~0); {93#false} is VALID [2020-07-10 20:21:42,050 INFO L280 TraceCheckUtils]: 30: Hoare triple {93#false} ~i~0 := 0; {93#false} is VALID [2020-07-10 20:21:42,050 INFO L280 TraceCheckUtils]: 31: Hoare triple {93#false} assume !true; {93#false} is VALID [2020-07-10 20:21:42,051 INFO L280 TraceCheckUtils]: 32: Hoare triple {93#false} ~i~0 := 0; {93#false} is VALID [2020-07-10 20:21:42,051 INFO L280 TraceCheckUtils]: 33: Hoare triple {93#false} assume !true; {93#false} is VALID [2020-07-10 20:21:42,051 INFO L280 TraceCheckUtils]: 34: Hoare triple {93#false} ~i~0 := 0; {93#false} is VALID [2020-07-10 20:21:42,052 INFO L280 TraceCheckUtils]: 35: Hoare triple {93#false} assume !!(~i~0 < ~N~0); {93#false} is VALID [2020-07-10 20:21:42,052 INFO L280 TraceCheckUtils]: 36: Hoare triple {93#false} SUMMARY for call #t~mem15 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); srcloc: L58 {93#false} is VALID [2020-07-10 20:21:42,052 INFO L263 TraceCheckUtils]: 37: Hoare triple {93#false} call __VERIFIER_assert((if #t~mem15 == 2 * ~N~0 then 1 else 0)); {93#false} is VALID [2020-07-10 20:21:42,053 INFO L280 TraceCheckUtils]: 38: Hoare triple {93#false} ~cond := #in~cond; {93#false} is VALID [2020-07-10 20:21:42,053 INFO L280 TraceCheckUtils]: 39: Hoare triple {93#false} assume 0 == ~cond; {93#false} is VALID [2020-07-10 20:21:42,053 INFO L280 TraceCheckUtils]: 40: Hoare triple {93#false} assume !false; {93#false} is VALID [2020-07-10 20:21:42,061 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:42,062 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:42,064 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [783155232] [2020-07-10 20:21:42,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:42,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:21:42,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607967415] [2020-07-10 20:21:42,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2020-07-10 20:21:42,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:42,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:21:42,182 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:42,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:21:42,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:42,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:21:42,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:21:42,192 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 3 states. [2020-07-10 20:21:42,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:42,749 INFO L93 Difference]: Finished difference Result 161 states and 188 transitions. [2020-07-10 20:21:42,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:21:42,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2020-07-10 20:21:42,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:42,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:42,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2020-07-10 20:21:42,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2020-07-10 20:21:42,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 188 transitions. [2020-07-10 20:21:43,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:43,022 INFO L225 Difference]: With dead ends: 161 [2020-07-10 20:21:43,023 INFO L226 Difference]: Without dead ends: 80 [2020-07-10 20:21:43,028 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:43,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-10 20:21:43,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-07-10 20:21:43,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:43,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 80 states. [2020-07-10 20:21:43,145 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2020-07-10 20:21:43,146 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2020-07-10 20:21:43,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:43,154 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2020-07-10 20:21:43,154 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2020-07-10 20:21:43,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:43,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:43,156 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2020-07-10 20:21:43,157 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2020-07-10 20:21:43,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:43,165 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2020-07-10 20:21:43,165 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2020-07-10 20:21:43,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:43,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:43,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:43,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-10 20:21:43,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2020-07-10 20:21:43,176 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 41 [2020-07-10 20:21:43,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:43,177 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2020-07-10 20:21:43,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:21:43,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 80 states and 85 transitions. [2020-07-10 20:21:43,303 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:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2020-07-10 20:21:43,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-10 20:21:43,306 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:43,306 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] [2020-07-10 20:21:43,307 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:21:43,307 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:43,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:43,308 INFO L82 PathProgramCache]: Analyzing trace with hash -690131343, now seen corresponding path program 1 times [2020-07-10 20:21:43,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:43,309 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [849304255] [2020-07-10 20:21:43,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:43,523 INFO L280 TraceCheckUtils]: 0: Hoare triple {763#(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; {749#true} is VALID [2020-07-10 20:21:43,523 INFO L280 TraceCheckUtils]: 1: Hoare triple {749#true} #valid := #valid[0 := 0]; {749#true} is VALID [2020-07-10 20:21:43,523 INFO L280 TraceCheckUtils]: 2: Hoare triple {749#true} assume 0 < #StackHeapBarrier; {749#true} is VALID [2020-07-10 20:21:43,524 INFO L280 TraceCheckUtils]: 3: Hoare triple {749#true} ~N~0 := 0; {749#true} is VALID [2020-07-10 20:21:43,524 INFO L280 TraceCheckUtils]: 4: Hoare triple {749#true} assume true; {749#true} is VALID [2020-07-10 20:21:43,524 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {749#true} {749#true} #169#return; {749#true} is VALID [2020-07-10 20:21:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:43,531 INFO L280 TraceCheckUtils]: 0: Hoare triple {749#true} ~cond := #in~cond; {749#true} is VALID [2020-07-10 20:21:43,531 INFO L280 TraceCheckUtils]: 1: Hoare triple {749#true} assume !(0 == ~cond); {749#true} is VALID [2020-07-10 20:21:43,532 INFO L280 TraceCheckUtils]: 2: Hoare triple {749#true} assume true; {749#true} is VALID [2020-07-10 20:21:43,533 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {749#true} {757#(<= 1 ~N~0)} #165#return; {757#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:43,534 INFO L263 TraceCheckUtils]: 0: Hoare triple {749#true} call ULTIMATE.init(); {763#(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:43,535 INFO L280 TraceCheckUtils]: 1: Hoare triple {763#(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; {749#true} is VALID [2020-07-10 20:21:43,535 INFO L280 TraceCheckUtils]: 2: Hoare triple {749#true} #valid := #valid[0 := 0]; {749#true} is VALID [2020-07-10 20:21:43,535 INFO L280 TraceCheckUtils]: 3: Hoare triple {749#true} assume 0 < #StackHeapBarrier; {749#true} is VALID [2020-07-10 20:21:43,536 INFO L280 TraceCheckUtils]: 4: Hoare triple {749#true} ~N~0 := 0; {749#true} is VALID [2020-07-10 20:21:43,536 INFO L280 TraceCheckUtils]: 5: Hoare triple {749#true} assume true; {749#true} is VALID [2020-07-10 20:21:43,536 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {749#true} {749#true} #169#return; {749#true} is VALID [2020-07-10 20:21:43,537 INFO L263 TraceCheckUtils]: 7: Hoare triple {749#true} call #t~ret16 := main(); {749#true} is VALID [2020-07-10 20:21:43,537 INFO L280 TraceCheckUtils]: 8: Hoare triple {749#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {749#true} is VALID [2020-07-10 20:21:43,538 INFO L280 TraceCheckUtils]: 9: Hoare triple {749#true} ~N~0 := #t~nondet0; {749#true} is VALID [2020-07-10 20:21:43,538 INFO L280 TraceCheckUtils]: 10: Hoare triple {749#true} havoc #t~nondet0; {749#true} is VALID [2020-07-10 20:21:43,539 INFO L280 TraceCheckUtils]: 11: Hoare triple {749#true} assume !(~N~0 <= 0); {757#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:43,540 INFO L263 TraceCheckUtils]: 12: Hoare triple {757#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {749#true} is VALID [2020-07-10 20:21:43,540 INFO L280 TraceCheckUtils]: 13: Hoare triple {749#true} ~cond := #in~cond; {749#true} is VALID [2020-07-10 20:21:43,541 INFO L280 TraceCheckUtils]: 14: Hoare triple {749#true} assume !(0 == ~cond); {749#true} is VALID [2020-07-10 20:21:43,541 INFO L280 TraceCheckUtils]: 15: Hoare triple {749#true} assume true; {749#true} is VALID [2020-07-10 20:21:43,542 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {749#true} {757#(<= 1 ~N~0)} #165#return; {757#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:43,543 INFO L280 TraceCheckUtils]: 17: Hoare triple {757#(<= 1 ~N~0)} havoc ~i~0; {757#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:43,543 INFO L280 TraceCheckUtils]: 18: Hoare triple {757#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {757#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:43,544 INFO L280 TraceCheckUtils]: 19: Hoare triple {757#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {757#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:43,545 INFO L280 TraceCheckUtils]: 20: Hoare triple {757#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {757#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:43,545 INFO L280 TraceCheckUtils]: 21: Hoare triple {757#(<= 1 ~N~0)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L28 {757#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:43,546 INFO L280 TraceCheckUtils]: 22: Hoare triple {757#(<= 1 ~N~0)} ~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset; {757#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:43,547 INFO L280 TraceCheckUtils]: 23: Hoare triple {757#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L30 {757#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:43,548 INFO L280 TraceCheckUtils]: 24: Hoare triple {757#(<= 1 ~N~0)} ~i~0 := 0; {762#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 20:21:43,549 INFO L280 TraceCheckUtils]: 25: Hoare triple {762#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {750#false} is VALID [2020-07-10 20:21:43,550 INFO L280 TraceCheckUtils]: 26: Hoare triple {750#false} ~i~0 := 0; {750#false} is VALID [2020-07-10 20:21:43,550 INFO L280 TraceCheckUtils]: 27: Hoare triple {750#false} assume !(~i~0 < ~N~0); {750#false} is VALID [2020-07-10 20:21:43,550 INFO L280 TraceCheckUtils]: 28: Hoare triple {750#false} ~i~0 := 0; {750#false} is VALID [2020-07-10 20:21:43,551 INFO L280 TraceCheckUtils]: 29: Hoare triple {750#false} assume !(~i~0 < ~N~0); {750#false} is VALID [2020-07-10 20:21:43,551 INFO L280 TraceCheckUtils]: 30: Hoare triple {750#false} ~i~0 := 0; {750#false} is VALID [2020-07-10 20:21:43,551 INFO L280 TraceCheckUtils]: 31: Hoare triple {750#false} assume !(~i~0 < ~N~0); {750#false} is VALID [2020-07-10 20:21:43,552 INFO L280 TraceCheckUtils]: 32: Hoare triple {750#false} ~i~0 := 0; {750#false} is VALID [2020-07-10 20:21:43,552 INFO L280 TraceCheckUtils]: 33: Hoare triple {750#false} assume !(~i~0 < ~N~0); {750#false} is VALID [2020-07-10 20:21:43,552 INFO L280 TraceCheckUtils]: 34: Hoare triple {750#false} ~i~0 := 0; {750#false} is VALID [2020-07-10 20:21:43,553 INFO L280 TraceCheckUtils]: 35: Hoare triple {750#false} assume !!(~i~0 < ~N~0); {750#false} is VALID [2020-07-10 20:21:43,553 INFO L280 TraceCheckUtils]: 36: Hoare triple {750#false} SUMMARY for call #t~mem15 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); srcloc: L58 {750#false} is VALID [2020-07-10 20:21:43,553 INFO L263 TraceCheckUtils]: 37: Hoare triple {750#false} call __VERIFIER_assert((if #t~mem15 == 2 * ~N~0 then 1 else 0)); {750#false} is VALID [2020-07-10 20:21:43,554 INFO L280 TraceCheckUtils]: 38: Hoare triple {750#false} ~cond := #in~cond; {750#false} is VALID [2020-07-10 20:21:43,554 INFO L280 TraceCheckUtils]: 39: Hoare triple {750#false} assume 0 == ~cond; {750#false} is VALID [2020-07-10 20:21:43,554 INFO L280 TraceCheckUtils]: 40: Hoare triple {750#false} assume !false; {750#false} is VALID [2020-07-10 20:21:43,557 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:43,558 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:43,558 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [849304255] [2020-07-10 20:21:43,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:43,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:21:43,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605407914] [2020-07-10 20:21:43,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-07-10 20:21:43,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:43,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:21:43,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:43,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:21:43,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:43,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:21:43,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:21:43,605 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 5 states. [2020-07-10 20:21:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:44,367 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2020-07-10 20:21:44,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:21:44,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-07-10 20:21:44,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:44,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2020-07-10 20:21:44,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:44,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2020-07-10 20:21:44,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 183 transitions. [2020-07-10 20:21:44,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:44,610 INFO L225 Difference]: With dead ends: 168 [2020-07-10 20:21:44,610 INFO L226 Difference]: Without dead ends: 118 [2020-07-10 20:21:44,612 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:44,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-07-10 20:21:44,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 85. [2020-07-10 20:21:44,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:44,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 85 states. [2020-07-10 20:21:44,764 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 85 states. [2020-07-10 20:21:44,765 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 85 states. [2020-07-10 20:21:44,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:44,773 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2020-07-10 20:21:44,773 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2020-07-10 20:21:44,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:44,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:44,775 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 118 states. [2020-07-10 20:21:44,775 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 118 states. [2020-07-10 20:21:44,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:44,795 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2020-07-10 20:21:44,796 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2020-07-10 20:21:44,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:44,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:44,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:44,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-10 20:21:44,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2020-07-10 20:21:44,807 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 41 [2020-07-10 20:21:44,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:44,807 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2020-07-10 20:21:44,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:21:44,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states and 90 transitions. [2020-07-10 20:21:44,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:44,953 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2020-07-10 20:21:44,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-10 20:21:44,956 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:44,956 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] [2020-07-10 20:21:44,956 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:21:44,957 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:44,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:44,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1472096967, now seen corresponding path program 1 times [2020-07-10 20:21:44,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:44,958 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1364788196] [2020-07-10 20:21:44,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:44,992 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:21:44,993 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:44,999 INFO L168 Benchmark]: Toolchain (without parser) took 4493.18 ms. Allocated memory was 145.2 MB in the beginning and 246.9 MB in the end (delta: 101.7 MB). Free memory was 103.4 MB in the beginning and 133.2 MB in the end (delta: -29.8 MB). Peak memory consumption was 71.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:45,000 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 145.2 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 20:21:45,001 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.42 ms. Allocated memory is still 145.2 MB. Free memory was 103.2 MB in the beginning and 91.5 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:45,002 INFO L168 Benchmark]: Boogie Preprocessor took 162.60 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 91.5 MB in the beginning and 179.7 MB in the end (delta: -88.1 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:45,003 INFO L168 Benchmark]: RCFGBuilder took 612.79 ms. Allocated memory is still 202.9 MB. Free memory was 179.7 MB in the beginning and 142.1 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:45,004 INFO L168 Benchmark]: TraceAbstraction took 3402.89 ms. Allocated memory was 202.9 MB in the beginning and 246.9 MB in the end (delta: 44.0 MB). Free memory was 141.4 MB in the beginning and 133.2 MB in the end (delta: 8.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:45,008 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.28 ms. Allocated memory is still 145.2 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 309.42 ms. Allocated memory is still 145.2 MB. Free memory was 103.2 MB in the beginning and 91.5 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 162.60 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 91.5 MB in the beginning and 179.7 MB in the end (delta: -88.1 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 612.79 ms. Allocated memory is still 202.9 MB. Free memory was 179.7 MB in the beginning and 142.1 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3402.89 ms. Allocated memory was 202.9 MB in the beginning and 246.9 MB in the end (delta: 44.0 MB). Free memory was 141.4 MB in the beginning and 133.2 MB in the end (delta: 8.2 MB). Peak memory consumption was 52.2 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...