/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/id_i20_o20-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 20:27:13,549 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 20:27:13,552 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 20:27:13,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 20:27:13,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 20:27:13,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 20:27:13,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 20:27:13,602 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 20:27:13,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 20:27:13,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 20:27:13,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 20:27:13,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 20:27:13,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 20:27:13,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 20:27:13,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 20:27:13,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 20:27:13,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 20:27:13,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 20:27:13,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 20:27:13,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 20:27:13,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 20:27:13,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 20:27:13,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 20:27:13,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 20:27:13,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 20:27:13,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 20:27:13,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 20:27:13,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 20:27:13,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 20:27:13,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 20:27:13,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 20:27:13,649 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 20:27:13,650 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 20:27:13,651 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 20:27:13,652 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 20:27:13,653 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 20:27:13,654 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 20:27:13,654 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 20:27:13,654 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 20:27:13,655 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 20:27:13,656 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 20:27:13,658 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-23 20:27:13,680 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 20:27:13,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 20:27:13,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 20:27:13,687 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 20:27:13,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 20:27:13,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 20:27:13,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 20:27:13,687 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 20:27:13,687 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 20:27:13,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 20:27:13,689 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 20:27:13,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 20:27:13,689 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 20:27:13,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 20:27:13,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 20:27:13,690 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-23 20:27:13,690 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 20:27:13,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 20:27:13,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 20:27:13,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 20:27:13,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-23 20:27:13,691 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 20:27:13,691 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-10-23 20:27:14,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 20:27:14,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 20:27:14,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 20:27:14,248 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 20:27:14,249 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 20:27:14,253 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i20_o20-1.c [2020-10-23 20:27:14,334 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa53a58cc/ff620d89b97d4c2b8475159519ddfdff/FLAGee74f4e18 [2020-10-23 20:27:14,912 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 20:27:14,912 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i20_o20-1.c [2020-10-23 20:27:14,919 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa53a58cc/ff620d89b97d4c2b8475159519ddfdff/FLAGee74f4e18 [2020-10-23 20:27:15,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa53a58cc/ff620d89b97d4c2b8475159519ddfdff [2020-10-23 20:27:15,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 20:27:15,293 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 20:27:15,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 20:27:15,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 20:27:15,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 20:27:15,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:27:15" (1/1) ... [2020-10-23 20:27:15,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ddc771c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:15, skipping insertion in model container [2020-10-23 20:27:15,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:27:15" (1/1) ... [2020-10-23 20:27:15,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 20:27:15,338 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 20:27:15,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:27:15,519 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 20:27:15,536 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:27:15,554 INFO L208 MainTranslator]: Completed translation [2020-10-23 20:27:15,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:15 WrapperNode [2020-10-23 20:27:15,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 20:27:15,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 20:27:15,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 20:27:15,556 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 20:27:15,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:15" (1/1) ... [2020-10-23 20:27:15,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:15" (1/1) ... [2020-10-23 20:27:15,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:15" (1/1) ... [2020-10-23 20:27:15,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:15" (1/1) ... [2020-10-23 20:27:15,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:15" (1/1) ... [2020-10-23 20:27:15,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:15" (1/1) ... [2020-10-23 20:27:15,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:15" (1/1) ... [2020-10-23 20:27:15,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 20:27:15,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 20:27:15,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 20:27:15,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 20:27:15,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:15" (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-10-23 20:27:15,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 20:27:15,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 20:27:15,677 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 20:27:15,677 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-10-23 20:27:15,677 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 20:27:15,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-23 20:27:15,678 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 20:27:15,678 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 20:27:15,678 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 20:27:15,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 20:27:15,678 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-10-23 20:27:15,679 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 20:27:15,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 20:27:15,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 20:27:15,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 20:27:15,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 20:27:15,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 20:27:15,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 20:27:15,918 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 20:27:15,918 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-23 20:27:15,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:27:15 BoogieIcfgContainer [2020-10-23 20:27:15,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 20:27:15,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 20:27:15,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 20:27:15,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 20:27:15,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:27:15" (1/3) ... [2020-10-23 20:27:15,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18e14a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:27:15, skipping insertion in model container [2020-10-23 20:27:15,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:15" (2/3) ... [2020-10-23 20:27:15,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18e14a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:27:15, skipping insertion in model container [2020-10-23 20:27:15,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:27:15" (3/3) ... [2020-10-23 20:27:15,930 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i20_o20-1.c [2020-10-23 20:27:15,944 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-23 20:27:15,950 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 20:27:15,966 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 20:27:16,017 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 20:27:16,018 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 20:27:16,018 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-10-23 20:27:16,018 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 20:27:16,021 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 20:27:16,021 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 20:27:16,021 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 20:27:16,022 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 20:27:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-10-23 20:27:16,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-23 20:27:16,065 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:16,066 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] [2020-10-23 20:27:16,066 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:16,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:16,073 INFO L82 PathProgramCache]: Analyzing trace with hash -742560695, now seen corresponding path program 1 times [2020-10-23 20:27:16,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:16,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1604841826] [2020-10-23 20:27:16,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:16,165 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:16,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:16,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:16,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:27:16,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1604841826] [2020-10-23 20:27:16,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:16,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 20:27:16,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154768928] [2020-10-23 20:27:16,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 20:27:16,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:16,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 20:27:16,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-23 20:27:16,591 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 6 states. [2020-10-23 20:27:16,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:16,983 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-10-23 20:27:16,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-23 20:27:16,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-23 20:27:16,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:17,013 INFO L225 Difference]: With dead ends: 50 [2020-10-23 20:27:17,013 INFO L226 Difference]: Without dead ends: 32 [2020-10-23 20:27:17,019 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-23 20:27:17,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-10-23 20:27:17,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-10-23 20:27:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-23 20:27:17,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-10-23 20:27:17,111 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-10-23 20:27:17,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:17,111 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-10-23 20:27:17,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 20:27:17,113 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-10-23 20:27:17,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-23 20:27:17,118 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:17,118 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-23 20:27:17,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 20:27:17,119 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:17,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:17,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1024612499, now seen corresponding path program 1 times [2020-10-23 20:27:17,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:17,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [33461051] [2020-10-23 20:27:17,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:17,141 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-23 20:27:17,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [33461051] [2020-10-23 20:27:17,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:17,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-23 20:27:17,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291526407] [2020-10-23 20:27:17,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 20:27:17,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:17,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 20:27:17,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-23 20:27:17,325 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2020-10-23 20:27:17,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:17,637 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-10-23 20:27:17,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-23 20:27:17,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-10-23 20:27:17,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:17,640 INFO L225 Difference]: With dead ends: 44 [2020-10-23 20:27:17,641 INFO L226 Difference]: Without dead ends: 37 [2020-10-23 20:27:17,642 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-10-23 20:27:17,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-23 20:27:17,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-23 20:27:17,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-23 20:27:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-10-23 20:27:17,659 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2020-10-23 20:27:17,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:17,660 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-10-23 20:27:17,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 20:27:17,660 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-10-23 20:27:17,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-23 20:27:17,662 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:17,662 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-23 20:27:17,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 20:27:17,662 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:17,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:17,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1157111945, now seen corresponding path program 2 times [2020-10-23 20:27:17,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:17,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1495093925] [2020-10-23 20:27:17,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:17,668 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-23 20:27:17,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1495093925] [2020-10-23 20:27:17,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:17,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 20:27:17,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312545374] [2020-10-23 20:27:17,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 20:27:17,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:17,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 20:27:17,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-23 20:27:17,883 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2020-10-23 20:27:18,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:18,143 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-10-23 20:27:18,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 20:27:18,143 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-10-23 20:27:18,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:18,145 INFO L225 Difference]: With dead ends: 49 [2020-10-23 20:27:18,145 INFO L226 Difference]: Without dead ends: 42 [2020-10-23 20:27:18,146 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-10-23 20:27:18,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-10-23 20:27:18,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-10-23 20:27:18,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-23 20:27:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-10-23 20:27:18,160 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 41 [2020-10-23 20:27:18,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:18,161 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-10-23 20:27:18,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 20:27:18,161 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-10-23 20:27:18,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-23 20:27:18,163 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:18,163 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-23 20:27:18,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 20:27:18,163 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:18,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:18,164 INFO L82 PathProgramCache]: Analyzing trace with hash 2083092563, now seen corresponding path program 3 times [2020-10-23 20:27:18,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:18,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1330213267] [2020-10-23 20:27:18,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:18,168 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-23 20:27:18,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1330213267] [2020-10-23 20:27:18,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:18,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 20:27:18,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149561936] [2020-10-23 20:27:18,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 20:27:18,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:18,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 20:27:18,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-23 20:27:18,420 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 9 states. [2020-10-23 20:27:18,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:18,813 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-10-23 20:27:18,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 20:27:18,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-10-23 20:27:18,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:18,815 INFO L225 Difference]: With dead ends: 54 [2020-10-23 20:27:18,815 INFO L226 Difference]: Without dead ends: 47 [2020-10-23 20:27:18,816 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-10-23 20:27:18,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-23 20:27:18,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-23 20:27:18,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-23 20:27:18,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-10-23 20:27:18,831 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 49 [2020-10-23 20:27:18,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:18,831 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-10-23 20:27:18,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 20:27:18,832 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-10-23 20:27:18,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-10-23 20:27:18,833 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:18,834 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-23 20:27:18,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 20:27:18,834 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:18,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:18,835 INFO L82 PathProgramCache]: Analyzing trace with hash 2025718985, now seen corresponding path program 4 times [2020-10-23 20:27:18,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:18,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1458430604] [2020-10-23 20:27:18,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:18,839 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,051 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-23 20:27:19,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1458430604] [2020-10-23 20:27:19,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:19,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 20:27:19,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655205464] [2020-10-23 20:27:19,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 20:27:19,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:19,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 20:27:19,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-23 20:27:19,056 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 10 states. [2020-10-23 20:27:19,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:19,604 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-10-23 20:27:19,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-23 20:27:19,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-10-23 20:27:19,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:19,607 INFO L225 Difference]: With dead ends: 59 [2020-10-23 20:27:19,607 INFO L226 Difference]: Without dead ends: 52 [2020-10-23 20:27:19,608 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-10-23 20:27:19,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-10-23 20:27:19,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-10-23 20:27:19,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-23 20:27:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2020-10-23 20:27:19,623 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 57 [2020-10-23 20:27:19,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:19,623 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2020-10-23 20:27:19,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 20:27:19,624 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-10-23 20:27:19,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-23 20:27:19,625 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:19,625 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-23 20:27:19,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 20:27:19,626 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:19,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:19,627 INFO L82 PathProgramCache]: Analyzing trace with hash 2086365203, now seen corresponding path program 5 times [2020-10-23 20:27:19,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:19,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1613538847] [2020-10-23 20:27:19,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:19,631 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-23 20:27:19,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1613538847] [2020-10-23 20:27:19,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:19,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-23 20:27:19,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724746234] [2020-10-23 20:27:19,952 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 20:27:19,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:19,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 20:27:19,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:27:19,953 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 11 states. [2020-10-23 20:27:20,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:20,480 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-10-23 20:27:20,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-23 20:27:20,480 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2020-10-23 20:27:20,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:20,487 INFO L225 Difference]: With dead ends: 64 [2020-10-23 20:27:20,487 INFO L226 Difference]: Without dead ends: 57 [2020-10-23 20:27:20,488 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-10-23 20:27:20,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-23 20:27:20,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-10-23 20:27:20,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-23 20:27:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-10-23 20:27:20,520 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 65 [2020-10-23 20:27:20,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:20,522 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-10-23 20:27:20,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 20:27:20,523 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-10-23 20:27:20,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-23 20:27:20,526 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:20,527 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-23 20:27:20,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 20:27:20,527 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:20,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:20,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1881990903, now seen corresponding path program 6 times [2020-10-23 20:27:20,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:20,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [399971501] [2020-10-23 20:27:20,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:20,536 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-10-23 20:27:20,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [399971501] [2020-10-23 20:27:20,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:20,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-23 20:27:20,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580460388] [2020-10-23 20:27:20,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 20:27:20,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:20,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 20:27:20,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-23 20:27:20,853 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2020-10-23 20:27:21,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:21,450 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-10-23 20:27:21,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 20:27:21,450 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-10-23 20:27:21,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:21,453 INFO L225 Difference]: With dead ends: 69 [2020-10-23 20:27:21,453 INFO L226 Difference]: Without dead ends: 62 [2020-10-23 20:27:21,454 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-10-23 20:27:21,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-23 20:27:21,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-23 20:27:21,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-23 20:27:21,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2020-10-23 20:27:21,469 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 73 [2020-10-23 20:27:21,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:21,469 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2020-10-23 20:27:21,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 20:27:21,470 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2020-10-23 20:27:21,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-10-23 20:27:21,471 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:21,471 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-23 20:27:21,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-23 20:27:21,472 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:21,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:21,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1486608429, now seen corresponding path program 7 times [2020-10-23 20:27:21,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:21,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1398630378] [2020-10-23 20:27:21,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:21,477 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,910 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-10-23 20:27:21,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1398630378] [2020-10-23 20:27:21,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:21,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-23 20:27:21,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481077222] [2020-10-23 20:27:21,925 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-23 20:27:21,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:21,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-23 20:27:21,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-10-23 20:27:21,926 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 13 states. [2020-10-23 20:27:22,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:22,544 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-10-23 20:27:22,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 20:27:22,545 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2020-10-23 20:27:22,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:22,546 INFO L225 Difference]: With dead ends: 74 [2020-10-23 20:27:22,546 INFO L226 Difference]: Without dead ends: 67 [2020-10-23 20:27:22,549 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-10-23 20:27:22,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-10-23 20:27:22,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-10-23 20:27:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-23 20:27:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-10-23 20:27:22,578 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 81 [2020-10-23 20:27:22,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:22,580 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-10-23 20:27:22,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-23 20:27:22,580 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-10-23 20:27:22,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-10-23 20:27:22,585 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:22,585 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-23 20:27:22,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-23 20:27:22,585 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:22,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:22,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2047124151, now seen corresponding path program 8 times [2020-10-23 20:27:22,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:22,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1072130951] [2020-10-23 20:27:22,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:22,595 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,964 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-10-23 20:27:22,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1072130951] [2020-10-23 20:27:22,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:22,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-23 20:27:22,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565897915] [2020-10-23 20:27:22,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-23 20:27:22,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:22,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-23 20:27:22,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-10-23 20:27:22,974 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 14 states. [2020-10-23 20:27:23,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:23,634 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-10-23 20:27:23,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-23 20:27:23,635 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2020-10-23 20:27:23,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:23,636 INFO L225 Difference]: With dead ends: 79 [2020-10-23 20:27:23,636 INFO L226 Difference]: Without dead ends: 72 [2020-10-23 20:27:23,638 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2020-10-23 20:27:23,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-23 20:27:23,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-10-23 20:27:23,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-23 20:27:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-10-23 20:27:23,669 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 89 [2020-10-23 20:27:23,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:23,670 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-10-23 20:27:23,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-23 20:27:23,670 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-10-23 20:27:23,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-10-23 20:27:23,678 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:23,679 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-23 20:27:23,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-23 20:27:23,679 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:23,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:23,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1811920787, now seen corresponding path program 9 times [2020-10-23 20:27:23,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:23,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [151812021] [2020-10-23 20:27:23,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:23,690 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,144 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-10-23 20:27:24,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [151812021] [2020-10-23 20:27:24,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:24,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-23 20:27:24,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807165805] [2020-10-23 20:27:24,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-23 20:27:24,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:24,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-23 20:27:24,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-23 20:27:24,147 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2020-10-23 20:27:24,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:24,902 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-10-23 20:27:24,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-23 20:27:24,903 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2020-10-23 20:27:24,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:24,905 INFO L225 Difference]: With dead ends: 84 [2020-10-23 20:27:24,905 INFO L226 Difference]: Without dead ends: 77 [2020-10-23 20:27:24,907 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-10-23 20:27:24,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-23 20:27:24,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-10-23 20:27:24,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-23 20:27:24,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2020-10-23 20:27:24,939 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 97 [2020-10-23 20:27:24,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:24,939 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2020-10-23 20:27:24,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-23 20:27:24,939 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2020-10-23 20:27:24,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-10-23 20:27:24,941 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:24,941 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-23 20:27:24,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-23 20:27:24,941 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:24,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:24,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1912263049, now seen corresponding path program 10 times [2020-10-23 20:27:24,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:24,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [117611560] [2020-10-23 20:27:24,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:24,951 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-10-23 20:27:25,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [117611560] [2020-10-23 20:27:25,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:25,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-10-23 20:27:25,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813864452] [2020-10-23 20:27:25,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-23 20:27:25,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:25,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-23 20:27:25,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-10-23 20:27:25,441 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 16 states. [2020-10-23 20:27:26,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:26,190 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-10-23 20:27:26,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-23 20:27:26,194 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-10-23 20:27:26,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:26,195 INFO L225 Difference]: With dead ends: 89 [2020-10-23 20:27:26,195 INFO L226 Difference]: Without dead ends: 82 [2020-10-23 20:27:26,211 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=268, Invalid=544, Unknown=0, NotChecked=0, Total=812 [2020-10-23 20:27:26,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-23 20:27:26,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-10-23 20:27:26,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-23 20:27:26,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2020-10-23 20:27:26,225 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 105 [2020-10-23 20:27:26,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:26,226 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2020-10-23 20:27:26,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-23 20:27:26,226 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2020-10-23 20:27:26,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-10-23 20:27:26,227 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:26,227 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:26,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-23 20:27:26,228 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:26,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:26,228 INFO L82 PathProgramCache]: Analyzing trace with hash -34990253, now seen corresponding path program 11 times [2020-10-23 20:27:26,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:26,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [772936201] [2020-10-23 20:27:26,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:26,235 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-10-23 20:27:26,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [772936201] [2020-10-23 20:27:26,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:26,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-10-23 20:27:26,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523637450] [2020-10-23 20:27:26,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-23 20:27:26,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:26,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-23 20:27:26,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-10-23 20:27:26,737 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 17 states. [2020-10-23 20:27:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:27,577 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-10-23 20:27:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-23 20:27:27,577 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 113 [2020-10-23 20:27:27,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:27,578 INFO L225 Difference]: With dead ends: 94 [2020-10-23 20:27:27,578 INFO L226 Difference]: Without dead ends: 87 [2020-10-23 20:27:27,580 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2020-10-23 20:27:27,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-23 20:27:27,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-10-23 20:27:27,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-23 20:27:27,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2020-10-23 20:27:27,600 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 113 [2020-10-23 20:27:27,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:27,601 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2020-10-23 20:27:27,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-23 20:27:27,601 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2020-10-23 20:27:27,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-10-23 20:27:27,604 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:27,605 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:27,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-23 20:27:27,605 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:27,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:27,606 INFO L82 PathProgramCache]: Analyzing trace with hash -980060727, now seen corresponding path program 12 times [2020-10-23 20:27:27,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:27,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1037765796] [2020-10-23 20:27:27,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:27,613 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:27,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:27,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:27,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:27,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:27,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:27,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:27,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-10-23 20:27:28,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1037765796] [2020-10-23 20:27:28,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:28,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-10-23 20:27:28,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487026794] [2020-10-23 20:27:28,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-23 20:27:28,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:28,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-23 20:27:28,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-10-23 20:27:28,286 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 18 states. [2020-10-23 20:27:29,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:29,195 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-10-23 20:27:29,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-23 20:27:29,196 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2020-10-23 20:27:29,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:29,197 INFO L225 Difference]: With dead ends: 99 [2020-10-23 20:27:29,197 INFO L226 Difference]: Without dead ends: 92 [2020-10-23 20:27:29,198 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2020-10-23 20:27:29,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-23 20:27:29,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-10-23 20:27:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-23 20:27:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2020-10-23 20:27:29,212 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 121 [2020-10-23 20:27:29,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:29,213 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2020-10-23 20:27:29,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-23 20:27:29,213 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2020-10-23 20:27:29,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-10-23 20:27:29,215 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:29,215 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:29,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-23 20:27:29,215 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:29,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:29,216 INFO L82 PathProgramCache]: Analyzing trace with hash 366954259, now seen corresponding path program 13 times [2020-10-23 20:27:29,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:29,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [110219543] [2020-10-23 20:27:29,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:29,224 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,965 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-10-23 20:27:29,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [110219543] [2020-10-23 20:27:29,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:29,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-10-23 20:27:29,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072729266] [2020-10-23 20:27:29,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-23 20:27:29,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:29,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-23 20:27:29,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-10-23 20:27:29,967 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 19 states. [2020-10-23 20:27:30,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:30,946 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2020-10-23 20:27:30,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-23 20:27:30,947 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 129 [2020-10-23 20:27:30,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:30,949 INFO L225 Difference]: With dead ends: 104 [2020-10-23 20:27:30,949 INFO L226 Difference]: Without dead ends: 97 [2020-10-23 20:27:30,950 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2020-10-23 20:27:30,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-23 20:27:30,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-10-23 20:27:30,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-23 20:27:30,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2020-10-23 20:27:30,964 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 129 [2020-10-23 20:27:30,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:30,964 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2020-10-23 20:27:30,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-23 20:27:30,964 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2020-10-23 20:27:30,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-10-23 20:27:30,966 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:30,966 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:30,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-23 20:27:30,967 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:30,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:30,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1919989239, now seen corresponding path program 14 times [2020-10-23 20:27:30,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:30,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1936628279] [2020-10-23 20:27:30,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:30,975 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,743 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-10-23 20:27:31,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1936628279] [2020-10-23 20:27:31,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:31,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-10-23 20:27:31,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933631178] [2020-10-23 20:27:31,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-23 20:27:31,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:31,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-23 20:27:31,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-10-23 20:27:31,745 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 20 states. [2020-10-23 20:27:32,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:32,771 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2020-10-23 20:27:32,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-23 20:27:32,772 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 137 [2020-10-23 20:27:32,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:32,774 INFO L225 Difference]: With dead ends: 109 [2020-10-23 20:27:32,774 INFO L226 Difference]: Without dead ends: 102 [2020-10-23 20:27:32,775 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=450, Invalid=882, Unknown=0, NotChecked=0, Total=1332 [2020-10-23 20:27:32,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-23 20:27:32,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-10-23 20:27:32,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-23 20:27:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2020-10-23 20:27:32,793 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 137 [2020-10-23 20:27:32,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:32,793 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2020-10-23 20:27:32,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-23 20:27:32,794 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2020-10-23 20:27:32,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-10-23 20:27:32,796 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:32,796 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:32,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-23 20:27:32,796 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:32,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:32,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1315223853, now seen corresponding path program 15 times [2020-10-23 20:27:32,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:32,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [217993874] [2020-10-23 20:27:32,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:32,806 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:32,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:32,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:32,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:32,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,621 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-10-23 20:27:33,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [217993874] [2020-10-23 20:27:33,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:33,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-10-23 20:27:33,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732362539] [2020-10-23 20:27:33,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-23 20:27:33,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:33,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-23 20:27:33,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2020-10-23 20:27:33,623 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 21 states. [2020-10-23 20:27:34,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:34,684 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2020-10-23 20:27:34,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-23 20:27:34,685 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 145 [2020-10-23 20:27:34,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:34,686 INFO L225 Difference]: With dead ends: 114 [2020-10-23 20:27:34,686 INFO L226 Difference]: Without dead ends: 107 [2020-10-23 20:27:34,687 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=503, Invalid=979, Unknown=0, NotChecked=0, Total=1482 [2020-10-23 20:27:34,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-23 20:27:34,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-23 20:27:34,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-23 20:27:34,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2020-10-23 20:27:34,704 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 145 [2020-10-23 20:27:34,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:34,704 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2020-10-23 20:27:34,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-23 20:27:34,705 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2020-10-23 20:27:34,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-10-23 20:27:34,706 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:34,707 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:34,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-23 20:27:34,707 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:34,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:34,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1314107831, now seen corresponding path program 16 times [2020-10-23 20:27:34,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:34,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1390254215] [2020-10-23 20:27:34,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:34,713 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:34,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:34,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:34,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:34,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:34,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:34,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,564 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-10-23 20:27:35,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1390254215] [2020-10-23 20:27:35,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:35,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-10-23 20:27:35,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461975820] [2020-10-23 20:27:35,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-23 20:27:35,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:35,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-23 20:27:35,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2020-10-23 20:27:35,566 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 22 states. [2020-10-23 20:27:36,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:36,657 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2020-10-23 20:27:36,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-23 20:27:36,658 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 153 [2020-10-23 20:27:36,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:36,661 INFO L225 Difference]: With dead ends: 119 [2020-10-23 20:27:36,661 INFO L226 Difference]: Without dead ends: 112 [2020-10-23 20:27:36,662 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=559, Invalid=1081, Unknown=0, NotChecked=0, Total=1640 [2020-10-23 20:27:36,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-23 20:27:36,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-23 20:27:36,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-23 20:27:36,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2020-10-23 20:27:36,678 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 153 [2020-10-23 20:27:36,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:36,679 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2020-10-23 20:27:36,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-23 20:27:36,679 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2020-10-23 20:27:36,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-10-23 20:27:36,681 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:36,681 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:36,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-23 20:27:36,682 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:36,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:36,682 INFO L82 PathProgramCache]: Analyzing trace with hash -740682093, now seen corresponding path program 17 times [2020-10-23 20:27:36,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:36,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1302367207] [2020-10-23 20:27:36,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:36,687 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:36,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:36,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:36,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:36,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:36,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:36,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,704 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-10-23 20:27:37,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1302367207] [2020-10-23 20:27:37,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:37,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-10-23 20:27:37,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596491862] [2020-10-23 20:27:37,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-23 20:27:37,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:37,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-23 20:27:37,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2020-10-23 20:27:37,707 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 23 states. [2020-10-23 20:27:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:38,936 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2020-10-23 20:27:38,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-23 20:27:38,941 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 161 [2020-10-23 20:27:38,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:38,943 INFO L225 Difference]: With dead ends: 124 [2020-10-23 20:27:38,943 INFO L226 Difference]: Without dead ends: 117 [2020-10-23 20:27:38,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=618, Invalid=1188, Unknown=0, NotChecked=0, Total=1806 [2020-10-23 20:27:38,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-23 20:27:38,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2020-10-23 20:27:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-10-23 20:27:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2020-10-23 20:27:38,964 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 161 [2020-10-23 20:27:38,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:38,965 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2020-10-23 20:27:38,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-23 20:27:38,965 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2020-10-23 20:27:38,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-10-23 20:27:38,967 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:38,967 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:38,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-23 20:27:38,967 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:38,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:38,968 INFO L82 PathProgramCache]: Analyzing trace with hash 883982985, now seen corresponding path program 18 times [2020-10-23 20:27:38,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:38,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [379028128] [2020-10-23 20:27:38,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:38,972 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-10-23 20:27:39,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [379028128] [2020-10-23 20:27:39,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:39,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-10-23 20:27:39,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457673263] [2020-10-23 20:27:39,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-23 20:27:39,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:39,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-23 20:27:39,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=336, Unknown=0, NotChecked=0, Total=552 [2020-10-23 20:27:39,979 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 24 states. [2020-10-23 20:27:41,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:41,253 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2020-10-23 20:27:41,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-23 20:27:41,254 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 169 [2020-10-23 20:27:41,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:41,255 INFO L225 Difference]: With dead ends: 129 [2020-10-23 20:27:41,255 INFO L226 Difference]: Without dead ends: 122 [2020-10-23 20:27:41,257 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=680, Invalid=1300, Unknown=0, NotChecked=0, Total=1980 [2020-10-23 20:27:41,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-10-23 20:27:41,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-10-23 20:27:41,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-10-23 20:27:41,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2020-10-23 20:27:41,275 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 169 [2020-10-23 20:27:41,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:41,276 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2020-10-23 20:27:41,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-23 20:27:41,276 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2020-10-23 20:27:41,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-10-23 20:27:41,278 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:41,278 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:41,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-23 20:27:41,279 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:41,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:41,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1146598995, now seen corresponding path program 19 times [2020-10-23 20:27:41,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:41,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [730892971] [2020-10-23 20:27:41,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:41,284 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,374 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-10-23 20:27:42,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [730892971] [2020-10-23 20:27:42,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:42,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-10-23 20:27:42,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035430809] [2020-10-23 20:27:42,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-23 20:27:42,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:42,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-23 20:27:42,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=363, Unknown=0, NotChecked=0, Total=600 [2020-10-23 20:27:42,377 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 25 states. [2020-10-23 20:27:43,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:43,732 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2020-10-23 20:27:43,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-23 20:27:43,733 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 177 [2020-10-23 20:27:43,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:43,737 INFO L225 Difference]: With dead ends: 134 [2020-10-23 20:27:43,737 INFO L226 Difference]: Without dead ends: 127 [2020-10-23 20:27:43,739 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=745, Invalid=1417, Unknown=0, NotChecked=0, Total=2162 [2020-10-23 20:27:43,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-10-23 20:27:43,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-10-23 20:27:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-23 20:27:43,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2020-10-23 20:27:43,755 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 177 [2020-10-23 20:27:43,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:43,755 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2020-10-23 20:27:43,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-23 20:27:43,756 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2020-10-23 20:27:43,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-10-23 20:27:43,758 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:43,758 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:43,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-23 20:27:43,759 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:43,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:43,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1952442057, now seen corresponding path program 20 times [2020-10-23 20:27:43,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:43,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [453099765] [2020-10-23 20:27:43,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:43,764 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:43,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:43,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:43,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:46,281 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2020-10-23 20:27:46,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [453099765] [2020-10-23 20:27:46,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:46,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2020-10-23 20:27:46,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456740869] [2020-10-23 20:27:46,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 46 states [2020-10-23 20:27:46,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:46,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2020-10-23 20:27:46,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2020-10-23 20:27:46,283 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 46 states. [2020-10-23 20:27:54,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:54,865 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2020-10-23 20:27:54,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2020-10-23 20:27:54,866 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 185 [2020-10-23 20:27:54,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:54,868 INFO L225 Difference]: With dead ends: 139 [2020-10-23 20:27:54,868 INFO L226 Difference]: Without dead ends: 132 [2020-10-23 20:27:54,872 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1995 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=408, Invalid=11582, Unknown=0, NotChecked=0, Total=11990 [2020-10-23 20:27:54,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-23 20:27:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-10-23 20:27:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-10-23 20:27:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2020-10-23 20:27:54,888 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 185 [2020-10-23 20:27:54,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:54,888 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2020-10-23 20:27:54,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2020-10-23 20:27:54,889 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2020-10-23 20:27:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-10-23 20:27:54,890 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:54,890 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:54,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-23 20:27:54,891 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:54,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:54,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1339041299, now seen corresponding path program 21 times [2020-10-23 20:27:54,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:54,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [70089043] [2020-10-23 20:27:54,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:54,896 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:55,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:55,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:55,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:55,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:55,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:55,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:55,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:55,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:55,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:55,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:55,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:55,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:55,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:55,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:55,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:55,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:55,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:55,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:55,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:55,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:55,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2020-10-23 20:27:56,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [70089043] [2020-10-23 20:27:56,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:56,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2020-10-23 20:27:56,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524719219] [2020-10-23 20:27:56,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-10-23 20:27:56,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:56,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-10-23 20:27:56,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=441, Unknown=0, NotChecked=0, Total=702 [2020-10-23 20:27:56,233 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 27 states. [2020-10-23 20:27:58,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:58,195 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2020-10-23 20:27:58,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-23 20:27:58,199 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 193 [2020-10-23 20:27:58,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:58,200 INFO L225 Difference]: With dead ends: 132 [2020-10-23 20:27:58,200 INFO L226 Difference]: Without dead ends: 0 [2020-10-23 20:27:58,201 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=821, Invalid=1729, Unknown=0, NotChecked=0, Total=2550 [2020-10-23 20:27:58,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-23 20:27:58,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-23 20:27:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-23 20:27:58,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-23 20:27:58,202 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 193 [2020-10-23 20:27:58,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:58,202 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-23 20:27:58,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-10-23 20:27:58,202 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-23 20:27:58,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-23 20:27:58,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-23 20:27:58,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-23 20:27:58,422 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 102 [2020-10-23 20:27:58,637 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 102 [2020-10-23 20:27:58,880 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 98 [2020-10-23 20:27:59,066 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 98 [2020-10-23 20:27:59,300 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 102 [2020-10-23 20:28:00,471 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 175 DAG size of output: 131 [2020-10-23 20:28:01,589 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 175 DAG size of output: 131 [2020-10-23 20:28:02,731 WARN L193 SmtUtils]: Spent 997.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 127 [2020-10-23 20:28:03,721 WARN L193 SmtUtils]: Spent 985.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 127 [2020-10-23 20:28:04,945 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 211 DAG size of output: 168 [2020-10-23 20:28:04,951 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-10-23 20:28:04,951 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-10-23 20:28:04,951 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-10-23 20:28:04,952 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-10-23 20:28:04,952 INFO L277 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-10-23 20:28:04,952 INFO L277 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-10-23 20:28:04,952 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 20:28:04,952 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-23 20:28:04,952 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-10-23 20:28:04,952 INFO L270 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-10-23 20:28:04,953 INFO L277 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-10-23 20:28:04,953 INFO L277 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-10-23 20:28:04,953 INFO L277 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-10-23 20:28:04,953 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:28:04,953 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:28:04,954 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 20:28:04,954 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-23 20:28:04,954 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-23 20:28:04,954 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-10-23 20:28:04,954 INFO L270 CegarLoopResult]: At program point mainEXIT(lines 11 17) the Hoare annotation is: (<= 20 main_~input~0) [2020-10-23 20:28:04,954 INFO L270 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: false [2020-10-23 20:28:04,954 INFO L270 CegarLoopResult]: At program point L14(lines 14 16) the Hoare annotation is: (and (<= 20 main_~input~0) (<= main_~result~0 20) (<= 20 main_~result~0)) [2020-10-23 20:28:04,955 INFO L270 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: false [2020-10-23 20:28:04,955 INFO L270 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= main_~input~0 20) (<= 20 main_~input~0)) [2020-10-23 20:28:04,955 INFO L270 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (<= 20 main_~input~0) (<= |main_#t~ret8| 20) (<= 20 |main_#t~ret8|)) [2020-10-23 20:28:04,955 INFO L270 CegarLoopResult]: At program point L14-2(lines 11 17) the Hoare annotation is: (<= 20 main_~input~0) [2020-10-23 20:28:04,955 INFO L270 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (<= 20 main_~input~0) (<= |main_#t~ret8| 20) (<= 20 |main_#t~ret8|)) [2020-10-23 20:28:04,955 INFO L270 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (and (<= 20 main_~input~0) (<= |main_#t~ret8| 20) (<= 20 |main_#t~ret8|) (<= main_~result~0 20) (<= 20 main_~result~0)) [2020-10-23 20:28:04,956 INFO L270 CegarLoopResult]: At program point idFINAL(lines 6 9) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= |id_#res| 16) .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) .cse0 (<= |id_#in~x| 15) (<= |id_#res| 15)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and (<= |id_#res| 17) (<= 17 |id_#res|) .cse0 (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 9 |id_#in~x|)) (and .cse0 (<= 20 |id_#res|) (<= |id_#res| 20) (<= 20 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|)) (and (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse0 (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= 12 |id_#in~x|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) (and (<= 19 |id_#res|) (<= |id_#res| 19) .cse0 (<= |id_#in~x| 19) (<= 19 |id_#in~x|)) (and (<= 21 |id_#in~x|) .cse0) (and (<= |id_#res| 18) (<= 18 |id_#in~x|) .cse0 (<= 18 |id_#res|) (<= |id_#in~x| 18)))) [2020-10-23 20:28:04,956 INFO L270 CegarLoopResult]: At program point idEXIT(lines 6 9) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= |id_#res| 16) .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) .cse0 (<= |id_#in~x| 15) (<= |id_#res| 15)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and (<= |id_#res| 17) (<= 17 |id_#res|) .cse0 (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 9 |id_#in~x|)) (and .cse0 (<= 20 |id_#res|) (<= |id_#res| 20) (<= 20 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|)) (and (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse0 (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= 12 |id_#in~x|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) (and (<= 19 |id_#res|) (<= |id_#res| 19) .cse0 (<= |id_#in~x| 19) (<= 19 |id_#in~x|)) (and (<= 21 |id_#in~x|) .cse0) (and (<= |id_#res| 18) (<= 18 |id_#in~x|) .cse0 (<= 18 |id_#res|) (<= |id_#in~x| 18)))) [2020-10-23 20:28:04,956 INFO L270 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-10-23 20:28:04,957 INFO L277 CegarLoopResult]: At program point idENTRY(lines 6 9) the Hoare annotation is: true [2020-10-23 20:28:04,957 INFO L270 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-10-23 20:28:04,957 INFO L270 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 12 |id_#in~x|) .cse0 (<= |id_#in~x| 12) (<= |id_#t~ret7| 11) (<= 11 |id_#t~ret7|)) (and (<= 18 |id_#in~x|) (<= |id_#t~ret7| 17) .cse0 (<= |id_#in~x| 18) (<= 17 |id_#t~ret7|)) (and (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and (<= |id_#t~ret7| 19) .cse0 (<= 20 |id_#in~x|) (<= 19 |id_#t~ret7|)) (and .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and .cse0 (<= |id_#in~x| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and .cse0 (<= 18 |id_#t~ret7|) (<= |id_#in~x| 19) (<= |id_#t~ret7| 18) (<= 19 |id_#in~x|)) (and (<= 5 |id_#t~ret7|) (<= |id_#t~ret7| 5) .cse0 (<= 6 |id_#in~x|) (<= |id_#in~x| 6)) (and (<= 15 |id_#in~x|) (<= |id_#t~ret7| 14) .cse0 (<= |id_#in~x| 15) (<= 14 |id_#t~ret7|)) (and .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 15 |id_#t~ret7|) (<= |id_#t~ret7| 15)) (and .cse0 (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and .cse0 (<= |id_#t~ret7| 16) (<= 16 |id_#t~ret7|) (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= |id_#t~ret7| 6) .cse0 (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret7| 12) .cse0 (<= 12 |id_#t~ret7|)) (and (<= 14 |id_#in~x|) (<= |id_#t~ret7| 13) .cse0 (<= 13 |id_#t~ret7|) (<= |id_#in~x| 14)) (and .cse0 (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#t~ret7| 10) (<= 10 |id_#t~ret7|) (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0) (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret7| 0) (<= |id_#in~x| 1)) (and (<= 3 |id_#in~x|) .cse0 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3)) (and .cse0 (<= |id_#in~x| 10) (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9)) (and (<= 21 |id_#in~x|) .cse0))) [2020-10-23 20:28:04,957 INFO L270 CegarLoopResult]: At program point L7-1(line 7) the Hoare annotation is: (and (= |id_#in~x| id_~x) (= |id_#in~x| 0)) [2020-10-23 20:28:04,958 INFO L270 CegarLoopResult]: At program point L8-2(line 8) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 12 |id_#in~x|) .cse0 (<= |id_#in~x| 12) (<= |id_#t~ret7| 11) (<= 11 |id_#t~ret7|)) (and (<= 18 |id_#in~x|) (<= |id_#t~ret7| 17) .cse0 (<= |id_#in~x| 18) (<= 17 |id_#t~ret7|)) (and (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and (<= |id_#t~ret7| 19) .cse0 (<= 20 |id_#in~x|) (<= 19 |id_#t~ret7|)) (and .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and .cse0 (<= |id_#in~x| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and .cse0 (<= 18 |id_#t~ret7|) (<= |id_#in~x| 19) (<= |id_#t~ret7| 18) (<= 19 |id_#in~x|)) (and (<= 5 |id_#t~ret7|) (<= |id_#t~ret7| 5) .cse0 (<= 6 |id_#in~x|) (<= |id_#in~x| 6)) (and (<= 15 |id_#in~x|) (<= |id_#t~ret7| 14) .cse0 (<= |id_#in~x| 15) (<= 14 |id_#t~ret7|)) (and .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 15 |id_#t~ret7|) (<= |id_#t~ret7| 15)) (and .cse0 (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and .cse0 (<= |id_#t~ret7| 16) (<= 16 |id_#t~ret7|) (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= |id_#t~ret7| 6) .cse0 (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret7| 12) .cse0 (<= 12 |id_#t~ret7|)) (and (<= 14 |id_#in~x|) (<= |id_#t~ret7| 13) .cse0 (<= 13 |id_#t~ret7|) (<= |id_#in~x| 14)) (and .cse0 (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#t~ret7| 10) (<= 10 |id_#t~ret7|) (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0) (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret7| 0) (<= |id_#in~x| 1)) (and (<= 3 |id_#in~x|) .cse0 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3)) (and .cse0 (<= |id_#in~x| 10) (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9)) (and (<= 21 |id_#in~x|) .cse0))) [2020-10-23 20:28:04,958 INFO L270 CegarLoopResult]: At program point L8-3(line 8) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (= |id_#t~ret7| 0) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) (<= |id_#t~ret7| 14) .cse0 (<= |id_#in~x| 15) (<= 14 |id_#t~ret7|) (<= |id_#res| 15)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 8 |id_#res|) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and (<= |id_#t~ret7| 6) (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= |id_#t~ret7| 19) .cse0 (<= 20 |id_#res|) (<= |id_#res| 20) (<= 20 |id_#in~x|) (<= 19 |id_#t~ret7|)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and (<= |id_#res| 17) (<= 17 |id_#res|) .cse0 (<= |id_#t~ret7| 16) (<= 16 |id_#t~ret7|) (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret7| 12) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|) (<= 12 |id_#t~ret7|)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and .cse0 (<= |id_#in~x| 10) (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= 12 |id_#in~x|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|) (<= |id_#t~ret7| 11) (<= 11 |id_#t~ret7|)) (and (<= |id_#res| 14) (<= 14 |id_#in~x|) (<= |id_#t~ret7| 13) .cse0 (<= 13 |id_#t~ret7|) (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= |id_#res| 16) .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|) (<= 15 |id_#t~ret7|) (<= |id_#t~ret7| 15)) (and (<= |id_#res| 18) (<= 18 |id_#in~x|) (<= |id_#t~ret7| 17) .cse0 (<= 18 |id_#res|) (<= |id_#in~x| 18) (<= 17 |id_#t~ret7|)) (and (<= 19 |id_#res|) (<= |id_#res| 19) .cse0 (<= 18 |id_#t~ret7|) (<= |id_#in~x| 19) (<= |id_#t~ret7| 18) (<= 19 |id_#in~x|)) (and (<= 21 |id_#in~x|) .cse0) (and (<= 2 |id_#res|) .cse0 (<= |id_#t~ret7| 1) (<= |id_#res| 2) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#t~ret7| 10) (<= 10 |id_#t~ret7|) (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5) (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and (<= 5 |id_#t~ret7|) (<= |id_#res| 6) (<= |id_#t~ret7| 5) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)))) [2020-10-23 20:28:04,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:28:04 BoogieIcfgContainer [2020-10-23 20:28:04,982 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 20:28:04,984 INFO L168 Benchmark]: Toolchain (without parser) took 49695.69 ms. Allocated memory was 155.2 MB in the beginning and 389.0 MB in the end (delta: 233.8 MB). Free memory was 132.2 MB in the beginning and 270.2 MB in the end (delta: -138.0 MB). Peak memory consumption was 228.6 MB. Max. memory is 8.0 GB. [2020-10-23 20:28:04,984 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 155.2 MB. Free memory is still 129.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 20:28:04,984 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.44 ms. Allocated memory is still 155.2 MB. Free memory was 131.6 MB in the beginning and 122.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-23 20:28:04,985 INFO L168 Benchmark]: Boogie Preprocessor took 35.62 ms. Allocated memory is still 155.2 MB. Free memory was 122.4 MB in the beginning and 121.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-23 20:28:04,985 INFO L168 Benchmark]: RCFGBuilder took 327.97 ms. Allocated memory is still 155.2 MB. Free memory was 121.0 MB in the beginning and 108.1 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-10-23 20:28:04,986 INFO L168 Benchmark]: TraceAbstraction took 49059.94 ms. Allocated memory was 155.2 MB in the beginning and 389.0 MB in the end (delta: 233.8 MB). Free memory was 107.7 MB in the beginning and 270.2 MB in the end (delta: -162.5 MB). Peak memory consumption was 203.5 MB. Max. memory is 8.0 GB. [2020-10-23 20:28:04,988 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.22 ms. Allocated memory is still 155.2 MB. Free memory is still 129.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 255.44 ms. Allocated memory is still 155.2 MB. Free memory was 131.6 MB in the beginning and 122.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 35.62 ms. Allocated memory is still 155.2 MB. Free memory was 122.4 MB in the beginning and 121.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 327.97 ms. Allocated memory is still 155.2 MB. Free memory was 121.0 MB in the beginning and 108.1 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 49059.94 ms. Allocated memory was 155.2 MB in the beginning and 389.0 MB in the end (delta: 233.8 MB). Free memory was 107.7 MB in the beginning and 270.2 MB in the end (delta: -162.5 MB). Peak memory consumption was 203.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 20 <= input - ProcedureContractResult [Line: 6]: Procedure Contract for id Derived contract for procedure id: ((((((((((((((((((((((((7 <= \result && \old(x) == x) && \result <= 7) && 7 <= \old(x)) && \old(x) <= 7) || ((((1 <= \old(x) && \old(x) == x) && \result <= 1) && 1 <= \result) && \old(x) <= 1)) || ((((\old(x) <= 11 && 11 <= \old(x)) && \old(x) == x) && \result <= 11) && 11 <= \result)) || ((((\old(x) == x && \old(x) <= 10) && 10 <= \old(x)) && 10 <= \result) && \result <= 10)) || ((((\result <= 16 && \old(x) == x) && 16 <= \old(x)) && \old(x) <= 16) && 16 <= \result)) || ((((15 <= \result && 15 <= \old(x)) && \old(x) == x) && \old(x) <= 15) && \result <= 15)) || ((((5 <= \result && 5 <= \old(x)) && \old(x) <= 5) && \old(x) == x) && \result <= 5)) || ((((2 <= \result && \old(x) == x) && \result <= 2) && 2 <= \old(x)) && \old(x) <= 2)) || ((((\result <= 3 && 3 <= \old(x)) && \old(x) == x) && \old(x) <= 3) && 3 <= \result)) || ((((\result <= 17 && 17 <= \result) && \old(x) == x) && \old(x) <= 17) && 17 <= \old(x))) || ((((9 <= \result && \old(x) == x) && \old(x) <= 9) && \result <= 9) && 9 <= \old(x))) || (((\old(x) == x && 20 <= \result) && \result <= 20) && 20 <= \old(x))) || ((((13 <= \old(x) && \old(x) <= 13) && \old(x) == x) && \result <= 13) && 13 <= \result)) || ((((\result <= 14 && 14 <= \old(x)) && \old(x) == x) && 14 <= \result) && \old(x) <= 14)) || ((((12 <= \old(x) && \old(x) == x) && \result <= 12) && \old(x) <= 12) && 12 <= \result)) || ((((\result <= 4 && 4 <= \result) && \old(x) == x) && \old(x) <= 4) && 4 <= \old(x))) || ((\old(x) == x && \result == 0) && \old(x) == 0)) || ((((\result <= 6 && \old(x) == x) && 6 <= \old(x)) && 6 <= \result) && \old(x) <= 6)) || ((((\result <= 8 && \old(x) == x) && 8 <= \old(x)) && 8 <= \result) && \old(x) <= 8)) || ((((19 <= \result && \result <= 19) && \old(x) == x) && \old(x) <= 19) && 19 <= \old(x))) || (21 <= \old(x) && \old(x) == x)) || ((((\result <= 18 && 18 <= \old(x)) && \old(x) == x) && 18 <= \result) && \old(x) <= 18) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 42.1s, OverallIterations: 22, TraceHistogramMax: 22, AutomataDifference: 26.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 710 SDtfs, 2243 SDslu, 2070 SDs, 0 SdLazy, 7645 SolverSat, 654 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1228 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 677 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5139 ImplicationChecksByTransitivity, 22.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 130 PreInvPairs, 539 NumberOfFragments, 1880 HoareAnnotationTreeSize, 130 FomulaSimplifications, 8966 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 37 FomulaSimplificationsInter, 7564 FormulaSimplificationTreeSizeReductionInter, 5.5s 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...