/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/ss4f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:21:44,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:21:44,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:21:44,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:21:44,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:21:44,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:21:44,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:21:44,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:21:44,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:21:44,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:21:44,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:21:44,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:21:44,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:21:44,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:21:44,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:21:44,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:21:44,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:21:44,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:21:44,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:21:44,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:21:44,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:21:44,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:21:44,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:21:44,287 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:21:44,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:21:44,290 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:21:44,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:21:44,292 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:21:44,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:21:44,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:21:44,294 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:21:44,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:21:44,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:21:44,296 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:21:44,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:21:44,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:21:44,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:21:44,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:21:44,299 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:21:44,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:21:44,300 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:21:44,301 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:44,311 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:21:44,311 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:21:44,313 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:21:44,313 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:21:44,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:21:44,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:21:44,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:21:44,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:21:44,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:21:44,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:21:44,314 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:21:44,315 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:21:44,315 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:21:44,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:21:44,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:21:44,315 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:21:44,316 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:21:44,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:21:44,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:44,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:21:44,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:21:44,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:21:44,317 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:21:44,593 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:21:44,616 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:21:44,620 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:21:44,622 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:21:44,622 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:21:44,623 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ss4f.c [2020-07-10 20:21:44,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7710b67ef/050ca82a345a4a18b2a39d4b1d412e01/FLAG0ef16683f [2020-07-10 20:21:45,204 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:21:45,205 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ss4f.c [2020-07-10 20:21:45,211 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7710b67ef/050ca82a345a4a18b2a39d4b1d412e01/FLAG0ef16683f [2020-07-10 20:21:45,560 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7710b67ef/050ca82a345a4a18b2a39d4b1d412e01 [2020-07-10 20:21:45,570 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:21:45,572 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:21:45,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:45,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:21:45,578 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:21:45,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:45" (1/1) ... [2020-07-10 20:21:45,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d9db4b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:45, skipping insertion in model container [2020-07-10 20:21:45,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:45" (1/1) ... [2020-07-10 20:21:45,591 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:21:45,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:21:45,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:45,884 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:21:45,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:46,119 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:21:46,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:46 WrapperNode [2020-07-10 20:21:46,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:46,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:21:46,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:21:46,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:21:46,136 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:46" (1/1) ... [2020-07-10 20:21:46,136 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:46" (1/1) ... [2020-07-10 20:21:46,158 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:46" (1/1) ... [2020-07-10 20:21:46,159 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:46" (1/1) ... [2020-07-10 20:21:46,173 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:46" (1/1) ... [2020-07-10 20:21:46,180 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:46" (1/1) ... [2020-07-10 20:21:46,182 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:46" (1/1) ... [2020-07-10 20:21:46,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:21:46,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:21:46,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:21:46,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:21:46,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:46" (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:46,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:21:46,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:21:46,268 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:21:46,268 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:21:46,268 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:21:46,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:21:46,269 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:21:46,269 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:21:46,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:21:46,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:21:46,270 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 20:21:46,270 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:21:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:21:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 20:21:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:21:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:21:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:21:46,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:21:46,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:21:46,881 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:21:46,881 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 20:21:46,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:46 BoogieIcfgContainer [2020-07-10 20:21:46,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:21:46,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:21:46,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:21:46,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:21:46,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:21:45" (1/3) ... [2020-07-10 20:21:46,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5158f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:46, skipping insertion in model container [2020-07-10 20:21:46,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:46" (2/3) ... [2020-07-10 20:21:46,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5158f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:46, skipping insertion in model container [2020-07-10 20:21:46,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:46" (3/3) ... [2020-07-10 20:21:46,896 INFO L109 eAbstractionObserver]: Analyzing ICFG ss4f.c [2020-07-10 20:21:46,907 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:21:46,916 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:21:46,931 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:21:46,956 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:21:46,956 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:21:46,956 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:21:46,956 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:21:46,957 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:21:46,957 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:21:46,957 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:21:46,957 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:21:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states. [2020-07-10 20:21:46,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-10 20:21:46,993 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:46,994 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] [2020-07-10 20:21:46,995 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:47,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:47,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1254588623, now seen corresponding path program 1 times [2020-07-10 20:21:47,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:47,009 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1861863094] [2020-07-10 20:21:47,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:47,277 INFO L280 TraceCheckUtils]: 0: Hoare triple {92#(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; {80#true} is VALID [2020-07-10 20:21:47,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {80#true} #valid := #valid[0 := 0]; {80#true} is VALID [2020-07-10 20:21:47,278 INFO L280 TraceCheckUtils]: 2: Hoare triple {80#true} assume 0 < #StackHeapBarrier; {80#true} is VALID [2020-07-10 20:21:47,279 INFO L280 TraceCheckUtils]: 3: Hoare triple {80#true} ~N~0 := 0; {80#true} is VALID [2020-07-10 20:21:47,279 INFO L280 TraceCheckUtils]: 4: Hoare triple {80#true} assume true; {80#true} is VALID [2020-07-10 20:21:47,280 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {80#true} {80#true} #135#return; {80#true} is VALID [2020-07-10 20:21:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:47,295 INFO L280 TraceCheckUtils]: 0: Hoare triple {80#true} ~cond := #in~cond; {80#true} is VALID [2020-07-10 20:21:47,295 INFO L280 TraceCheckUtils]: 1: Hoare triple {80#true} assume !(0 == ~cond); {80#true} is VALID [2020-07-10 20:21:47,296 INFO L280 TraceCheckUtils]: 2: Hoare triple {80#true} assume true; {80#true} is VALID [2020-07-10 20:21:47,296 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {80#true} {80#true} #131#return; {80#true} is VALID [2020-07-10 20:21:47,299 INFO L263 TraceCheckUtils]: 0: Hoare triple {80#true} call ULTIMATE.init(); {92#(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:47,299 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#(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; {80#true} is VALID [2020-07-10 20:21:47,300 INFO L280 TraceCheckUtils]: 2: Hoare triple {80#true} #valid := #valid[0 := 0]; {80#true} is VALID [2020-07-10 20:21:47,300 INFO L280 TraceCheckUtils]: 3: Hoare triple {80#true} assume 0 < #StackHeapBarrier; {80#true} is VALID [2020-07-10 20:21:47,300 INFO L280 TraceCheckUtils]: 4: Hoare triple {80#true} ~N~0 := 0; {80#true} is VALID [2020-07-10 20:21:47,301 INFO L280 TraceCheckUtils]: 5: Hoare triple {80#true} assume true; {80#true} is VALID [2020-07-10 20:21:47,301 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {80#true} {80#true} #135#return; {80#true} is VALID [2020-07-10 20:21:47,302 INFO L263 TraceCheckUtils]: 7: Hoare triple {80#true} call #t~ret13 := main(); {80#true} is VALID [2020-07-10 20:21:47,302 INFO L280 TraceCheckUtils]: 8: Hoare triple {80#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {80#true} is VALID [2020-07-10 20:21:47,303 INFO L280 TraceCheckUtils]: 9: Hoare triple {80#true} ~N~0 := #t~nondet0; {80#true} is VALID [2020-07-10 20:21:47,303 INFO L280 TraceCheckUtils]: 10: Hoare triple {80#true} havoc #t~nondet0; {80#true} is VALID [2020-07-10 20:21:47,304 INFO L280 TraceCheckUtils]: 11: Hoare triple {80#true} assume !(~N~0 <= 0); {80#true} is VALID [2020-07-10 20:21:47,304 INFO L263 TraceCheckUtils]: 12: Hoare triple {80#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {80#true} is VALID [2020-07-10 20:21:47,304 INFO L280 TraceCheckUtils]: 13: Hoare triple {80#true} ~cond := #in~cond; {80#true} is VALID [2020-07-10 20:21:47,305 INFO L280 TraceCheckUtils]: 14: Hoare triple {80#true} assume !(0 == ~cond); {80#true} is VALID [2020-07-10 20:21:47,305 INFO L280 TraceCheckUtils]: 15: Hoare triple {80#true} assume true; {80#true} is VALID [2020-07-10 20:21:47,306 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {80#true} {80#true} #131#return; {80#true} is VALID [2020-07-10 20:21:47,306 INFO L280 TraceCheckUtils]: 17: Hoare triple {80#true} havoc ~i~0; {80#true} is VALID [2020-07-10 20:21:47,307 INFO L280 TraceCheckUtils]: 18: Hoare triple {80#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {80#true} is VALID [2020-07-10 20:21:47,307 INFO L280 TraceCheckUtils]: 19: Hoare triple {80#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {80#true} is VALID [2020-07-10 20:21:47,308 INFO L280 TraceCheckUtils]: 20: Hoare triple {80#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {80#true} is VALID [2020-07-10 20:21:47,308 INFO L280 TraceCheckUtils]: 21: Hoare triple {80#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {80#true} is VALID [2020-07-10 20:21:47,308 INFO L280 TraceCheckUtils]: 22: Hoare triple {80#true} ~i~0 := 0; {80#true} is VALID [2020-07-10 20:21:47,310 INFO L280 TraceCheckUtils]: 23: Hoare triple {80#true} assume !true; {81#false} is VALID [2020-07-10 20:21:47,310 INFO L280 TraceCheckUtils]: 24: Hoare triple {81#false} ~i~0 := 0; {81#false} is VALID [2020-07-10 20:21:47,311 INFO L280 TraceCheckUtils]: 25: Hoare triple {81#false} assume !true; {81#false} is VALID [2020-07-10 20:21:47,311 INFO L280 TraceCheckUtils]: 26: Hoare triple {81#false} ~i~0 := 0; {81#false} is VALID [2020-07-10 20:21:47,311 INFO L280 TraceCheckUtils]: 27: Hoare triple {81#false} assume !true; {81#false} is VALID [2020-07-10 20:21:47,312 INFO L280 TraceCheckUtils]: 28: Hoare triple {81#false} SUMMARY for call write~int(~N~0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L40-6 {81#false} is VALID [2020-07-10 20:21:47,312 INFO L280 TraceCheckUtils]: 29: Hoare triple {81#false} ~i~0 := 0; {81#false} is VALID [2020-07-10 20:21:47,313 INFO L280 TraceCheckUtils]: 30: Hoare triple {81#false} assume !true; {81#false} is VALID [2020-07-10 20:21:47,313 INFO L280 TraceCheckUtils]: 31: Hoare triple {81#false} SUMMARY for call #t~mem12 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L46-6 {81#false} is VALID [2020-07-10 20:21:47,314 INFO L263 TraceCheckUtils]: 32: Hoare triple {81#false} call __VERIFIER_assert((if #t~mem12 == ~N~0 * (1 + ~N~0) then 1 else 0)); {81#false} is VALID [2020-07-10 20:21:47,314 INFO L280 TraceCheckUtils]: 33: Hoare triple {81#false} ~cond := #in~cond; {81#false} is VALID [2020-07-10 20:21:47,314 INFO L280 TraceCheckUtils]: 34: Hoare triple {81#false} assume 0 == ~cond; {81#false} is VALID [2020-07-10 20:21:47,315 INFO L280 TraceCheckUtils]: 35: Hoare triple {81#false} assume !false; {81#false} is VALID [2020-07-10 20:21:47,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:21:47,321 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:47,323 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1861863094] [2020-07-10 20:21:47,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:47,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:21:47,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644807134] [2020-07-10 20:21:47,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-07-10 20:21:47,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:47,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:21:47,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:47,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:21:47,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:47,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:21:47,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:21:47,434 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 3 states. [2020-07-10 20:21:47,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:47,966 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2020-07-10 20:21:47,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:21:47,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-07-10 20:21:47,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:47,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-10 20:21:48,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-10 20:21:48,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 156 transitions. [2020-07-10 20:21:48,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:48,254 INFO L225 Difference]: With dead ends: 137 [2020-07-10 20:21:48,254 INFO L226 Difference]: Without dead ends: 65 [2020-07-10 20:21:48,262 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:48,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-10 20:21:48,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-07-10 20:21:48,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:48,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 65 states. [2020-07-10 20:21:48,375 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2020-07-10 20:21:48,375 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2020-07-10 20:21:48,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:48,381 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2020-07-10 20:21:48,381 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2020-07-10 20:21:48,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:48,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:48,382 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2020-07-10 20:21:48,383 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2020-07-10 20:21:48,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:48,389 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2020-07-10 20:21:48,389 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2020-07-10 20:21:48,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:48,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:48,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:48,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:48,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-10 20:21:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2020-07-10 20:21:48,397 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 36 [2020-07-10 20:21:48,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:48,397 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2020-07-10 20:21:48,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:21:48,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states and 68 transitions. [2020-07-10 20:21:48,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:48,474 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2020-07-10 20:21:48,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-10 20:21:48,476 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:48,476 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] [2020-07-10 20:21:48,477 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:21:48,477 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:48,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:48,478 INFO L82 PathProgramCache]: Analyzing trace with hash 626494907, now seen corresponding path program 1 times [2020-07-10 20:21:48,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:48,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [345104212] [2020-07-10 20:21:48,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:48,599 INFO L280 TraceCheckUtils]: 0: Hoare triple {643#(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; {629#true} is VALID [2020-07-10 20:21:48,599 INFO L280 TraceCheckUtils]: 1: Hoare triple {629#true} #valid := #valid[0 := 0]; {629#true} is VALID [2020-07-10 20:21:48,600 INFO L280 TraceCheckUtils]: 2: Hoare triple {629#true} assume 0 < #StackHeapBarrier; {629#true} is VALID [2020-07-10 20:21:48,600 INFO L280 TraceCheckUtils]: 3: Hoare triple {629#true} ~N~0 := 0; {629#true} is VALID [2020-07-10 20:21:48,600 INFO L280 TraceCheckUtils]: 4: Hoare triple {629#true} assume true; {629#true} is VALID [2020-07-10 20:21:48,601 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {629#true} {629#true} #135#return; {629#true} is VALID [2020-07-10 20:21:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:48,610 INFO L280 TraceCheckUtils]: 0: Hoare triple {629#true} ~cond := #in~cond; {629#true} is VALID [2020-07-10 20:21:48,610 INFO L280 TraceCheckUtils]: 1: Hoare triple {629#true} assume !(0 == ~cond); {629#true} is VALID [2020-07-10 20:21:48,611 INFO L280 TraceCheckUtils]: 2: Hoare triple {629#true} assume true; {629#true} is VALID [2020-07-10 20:21:48,612 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {629#true} {637#(<= 1 ~N~0)} #131#return; {637#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:48,613 INFO L263 TraceCheckUtils]: 0: Hoare triple {629#true} call ULTIMATE.init(); {643#(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:48,614 INFO L280 TraceCheckUtils]: 1: Hoare triple {643#(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; {629#true} is VALID [2020-07-10 20:21:48,614 INFO L280 TraceCheckUtils]: 2: Hoare triple {629#true} #valid := #valid[0 := 0]; {629#true} is VALID [2020-07-10 20:21:48,615 INFO L280 TraceCheckUtils]: 3: Hoare triple {629#true} assume 0 < #StackHeapBarrier; {629#true} is VALID [2020-07-10 20:21:48,615 INFO L280 TraceCheckUtils]: 4: Hoare triple {629#true} ~N~0 := 0; {629#true} is VALID [2020-07-10 20:21:48,615 INFO L280 TraceCheckUtils]: 5: Hoare triple {629#true} assume true; {629#true} is VALID [2020-07-10 20:21:48,616 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {629#true} {629#true} #135#return; {629#true} is VALID [2020-07-10 20:21:48,616 INFO L263 TraceCheckUtils]: 7: Hoare triple {629#true} call #t~ret13 := main(); {629#true} is VALID [2020-07-10 20:21:48,617 INFO L280 TraceCheckUtils]: 8: Hoare triple {629#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {629#true} is VALID [2020-07-10 20:21:48,617 INFO L280 TraceCheckUtils]: 9: Hoare triple {629#true} ~N~0 := #t~nondet0; {629#true} is VALID [2020-07-10 20:21:48,617 INFO L280 TraceCheckUtils]: 10: Hoare triple {629#true} havoc #t~nondet0; {629#true} is VALID [2020-07-10 20:21:48,618 INFO L280 TraceCheckUtils]: 11: Hoare triple {629#true} assume !(~N~0 <= 0); {637#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:48,619 INFO L263 TraceCheckUtils]: 12: Hoare triple {637#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {629#true} is VALID [2020-07-10 20:21:48,619 INFO L280 TraceCheckUtils]: 13: Hoare triple {629#true} ~cond := #in~cond; {629#true} is VALID [2020-07-10 20:21:48,619 INFO L280 TraceCheckUtils]: 14: Hoare triple {629#true} assume !(0 == ~cond); {629#true} is VALID [2020-07-10 20:21:48,620 INFO L280 TraceCheckUtils]: 15: Hoare triple {629#true} assume true; {629#true} is VALID [2020-07-10 20:21:48,621 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {629#true} {637#(<= 1 ~N~0)} #131#return; {637#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:48,622 INFO L280 TraceCheckUtils]: 17: Hoare triple {637#(<= 1 ~N~0)} havoc ~i~0; {637#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:48,623 INFO L280 TraceCheckUtils]: 18: Hoare triple {637#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {637#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:48,624 INFO L280 TraceCheckUtils]: 19: Hoare triple {637#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {637#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:48,625 INFO L280 TraceCheckUtils]: 20: Hoare triple {637#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {637#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:48,626 INFO L280 TraceCheckUtils]: 21: Hoare triple {637#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {637#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:48,627 INFO L280 TraceCheckUtils]: 22: Hoare triple {637#(<= 1 ~N~0)} ~i~0 := 0; {642#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 20:21:48,628 INFO L280 TraceCheckUtils]: 23: Hoare triple {642#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {630#false} is VALID [2020-07-10 20:21:48,628 INFO L280 TraceCheckUtils]: 24: Hoare triple {630#false} ~i~0 := 0; {630#false} is VALID [2020-07-10 20:21:48,628 INFO L280 TraceCheckUtils]: 25: Hoare triple {630#false} assume !(~i~0 < ~N~0); {630#false} is VALID [2020-07-10 20:21:48,629 INFO L280 TraceCheckUtils]: 26: Hoare triple {630#false} ~i~0 := 0; {630#false} is VALID [2020-07-10 20:21:48,629 INFO L280 TraceCheckUtils]: 27: Hoare triple {630#false} assume !(~i~0 < ~N~0); {630#false} is VALID [2020-07-10 20:21:48,629 INFO L280 TraceCheckUtils]: 28: Hoare triple {630#false} SUMMARY for call write~int(~N~0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L40-6 {630#false} is VALID [2020-07-10 20:21:48,630 INFO L280 TraceCheckUtils]: 29: Hoare triple {630#false} ~i~0 := 0; {630#false} is VALID [2020-07-10 20:21:48,630 INFO L280 TraceCheckUtils]: 30: Hoare triple {630#false} assume !(~i~0 < ~N~0); {630#false} is VALID [2020-07-10 20:21:48,631 INFO L280 TraceCheckUtils]: 31: Hoare triple {630#false} SUMMARY for call #t~mem12 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L46-6 {630#false} is VALID [2020-07-10 20:21:48,631 INFO L263 TraceCheckUtils]: 32: Hoare triple {630#false} call __VERIFIER_assert((if #t~mem12 == ~N~0 * (1 + ~N~0) then 1 else 0)); {630#false} is VALID [2020-07-10 20:21:48,631 INFO L280 TraceCheckUtils]: 33: Hoare triple {630#false} ~cond := #in~cond; {630#false} is VALID [2020-07-10 20:21:48,632 INFO L280 TraceCheckUtils]: 34: Hoare triple {630#false} assume 0 == ~cond; {630#false} is VALID [2020-07-10 20:21:48,632 INFO L280 TraceCheckUtils]: 35: Hoare triple {630#false} assume !false; {630#false} is VALID [2020-07-10 20:21:48,635 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:48,635 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:48,636 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [345104212] [2020-07-10 20:21:48,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:48,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:21:48,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665428544] [2020-07-10 20:21:48,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2020-07-10 20:21:48,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:48,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:21:48,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:48,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:21:48,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:48,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:21:48,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:21:48,690 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 5 states. [2020-07-10 20:21:49,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:49,360 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2020-07-10 20:21:49,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:21:49,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2020-07-10 20:21:49,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:49,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2020-07-10 20:21:49,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:49,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2020-07-10 20:21:49,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 139 transitions. [2020-07-10 20:21:49,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:49,541 INFO L225 Difference]: With dead ends: 130 [2020-07-10 20:21:49,541 INFO L226 Difference]: Without dead ends: 93 [2020-07-10 20:21:49,543 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:49,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-10 20:21:49,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 69. [2020-07-10 20:21:49,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:49,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 69 states. [2020-07-10 20:21:49,672 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 69 states. [2020-07-10 20:21:49,673 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 69 states. [2020-07-10 20:21:49,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:49,677 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2020-07-10 20:21:49,678 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2020-07-10 20:21:49,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:49,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:49,679 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 93 states. [2020-07-10 20:21:49,679 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 93 states. [2020-07-10 20:21:49,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:49,685 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2020-07-10 20:21:49,685 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2020-07-10 20:21:49,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:49,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:49,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:49,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:49,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-10 20:21:49,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2020-07-10 20:21:49,690 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 36 [2020-07-10 20:21:49,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:49,690 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2020-07-10 20:21:49,691 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:21:49,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 69 states and 72 transitions. [2020-07-10 20:21:49,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:49,796 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2020-07-10 20:21:49,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-10 20:21:49,799 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:49,800 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] [2020-07-10 20:21:49,800 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:21:49,800 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:49,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:49,800 INFO L82 PathProgramCache]: Analyzing trace with hash 290043744, now seen corresponding path program 1 times [2020-07-10 20:21:49,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:49,801 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1722383079] [2020-07-10 20:21:49,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:49,855 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:21:49,855 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:49,860 INFO L168 Benchmark]: Toolchain (without parser) took 4287.88 ms. Allocated memory was 144.2 MB in the beginning and 245.4 MB in the end (delta: 101.2 MB). Free memory was 101.6 MB in the beginning and 202.4 MB in the end (delta: -100.8 MB). Peak memory consumption was 424.4 kB. Max. memory is 7.1 GB. [2020-07-10 20:21:49,861 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 144.2 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 20:21:49,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 546.54 ms. Allocated memory was 144.2 MB in the beginning and 205.0 MB in the end (delta: 60.8 MB). Free memory was 101.4 MB in the beginning and 184.1 MB in the end (delta: -82.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:49,863 INFO L168 Benchmark]: Boogie Preprocessor took 64.44 ms. Allocated memory is still 205.0 MB. Free memory was 184.1 MB in the beginning and 181.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:49,864 INFO L168 Benchmark]: RCFGBuilder took 701.22 ms. Allocated memory is still 205.0 MB. Free memory was 181.7 MB in the beginning and 148.7 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:49,865 INFO L168 Benchmark]: TraceAbstraction took 2969.67 ms. Allocated memory was 205.0 MB in the beginning and 245.4 MB in the end (delta: 40.4 MB). Free memory was 148.0 MB in the beginning and 202.4 MB in the end (delta: -54.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 20:21:49,869 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.35 ms. Allocated memory is still 144.2 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 546.54 ms. Allocated memory was 144.2 MB in the beginning and 205.0 MB in the end (delta: 60.8 MB). Free memory was 101.4 MB in the beginning and 184.1 MB in the end (delta: -82.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.44 ms. Allocated memory is still 205.0 MB. Free memory was 184.1 MB in the beginning and 181.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 701.22 ms. Allocated memory is still 205.0 MB. Free memory was 181.7 MB in the beginning and 148.7 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2969.67 ms. Allocated memory was 205.0 MB in the beginning and 245.4 MB in the end (delta: 40.4 MB). Free memory was 148.0 MB in the beginning and 202.4 MB in the end (delta: -54.4 MB). There was no memory consumed. 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...