/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/condnf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 17:36:04,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 17:36:04,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 17:36:04,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 17:36:04,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 17:36:04,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 17:36:04,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 17:36:04,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 17:36:04,398 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 17:36:04,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 17:36:04,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 17:36:04,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 17:36:04,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 17:36:04,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 17:36:04,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 17:36:04,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 17:36:04,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 17:36:04,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 17:36:04,418 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 17:36:04,423 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 17:36:04,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 17:36:04,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 17:36:04,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 17:36:04,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 17:36:04,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 17:36:04,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 17:36:04,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 17:36:04,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 17:36:04,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 17:36:04,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 17:36:04,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 17:36:04,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 17:36:04,439 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 17:36:04,440 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 17:36:04,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 17:36:04,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 17:36:04,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 17:36:04,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 17:36:04,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 17:36:04,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 17:36:04,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 17:36:04,448 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:04,463 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 17:36:04,463 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 17:36:04,466 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 17:36:04,466 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 17:36:04,466 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 17:36:04,466 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 17:36:04,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 17:36:04,467 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 17:36:04,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 17:36:04,467 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 17:36:04,468 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 17:36:04,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 17:36:04,469 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 17:36:04,469 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 17:36:04,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 17:36:04,470 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 17:36:04,470 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 17:36:04,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 17:36:04,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 17:36:04,471 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 17:36:04,471 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 17:36:04,471 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 17:36:04,471 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 17:36:04,749 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 17:36:04,762 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 17:36:04,766 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 17:36:04,768 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 17:36:04,768 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 17:36:04,769 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/condnf.c [2020-07-08 17:36:04,852 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73d8f26fe/6d2a955f128d4643a996cefc46e6ca13/FLAGa0528bd5d [2020-07-08 17:36:05,357 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 17:36:05,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condnf.c [2020-07-08 17:36:05,365 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73d8f26fe/6d2a955f128d4643a996cefc46e6ca13/FLAGa0528bd5d [2020-07-08 17:36:05,799 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73d8f26fe/6d2a955f128d4643a996cefc46e6ca13 [2020-07-08 17:36:05,814 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 17:36:05,818 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 17:36:05,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 17:36:05,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 17:36:05,823 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 17:36:05,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:36:05" (1/1) ... [2020-07-08 17:36:05,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41be3f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:05, skipping insertion in model container [2020-07-08 17:36:05,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:36:05" (1/1) ... [2020-07-08 17:36:05,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 17:36:05,860 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 17:36:06,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:36:06,107 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 17:36:06,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:36:06,157 INFO L208 MainTranslator]: Completed translation [2020-07-08 17:36:06,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:06 WrapperNode [2020-07-08 17:36:06,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 17:36:06,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 17:36:06,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 17:36:06,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 17:36:06,278 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:06" (1/1) ... [2020-07-08 17:36:06,278 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:06" (1/1) ... [2020-07-08 17:36:06,291 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:06" (1/1) ... [2020-07-08 17:36:06,292 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:06" (1/1) ... [2020-07-08 17:36:06,319 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:06" (1/1) ... [2020-07-08 17:36:06,331 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:06" (1/1) ... [2020-07-08 17:36:06,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:06" (1/1) ... [2020-07-08 17:36:06,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 17:36:06,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 17:36:06,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 17:36:06,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 17:36:06,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:06" (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:06,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 17:36:06,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 17:36:06,443 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 17:36:06,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 17:36:06,443 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 17:36:06,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 17:36:06,444 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 17:36:06,444 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 17:36:06,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 17:36:06,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 17:36:06,444 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 17:36:06,444 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 17:36:06,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 17:36:06,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 17:36:06,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 17:36:06,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 17:36:06,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 17:36:06,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 17:36:06,954 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 17:36:06,954 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-08 17:36:06,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:36:06 BoogieIcfgContainer [2020-07-08 17:36:06,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 17:36:06,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 17:36:06,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 17:36:06,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 17:36:06,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 05:36:05" (1/3) ... [2020-07-08 17:36:06,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e831536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:36:06, skipping insertion in model container [2020-07-08 17:36:06,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:36:06" (2/3) ... [2020-07-08 17:36:06,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e831536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:36:06, skipping insertion in model container [2020-07-08 17:36:06,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:36:06" (3/3) ... [2020-07-08 17:36:06,969 INFO L109 eAbstractionObserver]: Analyzing ICFG condnf.c [2020-07-08 17:36:06,981 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 17:36:06,989 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 17:36:07,003 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 17:36:07,024 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 17:36:07,024 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 17:36:07,024 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 17:36:07,025 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 17:36:07,025 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 17:36:07,025 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 17:36:07,025 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 17:36:07,026 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 17:36:07,043 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2020-07-08 17:36:07,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 17:36:07,053 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:36:07,055 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] [2020-07-08 17:36:07,055 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:36:07,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:36:07,061 INFO L82 PathProgramCache]: Analyzing trace with hash -386984160, now seen corresponding path program 1 times [2020-07-08 17:36:07,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:36:07,070 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1742399328] [2020-07-08 17:36:07,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:36:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:07,341 INFO L280 TraceCheckUtils]: 0: Hoare triple {77#(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; {65#true} is VALID [2020-07-08 17:36:07,342 INFO L280 TraceCheckUtils]: 1: Hoare triple {65#true} #valid := #valid[0 := 0]; {65#true} is VALID [2020-07-08 17:36:07,343 INFO L280 TraceCheckUtils]: 2: Hoare triple {65#true} assume 0 < #StackHeapBarrier; {65#true} is VALID [2020-07-08 17:36:07,343 INFO L280 TraceCheckUtils]: 3: Hoare triple {65#true} ~N~0 := 0; {65#true} is VALID [2020-07-08 17:36:07,344 INFO L280 TraceCheckUtils]: 4: Hoare triple {65#true} assume true; {65#true} is VALID [2020-07-08 17:36:07,344 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {65#true} {65#true} #113#return; {65#true} is VALID [2020-07-08 17:36:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:07,357 INFO L280 TraceCheckUtils]: 0: Hoare triple {65#true} ~cond := #in~cond; {65#true} is VALID [2020-07-08 17:36:07,358 INFO L280 TraceCheckUtils]: 1: Hoare triple {65#true} assume !(0 == ~cond); {65#true} is VALID [2020-07-08 17:36:07,359 INFO L280 TraceCheckUtils]: 2: Hoare triple {65#true} assume true; {65#true} is VALID [2020-07-08 17:36:07,359 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {65#true} {65#true} #109#return; {65#true} is VALID [2020-07-08 17:36:07,361 INFO L263 TraceCheckUtils]: 0: Hoare triple {65#true} call ULTIMATE.init(); {77#(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:07,362 INFO L280 TraceCheckUtils]: 1: Hoare triple {77#(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; {65#true} is VALID [2020-07-08 17:36:07,362 INFO L280 TraceCheckUtils]: 2: Hoare triple {65#true} #valid := #valid[0 := 0]; {65#true} is VALID [2020-07-08 17:36:07,363 INFO L280 TraceCheckUtils]: 3: Hoare triple {65#true} assume 0 < #StackHeapBarrier; {65#true} is VALID [2020-07-08 17:36:07,363 INFO L280 TraceCheckUtils]: 4: Hoare triple {65#true} ~N~0 := 0; {65#true} is VALID [2020-07-08 17:36:07,364 INFO L280 TraceCheckUtils]: 5: Hoare triple {65#true} assume true; {65#true} is VALID [2020-07-08 17:36:07,364 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {65#true} {65#true} #113#return; {65#true} is VALID [2020-07-08 17:36:07,364 INFO L263 TraceCheckUtils]: 7: Hoare triple {65#true} call #t~ret9 := main(); {65#true} is VALID [2020-07-08 17:36:07,365 INFO L280 TraceCheckUtils]: 8: Hoare triple {65#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {65#true} is VALID [2020-07-08 17:36:07,365 INFO L280 TraceCheckUtils]: 9: Hoare triple {65#true} ~N~0 := #t~nondet0; {65#true} is VALID [2020-07-08 17:36:07,366 INFO L280 TraceCheckUtils]: 10: Hoare triple {65#true} havoc #t~nondet0; {65#true} is VALID [2020-07-08 17:36:07,366 INFO L280 TraceCheckUtils]: 11: Hoare triple {65#true} assume !(~N~0 <= 0); {65#true} is VALID [2020-07-08 17:36:07,367 INFO L263 TraceCheckUtils]: 12: Hoare triple {65#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {65#true} is VALID [2020-07-08 17:36:07,367 INFO L280 TraceCheckUtils]: 13: Hoare triple {65#true} ~cond := #in~cond; {65#true} is VALID [2020-07-08 17:36:07,368 INFO L280 TraceCheckUtils]: 14: Hoare triple {65#true} assume !(0 == ~cond); {65#true} is VALID [2020-07-08 17:36:07,368 INFO L280 TraceCheckUtils]: 15: Hoare triple {65#true} assume true; {65#true} is VALID [2020-07-08 17:36:07,368 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {65#true} {65#true} #109#return; {65#true} is VALID [2020-07-08 17:36:07,369 INFO L280 TraceCheckUtils]: 17: Hoare triple {65#true} havoc ~i~0; {65#true} is VALID [2020-07-08 17:36:07,369 INFO L280 TraceCheckUtils]: 18: Hoare triple {65#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26 {65#true} is VALID [2020-07-08 17:36:07,370 INFO L280 TraceCheckUtils]: 19: Hoare triple {65#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {65#true} is VALID [2020-07-08 17:36:07,370 INFO L280 TraceCheckUtils]: 20: Hoare triple {65#true} ~i~0 := 0; {65#true} is VALID [2020-07-08 17:36:07,372 INFO L280 TraceCheckUtils]: 21: Hoare triple {65#true} assume !true; {66#false} is VALID [2020-07-08 17:36:07,372 INFO L280 TraceCheckUtils]: 22: Hoare triple {66#false} ~i~0 := 0; {66#false} is VALID [2020-07-08 17:36:07,373 INFO L280 TraceCheckUtils]: 23: Hoare triple {66#false} assume !true; {66#false} is VALID [2020-07-08 17:36:07,373 INFO L280 TraceCheckUtils]: 24: Hoare triple {66#false} ~i~0 := 0; {66#false} is VALID [2020-07-08 17:36:07,374 INFO L280 TraceCheckUtils]: 25: Hoare triple {66#false} assume !!(~i~0 < ~N~0); {66#false} is VALID [2020-07-08 17:36:07,374 INFO L280 TraceCheckUtils]: 26: Hoare triple {66#false} SUMMARY for call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L44 {66#false} is VALID [2020-07-08 17:36:07,375 INFO L263 TraceCheckUtils]: 27: Hoare triple {66#false} call __VERIFIER_assert((if #t~mem8 <= ~N~0 then 1 else 0)); {66#false} is VALID [2020-07-08 17:36:07,375 INFO L280 TraceCheckUtils]: 28: Hoare triple {66#false} ~cond := #in~cond; {66#false} is VALID [2020-07-08 17:36:07,376 INFO L280 TraceCheckUtils]: 29: Hoare triple {66#false} assume 0 == ~cond; {66#false} is VALID [2020-07-08 17:36:07,376 INFO L280 TraceCheckUtils]: 30: Hoare triple {66#false} assume !false; {66#false} is VALID [2020-07-08 17:36:07,381 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:07,381 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:36:07,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1742399328] [2020-07-08 17:36:07,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:36:07,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 17:36:07,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332286886] [2020-07-08 17:36:07,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-08 17:36:07,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:36:07,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 17:36:07,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:07,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 17:36:07,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:36:07,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 17:36:07,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 17:36:07,506 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2020-07-08 17:36:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:08,003 INFO L93 Difference]: Finished difference Result 107 states and 124 transitions. [2020-07-08 17:36:08,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 17:36:08,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-08 17:36:08,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:36:08,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 17:36:08,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2020-07-08 17:36:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 17:36:08,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2020-07-08 17:36:08,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 124 transitions. [2020-07-08 17:36:08,227 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:08,243 INFO L225 Difference]: With dead ends: 107 [2020-07-08 17:36:08,243 INFO L226 Difference]: Without dead ends: 55 [2020-07-08 17:36:08,247 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:08,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-08 17:36:08,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-08 17:36:08,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:36:08,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2020-07-08 17:36:08,353 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-08 17:36:08,354 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-08 17:36:08,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:08,361 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2020-07-08 17:36:08,361 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-08 17:36:08,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:08,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:08,363 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-08 17:36:08,363 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-08 17:36:08,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:08,370 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2020-07-08 17:36:08,370 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-08 17:36:08,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:08,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:08,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:36:08,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:36:08,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-08 17:36:08,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2020-07-08 17:36:08,379 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 31 [2020-07-08 17:36:08,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:36:08,379 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2020-07-08 17:36:08,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 17:36:08,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 58 transitions. [2020-07-08 17:36:08,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:08,455 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-08 17:36:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 17:36:08,456 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:36:08,457 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] [2020-07-08 17:36:08,457 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 17:36:08,457 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:36:08,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:36:08,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1278196063, now seen corresponding path program 1 times [2020-07-08 17:36:08,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:36:08,458 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [145428468] [2020-07-08 17:36:08,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:36:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:08,578 INFO L280 TraceCheckUtils]: 0: Hoare triple {528#(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; {514#true} is VALID [2020-07-08 17:36:08,579 INFO L280 TraceCheckUtils]: 1: Hoare triple {514#true} #valid := #valid[0 := 0]; {514#true} is VALID [2020-07-08 17:36:08,579 INFO L280 TraceCheckUtils]: 2: Hoare triple {514#true} assume 0 < #StackHeapBarrier; {514#true} is VALID [2020-07-08 17:36:08,579 INFO L280 TraceCheckUtils]: 3: Hoare triple {514#true} ~N~0 := 0; {514#true} is VALID [2020-07-08 17:36:08,580 INFO L280 TraceCheckUtils]: 4: Hoare triple {514#true} assume true; {514#true} is VALID [2020-07-08 17:36:08,580 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {514#true} {514#true} #113#return; {514#true} is VALID [2020-07-08 17:36:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:08,590 INFO L280 TraceCheckUtils]: 0: Hoare triple {514#true} ~cond := #in~cond; {514#true} is VALID [2020-07-08 17:36:08,591 INFO L280 TraceCheckUtils]: 1: Hoare triple {514#true} assume !(0 == ~cond); {514#true} is VALID [2020-07-08 17:36:08,591 INFO L280 TraceCheckUtils]: 2: Hoare triple {514#true} assume true; {514#true} is VALID [2020-07-08 17:36:08,593 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {514#true} {522#(<= 1 ~N~0)} #109#return; {522#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:08,594 INFO L263 TraceCheckUtils]: 0: Hoare triple {514#true} call ULTIMATE.init(); {528#(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:08,595 INFO L280 TraceCheckUtils]: 1: Hoare triple {528#(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; {514#true} is VALID [2020-07-08 17:36:08,595 INFO L280 TraceCheckUtils]: 2: Hoare triple {514#true} #valid := #valid[0 := 0]; {514#true} is VALID [2020-07-08 17:36:08,595 INFO L280 TraceCheckUtils]: 3: Hoare triple {514#true} assume 0 < #StackHeapBarrier; {514#true} is VALID [2020-07-08 17:36:08,596 INFO L280 TraceCheckUtils]: 4: Hoare triple {514#true} ~N~0 := 0; {514#true} is VALID [2020-07-08 17:36:08,596 INFO L280 TraceCheckUtils]: 5: Hoare triple {514#true} assume true; {514#true} is VALID [2020-07-08 17:36:08,596 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {514#true} {514#true} #113#return; {514#true} is VALID [2020-07-08 17:36:08,597 INFO L263 TraceCheckUtils]: 7: Hoare triple {514#true} call #t~ret9 := main(); {514#true} is VALID [2020-07-08 17:36:08,597 INFO L280 TraceCheckUtils]: 8: Hoare triple {514#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {514#true} is VALID [2020-07-08 17:36:08,598 INFO L280 TraceCheckUtils]: 9: Hoare triple {514#true} ~N~0 := #t~nondet0; {514#true} is VALID [2020-07-08 17:36:08,598 INFO L280 TraceCheckUtils]: 10: Hoare triple {514#true} havoc #t~nondet0; {514#true} is VALID [2020-07-08 17:36:08,599 INFO L280 TraceCheckUtils]: 11: Hoare triple {514#true} assume !(~N~0 <= 0); {522#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:08,599 INFO L263 TraceCheckUtils]: 12: Hoare triple {522#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {514#true} is VALID [2020-07-08 17:36:08,600 INFO L280 TraceCheckUtils]: 13: Hoare triple {514#true} ~cond := #in~cond; {514#true} is VALID [2020-07-08 17:36:08,600 INFO L280 TraceCheckUtils]: 14: Hoare triple {514#true} assume !(0 == ~cond); {514#true} is VALID [2020-07-08 17:36:08,600 INFO L280 TraceCheckUtils]: 15: Hoare triple {514#true} assume true; {514#true} is VALID [2020-07-08 17:36:08,601 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {514#true} {522#(<= 1 ~N~0)} #109#return; {522#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:08,602 INFO L280 TraceCheckUtils]: 17: Hoare triple {522#(<= 1 ~N~0)} havoc ~i~0; {522#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:08,603 INFO L280 TraceCheckUtils]: 18: Hoare triple {522#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26 {522#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:08,604 INFO L280 TraceCheckUtils]: 19: Hoare triple {522#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {522#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:08,605 INFO L280 TraceCheckUtils]: 20: Hoare triple {522#(<= 1 ~N~0)} ~i~0 := 0; {527#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-08 17:36:08,606 INFO L280 TraceCheckUtils]: 21: Hoare triple {527#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {515#false} is VALID [2020-07-08 17:36:08,607 INFO L280 TraceCheckUtils]: 22: Hoare triple {515#false} ~i~0 := 0; {515#false} is VALID [2020-07-08 17:36:08,607 INFO L280 TraceCheckUtils]: 23: Hoare triple {515#false} assume !(~i~0 < ~N~0); {515#false} is VALID [2020-07-08 17:36:08,607 INFO L280 TraceCheckUtils]: 24: Hoare triple {515#false} ~i~0 := 0; {515#false} is VALID [2020-07-08 17:36:08,608 INFO L280 TraceCheckUtils]: 25: Hoare triple {515#false} assume !!(~i~0 < ~N~0); {515#false} is VALID [2020-07-08 17:36:08,608 INFO L280 TraceCheckUtils]: 26: Hoare triple {515#false} SUMMARY for call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L44 {515#false} is VALID [2020-07-08 17:36:08,608 INFO L263 TraceCheckUtils]: 27: Hoare triple {515#false} call __VERIFIER_assert((if #t~mem8 <= ~N~0 then 1 else 0)); {515#false} is VALID [2020-07-08 17:36:08,609 INFO L280 TraceCheckUtils]: 28: Hoare triple {515#false} ~cond := #in~cond; {515#false} is VALID [2020-07-08 17:36:08,609 INFO L280 TraceCheckUtils]: 29: Hoare triple {515#false} assume 0 == ~cond; {515#false} is VALID [2020-07-08 17:36:08,609 INFO L280 TraceCheckUtils]: 30: Hoare triple {515#false} assume !false; {515#false} is VALID [2020-07-08 17:36:08,611 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:08,611 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:36:08,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [145428468] [2020-07-08 17:36:08,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:36:08,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 17:36:08,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854976142] [2020-07-08 17:36:08,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-07-08 17:36:08,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:36:08,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 17:36:08,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:08,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 17:36:08,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:36:08,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 17:36:08,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 17:36:08,656 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 5 states. [2020-07-08 17:36:09,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:09,200 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2020-07-08 17:36:09,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 17:36:09,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-07-08 17:36:09,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:36:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:36:09,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2020-07-08 17:36:09,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:36:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2020-07-08 17:36:09,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 114 transitions. [2020-07-08 17:36:09,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:09,381 INFO L225 Difference]: With dead ends: 105 [2020-07-08 17:36:09,381 INFO L226 Difference]: Without dead ends: 78 [2020-07-08 17:36:09,383 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:09,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-08 17:36:09,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 57. [2020-07-08 17:36:09,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:36:09,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 57 states. [2020-07-08 17:36:09,493 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 57 states. [2020-07-08 17:36:09,493 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 57 states. [2020-07-08 17:36:09,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:09,501 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2020-07-08 17:36:09,501 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2020-07-08 17:36:09,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:09,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:09,503 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 78 states. [2020-07-08 17:36:09,503 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 78 states. [2020-07-08 17:36:09,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:09,509 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2020-07-08 17:36:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2020-07-08 17:36:09,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:09,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:09,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:36:09,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:36:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-08 17:36:09,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2020-07-08 17:36:09,515 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 31 [2020-07-08 17:36:09,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:36:09,515 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2020-07-08 17:36:09,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 17:36:09,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 60 transitions. [2020-07-08 17:36:09,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:09,593 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2020-07-08 17:36:09,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-08 17:36:09,595 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:36:09,595 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] [2020-07-08 17:36:09,595 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 17:36:09,596 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:36:09,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:36:09,596 INFO L82 PathProgramCache]: Analyzing trace with hash -620119431, now seen corresponding path program 1 times [2020-07-08 17:36:09,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:36:09,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1947907565] [2020-07-08 17:36:09,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:36:09,628 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 17:36:09,629 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:09,635 INFO L168 Benchmark]: Toolchain (without parser) took 3816.99 ms. Allocated memory was 138.9 MB in the beginning and 247.5 MB in the end (delta: 108.5 MB). Free memory was 104.1 MB in the beginning and 120.3 MB in the end (delta: -16.2 MB). Peak memory consumption was 92.4 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:09,636 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-08 17:36:09,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.80 ms. Allocated memory is still 138.9 MB. Free memory was 103.9 MB in the beginning and 93.1 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:09,638 INFO L168 Benchmark]: Boogie Preprocessor took 187.63 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 93.1 MB in the beginning and 181.4 MB in the end (delta: -88.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:09,639 INFO L168 Benchmark]: RCFGBuilder took 612.81 ms. Allocated memory is still 203.9 MB. Free memory was 181.4 MB in the beginning and 153.2 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:09,640 INFO L168 Benchmark]: TraceAbstraction took 2671.43 ms. Allocated memory was 203.9 MB in the beginning and 247.5 MB in the end (delta: 43.5 MB). Free memory was 152.5 MB in the beginning and 120.3 MB in the end (delta: 32.2 MB). Peak memory consumption was 75.7 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:09,645 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.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 338.80 ms. Allocated memory is still 138.9 MB. Free memory was 103.9 MB in the beginning and 93.1 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 187.63 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 93.1 MB in the beginning and 181.4 MB in the end (delta: -88.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 612.81 ms. Allocated memory is still 203.9 MB. Free memory was 181.4 MB in the beginning and 153.2 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2671.43 ms. Allocated memory was 203.9 MB in the beginning and 247.5 MB in the end (delta: 43.5 MB). Free memory was 152.5 MB in the beginning and 120.3 MB in the end (delta: 32.2 MB). Peak memory consumption was 75.7 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...