/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/sum_10x0-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:43:06,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:43:06,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:43:06,636 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:43:06,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:43:06,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:43:06,644 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:43:06,652 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:43:06,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:43:06,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:43:06,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:43:06,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:43:06,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:43:06,667 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:43:06,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:43:06,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:43:06,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:43:06,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:43:06,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:43:06,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:43:06,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:43:06,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:43:06,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:43:06,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:43:06,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:43:06,710 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:43:06,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:43:06,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:43:06,726 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:43:06,727 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:43:06,727 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:43:06,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:43:06,729 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:43:06,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:43:06,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:43:06,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:43:06,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:43:06,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:43:06,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:43:06,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:43:06,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:43:06,735 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 00:43:06,748 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:43:06,749 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:43:06,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:43:06,751 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:43:06,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:43:06,751 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:43:06,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:43:06,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:43:06,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:43:06,752 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:43:06,752 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:43:06,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:43:06,753 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:43:06,753 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:43:06,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:43:06,753 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:43:06,754 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:43:06,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:43:06,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:43:06,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:43:06,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:43:06,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:43:06,755 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-07 00:43:07,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:43:07,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:43:07,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:43:07,161 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:43:07,161 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:43:07,162 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_10x0-1.c [2020-11-07 00:43:07,246 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99d9fc7aa/4a6ab56b98ca4484a38f0772ae88339e/FLAG4605cbcf3 [2020-11-07 00:43:07,934 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:43:07,935 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_10x0-1.c [2020-11-07 00:43:07,942 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99d9fc7aa/4a6ab56b98ca4484a38f0772ae88339e/FLAG4605cbcf3 [2020-11-07 00:43:08,283 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99d9fc7aa/4a6ab56b98ca4484a38f0772ae88339e [2020-11-07 00:43:08,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:43:08,299 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:43:08,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:43:08,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:43:08,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:43:08,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:43:08" (1/1) ... [2020-11-07 00:43:08,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b33cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:08, skipping insertion in model container [2020-11-07 00:43:08,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:43:08" (1/1) ... [2020-11-07 00:43:08,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:43:08,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:43:08,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:43:08,510 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:43:08,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:43:08,544 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:43:08,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:08 WrapperNode [2020-11-07 00:43:08,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:43:08,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:43:08,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:43:08,547 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:43:08,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:08" (1/1) ... [2020-11-07 00:43:08,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:08" (1/1) ... [2020-11-07 00:43:08,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:08" (1/1) ... [2020-11-07 00:43:08,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:08" (1/1) ... [2020-11-07 00:43:08,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:08" (1/1) ... [2020-11-07 00:43:08,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:08" (1/1) ... [2020-11-07 00:43:08,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:08" (1/1) ... [2020-11-07 00:43:08,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:43:08,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:43:08,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:43:08,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:43:08,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:08" (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-11-07 00:43:08,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:43:08,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:43:08,670 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:43:08,670 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-11-07 00:43:08,670 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:43:08,671 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:43:08,671 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:43:08,671 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:43:08,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:43:08,671 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-11-07 00:43:08,672 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:43:08,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:43:08,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:43:08,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:43:08,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:43:08,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:43:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:43:09,065 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:43:09,066 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:43:09,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:43:09 BoogieIcfgContainer [2020-11-07 00:43:09,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:43:09,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:43:09,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:43:09,074 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:43:09,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:43:08" (1/3) ... [2020-11-07 00:43:09,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36444837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:43:09, skipping insertion in model container [2020-11-07 00:43:09,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:08" (2/3) ... [2020-11-07 00:43:09,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36444837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:43:09, skipping insertion in model container [2020-11-07 00:43:09,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:43:09" (3/3) ... [2020-11-07 00:43:09,078 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_10x0-1.c [2020-11-07 00:43:09,097 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:43:09,101 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:43:09,116 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:43:09,156 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:43:09,157 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:43:09,157 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:43:09,157 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:43:09,157 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:43:09,158 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:43:09,158 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:43:09,158 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:43:09,176 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-11-07 00:43:09,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-07 00:43:09,187 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:09,188 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:09,189 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:09,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:09,196 INFO L82 PathProgramCache]: Analyzing trace with hash -342472451, now seen corresponding path program 1 times [2020-11-07 00:43:09,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:09,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1130058024] [2020-11-07 00:43:09,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:09,291 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:09,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:09,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:43:09,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1130058024] [2020-11-07 00:43:09,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:09,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:43:09,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311221413] [2020-11-07 00:43:09,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:43:09,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:09,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:43:09,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:43:09,641 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 6 states. [2020-11-07 00:43:10,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:10,162 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-11-07 00:43:10,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:43:10,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-11-07 00:43:10,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:10,175 INFO L225 Difference]: With dead ends: 52 [2020-11-07 00:43:10,176 INFO L226 Difference]: Without dead ends: 34 [2020-11-07 00:43:10,180 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:43:10,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-11-07 00:43:10,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-11-07 00:43:10,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-07 00:43:10,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2020-11-07 00:43:10,237 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 27 [2020-11-07 00:43:10,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:10,238 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2020-11-07 00:43:10,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:43:10,238 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-11-07 00:43:10,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-07 00:43:10,241 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:10,241 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:10,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:43:10,242 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:10,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:10,243 INFO L82 PathProgramCache]: Analyzing trace with hash 653425116, now seen corresponding path program 1 times [2020-11-07 00:43:10,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:10,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [562094468] [2020-11-07 00:43:10,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:10,248 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:10,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:10,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:10,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:10,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-07 00:43:10,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [562094468] [2020-11-07 00:43:10,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:10,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:43:10,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103777646] [2020-11-07 00:43:10,434 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:43:10,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:10,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:43:10,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:43:10,436 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 7 states. [2020-11-07 00:43:10,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:10,719 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-11-07 00:43:10,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:43:10,720 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-11-07 00:43:10,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:10,722 INFO L225 Difference]: With dead ends: 46 [2020-11-07 00:43:10,722 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 00:43:10,724 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:43:10,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 00:43:10,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-07 00:43:10,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 00:43:10,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-11-07 00:43:10,739 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2020-11-07 00:43:10,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:10,739 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-11-07 00:43:10,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:43:10,739 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-11-07 00:43:10,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-07 00:43:10,742 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:10,742 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:10,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:43:10,742 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:10,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:10,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1221623283, now seen corresponding path program 2 times [2020-11-07 00:43:10,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:10,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [605756249] [2020-11-07 00:43:10,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:10,747 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:10,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:10,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:10,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:10,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-07 00:43:11,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [605756249] [2020-11-07 00:43:11,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:11,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:43:11,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082378474] [2020-11-07 00:43:11,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:43:11,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:11,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:43:11,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:43:11,006 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 8 states. [2020-11-07 00:43:11,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:11,322 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-11-07 00:43:11,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:43:11,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-11-07 00:43:11,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:11,325 INFO L225 Difference]: With dead ends: 51 [2020-11-07 00:43:11,325 INFO L226 Difference]: Without dead ends: 44 [2020-11-07 00:43:11,326 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:43:11,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-11-07 00:43:11,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-11-07 00:43:11,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-11-07 00:43:11,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2020-11-07 00:43:11,343 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 45 [2020-11-07 00:43:11,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:11,343 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2020-11-07 00:43:11,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:43:11,344 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-11-07 00:43:11,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-07 00:43:11,345 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:11,346 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:11,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:43:11,346 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:11,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:11,347 INFO L82 PathProgramCache]: Analyzing trace with hash 942298982, now seen corresponding path program 3 times [2020-11-07 00:43:11,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:11,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [281360993] [2020-11-07 00:43:11,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:11,351 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:11,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:11,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:11,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:11,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:11,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:11,569 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-11-07 00:43:11,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [281360993] [2020-11-07 00:43:11,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:11,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:43:11,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677556371] [2020-11-07 00:43:11,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:43:11,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:11,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:43:11,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:43:11,573 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 9 states. [2020-11-07 00:43:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:11,956 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-11-07 00:43:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:43:11,957 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-11-07 00:43:11,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:11,959 INFO L225 Difference]: With dead ends: 56 [2020-11-07 00:43:11,959 INFO L226 Difference]: Without dead ends: 49 [2020-11-07 00:43:11,960 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:43:11,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-11-07 00:43:11,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-11-07 00:43:11,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-11-07 00:43:11,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2020-11-07 00:43:11,974 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 54 [2020-11-07 00:43:11,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:11,975 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2020-11-07 00:43:11,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:43:11,975 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2020-11-07 00:43:11,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-07 00:43:11,977 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:11,977 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:11,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:43:11,977 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:11,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:11,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1161295337, now seen corresponding path program 4 times [2020-11-07 00:43:11,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:11,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1842029971] [2020-11-07 00:43:11,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:11,981 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:12,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:12,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:12,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:12,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:12,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:12,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:12,245 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-11-07 00:43:12,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1842029971] [2020-11-07 00:43:12,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:12,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:43:12,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133690423] [2020-11-07 00:43:12,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:43:12,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:12,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:43:12,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:43:12,248 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 10 states. [2020-11-07 00:43:12,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:12,873 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-11-07 00:43:12,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:43:12,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-11-07 00:43:12,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:12,877 INFO L225 Difference]: With dead ends: 61 [2020-11-07 00:43:12,877 INFO L226 Difference]: Without dead ends: 54 [2020-11-07 00:43:12,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:43:12,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-11-07 00:43:12,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-11-07 00:43:12,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-07 00:43:12,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-11-07 00:43:12,898 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 63 [2020-11-07 00:43:12,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:12,899 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-11-07 00:43:12,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:43:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-11-07 00:43:12,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-07 00:43:12,900 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:12,901 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:12,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:43:12,901 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:12,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:12,902 INFO L82 PathProgramCache]: Analyzing trace with hash -2109333008, now seen corresponding path program 5 times [2020-11-07 00:43:12,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:12,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1993028662] [2020-11-07 00:43:12,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:12,905 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:12,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:12,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:13,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:13,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:13,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:13,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:13,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-11-07 00:43:13,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1993028662] [2020-11-07 00:43:13,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:13,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:43:13,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762967729] [2020-11-07 00:43:13,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:43:13,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:13,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:43:13,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:43:13,231 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 11 states. [2020-11-07 00:43:13,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:13,797 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-11-07 00:43:13,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:43:13,798 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-11-07 00:43:13,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:13,800 INFO L225 Difference]: With dead ends: 66 [2020-11-07 00:43:13,800 INFO L226 Difference]: Without dead ends: 59 [2020-11-07 00:43:13,801 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-11-07 00:43:13,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-07 00:43:13,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-07 00:43:13,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-07 00:43:13,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-11-07 00:43:13,835 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 72 [2020-11-07 00:43:13,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:13,836 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-11-07 00:43:13,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:43:13,839 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-11-07 00:43:13,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-07 00:43:13,844 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:13,844 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:13,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:43:13,845 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:13,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:13,845 INFO L82 PathProgramCache]: Analyzing trace with hash 639783135, now seen corresponding path program 6 times [2020-11-07 00:43:13,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:13,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1940293069] [2020-11-07 00:43:13,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:13,849 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:13,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:13,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:14,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:14,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:14,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:14,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:14,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:14,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-11-07 00:43:14,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1940293069] [2020-11-07 00:43:14,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:14,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:43:14,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837983662] [2020-11-07 00:43:14,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:43:14,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:14,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:43:14,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:43:14,220 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 12 states. [2020-11-07 00:43:14,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:14,829 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-11-07 00:43:14,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 00:43:14,830 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-11-07 00:43:14,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:14,831 INFO L225 Difference]: With dead ends: 71 [2020-11-07 00:43:14,832 INFO L226 Difference]: Without dead ends: 64 [2020-11-07 00:43:14,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2020-11-07 00:43:14,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-07 00:43:14,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-11-07 00:43:14,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-07 00:43:14,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2020-11-07 00:43:14,864 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 81 [2020-11-07 00:43:14,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:14,866 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2020-11-07 00:43:14,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:43:14,866 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2020-11-07 00:43:14,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-07 00:43:14,872 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:14,872 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:14,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:43:14,873 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:14,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:14,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1631598970, now seen corresponding path program 7 times [2020-11-07 00:43:14,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:14,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1223969766] [2020-11-07 00:43:14,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:14,880 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:14,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:14,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:15,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:15,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:15,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:15,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:15,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:15,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:15,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:15,308 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-11-07 00:43:15,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1223969766] [2020-11-07 00:43:15,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:15,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 00:43:15,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116901729] [2020-11-07 00:43:15,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 00:43:15,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:15,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 00:43:15,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:43:15,312 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 13 states. [2020-11-07 00:43:15,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:15,980 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-11-07 00:43:15,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 00:43:15,981 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-11-07 00:43:15,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:15,984 INFO L225 Difference]: With dead ends: 76 [2020-11-07 00:43:15,984 INFO L226 Difference]: Without dead ends: 69 [2020-11-07 00:43:15,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-11-07 00:43:15,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-07 00:43:16,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-11-07 00:43:16,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-07 00:43:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2020-11-07 00:43:16,016 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 90 [2020-11-07 00:43:16,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:16,017 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2020-11-07 00:43:16,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 00:43:16,017 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2020-11-07 00:43:16,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-11-07 00:43:16,024 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:16,024 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:16,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:43:16,025 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:16,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:16,027 INFO L82 PathProgramCache]: Analyzing trace with hash -440062251, now seen corresponding path program 8 times [2020-11-07 00:43:16,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:16,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1015864976] [2020-11-07 00:43:16,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:16,030 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:16,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:16,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:16,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:16,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:16,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:16,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:16,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:16,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:16,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:16,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:16,512 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-11-07 00:43:16,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1015864976] [2020-11-07 00:43:16,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:16,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-07 00:43:16,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157365107] [2020-11-07 00:43:16,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 00:43:16,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:16,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 00:43:16,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:43:16,515 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 14 states. [2020-11-07 00:43:17,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:17,236 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-11-07 00:43:17,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 00:43:17,236 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-11-07 00:43:17,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:17,238 INFO L225 Difference]: With dead ends: 81 [2020-11-07 00:43:17,238 INFO L226 Difference]: Without dead ends: 74 [2020-11-07 00:43:17,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2020-11-07 00:43:17,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-07 00:43:17,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-11-07 00:43:17,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-11-07 00:43:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2020-11-07 00:43:17,263 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 99 [2020-11-07 00:43:17,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:17,264 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2020-11-07 00:43:17,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 00:43:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2020-11-07 00:43:17,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-11-07 00:43:17,266 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:17,266 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:17,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:43:17,267 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:17,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:17,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1832058372, now seen corresponding path program 9 times [2020-11-07 00:43:17,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:17,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [785499139] [2020-11-07 00:43:17,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:17,274 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:17,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:17,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:17,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:17,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:17,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:17,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:17,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:17,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:17,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:17,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:17,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:17,802 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-11-07 00:43:17,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [785499139] [2020-11-07 00:43:17,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:17,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:43:17,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656836597] [2020-11-07 00:43:17,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:43:17,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:17,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:43:17,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:43:17,807 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 15 states. [2020-11-07 00:43:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:18,519 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2020-11-07 00:43:18,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:43:18,519 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2020-11-07 00:43:18,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:18,521 INFO L225 Difference]: With dead ends: 86 [2020-11-07 00:43:18,521 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 00:43:18,523 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-11-07 00:43:18,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 00:43:18,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-11-07 00:43:18,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-07 00:43:18,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2020-11-07 00:43:18,540 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 108 [2020-11-07 00:43:18,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:18,541 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2020-11-07 00:43:18,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:43:18,541 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2020-11-07 00:43:18,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-11-07 00:43:18,542 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:18,543 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:18,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:43:18,543 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:18,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:18,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1858719797, now seen corresponding path program 10 times [2020-11-07 00:43:18,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:18,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [102186169] [2020-11-07 00:43:18,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:18,547 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:18,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:18,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:18,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:18,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:19,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:19,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:19,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:19,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:19,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:19,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:19,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:19,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:20,026 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2020-11-07 00:43:20,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [102186169] [2020-11-07 00:43:20,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:20,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2020-11-07 00:43:20,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765195191] [2020-11-07 00:43:20,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-11-07 00:43:20,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:20,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-11-07 00:43:20,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=835, Unknown=0, NotChecked=0, Total=992 [2020-11-07 00:43:20,029 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 32 states. [2020-11-07 00:43:24,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:24,755 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-11-07 00:43:24,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-11-07 00:43:24,756 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 117 [2020-11-07 00:43:24,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:24,757 INFO L225 Difference]: With dead ends: 79 [2020-11-07 00:43:24,757 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:43:24,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=965, Invalid=4147, Unknown=0, NotChecked=0, Total=5112 [2020-11-07 00:43:24,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:43:24,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:43:24,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:43:24,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:43:24,762 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2020-11-07 00:43:24,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:24,762 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:43:24,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-11-07 00:43:24,762 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:43:24,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:43:24,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:43:24,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:43:25,873 WARN L194 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 71 [2020-11-07 00:43:26,678 WARN L194 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2020-11-07 00:43:27,387 WARN L194 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2020-11-07 00:43:28,170 WARN L194 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2020-11-07 00:43:28,899 WARN L194 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2020-11-07 00:43:29,066 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 00:43:29,066 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 00:43:29,066 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:43:29,066 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 00:43:29,066 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 00:43:29,066 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 00:43:29,066 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:43:29,067 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 00:43:29,067 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:43:29,067 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:43:29,067 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 00:43:29,067 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 00:43:29,067 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 00:43:29,067 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:43:29,067 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:43:29,067 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:43:29,067 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:43:29,068 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:43:29,068 INFO L262 CegarLoopResult]: At program point sumEXIT(lines 5 11) the Hoare annotation is: (and (let ((.cse2 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (<= |sum_#res| .cse2))) (or (and .cse0 (<= (+ |sum_#in~m| 7) |sum_#res|) (<= |sum_#in~n| 7) .cse1) (and (<= |sum_#in~n| 4) .cse0 .cse1 (<= (+ |sum_#in~m| 4) |sum_#res|)) (and (<= (+ |sum_#in~m| 2) |sum_#res|) (<= |sum_#in~n| 2) .cse0 .cse1) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#res|)) (and (<= (+ |sum_#in~m| 6) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 6)) (and (<= |sum_#res| |sum_#in~m|) .cse0 (<= .cse2 |sum_#res|)) (and (<= (+ |sum_#in~m| 1) |sum_#res|) .cse0 (<= |sum_#in~n| 1) .cse1) (and (<= |sum_#in~n| 5) .cse0 .cse1 (<= (+ |sum_#in~m| 5) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 8) .cse1 (<= (+ |sum_#in~m| 8) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 3) .cse1 (<= (+ |sum_#in~m| 3) |sum_#res|))))) (let ((.cse3 (= sum_~n |sum_#in~n|))) (or (and .cse3 (<= |sum_#in~n| 9)) (and .cse3 (<= (+ |sum_#in~m| 10) |sum_#res|))))) [2020-11-07 00:43:29,068 INFO L262 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (<= 1 sum_~n) (= sum_~m |sum_#in~m|)) [2020-11-07 00:43:29,069 INFO L262 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (and (let ((.cse0 (= sum_~n |sum_#in~n|))) (or (and .cse0 (<= |sum_#in~n| 9)) (and .cse0 (<= (+ |sum_#in~m| 10) |sum_#t~ret7|)))) (let ((.cse1 (= sum_~m |sum_#in~m|)) (.cse2 (<= |sum_#t~ret7| (+ |sum_#in~n| |sum_#in~m|)))) (or (and (<= |sum_#in~n| 5) .cse1 (<= (+ |sum_#in~m| 5) |sum_#t~ret7|) .cse2) (and .cse1 (<= |sum_#in~n| 7) (<= (+ |sum_#in~m| 7) |sum_#t~ret7|) .cse2) (and .cse1 (<= (+ |sum_#in~m| 9) |sum_#t~ret7|) .cse2) (and (<= (+ |sum_#in~m| 4) |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse1 .cse2) (and .cse1 (<= |sum_#in~n| 8) (<= (+ |sum_#in~m| 8) |sum_#t~ret7|) .cse2) (and (<= (+ |sum_#in~m| 3) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 3) .cse2) (and (<= (+ |sum_#in~m| 1) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 1) .cse2) (and (<= |sum_#in~n| 2) .cse1 .cse2 (<= (+ |sum_#in~m| 2) |sum_#t~ret7|)) (and .cse1 (<= |sum_#in~n| 6) (<= (+ |sum_#in~m| 6) |sum_#t~ret7|) .cse2)))) [2020-11-07 00:43:29,069 INFO L262 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|) (<= sum_~n 0)) [2020-11-07 00:43:29,069 INFO L262 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: (and (let ((.cse0 (= sum_~n |sum_#in~n|))) (or (and .cse0 (<= |sum_#in~n| 9)) (and .cse0 (<= (+ |sum_#in~m| 10) |sum_#t~ret7|)))) (let ((.cse1 (= sum_~m |sum_#in~m|)) (.cse2 (<= |sum_#t~ret7| (+ |sum_#in~n| |sum_#in~m|)))) (or (and (<= |sum_#in~n| 5) .cse1 (<= (+ |sum_#in~m| 5) |sum_#t~ret7|) .cse2) (and .cse1 (<= |sum_#in~n| 7) (<= (+ |sum_#in~m| 7) |sum_#t~ret7|) .cse2) (and .cse1 (<= (+ |sum_#in~m| 9) |sum_#t~ret7|) .cse2) (and (<= (+ |sum_#in~m| 4) |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse1 .cse2) (and .cse1 (<= |sum_#in~n| 8) (<= (+ |sum_#in~m| 8) |sum_#t~ret7|) .cse2) (and (<= (+ |sum_#in~m| 3) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 3) .cse2) (and (<= (+ |sum_#in~m| 1) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 1) .cse2) (and (<= |sum_#in~n| 2) .cse1 .cse2 (<= (+ |sum_#in~m| 2) |sum_#t~ret7|)) (and .cse1 (<= |sum_#in~n| 6) (<= (+ |sum_#in~m| 6) |sum_#t~ret7|) .cse2)))) [2020-11-07 00:43:29,070 INFO L262 CegarLoopResult]: At program point L6(lines 6 10) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|)) [2020-11-07 00:43:29,070 INFO L262 CegarLoopResult]: At program point L9-3(line 9) the Hoare annotation is: (let ((.cse14 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~n |sum_#in~n|)) (.cse2 (= sum_~m |sum_#in~m|)) (.cse3 (<= |sum_#res| .cse14)) (.cse4 (<= |sum_#t~ret7| .cse14))) (or (let ((.cse1 (+ |sum_#in~m| 1))) (and .cse0 (<= .cse1 |sum_#t~ret7|) (<= .cse1 |sum_#res|) .cse2 (<= |sum_#in~n| 1) .cse3 .cse4)) (let ((.cse5 (+ |sum_#in~m| 7))) (and .cse0 .cse2 (<= .cse5 |sum_#res|) (<= |sum_#in~n| 7) .cse3 (<= .cse5 |sum_#t~ret7|) .cse4)) (let ((.cse6 (+ |sum_#in~m| 10))) (and .cse0 (<= .cse6 |sum_#res|) .cse2 .cse3 (<= .cse6 |sum_#t~ret7|) .cse4)) (let ((.cse7 (+ |sum_#in~m| 8))) (and .cse0 .cse2 (<= |sum_#in~n| 8) .cse3 (<= .cse7 |sum_#res|) (<= .cse7 |sum_#t~ret7|) .cse4)) (let ((.cse8 (+ |sum_#in~m| 4))) (and .cse0 (<= .cse8 |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse2 .cse3 (<= .cse8 |sum_#res|) .cse4)) (let ((.cse9 (+ |sum_#in~m| 6))) (and .cse0 (<= .cse9 |sum_#res|) .cse2 .cse3 (<= |sum_#in~n| 6) (<= .cse9 |sum_#t~ret7|) .cse4)) (let ((.cse10 (+ |sum_#in~m| 5))) (and .cse0 (<= |sum_#in~n| 5) .cse2 .cse3 (<= .cse10 |sum_#t~ret7|) (<= .cse10 |sum_#res|) .cse4)) (let ((.cse11 (+ |sum_#in~m| 3))) (and .cse0 (<= .cse11 |sum_#t~ret7|) .cse2 (<= |sum_#in~n| 3) .cse3 (<= .cse11 |sum_#res|) .cse4)) (let ((.cse12 (+ |sum_#in~m| 2))) (and .cse0 (<= .cse12 |sum_#res|) (<= |sum_#in~n| 2) .cse2 .cse3 .cse4 (<= .cse12 |sum_#t~ret7|))) (let ((.cse13 (+ |sum_#in~m| 9))) (and .cse0 .cse2 .cse3 (<= .cse13 |sum_#res|) (<= .cse13 |sum_#t~ret7|) (<= |sum_#in~n| 9) .cse4))))) [2020-11-07 00:43:29,070 INFO L262 CegarLoopResult]: At program point L5(lines 5 11) the Hoare annotation is: (= sum_~n |sum_#in~n|) [2020-11-07 00:43:29,070 INFO L262 CegarLoopResult]: At program point sumFINAL(lines 5 11) the Hoare annotation is: (and (let ((.cse2 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (<= |sum_#res| .cse2))) (or (and .cse0 (<= (+ |sum_#in~m| 7) |sum_#res|) (<= |sum_#in~n| 7) .cse1) (and (<= |sum_#in~n| 4) .cse0 .cse1 (<= (+ |sum_#in~m| 4) |sum_#res|)) (and (<= (+ |sum_#in~m| 2) |sum_#res|) (<= |sum_#in~n| 2) .cse0 .cse1) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#res|)) (and (<= (+ |sum_#in~m| 6) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 6)) (and (<= |sum_#res| |sum_#in~m|) .cse0 (<= .cse2 |sum_#res|)) (and (<= (+ |sum_#in~m| 1) |sum_#res|) .cse0 (<= |sum_#in~n| 1) .cse1) (and (<= |sum_#in~n| 5) .cse0 .cse1 (<= (+ |sum_#in~m| 5) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 8) .cse1 (<= (+ |sum_#in~m| 8) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 3) .cse1 (<= (+ |sum_#in~m| 3) |sum_#res|))))) (let ((.cse3 (= sum_~n |sum_#in~n|))) (or (and .cse3 (<= |sum_#in~n| 9)) (and .cse3 (<= (+ |sum_#in~m| 10) |sum_#res|))))) [2020-11-07 00:43:29,071 INFO L269 CegarLoopResult]: At program point sumENTRY(lines 5 11) the Hoare annotation is: true [2020-11-07 00:43:29,071 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 13 20) the Hoare annotation is: true [2020-11-07 00:43:29,071 INFO L262 CegarLoopResult]: At program point mainEXIT(lines 13 20) the Hoare annotation is: (<= 10 main_~a~0) [2020-11-07 00:43:29,071 INFO L262 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: false [2020-11-07 00:43:29,071 INFO L262 CegarLoopResult]: At program point L17(lines 17 19) the Hoare annotation is: (and (<= main_~a~0 10) (<= main_~a~0 main_~result~0) (<= 10 main_~a~0) (<= main_~result~0 main_~a~0) (= main_~b~0 0)) [2020-11-07 00:43:29,071 INFO L262 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: false [2020-11-07 00:43:29,071 INFO L262 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= main_~a~0 10) (<= 10 main_~a~0) (= main_~b~0 0)) [2020-11-07 00:43:29,071 INFO L262 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (<= main_~a~0 10) (<= 10 main_~a~0)) [2020-11-07 00:43:29,071 INFO L262 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (and (<= main_~a~0 10) (<= |main_#t~ret8| main_~a~0) (<= 10 main_~a~0) (<= main_~a~0 |main_#t~ret8|) (= main_~b~0 0)) [2020-11-07 00:43:29,071 INFO L262 CegarLoopResult]: At program point L17-2(lines 13 20) the Hoare annotation is: (<= 10 main_~a~0) [2020-11-07 00:43:29,072 INFO L262 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (and (<= main_~a~0 10) (<= |main_#t~ret8| main_~a~0) (<= 10 main_~a~0) (<= main_~a~0 |main_#t~ret8|) (= main_~b~0 0)) [2020-11-07 00:43:29,072 INFO L262 CegarLoopResult]: At program point L16-3(line 16) the Hoare annotation is: (and (<= main_~a~0 10) (<= |main_#t~ret8| main_~a~0) (<= main_~a~0 main_~result~0) (<= 10 main_~a~0) (<= main_~a~0 |main_#t~ret8|) (<= main_~result~0 main_~a~0) (= main_~b~0 0)) [2020-11-07 00:43:29,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:43:29 BoogieIcfgContainer [2020-11-07 00:43:29,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:43:29,104 INFO L168 Benchmark]: Toolchain (without parser) took 20812.11 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 128.1 MB in the beginning and 132.7 MB in the end (delta: -4.6 MB). Peak memory consumption was 184.3 MB. Max. memory is 8.0 GB. [2020-11-07 00:43:29,105 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 151.0 MB. Free memory was 126.5 MB in the beginning and 126.4 MB in the end (delta: 79.4 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:43:29,111 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.99 ms. Allocated memory is still 151.0 MB. Free memory was 127.5 MB in the beginning and 118.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:43:29,111 INFO L168 Benchmark]: Boogie Preprocessor took 35.53 ms. Allocated memory is still 151.0 MB. Free memory was 118.4 MB in the beginning and 117.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:43:29,112 INFO L168 Benchmark]: RCFGBuilder took 485.22 ms. Allocated memory is still 151.0 MB. Free memory was 117.0 MB in the beginning and 104.0 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:43:29,113 INFO L168 Benchmark]: TraceAbstraction took 20031.80 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 103.5 MB in the beginning and 132.7 MB in the end (delta: -29.1 MB). Peak memory consumption was 160.2 MB. Max. memory is 8.0 GB. [2020-11-07 00:43:29,116 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 151.0 MB. Free memory was 126.5 MB in the beginning and 126.4 MB in the end (delta: 79.4 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 241.99 ms. Allocated memory is still 151.0 MB. Free memory was 127.5 MB in the beginning and 118.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 35.53 ms. Allocated memory is still 151.0 MB. Free memory was 118.4 MB in the beginning and 117.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 485.22 ms. Allocated memory is still 151.0 MB. Free memory was 117.0 MB in the beginning and 104.0 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 20031.80 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 103.5 MB in the beginning and 132.7 MB in the end (delta: -29.1 MB). Peak memory consumption was 160.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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 - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for sum Derived contract for procedure sum: ((((((((((((m == \old(m) && \old(m) + 7 <= \result) && \old(n) <= 7) && \result <= \old(n) + \old(m)) || (((\old(n) <= 4 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 4 <= \result)) || (((\old(m) + 2 <= \result && \old(n) <= 2) && m == \old(m)) && \result <= \old(n) + \old(m))) || ((m == \old(m) && \result <= \old(n) + \old(m)) && \old(m) + 9 <= \result)) || (((\old(m) + 6 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 6)) || ((\result <= \old(m) && m == \old(m)) && \old(n) + \old(m) <= \result)) || (((\old(m) + 1 <= \result && m == \old(m)) && \old(n) <= 1) && \result <= \old(n) + \old(m))) || (((\old(n) <= 5 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 5 <= \result)) || (((m == \old(m) && \old(n) <= 8) && \result <= \old(n) + \old(m)) && \old(m) + 8 <= \result)) || (((m == \old(m) && \old(n) <= 3) && \result <= \old(n) + \old(m)) && \old(m) + 3 <= \result)) && ((n == \old(n) && \old(n) <= 9) || (n == \old(n) && \old(m) + 10 <= \result)) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 10 <= a - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 15.6s, OverallIterations: 11, TraceHistogramMax: 11, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 313 SDtfs, 719 SDslu, 718 SDs, 0 SdLazy, 1568 SolverSat, 224 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1162 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=10, 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, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 89 PreInvPairs, 239 NumberOfFragments, 1173 HoareAnnotationTreeSize, 89 FomulaSimplifications, 2948 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 39 FomulaSimplificationsInter, 4585 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...