/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-lit/cggmp2005.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:31:57,568 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:31:57,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:31:57,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:31:57,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:31:57,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:31:57,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:31:57,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:31:57,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:31:57,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:31:57,595 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:31:57,597 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:31:57,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:31:57,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:31:57,600 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:31:57,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:31:57,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:31:57,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:31:57,606 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:31:57,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:31:57,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:31:57,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:31:57,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:31:57,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:31:57,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:31:57,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:31:57,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:31:57,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:31:57,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:31:57,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:31:57,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:31:57,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:31:57,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:31:57,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:31:57,628 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:31:57,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:31:57,629 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:31:57,629 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:31:57,630 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:31:57,631 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:31:57,632 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:31:57,633 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:31:57,645 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:31:57,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:31:57,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:31:57,647 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:31:57,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:31:57,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:31:57,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:31:57,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:31:57,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:31:57,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:31:57,648 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:31:57,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:31:57,649 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:31:57,649 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:31:57,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:31:57,650 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:31:57,650 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:31:57,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:31:57,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:31:57,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:31:57,651 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:31:57,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:31:57,651 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 02:31:57,946 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:31:57,959 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:31:57,963 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:31:57,964 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:31:57,964 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:31:57,965 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005.i [2020-07-11 02:31:58,034 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33bed0684/cec8e2cac6f34e4b9f69cde46b276943/FLAG45a8cd77d [2020-07-11 02:31:58,464 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:31:58,465 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005.i [2020-07-11 02:31:58,471 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33bed0684/cec8e2cac6f34e4b9f69cde46b276943/FLAG45a8cd77d [2020-07-11 02:31:58,865 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33bed0684/cec8e2cac6f34e4b9f69cde46b276943 [2020-07-11 02:31:58,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:31:58,883 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:31:58,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:31:58,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:31:58,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:31:58,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:31:58" (1/1) ... [2020-07-11 02:31:58,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14484648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:58, skipping insertion in model container [2020-07-11 02:31:58,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:31:58" (1/1) ... [2020-07-11 02:31:58,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:31:58,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:31:59,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:31:59,141 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:31:59,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:31:59,184 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:31:59,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:59 WrapperNode [2020-07-11 02:31:59,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:31:59,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:31:59,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:31:59,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:31:59,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:59" (1/1) ... [2020-07-11 02:31:59,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:59" (1/1) ... [2020-07-11 02:31:59,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:59" (1/1) ... [2020-07-11 02:31:59,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:59" (1/1) ... [2020-07-11 02:31:59,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:59" (1/1) ... [2020-07-11 02:31:59,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:59" (1/1) ... [2020-07-11 02:31:59,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:59" (1/1) ... [2020-07-11 02:31:59,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:31:59,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:31:59,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:31:59,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:31:59,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:59" (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-11 02:31:59,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:31:59,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:31:59,424 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 02:31:59,425 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:31:59,425 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:31:59,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:31:59,426 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 02:31:59,426 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 02:31:59,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:31:59,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:31:59,427 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:31:59,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:31:59,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:31:59,796 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:31:59,797 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-11 02:31:59,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:31:59 BoogieIcfgContainer [2020-07-11 02:31:59,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:31:59,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:31:59,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:31:59,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:31:59,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:31:58" (1/3) ... [2020-07-11 02:31:59,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22512be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:31:59, skipping insertion in model container [2020-07-11 02:31:59,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:59" (2/3) ... [2020-07-11 02:31:59,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22512be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:31:59, skipping insertion in model container [2020-07-11 02:31:59,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:31:59" (3/3) ... [2020-07-11 02:31:59,812 INFO L109 eAbstractionObserver]: Analyzing ICFG cggmp2005.i [2020-07-11 02:31:59,825 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:31:59,834 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:31:59,851 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:31:59,880 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:31:59,881 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:31:59,881 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:31:59,881 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:31:59,881 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:31:59,882 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:31:59,882 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:31:59,882 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:31:59,898 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-11 02:31:59,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-11 02:31:59,910 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:59,911 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:31:59,912 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:59,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:59,919 INFO L82 PathProgramCache]: Analyzing trace with hash -714485069, now seen corresponding path program 1 times [2020-07-11 02:31:59,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:59,928 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1943173272] [2020-07-11 02:31:59,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:00,148 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-11 02:32:00,148 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {26#true} {26#true} #46#return; {26#true} is VALID [2020-07-11 02:32:00,151 INFO L263 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2020-07-11 02:32:00,152 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-11 02:32:00,152 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #46#return; {26#true} is VALID [2020-07-11 02:32:00,153 INFO L263 TraceCheckUtils]: 3: Hoare triple {26#true} call #t~ret0 := main(); {26#true} is VALID [2020-07-11 02:32:00,153 INFO L280 TraceCheckUtils]: 4: Hoare triple {26#true} havoc ~i~0; {26#true} is VALID [2020-07-11 02:32:00,153 INFO L280 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~j~0; {26#true} is VALID [2020-07-11 02:32:00,155 INFO L280 TraceCheckUtils]: 6: Hoare triple {26#true} ~i~0 := 1; {30#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:00,157 INFO L280 TraceCheckUtils]: 7: Hoare triple {30#(<= main_~i~0 1)} ~j~0 := 10; {31#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-11 02:32:00,159 INFO L280 TraceCheckUtils]: 8: Hoare triple {31#(<= (+ main_~i~0 9) main_~j~0)} assume !(~j~0 >= ~i~0); {27#false} is VALID [2020-07-11 02:32:00,159 INFO L263 TraceCheckUtils]: 9: Hoare triple {27#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {27#false} is VALID [2020-07-11 02:32:00,159 INFO L280 TraceCheckUtils]: 10: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2020-07-11 02:32:00,160 INFO L280 TraceCheckUtils]: 11: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2020-07-11 02:32:00,160 INFO L280 TraceCheckUtils]: 12: Hoare triple {27#false} assume !false; {27#false} is VALID [2020-07-11 02:32:00,162 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-11 02:32:00,163 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1943173272] [2020-07-11 02:32:00,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:32:00,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 02:32:00,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834525359] [2020-07-11 02:32:00,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-11 02:32:00,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:00,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 02:32:00,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:00,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 02:32:00,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:00,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 02:32:00,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 02:32:00,233 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 4 states. [2020-07-11 02:32:00,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:00,464 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-07-11 02:32:00,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 02:32:00,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-11 02:32:00,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:00,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 02:32:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2020-07-11 02:32:00,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 02:32:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2020-07-11 02:32:00,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2020-07-11 02:32:00,724 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:00,747 INFO L225 Difference]: With dead ends: 37 [2020-07-11 02:32:00,747 INFO L226 Difference]: Without dead ends: 18 [2020-07-11 02:32:00,756 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:32:00,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-11 02:32:00,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-07-11 02:32:00,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:00,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2020-07-11 02:32:00,842 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2020-07-11 02:32:00,842 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2020-07-11 02:32:00,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:00,851 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-11 02:32:00,851 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-11 02:32:00,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:00,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:00,852 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2020-07-11 02:32:00,852 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2020-07-11 02:32:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:00,856 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-11 02:32:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-11 02:32:00,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:00,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:00,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:00,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-11 02:32:00,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2020-07-11 02:32:00,862 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2020-07-11 02:32:00,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:00,863 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2020-07-11 02:32:00,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 02:32:00,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2020-07-11 02:32:00,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:00,889 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-11 02:32:00,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-11 02:32:00,890 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:00,890 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:00,891 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:32:00,891 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:00,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:00,892 INFO L82 PathProgramCache]: Analyzing trace with hash 673132007, now seen corresponding path program 1 times [2020-07-11 02:32:00,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:00,893 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [397149286] [2020-07-11 02:32:00,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:00,995 INFO L280 TraceCheckUtils]: 0: Hoare triple {180#true} assume true; {180#true} is VALID [2020-07-11 02:32:00,996 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {180#true} {180#true} #46#return; {180#true} is VALID [2020-07-11 02:32:00,997 INFO L263 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {180#true} is VALID [2020-07-11 02:32:00,997 INFO L280 TraceCheckUtils]: 1: Hoare triple {180#true} assume true; {180#true} is VALID [2020-07-11 02:32:00,997 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {180#true} {180#true} #46#return; {180#true} is VALID [2020-07-11 02:32:00,998 INFO L263 TraceCheckUtils]: 3: Hoare triple {180#true} call #t~ret0 := main(); {180#true} is VALID [2020-07-11 02:32:00,998 INFO L280 TraceCheckUtils]: 4: Hoare triple {180#true} havoc ~i~0; {180#true} is VALID [2020-07-11 02:32:00,998 INFO L280 TraceCheckUtils]: 5: Hoare triple {180#true} havoc ~j~0; {180#true} is VALID [2020-07-11 02:32:01,000 INFO L280 TraceCheckUtils]: 6: Hoare triple {180#true} ~i~0 := 1; {184#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:01,001 INFO L280 TraceCheckUtils]: 7: Hoare triple {184#(<= main_~i~0 1)} ~j~0 := 10; {185#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-11 02:32:01,002 INFO L280 TraceCheckUtils]: 8: Hoare triple {185#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~j~0 >= ~i~0); {185#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-11 02:32:01,004 INFO L280 TraceCheckUtils]: 9: Hoare triple {185#(<= (+ main_~i~0 9) main_~j~0)} ~i~0 := 2 + ~i~0; {186#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-11 02:32:01,005 INFO L280 TraceCheckUtils]: 10: Hoare triple {186#(<= (+ main_~i~0 7) main_~j~0)} ~j~0 := -1 + ~j~0; {187#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-11 02:32:01,007 INFO L280 TraceCheckUtils]: 11: Hoare triple {187#(<= (+ main_~i~0 6) main_~j~0)} assume !(~j~0 >= ~i~0); {181#false} is VALID [2020-07-11 02:32:01,007 INFO L263 TraceCheckUtils]: 12: Hoare triple {181#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {181#false} is VALID [2020-07-11 02:32:01,007 INFO L280 TraceCheckUtils]: 13: Hoare triple {181#false} ~cond := #in~cond; {181#false} is VALID [2020-07-11 02:32:01,008 INFO L280 TraceCheckUtils]: 14: Hoare triple {181#false} assume 0 == ~cond; {181#false} is VALID [2020-07-11 02:32:01,008 INFO L280 TraceCheckUtils]: 15: Hoare triple {181#false} assume !false; {181#false} is VALID [2020-07-11 02:32:01,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:32:01,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [397149286] [2020-07-11 02:32:01,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:01,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-11 02:32:01,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125901514] [2020-07-11 02:32:01,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-11 02:32:01,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:01,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 02:32:01,038 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:01,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 02:32:01,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:01,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 02:32:01,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-11 02:32:01,040 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2020-07-11 02:32:01,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:01,217 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-11 02:32:01,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 02:32:01,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-11 02:32:01,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:01,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:32:01,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-11 02:32:01,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:32:01,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-11 02:32:01,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2020-07-11 02:32:01,256 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:01,258 INFO L225 Difference]: With dead ends: 26 [2020-07-11 02:32:01,258 INFO L226 Difference]: Without dead ends: 21 [2020-07-11 02:32:01,260 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:32:01,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-11 02:32:01,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-07-11 02:32:01,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:01,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 20 states. [2020-07-11 02:32:01,284 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 20 states. [2020-07-11 02:32:01,284 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 20 states. [2020-07-11 02:32:01,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:01,286 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-11 02:32:01,286 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-11 02:32:01,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:01,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:01,287 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states. [2020-07-11 02:32:01,287 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states. [2020-07-11 02:32:01,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:01,290 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-11 02:32:01,290 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-11 02:32:01,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:01,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:01,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:01,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:01,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-11 02:32:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2020-07-11 02:32:01,294 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2020-07-11 02:32:01,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:01,294 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2020-07-11 02:32:01,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 02:32:01,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2020-07-11 02:32:01,320 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:01,320 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-11 02:32:01,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-11 02:32:01,321 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:01,321 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:01,322 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:32:01,322 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:01,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:01,323 INFO L82 PathProgramCache]: Analyzing trace with hash 113219123, now seen corresponding path program 2 times [2020-07-11 02:32:01,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:01,323 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1525116563] [2020-07-11 02:32:01,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:01,451 INFO L280 TraceCheckUtils]: 0: Hoare triple {326#true} assume true; {326#true} is VALID [2020-07-11 02:32:01,452 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {326#true} {326#true} #46#return; {326#true} is VALID [2020-07-11 02:32:01,452 INFO L263 TraceCheckUtils]: 0: Hoare triple {326#true} call ULTIMATE.init(); {326#true} is VALID [2020-07-11 02:32:01,452 INFO L280 TraceCheckUtils]: 1: Hoare triple {326#true} assume true; {326#true} is VALID [2020-07-11 02:32:01,453 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {326#true} {326#true} #46#return; {326#true} is VALID [2020-07-11 02:32:01,453 INFO L263 TraceCheckUtils]: 3: Hoare triple {326#true} call #t~ret0 := main(); {326#true} is VALID [2020-07-11 02:32:01,453 INFO L280 TraceCheckUtils]: 4: Hoare triple {326#true} havoc ~i~0; {326#true} is VALID [2020-07-11 02:32:01,454 INFO L280 TraceCheckUtils]: 5: Hoare triple {326#true} havoc ~j~0; {326#true} is VALID [2020-07-11 02:32:01,455 INFO L280 TraceCheckUtils]: 6: Hoare triple {326#true} ~i~0 := 1; {330#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:01,456 INFO L280 TraceCheckUtils]: 7: Hoare triple {330#(<= main_~i~0 1)} ~j~0 := 10; {331#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-11 02:32:01,457 INFO L280 TraceCheckUtils]: 8: Hoare triple {331#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~j~0 >= ~i~0); {331#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-11 02:32:01,458 INFO L280 TraceCheckUtils]: 9: Hoare triple {331#(<= (+ main_~i~0 9) main_~j~0)} ~i~0 := 2 + ~i~0; {332#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-11 02:32:01,459 INFO L280 TraceCheckUtils]: 10: Hoare triple {332#(<= (+ main_~i~0 7) main_~j~0)} ~j~0 := -1 + ~j~0; {333#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-11 02:32:01,461 INFO L280 TraceCheckUtils]: 11: Hoare triple {333#(<= (+ main_~i~0 6) main_~j~0)} assume !!(~j~0 >= ~i~0); {333#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-11 02:32:01,462 INFO L280 TraceCheckUtils]: 12: Hoare triple {333#(<= (+ main_~i~0 6) main_~j~0)} ~i~0 := 2 + ~i~0; {334#(<= (+ main_~i~0 4) main_~j~0)} is VALID [2020-07-11 02:32:01,464 INFO L280 TraceCheckUtils]: 13: Hoare triple {334#(<= (+ main_~i~0 4) main_~j~0)} ~j~0 := -1 + ~j~0; {335#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-11 02:32:01,465 INFO L280 TraceCheckUtils]: 14: Hoare triple {335#(<= (+ main_~i~0 3) main_~j~0)} assume !(~j~0 >= ~i~0); {327#false} is VALID [2020-07-11 02:32:01,465 INFO L263 TraceCheckUtils]: 15: Hoare triple {327#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {327#false} is VALID [2020-07-11 02:32:01,466 INFO L280 TraceCheckUtils]: 16: Hoare triple {327#false} ~cond := #in~cond; {327#false} is VALID [2020-07-11 02:32:01,466 INFO L280 TraceCheckUtils]: 17: Hoare triple {327#false} assume 0 == ~cond; {327#false} is VALID [2020-07-11 02:32:01,466 INFO L280 TraceCheckUtils]: 18: Hoare triple {327#false} assume !false; {327#false} is VALID [2020-07-11 02:32:01,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:32:01,468 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1525116563] [2020-07-11 02:32:01,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:01,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-11 02:32:01,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935121863] [2020-07-11 02:32:01,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-07-11 02:32:01,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:01,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 02:32:01,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:01,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 02:32:01,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:01,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 02:32:01,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-11 02:32:01,497 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 8 states. [2020-07-11 02:32:01,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:01,699 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2020-07-11 02:32:01,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 02:32:01,700 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-07-11 02:32:01,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:01,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:32:01,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-11 02:32:01,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:32:01,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-11 02:32:01,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2020-07-11 02:32:01,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:01,745 INFO L225 Difference]: With dead ends: 29 [2020-07-11 02:32:01,745 INFO L226 Difference]: Without dead ends: 24 [2020-07-11 02:32:01,746 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-07-11 02:32:01,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-11 02:32:01,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-11 02:32:01,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:01,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2020-07-11 02:32:01,773 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2020-07-11 02:32:01,773 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2020-07-11 02:32:01,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:01,776 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-07-11 02:32:01,776 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2020-07-11 02:32:01,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:01,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:01,777 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2020-07-11 02:32:01,777 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2020-07-11 02:32:01,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:01,780 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-07-11 02:32:01,780 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2020-07-11 02:32:01,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:01,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:01,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:01,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:01,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-11 02:32:01,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2020-07-11 02:32:01,783 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2020-07-11 02:32:01,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:01,783 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2020-07-11 02:32:01,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 02:32:01,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2020-07-11 02:32:01,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:01,816 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2020-07-11 02:32:01,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-11 02:32:01,817 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:01,817 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:01,817 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:32:01,817 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:01,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:01,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1401469543, now seen corresponding path program 3 times [2020-07-11 02:32:01,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:01,819 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [564030238] [2020-07-11 02:32:01,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:01,997 INFO L280 TraceCheckUtils]: 0: Hoare triple {492#true} assume true; {492#true} is VALID [2020-07-11 02:32:01,998 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {492#true} {492#true} #46#return; {492#true} is VALID [2020-07-11 02:32:01,998 INFO L263 TraceCheckUtils]: 0: Hoare triple {492#true} call ULTIMATE.init(); {492#true} is VALID [2020-07-11 02:32:01,999 INFO L280 TraceCheckUtils]: 1: Hoare triple {492#true} assume true; {492#true} is VALID [2020-07-11 02:32:01,999 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {492#true} {492#true} #46#return; {492#true} is VALID [2020-07-11 02:32:01,999 INFO L263 TraceCheckUtils]: 3: Hoare triple {492#true} call #t~ret0 := main(); {492#true} is VALID [2020-07-11 02:32:02,000 INFO L280 TraceCheckUtils]: 4: Hoare triple {492#true} havoc ~i~0; {492#true} is VALID [2020-07-11 02:32:02,000 INFO L280 TraceCheckUtils]: 5: Hoare triple {492#true} havoc ~j~0; {492#true} is VALID [2020-07-11 02:32:02,002 INFO L280 TraceCheckUtils]: 6: Hoare triple {492#true} ~i~0 := 1; {496#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:02,003 INFO L280 TraceCheckUtils]: 7: Hoare triple {496#(<= main_~i~0 1)} ~j~0 := 10; {497#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-11 02:32:02,004 INFO L280 TraceCheckUtils]: 8: Hoare triple {497#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~j~0 >= ~i~0); {497#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-11 02:32:02,005 INFO L280 TraceCheckUtils]: 9: Hoare triple {497#(<= (+ main_~i~0 9) main_~j~0)} ~i~0 := 2 + ~i~0; {498#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-11 02:32:02,006 INFO L280 TraceCheckUtils]: 10: Hoare triple {498#(<= (+ main_~i~0 7) main_~j~0)} ~j~0 := -1 + ~j~0; {499#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-11 02:32:02,007 INFO L280 TraceCheckUtils]: 11: Hoare triple {499#(<= (+ main_~i~0 6) main_~j~0)} assume !!(~j~0 >= ~i~0); {499#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-11 02:32:02,008 INFO L280 TraceCheckUtils]: 12: Hoare triple {499#(<= (+ main_~i~0 6) main_~j~0)} ~i~0 := 2 + ~i~0; {500#(<= (+ main_~i~0 4) main_~j~0)} is VALID [2020-07-11 02:32:02,009 INFO L280 TraceCheckUtils]: 13: Hoare triple {500#(<= (+ main_~i~0 4) main_~j~0)} ~j~0 := -1 + ~j~0; {501#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-11 02:32:02,011 INFO L280 TraceCheckUtils]: 14: Hoare triple {501#(<= (+ main_~i~0 3) main_~j~0)} assume !!(~j~0 >= ~i~0); {501#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-11 02:32:02,012 INFO L280 TraceCheckUtils]: 15: Hoare triple {501#(<= (+ main_~i~0 3) main_~j~0)} ~i~0 := 2 + ~i~0; {502#(<= (+ main_~i~0 1) main_~j~0)} is VALID [2020-07-11 02:32:02,013 INFO L280 TraceCheckUtils]: 16: Hoare triple {502#(<= (+ main_~i~0 1) main_~j~0)} ~j~0 := -1 + ~j~0; {503#(<= main_~i~0 main_~j~0)} is VALID [2020-07-11 02:32:02,014 INFO L280 TraceCheckUtils]: 17: Hoare triple {503#(<= main_~i~0 main_~j~0)} assume !(~j~0 >= ~i~0); {493#false} is VALID [2020-07-11 02:32:02,014 INFO L263 TraceCheckUtils]: 18: Hoare triple {493#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {493#false} is VALID [2020-07-11 02:32:02,014 INFO L280 TraceCheckUtils]: 19: Hoare triple {493#false} ~cond := #in~cond; {493#false} is VALID [2020-07-11 02:32:02,015 INFO L280 TraceCheckUtils]: 20: Hoare triple {493#false} assume 0 == ~cond; {493#false} is VALID [2020-07-11 02:32:02,015 INFO L280 TraceCheckUtils]: 21: Hoare triple {493#false} assume !false; {493#false} is VALID [2020-07-11 02:32:02,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:32:02,017 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [564030238] [2020-07-11 02:32:02,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:02,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-11 02:32:02,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226034904] [2020-07-11 02:32:02,019 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-07-11 02:32:02,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:02,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 02:32:02,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:02,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 02:32:02,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:02,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 02:32:02,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-07-11 02:32:02,055 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 10 states. [2020-07-11 02:32:02,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:02,318 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-11 02:32:02,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 02:32:02,319 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-07-11 02:32:02,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:02,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 02:32:02,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2020-07-11 02:32:02,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 02:32:02,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2020-07-11 02:32:02,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 31 transitions. [2020-07-11 02:32:02,365 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-11 02:32:02,367 INFO L225 Difference]: With dead ends: 31 [2020-07-11 02:32:02,367 INFO L226 Difference]: Without dead ends: 26 [2020-07-11 02:32:02,368 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-07-11 02:32:02,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-11 02:32:02,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-11 02:32:02,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:02,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-11 02:32:02,395 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-11 02:32:02,395 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-11 02:32:02,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:02,397 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-11 02:32:02,398 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-11 02:32:02,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:02,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:02,398 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-11 02:32:02,399 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-11 02:32:02,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:02,401 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-11 02:32:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-11 02:32:02,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:02,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:02,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:02,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:02,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-11 02:32:02,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2020-07-11 02:32:02,404 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 22 [2020-07-11 02:32:02,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:02,405 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2020-07-11 02:32:02,405 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 02:32:02,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2020-07-11 02:32:02,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-11 02:32:02,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-11 02:32:02,437 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:02,438 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:02,438 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 02:32:02,438 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:02,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:02,439 INFO L82 PathProgramCache]: Analyzing trace with hash -158025293, now seen corresponding path program 4 times [2020-07-11 02:32:02,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:02,439 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [385107850] [2020-07-11 02:32:02,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:02,693 INFO L280 TraceCheckUtils]: 0: Hoare triple {674#true} assume true; {674#true} is VALID [2020-07-11 02:32:02,693 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {674#true} {674#true} #46#return; {674#true} is VALID [2020-07-11 02:32:02,694 INFO L263 TraceCheckUtils]: 0: Hoare triple {674#true} call ULTIMATE.init(); {674#true} is VALID [2020-07-11 02:32:02,694 INFO L280 TraceCheckUtils]: 1: Hoare triple {674#true} assume true; {674#true} is VALID [2020-07-11 02:32:02,694 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {674#true} {674#true} #46#return; {674#true} is VALID [2020-07-11 02:32:02,695 INFO L263 TraceCheckUtils]: 3: Hoare triple {674#true} call #t~ret0 := main(); {674#true} is VALID [2020-07-11 02:32:02,695 INFO L280 TraceCheckUtils]: 4: Hoare triple {674#true} havoc ~i~0; {674#true} is VALID [2020-07-11 02:32:02,695 INFO L280 TraceCheckUtils]: 5: Hoare triple {674#true} havoc ~j~0; {674#true} is VALID [2020-07-11 02:32:02,695 INFO L280 TraceCheckUtils]: 6: Hoare triple {674#true} ~i~0 := 1; {674#true} is VALID [2020-07-11 02:32:02,697 INFO L280 TraceCheckUtils]: 7: Hoare triple {674#true} ~j~0 := 10; {678#(and (<= main_~j~0 10) (<= 10 main_~j~0))} is VALID [2020-07-11 02:32:02,698 INFO L280 TraceCheckUtils]: 8: Hoare triple {678#(and (<= main_~j~0 10) (<= 10 main_~j~0))} assume !!(~j~0 >= ~i~0); {678#(and (<= main_~j~0 10) (<= 10 main_~j~0))} is VALID [2020-07-11 02:32:02,699 INFO L280 TraceCheckUtils]: 9: Hoare triple {678#(and (<= main_~j~0 10) (<= 10 main_~j~0))} ~i~0 := 2 + ~i~0; {678#(and (<= main_~j~0 10) (<= 10 main_~j~0))} is VALID [2020-07-11 02:32:02,700 INFO L280 TraceCheckUtils]: 10: Hoare triple {678#(and (<= main_~j~0 10) (<= 10 main_~j~0))} ~j~0 := -1 + ~j~0; {679#(and (<= 9 main_~j~0) (<= main_~j~0 9))} is VALID [2020-07-11 02:32:02,701 INFO L280 TraceCheckUtils]: 11: Hoare triple {679#(and (<= 9 main_~j~0) (<= main_~j~0 9))} assume !!(~j~0 >= ~i~0); {679#(and (<= 9 main_~j~0) (<= main_~j~0 9))} is VALID [2020-07-11 02:32:02,702 INFO L280 TraceCheckUtils]: 12: Hoare triple {679#(and (<= 9 main_~j~0) (<= main_~j~0 9))} ~i~0 := 2 + ~i~0; {679#(and (<= 9 main_~j~0) (<= main_~j~0 9))} is VALID [2020-07-11 02:32:02,703 INFO L280 TraceCheckUtils]: 13: Hoare triple {679#(and (<= 9 main_~j~0) (<= main_~j~0 9))} ~j~0 := -1 + ~j~0; {680#(and (<= main_~j~0 8) (<= 8 main_~j~0))} is VALID [2020-07-11 02:32:02,704 INFO L280 TraceCheckUtils]: 14: Hoare triple {680#(and (<= main_~j~0 8) (<= 8 main_~j~0))} assume !!(~j~0 >= ~i~0); {680#(and (<= main_~j~0 8) (<= 8 main_~j~0))} is VALID [2020-07-11 02:32:02,705 INFO L280 TraceCheckUtils]: 15: Hoare triple {680#(and (<= main_~j~0 8) (<= 8 main_~j~0))} ~i~0 := 2 + ~i~0; {680#(and (<= main_~j~0 8) (<= 8 main_~j~0))} is VALID [2020-07-11 02:32:02,706 INFO L280 TraceCheckUtils]: 16: Hoare triple {680#(and (<= main_~j~0 8) (<= 8 main_~j~0))} ~j~0 := -1 + ~j~0; {681#(and (<= main_~j~0 7) (<= 7 main_~j~0))} is VALID [2020-07-11 02:32:02,707 INFO L280 TraceCheckUtils]: 17: Hoare triple {681#(and (<= main_~j~0 7) (<= 7 main_~j~0))} assume !!(~j~0 >= ~i~0); {681#(and (<= main_~j~0 7) (<= 7 main_~j~0))} is VALID [2020-07-11 02:32:02,708 INFO L280 TraceCheckUtils]: 18: Hoare triple {681#(and (<= main_~j~0 7) (<= 7 main_~j~0))} ~i~0 := 2 + ~i~0; {681#(and (<= main_~j~0 7) (<= 7 main_~j~0))} is VALID [2020-07-11 02:32:02,710 INFO L280 TraceCheckUtils]: 19: Hoare triple {681#(and (<= main_~j~0 7) (<= 7 main_~j~0))} ~j~0 := -1 + ~j~0; {682#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2020-07-11 02:32:02,711 INFO L280 TraceCheckUtils]: 20: Hoare triple {682#(and (<= main_~j~0 6) (< 5 main_~j~0))} assume !(~j~0 >= ~i~0); {682#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2020-07-11 02:32:02,712 INFO L263 TraceCheckUtils]: 21: Hoare triple {682#(and (<= main_~j~0 6) (< 5 main_~j~0))} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {683#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:32:02,713 INFO L280 TraceCheckUtils]: 22: Hoare triple {683#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {684#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:32:02,714 INFO L280 TraceCheckUtils]: 23: Hoare triple {684#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {675#false} is VALID [2020-07-11 02:32:02,714 INFO L280 TraceCheckUtils]: 24: Hoare triple {675#false} assume !false; {675#false} is VALID [2020-07-11 02:32:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:32:02,717 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [385107850] [2020-07-11 02:32:02,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:02,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-11 02:32:02,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208269409] [2020-07-11 02:32:02,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-11 02:32:02,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:02,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-11 02:32:02,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:02,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-11 02:32:02,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:02,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-11 02:32:02,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-07-11 02:32:02,749 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 9 states. [2020-07-11 02:32:03,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:03,121 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2020-07-11 02:32:03,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 02:32:03,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-11 02:32:03,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:32:03,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2020-07-11 02:32:03,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:32:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2020-07-11 02:32:03,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 36 transitions. [2020-07-11 02:32:03,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:03,167 INFO L225 Difference]: With dead ends: 36 [2020-07-11 02:32:03,168 INFO L226 Difference]: Without dead ends: 31 [2020-07-11 02:32:03,169 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-11 02:32:03,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-11 02:32:03,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2020-07-11 02:32:03,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:03,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 29 states. [2020-07-11 02:32:03,215 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 29 states. [2020-07-11 02:32:03,216 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 29 states. [2020-07-11 02:32:03,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:03,219 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-11 02:32:03,219 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-11 02:32:03,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:03,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:03,220 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 31 states. [2020-07-11 02:32:03,220 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 31 states. [2020-07-11 02:32:03,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:03,223 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-11 02:32:03,223 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-11 02:32:03,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:03,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:03,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:03,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:03,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-11 02:32:03,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2020-07-11 02:32:03,226 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2020-07-11 02:32:03,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:03,226 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2020-07-11 02:32:03,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-11 02:32:03,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2020-07-11 02:32:03,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:03,292 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2020-07-11 02:32:03,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-11 02:32:03,293 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:03,293 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:03,293 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 02:32:03,293 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:03,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:03,294 INFO L82 PathProgramCache]: Analyzing trace with hash -407443737, now seen corresponding path program 5 times [2020-07-11 02:32:03,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:03,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [20207268] [2020-07-11 02:32:03,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:03,515 INFO L280 TraceCheckUtils]: 0: Hoare triple {881#true} assume true; {881#true} is VALID [2020-07-11 02:32:03,516 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {881#true} {881#true} #46#return; {881#true} is VALID [2020-07-11 02:32:03,516 INFO L263 TraceCheckUtils]: 0: Hoare triple {881#true} call ULTIMATE.init(); {881#true} is VALID [2020-07-11 02:32:03,516 INFO L280 TraceCheckUtils]: 1: Hoare triple {881#true} assume true; {881#true} is VALID [2020-07-11 02:32:03,517 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {881#true} {881#true} #46#return; {881#true} is VALID [2020-07-11 02:32:03,517 INFO L263 TraceCheckUtils]: 3: Hoare triple {881#true} call #t~ret0 := main(); {881#true} is VALID [2020-07-11 02:32:03,517 INFO L280 TraceCheckUtils]: 4: Hoare triple {881#true} havoc ~i~0; {881#true} is VALID [2020-07-11 02:32:03,518 INFO L280 TraceCheckUtils]: 5: Hoare triple {881#true} havoc ~j~0; {881#true} is VALID [2020-07-11 02:32:03,519 INFO L280 TraceCheckUtils]: 6: Hoare triple {881#true} ~i~0 := 1; {885#(<= 1 main_~i~0)} is VALID [2020-07-11 02:32:03,520 INFO L280 TraceCheckUtils]: 7: Hoare triple {885#(<= 1 main_~i~0)} ~j~0 := 10; {886#(<= main_~j~0 (+ main_~i~0 9))} is VALID [2020-07-11 02:32:03,521 INFO L280 TraceCheckUtils]: 8: Hoare triple {886#(<= main_~j~0 (+ main_~i~0 9))} assume !!(~j~0 >= ~i~0); {886#(<= main_~j~0 (+ main_~i~0 9))} is VALID [2020-07-11 02:32:03,522 INFO L280 TraceCheckUtils]: 9: Hoare triple {886#(<= main_~j~0 (+ main_~i~0 9))} ~i~0 := 2 + ~i~0; {887#(<= main_~j~0 (+ main_~i~0 7))} is VALID [2020-07-11 02:32:03,524 INFO L280 TraceCheckUtils]: 10: Hoare triple {887#(<= main_~j~0 (+ main_~i~0 7))} ~j~0 := -1 + ~j~0; {888#(<= main_~j~0 (+ main_~i~0 6))} is VALID [2020-07-11 02:32:03,524 INFO L280 TraceCheckUtils]: 11: Hoare triple {888#(<= main_~j~0 (+ main_~i~0 6))} assume !!(~j~0 >= ~i~0); {888#(<= main_~j~0 (+ main_~i~0 6))} is VALID [2020-07-11 02:32:03,526 INFO L280 TraceCheckUtils]: 12: Hoare triple {888#(<= main_~j~0 (+ main_~i~0 6))} ~i~0 := 2 + ~i~0; {889#(<= main_~j~0 (+ main_~i~0 4))} is VALID [2020-07-11 02:32:03,527 INFO L280 TraceCheckUtils]: 13: Hoare triple {889#(<= main_~j~0 (+ main_~i~0 4))} ~j~0 := -1 + ~j~0; {890#(<= main_~j~0 (+ main_~i~0 3))} is VALID [2020-07-11 02:32:03,551 INFO L280 TraceCheckUtils]: 14: Hoare triple {890#(<= main_~j~0 (+ main_~i~0 3))} assume !!(~j~0 >= ~i~0); {890#(<= main_~j~0 (+ main_~i~0 3))} is VALID [2020-07-11 02:32:03,554 INFO L280 TraceCheckUtils]: 15: Hoare triple {890#(<= main_~j~0 (+ main_~i~0 3))} ~i~0 := 2 + ~i~0; {891#(<= main_~j~0 (+ main_~i~0 1))} is VALID [2020-07-11 02:32:03,555 INFO L280 TraceCheckUtils]: 16: Hoare triple {891#(<= main_~j~0 (+ main_~i~0 1))} ~j~0 := -1 + ~j~0; {892#(<= main_~j~0 main_~i~0)} is VALID [2020-07-11 02:32:03,556 INFO L280 TraceCheckUtils]: 17: Hoare triple {892#(<= main_~j~0 main_~i~0)} assume !!(~j~0 >= ~i~0); {892#(<= main_~j~0 main_~i~0)} is VALID [2020-07-11 02:32:03,566 INFO L280 TraceCheckUtils]: 18: Hoare triple {892#(<= main_~j~0 main_~i~0)} ~i~0 := 2 + ~i~0; {893#(<= (+ main_~j~0 2) main_~i~0)} is VALID [2020-07-11 02:32:03,567 INFO L280 TraceCheckUtils]: 19: Hoare triple {893#(<= (+ main_~j~0 2) main_~i~0)} ~j~0 := -1 + ~j~0; {894#(<= (+ main_~j~0 3) main_~i~0)} is VALID [2020-07-11 02:32:03,568 INFO L280 TraceCheckUtils]: 20: Hoare triple {894#(<= (+ main_~j~0 3) main_~i~0)} assume !!(~j~0 >= ~i~0); {882#false} is VALID [2020-07-11 02:32:03,569 INFO L280 TraceCheckUtils]: 21: Hoare triple {882#false} ~i~0 := 2 + ~i~0; {882#false} is VALID [2020-07-11 02:32:03,569 INFO L280 TraceCheckUtils]: 22: Hoare triple {882#false} ~j~0 := -1 + ~j~0; {882#false} is VALID [2020-07-11 02:32:03,569 INFO L280 TraceCheckUtils]: 23: Hoare triple {882#false} assume !(~j~0 >= ~i~0); {882#false} is VALID [2020-07-11 02:32:03,569 INFO L263 TraceCheckUtils]: 24: Hoare triple {882#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {882#false} is VALID [2020-07-11 02:32:03,570 INFO L280 TraceCheckUtils]: 25: Hoare triple {882#false} ~cond := #in~cond; {882#false} is VALID [2020-07-11 02:32:03,570 INFO L280 TraceCheckUtils]: 26: Hoare triple {882#false} assume 0 == ~cond; {882#false} is VALID [2020-07-11 02:32:03,574 INFO L280 TraceCheckUtils]: 27: Hoare triple {882#false} assume !false; {882#false} is VALID [2020-07-11 02:32:03,576 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:32:03,576 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [20207268] [2020-07-11 02:32:03,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:32:03,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-11 02:32:03,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840905983] [2020-07-11 02:32:03,580 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-07-11 02:32:03,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:03,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-11 02:32:03,618 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:03,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-11 02:32:03,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:03,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-11 02:32:03,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-07-11 02:32:03,620 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2020-07-11 02:32:03,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:03,895 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2020-07-11 02:32:03,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 02:32:03,895 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-07-11 02:32:03,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:03,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 02:32:03,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2020-07-11 02:32:03,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 02:32:03,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2020-07-11 02:32:03,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 29 transitions. [2020-07-11 02:32:03,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:03,931 INFO L225 Difference]: With dead ends: 29 [2020-07-11 02:32:03,931 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 02:32:03,932 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2020-07-11 02:32:03,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 02:32:03,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 02:32:03,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:03,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:03,933 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:03,933 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:03,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:03,934 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:32:03,934 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:32:03,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:03,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:03,934 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:03,935 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:03,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:03,935 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:32:03,935 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:32:03,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:03,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:03,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:03,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:03,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 02:32:03,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 02:32:03,937 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2020-07-11 02:32:03,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:03,937 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 02:32:03,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-11 02:32:03,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 02:32:03,937 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:03,937 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:32:03,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:03,938 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 02:32:03,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 02:32:04,157 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2020-07-11 02:32:04,418 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:32:04,418 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:32:04,418 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:32:04,418 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 02:32:04,419 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 02:32:04,419 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:32:04,419 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:32:04,419 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:32:04,419 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-11 02:32:04,419 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-11 02:32:04,419 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:32:04,420 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 23) the Hoare annotation is: true [2020-07-11 02:32:04,420 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 23) the Hoare annotation is: true [2020-07-11 02:32:04,420 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-11 02:32:04,420 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (or (and (<= main_~j~0 7) (<= 7 main_~j~0) (<= (+ main_~j~0 2) main_~i~0)) (let ((.cse0 (+ main_~i~0 7))) (and (<= main_~j~0 10) (<= 10 main_~j~0) (<= main_~j~0 .cse0) (<= .cse0 main_~j~0))) (let ((.cse1 (+ main_~i~0 1))) (and (<= main_~j~0 8) (<= main_~j~0 .cse1) (<= 8 main_~j~0) (<= .cse1 main_~j~0))) (let ((.cse2 (+ main_~i~0 4))) (and (<= 9 main_~j~0) (<= .cse2 main_~j~0) (<= main_~j~0 .cse2) (<= main_~j~0 9)))) [2020-07-11 02:32:04,420 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 3))) (and (<= .cse0 main_~j~0) (<= main_~j~0 8) (<= main_~j~0 .cse0) (<= 8 main_~j~0))) (and (<= main_~j~0 7) (<= 7 main_~j~0) (<= main_~j~0 main_~i~0) (<= main_~i~0 main_~j~0)) (let ((.cse1 (+ main_~i~0 6))) (and (<= 9 main_~j~0) (<= .cse1 main_~j~0) (<= main_~j~0 .cse1) (<= main_~j~0 9))) (let ((.cse2 (+ main_~i~0 9))) (and (<= .cse2 main_~j~0) (<= main_~i~0 1) (<= main_~j~0 .cse2) (<= 1 main_~i~0)))) [2020-07-11 02:32:04,421 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= main_~i~0 1) (<= 1 main_~i~0)) [2020-07-11 02:32:04,421 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-11 02:32:04,421 INFO L264 CegarLoopResult]: At program point L17-2(lines 17 20) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 3))) (and (<= .cse0 main_~j~0) (<= main_~j~0 8) (<= main_~j~0 .cse0) (<= 8 main_~j~0))) (and (<= main_~j~0 6) (<= (+ main_~j~0 3) main_~i~0) (< 5 main_~j~0)) (and (<= main_~j~0 7) (<= 7 main_~j~0) (<= main_~j~0 main_~i~0) (<= main_~i~0 main_~j~0)) (let ((.cse1 (+ main_~i~0 6))) (and (<= 9 main_~j~0) (<= .cse1 main_~j~0) (<= main_~j~0 .cse1) (<= main_~j~0 9))) (let ((.cse2 (+ main_~i~0 9))) (and (<= .cse2 main_~j~0) (<= main_~i~0 1) (<= main_~j~0 .cse2) (<= 1 main_~i~0)))) [2020-07-11 02:32:04,421 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-11 02:32:04,421 INFO L264 CegarLoopResult]: At program point L17-3(lines 17 20) the Hoare annotation is: (and (<= main_~j~0 6) (< 5 main_~j~0)) [2020-07-11 02:32:04,422 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 23) the Hoare annotation is: true [2020-07-11 02:32:04,422 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-11 02:32:04,422 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: true [2020-07-11 02:32:04,422 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:32:04,422 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:32:04,422 INFO L271 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2020-07-11 02:32:04,422 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:32:04,427 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-11 02:32:04,430 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:32:04,430 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:32:04,431 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-11 02:32:04,431 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-11 02:32:04,440 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 02:32:04,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:32:04 BoogieIcfgContainer [2020-07-11 02:32:04,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:32:04,459 INFO L168 Benchmark]: Toolchain (without parser) took 5576.37 ms. Allocated memory was 142.6 MB in the beginning and 289.4 MB in the end (delta: 146.8 MB). Free memory was 101.2 MB in the beginning and 249.6 MB in the end (delta: -148.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 02:32:04,460 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 142.6 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 02:32:04,461 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.61 ms. Allocated memory is still 142.6 MB. Free memory was 101.0 MB in the beginning and 91.0 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:04,462 INFO L168 Benchmark]: Boogie Preprocessor took 48.37 ms. Allocated memory is still 142.6 MB. Free memory was 91.0 MB in the beginning and 89.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:04,463 INFO L168 Benchmark]: RCFGBuilder took 565.98 ms. Allocated memory was 142.6 MB in the beginning and 201.9 MB in the end (delta: 59.2 MB). Free memory was 89.5 MB in the beginning and 166.0 MB in the end (delta: -76.5 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:04,464 INFO L168 Benchmark]: TraceAbstraction took 4653.46 ms. Allocated memory was 201.9 MB in the beginning and 289.4 MB in the end (delta: 87.6 MB). Free memory was 165.3 MB in the beginning and 249.6 MB in the end (delta: -84.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:04,468 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.15 ms. Allocated memory is still 142.6 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 298.61 ms. Allocated memory is still 142.6 MB. Free memory was 101.0 MB in the beginning and 91.0 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.37 ms. Allocated memory is still 142.6 MB. Free memory was 91.0 MB in the beginning and 89.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 565.98 ms. Allocated memory was 142.6 MB in the beginning and 201.9 MB in the end (delta: 59.2 MB). Free memory was 89.5 MB in the beginning and 166.0 MB in the end (delta: -76.5 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4653.46 ms. Allocated memory was 201.9 MB in the beginning and 289.4 MB in the end (delta: 87.6 MB). Free memory was 165.3 MB in the beginning and 249.6 MB in the end (delta: -84.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((i + 3 <= j && j <= 8) && j <= i + 3) && 8 <= j) || ((j <= 6 && j + 3 <= i) && 5 < j)) || (((j <= 7 && 7 <= j) && j <= i) && i <= j)) || (((9 <= j && i + 6 <= j) && j <= i + 6) && j <= 9)) || (((i + 9 <= j && i <= 1) && j <= i + 9) && 1 <= i) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.0s, OverallIterations: 6, TraceHistogramMax: 5, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 84 SDtfs, 26 SDslu, 283 SDs, 0 SdLazy, 267 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 5 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 53 PreInvPairs, 82 NumberOfFragments, 249 HoareAnnotationTreeSize, 53 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 50 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 7671 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 35/75 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...