/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/ss2f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 17:36:52,364 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 17:36:52,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 17:36:52,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 17:36:52,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 17:36:52,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 17:36:52,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 17:36:52,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 17:36:52,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 17:36:52,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 17:36:52,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 17:36:52,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 17:36:52,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 17:36:52,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 17:36:52,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 17:36:52,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 17:36:52,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 17:36:52,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 17:36:52,401 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 17:36:52,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 17:36:52,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 17:36:52,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 17:36:52,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 17:36:52,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 17:36:52,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 17:36:52,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 17:36:52,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 17:36:52,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 17:36:52,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 17:36:52,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 17:36:52,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 17:36:52,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 17:36:52,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 17:36:52,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 17:36:52,423 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 17:36:52,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 17:36:52,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 17:36:52,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 17:36:52,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 17:36:52,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 17:36:52,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 17:36:52,427 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 17:36:52,439 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 17:36:52,439 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 17:36:52,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 17:36:52,441 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 17:36:52,441 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 17:36:52,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 17:36:52,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 17:36:52,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 17:36:52,441 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 17:36:52,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 17:36:52,442 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 17:36:52,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 17:36:52,442 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 17:36:52,442 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 17:36:52,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 17:36:52,443 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 17:36:52,443 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 17:36:52,443 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 17:36:52,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 17:36:52,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 17:36:52,444 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 17:36:52,444 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 17:36:52,444 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 17:36:52,783 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 17:36:52,798 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 17:36:52,802 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 17:36:52,804 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 17:36:52,805 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 17:36:52,806 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ss2f.c [2020-07-08 17:36:52,915 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03d8f8dc3/77da59189727446b8e268ddae7bdf216/FLAG6e5e17da9 [2020-07-08 17:36:53,522 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 17:36:53,525 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ss2f.c [2020-07-08 17:36:53,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03d8f8dc3/77da59189727446b8e268ddae7bdf216/FLAG6e5e17da9 [2020-07-08 17:36:53,817 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03d8f8dc3/77da59189727446b8e268ddae7bdf216 [2020-07-08 17:36:53,830 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 17:36:53,833 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 17:36:53,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 17:36:53,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 17:36:53,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 17:36:53,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:36:53" (1/1) ... [2020-07-08 17:36:53,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3be51f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:53, skipping insertion in model container [2020-07-08 17:36:53,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:36:53" (1/1) ... [2020-07-08 17:36:53,859 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 17:36:53,884 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 17:36:54,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:36:54,132 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 17:36:54,167 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:36:54,188 INFO L208 MainTranslator]: Completed translation [2020-07-08 17:36:54,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:54 WrapperNode [2020-07-08 17:36:54,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 17:36:54,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 17:36:54,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 17:36:54,191 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 17:36:54,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:54" (1/1) ... [2020-07-08 17:36:54,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:54" (1/1) ... [2020-07-08 17:36:54,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:54" (1/1) ... [2020-07-08 17:36:54,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:54" (1/1) ... [2020-07-08 17:36:54,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:54" (1/1) ... [2020-07-08 17:36:54,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:54" (1/1) ... [2020-07-08 17:36:54,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:54" (1/1) ... [2020-07-08 17:36:54,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 17:36:54,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 17:36:54,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 17:36:54,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 17:36:54,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:54" (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-08 17:36:54,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 17:36:54,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 17:36:54,440 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 17:36:54,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 17:36:54,440 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 17:36:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 17:36:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 17:36:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 17:36:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 17:36:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 17:36:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 17:36:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 17:36:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 17:36:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 17:36:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 17:36:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 17:36:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 17:36:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 17:36:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 17:36:55,103 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 17:36:55,104 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-08 17:36:55,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:36:55 BoogieIcfgContainer [2020-07-08 17:36:55,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 17:36:55,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 17:36:55,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 17:36:55,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 17:36:55,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 05:36:53" (1/3) ... [2020-07-08 17:36:55,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2681eb49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:36:55, skipping insertion in model container [2020-07-08 17:36:55,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:54" (2/3) ... [2020-07-08 17:36:55,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2681eb49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:36:55, skipping insertion in model container [2020-07-08 17:36:55,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:36:55" (3/3) ... [2020-07-08 17:36:55,123 INFO L109 eAbstractionObserver]: Analyzing ICFG ss2f.c [2020-07-08 17:36:55,137 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 17:36:55,149 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 17:36:55,169 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 17:36:55,200 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 17:36:55,200 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 17:36:55,200 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 17:36:55,200 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 17:36:55,201 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 17:36:55,201 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 17:36:55,201 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 17:36:55,202 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 17:36:55,232 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2020-07-08 17:36:55,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-08 17:36:55,263 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:36:55,264 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-08 17:36:55,265 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:36:55,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:36:55,275 INFO L82 PathProgramCache]: Analyzing trace with hash -456074008, now seen corresponding path program 1 times [2020-07-08 17:36:55,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:36:55,286 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [305694411] [2020-07-08 17:36:55,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:36:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:55,574 INFO L280 TraceCheckUtils]: 0: Hoare triple {112#(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; {100#true} is VALID [2020-07-08 17:36:55,575 INFO L280 TraceCheckUtils]: 1: Hoare triple {100#true} #valid := #valid[0 := 0]; {100#true} is VALID [2020-07-08 17:36:55,575 INFO L280 TraceCheckUtils]: 2: Hoare triple {100#true} assume 0 < #StackHeapBarrier; {100#true} is VALID [2020-07-08 17:36:55,576 INFO L280 TraceCheckUtils]: 3: Hoare triple {100#true} ~N~0 := 0; {100#true} is VALID [2020-07-08 17:36:55,577 INFO L280 TraceCheckUtils]: 4: Hoare triple {100#true} assume true; {100#true} is VALID [2020-07-08 17:36:55,578 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {100#true} {100#true} #188#return; {100#true} is VALID [2020-07-08 17:36:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:55,592 INFO L280 TraceCheckUtils]: 0: Hoare triple {100#true} ~cond := #in~cond; {100#true} is VALID [2020-07-08 17:36:55,592 INFO L280 TraceCheckUtils]: 1: Hoare triple {100#true} assume !(0 == ~cond); {100#true} is VALID [2020-07-08 17:36:55,593 INFO L280 TraceCheckUtils]: 2: Hoare triple {100#true} assume true; {100#true} is VALID [2020-07-08 17:36:55,594 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {100#true} {100#true} #184#return; {100#true} is VALID [2020-07-08 17:36:55,596 INFO L263 TraceCheckUtils]: 0: Hoare triple {100#true} call ULTIMATE.init(); {112#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 17:36:55,597 INFO L280 TraceCheckUtils]: 1: Hoare triple {112#(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; {100#true} is VALID [2020-07-08 17:36:55,597 INFO L280 TraceCheckUtils]: 2: Hoare triple {100#true} #valid := #valid[0 := 0]; {100#true} is VALID [2020-07-08 17:36:55,598 INFO L280 TraceCheckUtils]: 3: Hoare triple {100#true} assume 0 < #StackHeapBarrier; {100#true} is VALID [2020-07-08 17:36:55,598 INFO L280 TraceCheckUtils]: 4: Hoare triple {100#true} ~N~0 := 0; {100#true} is VALID [2020-07-08 17:36:55,598 INFO L280 TraceCheckUtils]: 5: Hoare triple {100#true} assume true; {100#true} is VALID [2020-07-08 17:36:55,599 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {100#true} {100#true} #188#return; {100#true} is VALID [2020-07-08 17:36:55,599 INFO L263 TraceCheckUtils]: 7: Hoare triple {100#true} call #t~ret18 := main(); {100#true} is VALID [2020-07-08 17:36:55,599 INFO L280 TraceCheckUtils]: 8: Hoare triple {100#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {100#true} is VALID [2020-07-08 17:36:55,600 INFO L280 TraceCheckUtils]: 9: Hoare triple {100#true} ~N~0 := #t~nondet0; {100#true} is VALID [2020-07-08 17:36:55,600 INFO L280 TraceCheckUtils]: 10: Hoare triple {100#true} havoc #t~nondet0; {100#true} is VALID [2020-07-08 17:36:55,601 INFO L280 TraceCheckUtils]: 11: Hoare triple {100#true} assume !(~N~0 <= 0); {100#true} is VALID [2020-07-08 17:36:55,601 INFO L263 TraceCheckUtils]: 12: Hoare triple {100#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {100#true} is VALID [2020-07-08 17:36:55,601 INFO L280 TraceCheckUtils]: 13: Hoare triple {100#true} ~cond := #in~cond; {100#true} is VALID [2020-07-08 17:36:55,602 INFO L280 TraceCheckUtils]: 14: Hoare triple {100#true} assume !(0 == ~cond); {100#true} is VALID [2020-07-08 17:36:55,602 INFO L280 TraceCheckUtils]: 15: Hoare triple {100#true} assume true; {100#true} is VALID [2020-07-08 17:36:55,603 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {100#true} {100#true} #184#return; {100#true} is VALID [2020-07-08 17:36:55,603 INFO L280 TraceCheckUtils]: 17: Hoare triple {100#true} havoc ~i~0; {100#true} is VALID [2020-07-08 17:36:55,604 INFO L280 TraceCheckUtils]: 18: Hoare triple {100#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {100#true} is VALID [2020-07-08 17:36:55,604 INFO L280 TraceCheckUtils]: 19: Hoare triple {100#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {100#true} is VALID [2020-07-08 17:36:55,605 INFO L280 TraceCheckUtils]: 20: Hoare triple {100#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {100#true} is VALID [2020-07-08 17:36:55,605 INFO L280 TraceCheckUtils]: 21: Hoare triple {100#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {100#true} is VALID [2020-07-08 17:36:55,605 INFO L280 TraceCheckUtils]: 22: Hoare triple {100#true} ~i~0 := 0; {100#true} is VALID [2020-07-08 17:36:55,607 INFO L280 TraceCheckUtils]: 23: Hoare triple {100#true} assume !true; {101#false} is VALID [2020-07-08 17:36:55,608 INFO L280 TraceCheckUtils]: 24: Hoare triple {101#false} ~i~0 := 0; {101#false} is VALID [2020-07-08 17:36:55,608 INFO L280 TraceCheckUtils]: 25: Hoare triple {101#false} assume !true; {101#false} is VALID [2020-07-08 17:36:55,608 INFO L280 TraceCheckUtils]: 26: Hoare triple {101#false} ~i~0 := 0; {101#false} is VALID [2020-07-08 17:36:55,609 INFO L280 TraceCheckUtils]: 27: Hoare triple {101#false} assume !(~i~0 < ~N~0); {101#false} is VALID [2020-07-08 17:36:55,609 INFO L280 TraceCheckUtils]: 28: Hoare triple {101#false} ~i~0 := 0; {101#false} is VALID [2020-07-08 17:36:55,609 INFO L280 TraceCheckUtils]: 29: Hoare triple {101#false} assume !true; {101#false} is VALID [2020-07-08 17:36:55,610 INFO L280 TraceCheckUtils]: 30: Hoare triple {101#false} ~i~0 := 0; {101#false} is VALID [2020-07-08 17:36:55,610 INFO L280 TraceCheckUtils]: 31: Hoare triple {101#false} assume !true; {101#false} is VALID [2020-07-08 17:36:55,611 INFO L280 TraceCheckUtils]: 32: Hoare triple {101#false} ~i~0 := 0; {101#false} is VALID [2020-07-08 17:36:55,611 INFO L280 TraceCheckUtils]: 33: Hoare triple {101#false} assume !true; {101#false} is VALID [2020-07-08 17:36:55,611 INFO L280 TraceCheckUtils]: 34: Hoare triple {101#false} ~i~0 := 0; {101#false} is VALID [2020-07-08 17:36:55,612 INFO L280 TraceCheckUtils]: 35: Hoare triple {101#false} assume !!(~i~0 < ~N~0); {101#false} is VALID [2020-07-08 17:36:55,612 INFO L280 TraceCheckUtils]: 36: Hoare triple {101#false} SUMMARY for call #t~mem17 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); srcloc: L62 {101#false} is VALID [2020-07-08 17:36:55,612 INFO L263 TraceCheckUtils]: 37: Hoare triple {101#false} call __VERIFIER_assert((if #t~mem17 == ~N~0 * (2 + ~N~0) then 1 else 0)); {101#false} is VALID [2020-07-08 17:36:55,613 INFO L280 TraceCheckUtils]: 38: Hoare triple {101#false} ~cond := #in~cond; {101#false} is VALID [2020-07-08 17:36:55,613 INFO L280 TraceCheckUtils]: 39: Hoare triple {101#false} assume 0 == ~cond; {101#false} is VALID [2020-07-08 17:36:55,614 INFO L280 TraceCheckUtils]: 40: Hoare triple {101#false} assume !false; {101#false} is VALID [2020-07-08 17:36:55,621 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-08 17:36:55,622 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:36:55,625 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [305694411] [2020-07-08 17:36:55,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:36:55,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 17:36:55,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102686049] [2020-07-08 17:36:55,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2020-07-08 17:36:55,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:36:55,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 17:36:55,736 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-08 17:36:55,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 17:36:55,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:36:55,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 17:36:55,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 17:36:55,748 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 3 states. [2020-07-08 17:36:56,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:56,574 INFO L93 Difference]: Finished difference Result 177 states and 208 transitions. [2020-07-08 17:36:56,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 17:36:56,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2020-07-08 17:36:56,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:36:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 17:36:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2020-07-08 17:36:56,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 17:36:56,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2020-07-08 17:36:56,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 208 transitions. [2020-07-08 17:36:56,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:56,919 INFO L225 Difference]: With dead ends: 177 [2020-07-08 17:36:56,919 INFO L226 Difference]: Without dead ends: 88 [2020-07-08 17:36:56,924 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-08 17:36:56,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-08 17:36:57,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2020-07-08 17:36:57,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:36:57,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 88 states. [2020-07-08 17:36:57,093 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2020-07-08 17:36:57,094 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2020-07-08 17:36:57,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:57,110 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2020-07-08 17:36:57,111 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2020-07-08 17:36:57,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:57,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:57,119 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2020-07-08 17:36:57,119 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2020-07-08 17:36:57,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:57,140 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2020-07-08 17:36:57,140 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2020-07-08 17:36:57,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:57,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:57,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:36:57,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:36:57,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-07-08 17:36:57,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2020-07-08 17:36:57,155 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 41 [2020-07-08 17:36:57,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:36:57,156 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2020-07-08 17:36:57,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 17:36:57,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 88 states and 94 transitions. [2020-07-08 17:36:57,320 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:57,321 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2020-07-08 17:36:57,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-08 17:36:57,323 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:36:57,325 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-08 17:36:57,326 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 17:36:57,326 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:36:57,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:36:57,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1964521925, now seen corresponding path program 1 times [2020-07-08 17:36:57,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:36:57,328 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [171799663] [2020-07-08 17:36:57,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:36:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:57,486 INFO L280 TraceCheckUtils]: 0: Hoare triple {835#(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; {821#true} is VALID [2020-07-08 17:36:57,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {821#true} #valid := #valid[0 := 0]; {821#true} is VALID [2020-07-08 17:36:57,487 INFO L280 TraceCheckUtils]: 2: Hoare triple {821#true} assume 0 < #StackHeapBarrier; {821#true} is VALID [2020-07-08 17:36:57,487 INFO L280 TraceCheckUtils]: 3: Hoare triple {821#true} ~N~0 := 0; {821#true} is VALID [2020-07-08 17:36:57,488 INFO L280 TraceCheckUtils]: 4: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-08 17:36:57,488 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {821#true} {821#true} #188#return; {821#true} is VALID [2020-07-08 17:36:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:57,499 INFO L280 TraceCheckUtils]: 0: Hoare triple {821#true} ~cond := #in~cond; {821#true} is VALID [2020-07-08 17:36:57,500 INFO L280 TraceCheckUtils]: 1: Hoare triple {821#true} assume !(0 == ~cond); {821#true} is VALID [2020-07-08 17:36:57,500 INFO L280 TraceCheckUtils]: 2: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-08 17:36:57,501 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {821#true} {829#(<= 1 ~N~0)} #184#return; {829#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:57,503 INFO L263 TraceCheckUtils]: 0: Hoare triple {821#true} call ULTIMATE.init(); {835#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 17:36:57,504 INFO L280 TraceCheckUtils]: 1: Hoare triple {835#(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; {821#true} is VALID [2020-07-08 17:36:57,504 INFO L280 TraceCheckUtils]: 2: Hoare triple {821#true} #valid := #valid[0 := 0]; {821#true} is VALID [2020-07-08 17:36:57,505 INFO L280 TraceCheckUtils]: 3: Hoare triple {821#true} assume 0 < #StackHeapBarrier; {821#true} is VALID [2020-07-08 17:36:57,505 INFO L280 TraceCheckUtils]: 4: Hoare triple {821#true} ~N~0 := 0; {821#true} is VALID [2020-07-08 17:36:57,505 INFO L280 TraceCheckUtils]: 5: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-08 17:36:57,506 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {821#true} {821#true} #188#return; {821#true} is VALID [2020-07-08 17:36:57,506 INFO L263 TraceCheckUtils]: 7: Hoare triple {821#true} call #t~ret18 := main(); {821#true} is VALID [2020-07-08 17:36:57,506 INFO L280 TraceCheckUtils]: 8: Hoare triple {821#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {821#true} is VALID [2020-07-08 17:36:57,506 INFO L280 TraceCheckUtils]: 9: Hoare triple {821#true} ~N~0 := #t~nondet0; {821#true} is VALID [2020-07-08 17:36:57,507 INFO L280 TraceCheckUtils]: 10: Hoare triple {821#true} havoc #t~nondet0; {821#true} is VALID [2020-07-08 17:36:57,507 INFO L280 TraceCheckUtils]: 11: Hoare triple {821#true} assume !(~N~0 <= 0); {829#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:57,508 INFO L263 TraceCheckUtils]: 12: Hoare triple {829#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {821#true} is VALID [2020-07-08 17:36:57,508 INFO L280 TraceCheckUtils]: 13: Hoare triple {821#true} ~cond := #in~cond; {821#true} is VALID [2020-07-08 17:36:57,508 INFO L280 TraceCheckUtils]: 14: Hoare triple {821#true} assume !(0 == ~cond); {821#true} is VALID [2020-07-08 17:36:57,509 INFO L280 TraceCheckUtils]: 15: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-08 17:36:57,509 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {821#true} {829#(<= 1 ~N~0)} #184#return; {829#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:57,511 INFO L280 TraceCheckUtils]: 17: Hoare triple {829#(<= 1 ~N~0)} havoc ~i~0; {829#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:57,515 INFO L280 TraceCheckUtils]: 18: Hoare triple {829#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {829#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:57,516 INFO L280 TraceCheckUtils]: 19: Hoare triple {829#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {829#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:57,517 INFO L280 TraceCheckUtils]: 20: Hoare triple {829#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {829#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:57,518 INFO L280 TraceCheckUtils]: 21: Hoare triple {829#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {829#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:57,519 INFO L280 TraceCheckUtils]: 22: Hoare triple {829#(<= 1 ~N~0)} ~i~0 := 0; {834#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-08 17:36:57,520 INFO L280 TraceCheckUtils]: 23: Hoare triple {834#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {822#false} is VALID [2020-07-08 17:36:57,521 INFO L280 TraceCheckUtils]: 24: Hoare triple {822#false} ~i~0 := 0; {822#false} is VALID [2020-07-08 17:36:57,522 INFO L280 TraceCheckUtils]: 25: Hoare triple {822#false} assume !(~i~0 < ~N~0); {822#false} is VALID [2020-07-08 17:36:57,522 INFO L280 TraceCheckUtils]: 26: Hoare triple {822#false} ~i~0 := 0; {822#false} is VALID [2020-07-08 17:36:57,523 INFO L280 TraceCheckUtils]: 27: Hoare triple {822#false} assume !(~i~0 < ~N~0); {822#false} is VALID [2020-07-08 17:36:57,523 INFO L280 TraceCheckUtils]: 28: Hoare triple {822#false} ~i~0 := 0; {822#false} is VALID [2020-07-08 17:36:57,523 INFO L280 TraceCheckUtils]: 29: Hoare triple {822#false} assume !(~i~0 < ~N~0); {822#false} is VALID [2020-07-08 17:36:57,524 INFO L280 TraceCheckUtils]: 30: Hoare triple {822#false} ~i~0 := 0; {822#false} is VALID [2020-07-08 17:36:57,524 INFO L280 TraceCheckUtils]: 31: Hoare triple {822#false} assume !(~i~0 < ~N~0); {822#false} is VALID [2020-07-08 17:36:57,524 INFO L280 TraceCheckUtils]: 32: Hoare triple {822#false} ~i~0 := 0; {822#false} is VALID [2020-07-08 17:36:57,524 INFO L280 TraceCheckUtils]: 33: Hoare triple {822#false} assume !(~i~0 < ~N~0); {822#false} is VALID [2020-07-08 17:36:57,525 INFO L280 TraceCheckUtils]: 34: Hoare triple {822#false} ~i~0 := 0; {822#false} is VALID [2020-07-08 17:36:57,525 INFO L280 TraceCheckUtils]: 35: Hoare triple {822#false} assume !!(~i~0 < ~N~0); {822#false} is VALID [2020-07-08 17:36:57,525 INFO L280 TraceCheckUtils]: 36: Hoare triple {822#false} SUMMARY for call #t~mem17 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); srcloc: L62 {822#false} is VALID [2020-07-08 17:36:57,526 INFO L263 TraceCheckUtils]: 37: Hoare triple {822#false} call __VERIFIER_assert((if #t~mem17 == ~N~0 * (2 + ~N~0) then 1 else 0)); {822#false} is VALID [2020-07-08 17:36:57,526 INFO L280 TraceCheckUtils]: 38: Hoare triple {822#false} ~cond := #in~cond; {822#false} is VALID [2020-07-08 17:36:57,526 INFO L280 TraceCheckUtils]: 39: Hoare triple {822#false} assume 0 == ~cond; {822#false} is VALID [2020-07-08 17:36:57,527 INFO L280 TraceCheckUtils]: 40: Hoare triple {822#false} assume !false; {822#false} is VALID [2020-07-08 17:36:57,529 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-08 17:36:57,529 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:36:57,530 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [171799663] [2020-07-08 17:36:57,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:36:57,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 17:36:57,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266682963] [2020-07-08 17:36:57,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-07-08 17:36:57,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:36:57,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 17:36:57,577 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-08 17:36:57,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 17:36:57,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:36:57,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 17:36:57,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 17:36:57,578 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 5 states. [2020-07-08 17:36:58,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:58,535 INFO L93 Difference]: Finished difference Result 194 states and 212 transitions. [2020-07-08 17:36:58,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 17:36:58,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-07-08 17:36:58,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:36:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:36:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2020-07-08 17:36:58,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:36:58,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2020-07-08 17:36:58,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 212 transitions. [2020-07-08 17:36:58,828 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:58,840 INFO L225 Difference]: With dead ends: 194 [2020-07-08 17:36:58,841 INFO L226 Difference]: Without dead ends: 134 [2020-07-08 17:36:58,843 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-08 17:36:58,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-07-08 17:36:59,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 94. [2020-07-08 17:36:59,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:36:59,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 94 states. [2020-07-08 17:36:59,018 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 94 states. [2020-07-08 17:36:59,019 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 94 states. [2020-07-08 17:36:59,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:59,028 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2020-07-08 17:36:59,028 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 141 transitions. [2020-07-08 17:36:59,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:59,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:59,030 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 134 states. [2020-07-08 17:36:59,030 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 134 states. [2020-07-08 17:36:59,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:59,039 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2020-07-08 17:36:59,039 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 141 transitions. [2020-07-08 17:36:59,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:59,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:59,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:36:59,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:36:59,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-08 17:36:59,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2020-07-08 17:36:59,045 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 41 [2020-07-08 17:36:59,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:36:59,046 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2020-07-08 17:36:59,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 17:36:59,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 94 states and 100 transitions. [2020-07-08 17:36:59,195 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:59,196 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2020-07-08 17:36:59,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-07-08 17:36:59,201 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:36:59,202 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:36:59,202 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 17:36:59,202 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:36:59,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:36:59,203 INFO L82 PathProgramCache]: Analyzing trace with hash -725795370, now seen corresponding path program 1 times [2020-07-08 17:36:59,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:36:59,207 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1014035492] [2020-07-08 17:36:59,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:36:59,268 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 17:36:59,269 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-08 17:36:59,282 INFO L168 Benchmark]: Toolchain (without parser) took 5446.54 ms. Allocated memory was 136.3 MB in the beginning and 252.2 MB in the end (delta: 115.9 MB). Free memory was 101.2 MB in the beginning and 119.1 MB in the end (delta: -17.9 MB). Peak memory consumption was 98.0 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:59,284 INFO L168 Benchmark]: CDTParser took 1.01 ms. Allocated memory is still 136.3 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 17:36:59,285 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.60 ms. Allocated memory is still 136.3 MB. Free memory was 101.0 MB in the beginning and 89.2 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:59,287 INFO L168 Benchmark]: Boogie Preprocessor took 152.76 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 89.2 MB in the beginning and 177.0 MB in the end (delta: -87.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:59,289 INFO L168 Benchmark]: RCFGBuilder took 767.46 ms. Allocated memory is still 200.3 MB. Free memory was 177.0 MB in the beginning and 137.2 MB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:59,297 INFO L168 Benchmark]: TraceAbstraction took 4163.35 ms. Allocated memory was 200.3 MB in the beginning and 252.2 MB in the end (delta: 51.9 MB). Free memory was 137.2 MB in the beginning and 119.1 MB in the end (delta: 18.2 MB). Peak memory consumption was 70.1 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:59,305 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 1.01 ms. Allocated memory is still 136.3 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 355.60 ms. Allocated memory is still 136.3 MB. Free memory was 101.0 MB in the beginning and 89.2 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 152.76 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 89.2 MB in the beginning and 177.0 MB in the end (delta: -87.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 767.46 ms. Allocated memory is still 200.3 MB. Free memory was 177.0 MB in the beginning and 137.2 MB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4163.35 ms. Allocated memory was 200.3 MB in the beginning and 252.2 MB in the end (delta: 51.9 MB). Free memory was 137.2 MB in the beginning and 119.1 MB in the end (delta: 18.2 MB). Peak memory consumption was 70.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...