/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/recHanoi03-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:26:17,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:26:17,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:26:17,459 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:26:17,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:26:17,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:26:17,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:26:17,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:26:17,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:26:17,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:26:17,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:26:17,484 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:26:17,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:26:17,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:26:17,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:26:17,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:26:17,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:26:17,495 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:26:17,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:26:17,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:26:17,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:26:17,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:26:17,522 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:26:17,523 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:26:17,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:26:17,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:26:17,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:26:17,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:26:17,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:26:17,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:26:17,536 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:26:17,537 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:26:17,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:26:17,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:26:17,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:26:17,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:26:17,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:26:17,542 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:26:17,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:26:17,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:26:17,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:26:17,545 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 00:26:17,566 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:26:17,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:26:17,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:26:17,571 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:26:17,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:26:17,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:26:17,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:26:17,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:26:17,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:26:17,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:26:17,573 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:26:17,574 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:26:17,574 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:26:17,574 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:26:17,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:26:17,575 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:26:17,575 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:26:17,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:26:17,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:26:17,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:26:17,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:26:17,576 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:26:17,576 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-07 00:26:18,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:26:18,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:26:18,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:26:18,056 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:26:18,056 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:26:18,057 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/recHanoi03-2.c [2020-11-07 00:26:18,141 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf5dbc36a/6e24bd07d18c4c0fb8ae0f4a4ee067b7/FLAGbc4fa411c [2020-11-07 00:26:18,710 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:26:18,710 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/recHanoi03-2.c [2020-11-07 00:26:18,717 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf5dbc36a/6e24bd07d18c4c0fb8ae0f4a4ee067b7/FLAGbc4fa411c [2020-11-07 00:26:19,065 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf5dbc36a/6e24bd07d18c4c0fb8ae0f4a4ee067b7 [2020-11-07 00:26:19,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:26:19,075 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:26:19,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:26:19,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:26:19,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:26:19,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:26:19" (1/1) ... [2020-11-07 00:26:19,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57ca349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:26:19, skipping insertion in model container [2020-11-07 00:26:19,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:26:19" (1/1) ... [2020-11-07 00:26:19,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:26:19,110 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:26:19,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:26:19,266 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:26:19,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:26:19,297 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:26:19,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:26:19 WrapperNode [2020-11-07 00:26:19,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:26:19,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:26:19,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:26:19,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:26:19,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:26:19" (1/1) ... [2020-11-07 00:26:19,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:26:19" (1/1) ... [2020-11-07 00:26:19,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:26:19" (1/1) ... [2020-11-07 00:26:19,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:26:19" (1/1) ... [2020-11-07 00:26:19,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:26:19" (1/1) ... [2020-11-07 00:26:19,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:26:19" (1/1) ... [2020-11-07 00:26:19,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:26:19" (1/1) ... [2020-11-07 00:26:19,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:26:19,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:26:19,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:26:19,330 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:26:19,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:26:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:26:19,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:26:19,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:26:19,416 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:26:19,416 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2020-11-07 00:26:19,416 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:26:19,416 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:26:19,416 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:26:19,417 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:26:19,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:26:19,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:26:19,417 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2020-11-07 00:26:19,418 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:26:19,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:26:19,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:26:19,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:26:19,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:26:19,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:26:19,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:26:19,691 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:26:19,691 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:26:19,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:26:19 BoogieIcfgContainer [2020-11-07 00:26:19,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:26:19,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:26:19,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:26:19,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:26:19,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:26:19" (1/3) ... [2020-11-07 00:26:19,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3346c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:26:19, skipping insertion in model container [2020-11-07 00:26:19,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:26:19" (2/3) ... [2020-11-07 00:26:19,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3346c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:26:19, skipping insertion in model container [2020-11-07 00:26:19,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:26:19" (3/3) ... [2020-11-07 00:26:19,702 INFO L111 eAbstractionObserver]: Analyzing ICFG recHanoi03-2.c [2020-11-07 00:26:19,719 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:26:19,723 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:26:19,741 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:26:19,773 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:26:19,773 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:26:19,773 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:26:19,773 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:26:19,774 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:26:19,774 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:26:19,774 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:26:19,774 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:26:19,823 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2020-11-07 00:26:19,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-07 00:26:19,861 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:19,865 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:26:19,866 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:19,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:19,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1519440261, now seen corresponding path program 1 times [2020-11-07 00:26:19,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:19,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [880918953] [2020-11-07 00:26:19,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:20,007 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:20,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:20,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:26:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:26:20,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [880918953] [2020-11-07 00:26:20,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:20,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:26:20,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498399873] [2020-11-07 00:26:20,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:26:20,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:20,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:26:20,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:26:20,353 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 8 states. [2020-11-07 00:26:20,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:20,856 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2020-11-07 00:26:20,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:26:20,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-11-07 00:26:20,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:20,869 INFO L225 Difference]: With dead ends: 58 [2020-11-07 00:26:20,869 INFO L226 Difference]: Without dead ends: 35 [2020-11-07 00:26:20,873 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:26:20,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-11-07 00:26:20,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-11-07 00:26:20,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-11-07 00:26:20,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-11-07 00:26:20,927 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 28 [2020-11-07 00:26:20,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:20,928 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-11-07 00:26:20,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:26:20,928 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-11-07 00:26:20,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-07 00:26:20,931 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:20,931 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, 1, 1, 1] [2020-11-07 00:26:20,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:26:20,932 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:20,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:20,933 INFO L82 PathProgramCache]: Analyzing trace with hash -799218257, now seen corresponding path program 1 times [2020-11-07 00:26:20,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:20,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1719535716] [2020-11-07 00:26:20,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:20,937 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:21,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:21,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:26:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:21,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:21,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 00:26:21,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1719535716] [2020-11-07 00:26:21,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:21,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:26:21,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751985565] [2020-11-07 00:26:21,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:26:21,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:21,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:26:21,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:26:21,172 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 10 states. [2020-11-07 00:26:21,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:21,688 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2020-11-07 00:26:21,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 00:26:21,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2020-11-07 00:26:21,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:21,691 INFO L225 Difference]: With dead ends: 47 [2020-11-07 00:26:21,691 INFO L226 Difference]: Without dead ends: 40 [2020-11-07 00:26:21,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2020-11-07 00:26:21,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-11-07 00:26:21,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-11-07 00:26:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-07 00:26:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2020-11-07 00:26:21,707 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 36 [2020-11-07 00:26:21,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:21,707 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2020-11-07 00:26:21,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:26:21,708 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2020-11-07 00:26:21,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-07 00:26:21,709 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:21,710 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, 1, 1, 1] [2020-11-07 00:26:21,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:26:21,710 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:21,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:21,711 INFO L82 PathProgramCache]: Analyzing trace with hash 717569989, now seen corresponding path program 2 times [2020-11-07 00:26:21,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:21,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1658775076] [2020-11-07 00:26:21,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:21,715 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:21,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:21,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:26:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:21,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:21,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:21,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-07 00:26:21,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1658775076] [2020-11-07 00:26:21,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:21,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:26:21,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877982347] [2020-11-07 00:26:21,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:26:21,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:21,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:26:21,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:26:21,978 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 12 states. [2020-11-07 00:26:22,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:22,610 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-11-07 00:26:22,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:26:22,611 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2020-11-07 00:26:22,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:22,613 INFO L225 Difference]: With dead ends: 52 [2020-11-07 00:26:22,613 INFO L226 Difference]: Without dead ends: 45 [2020-11-07 00:26:22,614 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2020-11-07 00:26:22,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-11-07 00:26:22,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-11-07 00:26:22,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-07 00:26:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-11-07 00:26:22,628 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 44 [2020-11-07 00:26:22,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:22,628 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-11-07 00:26:22,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:26:22,629 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-11-07 00:26:22,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-07 00:26:22,631 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:22,631 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, 1, 1, 1] [2020-11-07 00:26:22,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:26:22,631 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:22,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:22,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1384654703, now seen corresponding path program 3 times [2020-11-07 00:26:22,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:22,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1470606982] [2020-11-07 00:26:22,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:22,635 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:22,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:22,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:26:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:22,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:22,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:22,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:23,003 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-07 00:26:23,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1470606982] [2020-11-07 00:26:23,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:23,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-07 00:26:23,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504463562] [2020-11-07 00:26:23,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 00:26:23,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:23,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 00:26:23,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:26:23,007 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 14 states. [2020-11-07 00:26:24,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:24,080 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2020-11-07 00:26:24,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 00:26:24,086 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2020-11-07 00:26:24,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:24,088 INFO L225 Difference]: With dead ends: 57 [2020-11-07 00:26:24,088 INFO L226 Difference]: Without dead ends: 50 [2020-11-07 00:26:24,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2020-11-07 00:26:24,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-11-07 00:26:24,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-11-07 00:26:24,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-11-07 00:26:24,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2020-11-07 00:26:24,103 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 52 [2020-11-07 00:26:24,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:24,103 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2020-11-07 00:26:24,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 00:26:24,103 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-11-07 00:26:24,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 00:26:24,105 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:24,105 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, 1, 1, 1] [2020-11-07 00:26:24,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:26:24,105 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:24,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:24,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1349115397, now seen corresponding path program 4 times [2020-11-07 00:26:24,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:24,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1400774472] [2020-11-07 00:26:24,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:24,109 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:24,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:24,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:26:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:24,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:24,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:24,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:24,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:24,450 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-07 00:26:24,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1400774472] [2020-11-07 00:26:24,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:24,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-07 00:26:24,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154010580] [2020-11-07 00:26:24,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 00:26:24,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:24,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 00:26:24,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2020-11-07 00:26:24,453 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 16 states. [2020-11-07 00:26:25,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:25,764 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2020-11-07 00:26:25,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 00:26:25,765 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2020-11-07 00:26:25,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:25,768 INFO L225 Difference]: With dead ends: 62 [2020-11-07 00:26:25,768 INFO L226 Difference]: Without dead ends: 55 [2020-11-07 00:26:25,769 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=147, Invalid=975, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 00:26:25,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-11-07 00:26:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-11-07 00:26:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-11-07 00:26:25,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2020-11-07 00:26:25,794 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 60 [2020-11-07 00:26:25,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:25,800 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2020-11-07 00:26:25,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 00:26:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2020-11-07 00:26:25,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-11-07 00:26:25,803 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:25,804 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, 1, 1, 1] [2020-11-07 00:26:25,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:26:25,807 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:25,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:25,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1532049711, now seen corresponding path program 5 times [2020-11-07 00:26:25,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:25,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2006380735] [2020-11-07 00:26:25,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:25,811 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:25,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:25,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:26:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:25,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:25,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:26,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:26,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:26,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:26,209 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 00:26:26,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2006380735] [2020-11-07 00:26:26,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:26,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-11-07 00:26:26,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271251895] [2020-11-07 00:26:26,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 00:26:26,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:26,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 00:26:26,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2020-11-07 00:26:26,212 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 18 states. [2020-11-07 00:26:27,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:27,710 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2020-11-07 00:26:27,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-07 00:26:27,710 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2020-11-07 00:26:27,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:27,712 INFO L225 Difference]: With dead ends: 67 [2020-11-07 00:26:27,712 INFO L226 Difference]: Without dead ends: 60 [2020-11-07 00:26:27,713 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=172, Invalid=1310, Unknown=0, NotChecked=0, Total=1482 [2020-11-07 00:26:27,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-11-07 00:26:27,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-11-07 00:26:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-11-07 00:26:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-11-07 00:26:27,730 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 68 [2020-11-07 00:26:27,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:27,730 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-11-07 00:26:27,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 00:26:27,731 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-11-07 00:26:27,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-07 00:26:27,732 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:27,732 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, 1, 1, 1] [2020-11-07 00:26:27,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:26:27,733 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:27,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:27,733 INFO L82 PathProgramCache]: Analyzing trace with hash 386051141, now seen corresponding path program 6 times [2020-11-07 00:26:27,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:27,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1318346188] [2020-11-07 00:26:27,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:27,736 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:27,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:27,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:26:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:27,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:27,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:27,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:27,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:28,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:28,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-11-07 00:26:28,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1318346188] [2020-11-07 00:26:28,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:28,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-11-07 00:26:28,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475954024] [2020-11-07 00:26:28,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 00:26:28,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:28,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 00:26:28,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2020-11-07 00:26:28,227 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 20 states. [2020-11-07 00:26:30,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:30,040 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2020-11-07 00:26:30,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-07 00:26:30,041 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 76 [2020-11-07 00:26:30,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:30,043 INFO L225 Difference]: With dead ends: 72 [2020-11-07 00:26:30,043 INFO L226 Difference]: Without dead ends: 65 [2020-11-07 00:26:30,046 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=197, Invalid=1695, Unknown=0, NotChecked=0, Total=1892 [2020-11-07 00:26:30,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-07 00:26:30,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-11-07 00:26:30,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-07 00:26:30,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2020-11-07 00:26:30,061 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 76 [2020-11-07 00:26:30,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:30,062 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2020-11-07 00:26:30,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 00:26:30,062 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2020-11-07 00:26:30,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-11-07 00:26:30,064 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:30,064 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, 1, 1, 1] [2020-11-07 00:26:30,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:26:30,064 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:30,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:30,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1370757871, now seen corresponding path program 7 times [2020-11-07 00:26:30,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:30,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1131585416] [2020-11-07 00:26:30,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:30,069 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:30,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:30,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:26:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:30,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:30,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:30,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:30,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:30,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:30,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:30,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:30,674 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-11-07 00:26:30,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1131585416] [2020-11-07 00:26:30,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:30,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-11-07 00:26:30,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555644627] [2020-11-07 00:26:30,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 00:26:30,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:30,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 00:26:30,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2020-11-07 00:26:30,678 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 22 states. [2020-11-07 00:26:32,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:32,728 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2020-11-07 00:26:32,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-07 00:26:32,729 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 84 [2020-11-07 00:26:32,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:32,730 INFO L225 Difference]: With dead ends: 77 [2020-11-07 00:26:32,730 INFO L226 Difference]: Without dead ends: 70 [2020-11-07 00:26:32,732 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=222, Invalid=2130, Unknown=0, NotChecked=0, Total=2352 [2020-11-07 00:26:32,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-07 00:26:32,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-11-07 00:26:32,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-07 00:26:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2020-11-07 00:26:32,753 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 84 [2020-11-07 00:26:32,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:32,754 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2020-11-07 00:26:32,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 00:26:32,754 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2020-11-07 00:26:32,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-11-07 00:26:32,755 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:32,756 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, 1, 1, 1] [2020-11-07 00:26:32,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:26:32,756 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:32,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:32,757 INFO L82 PathProgramCache]: Analyzing trace with hash 890481285, now seen corresponding path program 8 times [2020-11-07 00:26:32,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:32,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1862417305] [2020-11-07 00:26:32,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:32,760 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:32,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:32,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:26:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:32,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:32,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:33,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:33,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:33,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:33,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:33,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:33,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:33,501 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-07 00:26:33,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1862417305] [2020-11-07 00:26:33,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:33,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-11-07 00:26:33,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645245795] [2020-11-07 00:26:33,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-07 00:26:33,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:33,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-07 00:26:33,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2020-11-07 00:26:33,504 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 24 states. [2020-11-07 00:26:35,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:35,971 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2020-11-07 00:26:35,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-07 00:26:35,971 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 92 [2020-11-07 00:26:35,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:35,973 INFO L225 Difference]: With dead ends: 82 [2020-11-07 00:26:35,973 INFO L226 Difference]: Without dead ends: 75 [2020-11-07 00:26:35,976 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=247, Invalid=2615, Unknown=0, NotChecked=0, Total=2862 [2020-11-07 00:26:35,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-11-07 00:26:35,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-11-07 00:26:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-07 00:26:35,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2020-11-07 00:26:35,994 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 92 [2020-11-07 00:26:35,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:35,995 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2020-11-07 00:26:35,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-07 00:26:35,995 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2020-11-07 00:26:35,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-11-07 00:26:35,996 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:35,997 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, 1, 1, 1] [2020-11-07 00:26:35,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:26:35,997 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:35,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:35,998 INFO L82 PathProgramCache]: Analyzing trace with hash 296537263, now seen corresponding path program 9 times [2020-11-07 00:26:35,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:35,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1335525817] [2020-11-07 00:26:35,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:36,001 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:36,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:36,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:26:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:36,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:36,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:36,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:36,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:36,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:36,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:36,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:36,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:36,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:36,833 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-11-07 00:26:36,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1335525817] [2020-11-07 00:26:36,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:36,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2020-11-07 00:26:36,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013347312] [2020-11-07 00:26:36,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-11-07 00:26:36,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:36,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-07 00:26:36,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2020-11-07 00:26:36,835 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 26 states. [2020-11-07 00:26:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:39,691 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2020-11-07 00:26:39,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-11-07 00:26:39,692 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 100 [2020-11-07 00:26:39,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:39,694 INFO L225 Difference]: With dead ends: 87 [2020-11-07 00:26:39,694 INFO L226 Difference]: Without dead ends: 80 [2020-11-07 00:26:39,696 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=272, Invalid=3150, Unknown=0, NotChecked=0, Total=3422 [2020-11-07 00:26:39,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-11-07 00:26:39,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-11-07 00:26:39,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-11-07 00:26:39,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2020-11-07 00:26:39,713 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 100 [2020-11-07 00:26:39,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:39,714 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2020-11-07 00:26:39,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-11-07 00:26:39,714 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2020-11-07 00:26:39,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-11-07 00:26:39,715 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:39,715 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, 1, 1, 1] [2020-11-07 00:26:39,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:26:39,716 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:39,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:39,716 INFO L82 PathProgramCache]: Analyzing trace with hash 203479237, now seen corresponding path program 10 times [2020-11-07 00:26:39,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:39,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1892673956] [2020-11-07 00:26:39,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:39,719 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:39,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:39,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:26:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:39,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:39,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:39,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:40,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:40,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:40,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:40,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:40,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:40,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:40,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-11-07 00:26:40,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1892673956] [2020-11-07 00:26:40,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:40,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2020-11-07 00:26:40,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963909685] [2020-11-07 00:26:40,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-11-07 00:26:40,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:40,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-11-07 00:26:40,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2020-11-07 00:26:40,667 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 28 states. [2020-11-07 00:26:43,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:43,947 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2020-11-07 00:26:43,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-11-07 00:26:43,947 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 108 [2020-11-07 00:26:43,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:43,950 INFO L225 Difference]: With dead ends: 92 [2020-11-07 00:26:43,951 INFO L226 Difference]: Without dead ends: 85 [2020-11-07 00:26:43,952 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=297, Invalid=3735, Unknown=0, NotChecked=0, Total=4032 [2020-11-07 00:26:43,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-11-07 00:26:43,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-11-07 00:26:43,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-11-07 00:26:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2020-11-07 00:26:43,972 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 108 [2020-11-07 00:26:43,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:43,973 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2020-11-07 00:26:43,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-11-07 00:26:43,973 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2020-11-07 00:26:43,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-11-07 00:26:43,974 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:43,974 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, 1, 1, 1] [2020-11-07 00:26:43,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:26:43,975 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:43,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:43,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1405661585, now seen corresponding path program 11 times [2020-11-07 00:26:43,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:43,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [331823725] [2020-11-07 00:26:43,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:43,978 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:44,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:44,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:26:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:44,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:44,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:44,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:44,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:44,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:44,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:44,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:44,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:44,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:44,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:44,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,002 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-11-07 00:26:45,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [331823725] [2020-11-07 00:26:45,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:45,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2020-11-07 00:26:45,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268486446] [2020-11-07 00:26:45,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-11-07 00:26:45,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:45,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-11-07 00:26:45,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2020-11-07 00:26:45,004 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 30 states. [2020-11-07 00:26:48,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:48,768 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2020-11-07 00:26:48,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-11-07 00:26:48,779 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 116 [2020-11-07 00:26:48,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:48,780 INFO L225 Difference]: With dead ends: 97 [2020-11-07 00:26:48,780 INFO L226 Difference]: Without dead ends: 90 [2020-11-07 00:26:48,783 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=322, Invalid=4370, Unknown=0, NotChecked=0, Total=4692 [2020-11-07 00:26:48,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-11-07 00:26:48,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-11-07 00:26:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-11-07 00:26:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2020-11-07 00:26:48,810 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 116 [2020-11-07 00:26:48,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:48,811 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2020-11-07 00:26:48,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-11-07 00:26:48,811 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2020-11-07 00:26:48,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-11-07 00:26:48,813 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:48,814 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, 1, 1, 1] [2020-11-07 00:26:48,814 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 00:26:48,814 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:48,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:48,815 INFO L82 PathProgramCache]: Analyzing trace with hash -391235835, now seen corresponding path program 12 times [2020-11-07 00:26:48,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:48,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [839387403] [2020-11-07 00:26:48,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:48,818 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:48,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:48,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:26:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:48,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:49,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:49,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:49,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:49,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:49,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:49,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:49,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:49,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:49,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:49,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:49,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-11-07 00:26:49,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [839387403] [2020-11-07 00:26:49,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:49,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2020-11-07 00:26:49,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028885466] [2020-11-07 00:26:49,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-11-07 00:26:49,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:49,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-11-07 00:26:49,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2020-11-07 00:26:49,977 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 32 states. [2020-11-07 00:26:54,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:54,202 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2020-11-07 00:26:54,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-11-07 00:26:54,204 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 124 [2020-11-07 00:26:54,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:54,205 INFO L225 Difference]: With dead ends: 102 [2020-11-07 00:26:54,205 INFO L226 Difference]: Without dead ends: 95 [2020-11-07 00:26:54,207 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=347, Invalid=5055, Unknown=0, NotChecked=0, Total=5402 [2020-11-07 00:26:54,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-11-07 00:26:54,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-11-07 00:26:54,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-07 00:26:54,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2020-11-07 00:26:54,233 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 124 [2020-11-07 00:26:54,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:54,234 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2020-11-07 00:26:54,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-11-07 00:26:54,234 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2020-11-07 00:26:54,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-07 00:26:54,235 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:54,235 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, 1, 1, 1] [2020-11-07 00:26:54,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 00:26:54,236 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:54,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:54,236 INFO L82 PathProgramCache]: Analyzing trace with hash 659529775, now seen corresponding path program 13 times [2020-11-07 00:26:54,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:54,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1445936963] [2020-11-07 00:26:54,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:54,239 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:26:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:55,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:55,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:55,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:55,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:26:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-11-07 00:26:55,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1445936963] [2020-11-07 00:26:55,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:55,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2020-11-07 00:26:55,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303741160] [2020-11-07 00:26:55,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-11-07 00:26:55,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:55,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-11-07 00:26:55,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 00:26:55,659 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 34 states. [2020-11-07 00:27:00,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:27:00,330 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2020-11-07 00:27:00,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2020-11-07 00:27:00,330 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2020-11-07 00:27:00,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:27:00,337 INFO L225 Difference]: With dead ends: 107 [2020-11-07 00:27:00,337 INFO L226 Difference]: Without dead ends: 100 [2020-11-07 00:27:00,339 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=372, Invalid=5790, Unknown=0, NotChecked=0, Total=6162 [2020-11-07 00:27:00,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-11-07 00:27:00,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2020-11-07 00:27:00,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-07 00:27:00,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2020-11-07 00:27:00,357 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 132 [2020-11-07 00:27:00,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:27:00,358 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2020-11-07 00:27:00,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-11-07 00:27:00,358 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2020-11-07 00:27:00,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-11-07 00:27:00,360 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:27:00,360 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, 1, 1, 1] [2020-11-07 00:27:00,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 00:27:00,360 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:27:00,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:27:00,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1111475525, now seen corresponding path program 14 times [2020-11-07 00:27:00,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:27:00,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [25130410] [2020-11-07 00:27:00,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:27:00,364 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:27:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:00,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:27:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:00,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:27:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:00,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:00,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:00,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:00,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:00,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:00,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:00,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:01,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:01,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:01,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:01,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:01,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:01,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:01,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:01,862 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-11-07 00:27:01,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [25130410] [2020-11-07 00:27:01,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:27:01,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2020-11-07 00:27:01,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686541878] [2020-11-07 00:27:01,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-11-07 00:27:01,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:27:01,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-11-07 00:27:01,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2020-11-07 00:27:01,865 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 36 states. [2020-11-07 00:27:07,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:27:07,134 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2020-11-07 00:27:07,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-11-07 00:27:07,134 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 140 [2020-11-07 00:27:07,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:27:07,136 INFO L225 Difference]: With dead ends: 112 [2020-11-07 00:27:07,136 INFO L226 Difference]: Without dead ends: 105 [2020-11-07 00:27:07,140 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=397, Invalid=6575, Unknown=0, NotChecked=0, Total=6972 [2020-11-07 00:27:07,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-11-07 00:27:07,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-11-07 00:27:07,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-11-07 00:27:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2020-11-07 00:27:07,161 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 140 [2020-11-07 00:27:07,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:27:07,162 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2020-11-07 00:27:07,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-11-07 00:27:07,162 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2020-11-07 00:27:07,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-11-07 00:27:07,163 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:27:07,164 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, 1, 1, 1] [2020-11-07 00:27:07,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 00:27:07,164 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:27:07,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:27:07,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1039253999, now seen corresponding path program 15 times [2020-11-07 00:27:07,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:27:07,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1026700490] [2020-11-07 00:27:07,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:27:07,167 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:27:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:07,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:27:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:07,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:27:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:07,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:07,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:07,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:07,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:07,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:07,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:07,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:07,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:07,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:08,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:08,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:08,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:08,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:08,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:08,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-11-07 00:27:08,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1026700490] [2020-11-07 00:27:08,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:27:08,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2020-11-07 00:27:08,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977435391] [2020-11-07 00:27:08,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2020-11-07 00:27:08,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:27:08,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-11-07 00:27:08,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2020-11-07 00:27:08,955 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 38 states. [2020-11-07 00:27:14,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:27:14,828 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2020-11-07 00:27:14,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2020-11-07 00:27:14,829 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2020-11-07 00:27:14,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:27:14,831 INFO L225 Difference]: With dead ends: 117 [2020-11-07 00:27:14,831 INFO L226 Difference]: Without dead ends: 110 [2020-11-07 00:27:14,835 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=422, Invalid=7410, Unknown=0, NotChecked=0, Total=7832 [2020-11-07 00:27:14,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-11-07 00:27:14,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-11-07 00:27:14,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-11-07 00:27:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2020-11-07 00:27:14,859 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 148 [2020-11-07 00:27:14,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:27:14,860 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2020-11-07 00:27:14,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2020-11-07 00:27:14,860 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2020-11-07 00:27:14,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-11-07 00:27:14,862 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:27:14,862 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, 1, 1, 1] [2020-11-07 00:27:14,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 00:27:14,862 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:27:14,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:27:14,863 INFO L82 PathProgramCache]: Analyzing trace with hash -78019707, now seen corresponding path program 16 times [2020-11-07 00:27:14,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:27:14,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1675062972] [2020-11-07 00:27:14,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:27:14,865 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:27:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:14,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:27:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:14,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:27:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:15,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:15,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:15,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:15,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:15,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:15,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:15,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:15,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:15,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:15,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:15,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:15,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:16,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:16,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:16,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:16,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:16,745 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-11-07 00:27:16,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1675062972] [2020-11-07 00:27:16,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:27:16,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2020-11-07 00:27:16,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123285256] [2020-11-07 00:27:16,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states [2020-11-07 00:27:16,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:27:16,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2020-11-07 00:27:16,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2020-11-07 00:27:16,748 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 40 states. [2020-11-07 00:27:23,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:27:23,274 INFO L93 Difference]: Finished difference Result 122 states and 123 transitions. [2020-11-07 00:27:23,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2020-11-07 00:27:23,275 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 156 [2020-11-07 00:27:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:27:23,277 INFO L225 Difference]: With dead ends: 122 [2020-11-07 00:27:23,277 INFO L226 Difference]: Without dead ends: 115 [2020-11-07 00:27:23,279 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=447, Invalid=8295, Unknown=0, NotChecked=0, Total=8742 [2020-11-07 00:27:23,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-11-07 00:27:23,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2020-11-07 00:27:23,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-11-07 00:27:23,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2020-11-07 00:27:23,306 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 156 [2020-11-07 00:27:23,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:27:23,306 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2020-11-07 00:27:23,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2020-11-07 00:27:23,307 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2020-11-07 00:27:23,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-11-07 00:27:23,311 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:27:23,311 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, 1, 1, 1] [2020-11-07 00:27:23,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 00:27:23,312 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:27:23,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:27:23,314 INFO L82 PathProgramCache]: Analyzing trace with hash 538555311, now seen corresponding path program 17 times [2020-11-07 00:27:23,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:27:23,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1603853416] [2020-11-07 00:27:23,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:27:23,320 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:27:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:23,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:27:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:23,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:27:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:23,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:23,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:23,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:23,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:23,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:23,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:23,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:24,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:24,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:24,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:24,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:24,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:24,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:24,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:24,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:24,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:24,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:25,319 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-11-07 00:27:25,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1603853416] [2020-11-07 00:27:25,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:27:25,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2020-11-07 00:27:25,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819795792] [2020-11-07 00:27:25,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 42 states [2020-11-07 00:27:25,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:27:25,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2020-11-07 00:27:25,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2020-11-07 00:27:25,321 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 42 states. [2020-11-07 00:27:32,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:27:32,603 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2020-11-07 00:27:32,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2020-11-07 00:27:32,610 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 164 [2020-11-07 00:27:32,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:27:32,612 INFO L225 Difference]: With dead ends: 127 [2020-11-07 00:27:32,612 INFO L226 Difference]: Without dead ends: 120 [2020-11-07 00:27:32,614 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1579 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=472, Invalid=9230, Unknown=0, NotChecked=0, Total=9702 [2020-11-07 00:27:32,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-11-07 00:27:32,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-11-07 00:27:32,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-11-07 00:27:32,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2020-11-07 00:27:32,651 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 164 [2020-11-07 00:27:32,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:27:32,651 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2020-11-07 00:27:32,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2020-11-07 00:27:32,651 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2020-11-07 00:27:32,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2020-11-07 00:27:32,652 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:27:32,653 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, 1, 1, 1] [2020-11-07 00:27:32,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 00:27:32,653 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:27:32,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:27:32,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1585483323, now seen corresponding path program 18 times [2020-11-07 00:27:32,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:27:32,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [812815230] [2020-11-07 00:27:32,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:27:32,658 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:27:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:32,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:27:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:32,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:27:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:32,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:32,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:32,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:33,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:33,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:33,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:33,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:33,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:33,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:33,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:33,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:33,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:33,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:34,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:34,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:34,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:34,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:34,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:34,884 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-11-07 00:27:34,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [812815230] [2020-11-07 00:27:34,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:27:34,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2020-11-07 00:27:34,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851417028] [2020-11-07 00:27:34,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2020-11-07 00:27:34,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:27:34,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2020-11-07 00:27:34,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2020-11-07 00:27:34,887 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 44 states. [2020-11-07 00:27:42,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:27:42,983 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2020-11-07 00:27:42,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2020-11-07 00:27:42,987 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 172 [2020-11-07 00:27:42,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:27:42,989 INFO L225 Difference]: With dead ends: 132 [2020-11-07 00:27:42,989 INFO L226 Difference]: Without dead ends: 125 [2020-11-07 00:27:42,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1752 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=497, Invalid=10215, Unknown=0, NotChecked=0, Total=10712 [2020-11-07 00:27:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-11-07 00:27:43,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-11-07 00:27:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-11-07 00:27:43,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2020-11-07 00:27:43,016 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 172 [2020-11-07 00:27:43,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:27:43,016 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2020-11-07 00:27:43,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2020-11-07 00:27:43,017 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2020-11-07 00:27:43,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-11-07 00:27:43,018 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:27:43,018 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, 1, 1, 1] [2020-11-07 00:27:43,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-07 00:27:43,018 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:27:43,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:27:43,019 INFO L82 PathProgramCache]: Analyzing trace with hash 851670383, now seen corresponding path program 19 times [2020-11-07 00:27:43,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:27:43,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1373421973] [2020-11-07 00:27:43,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:27:43,021 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:27:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:43,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:27:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:43,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:27:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:43,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:43,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:43,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:43,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:43,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:43,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:43,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:43,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:43,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:44,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:44,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:44,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:44,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:44,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:44,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:44,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:44,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:45,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:45,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:45,571 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-11-07 00:27:45,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1373421973] [2020-11-07 00:27:45,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:27:45,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2020-11-07 00:27:45,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609852063] [2020-11-07 00:27:45,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 46 states [2020-11-07 00:27:45,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:27:45,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2020-11-07 00:27:45,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1980, Unknown=0, NotChecked=0, Total=2070 [2020-11-07 00:27:45,573 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 46 states. [2020-11-07 00:27:54,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:27:54,530 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2020-11-07 00:27:54,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2020-11-07 00:27:54,531 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 180 [2020-11-07 00:27:54,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:27:54,533 INFO L225 Difference]: With dead ends: 137 [2020-11-07 00:27:54,533 INFO L226 Difference]: Without dead ends: 130 [2020-11-07 00:27:54,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1934 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=522, Invalid=11250, Unknown=0, NotChecked=0, Total=11772 [2020-11-07 00:27:54,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-11-07 00:27:54,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2020-11-07 00:27:54,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-11-07 00:27:54,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2020-11-07 00:27:54,564 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 180 [2020-11-07 00:27:54,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:27:54,565 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2020-11-07 00:27:54,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2020-11-07 00:27:54,565 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2020-11-07 00:27:54,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2020-11-07 00:27:54,566 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:27:54,566 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, 1, 1, 1] [2020-11-07 00:27:54,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-07 00:27:54,566 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:27:54,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:27:54,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1388998651, now seen corresponding path program 20 times [2020-11-07 00:27:54,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:27:54,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [470613478] [2020-11-07 00:27:54,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:27:54,570 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:27:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:54,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:27:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:54,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:27:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:54,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:54,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:54,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:55,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:55,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:55,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:55,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:55,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:55,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:55,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:55,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:55,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:55,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:56,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:56,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:56,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:56,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:56,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:56,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:56,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:27:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:27:57,487 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2020-11-07 00:27:57,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [470613478] [2020-11-07 00:27:57,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:27:57,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2020-11-07 00:27:57,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253228109] [2020-11-07 00:27:57,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 48 states [2020-11-07 00:27:57,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:27:57,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2020-11-07 00:27:57,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=2162, Unknown=0, NotChecked=0, Total=2256 [2020-11-07 00:27:57,490 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 48 states. [2020-11-07 00:28:07,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:28:07,235 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2020-11-07 00:28:07,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2020-11-07 00:28:07,235 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 188 [2020-11-07 00:28:07,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:28:07,238 INFO L225 Difference]: With dead ends: 142 [2020-11-07 00:28:07,238 INFO L226 Difference]: Without dead ends: 135 [2020-11-07 00:28:07,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2125 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=547, Invalid=12335, Unknown=0, NotChecked=0, Total=12882 [2020-11-07 00:28:07,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-11-07 00:28:07,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2020-11-07 00:28:07,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-11-07 00:28:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2020-11-07 00:28:07,277 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 188 [2020-11-07 00:28:07,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:28:07,278 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2020-11-07 00:28:07,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2020-11-07 00:28:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2020-11-07 00:28:07,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2020-11-07 00:28:07,279 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:28:07,279 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, 1, 1, 1] [2020-11-07 00:28:07,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-07 00:28:07,280 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:28:07,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:28:07,280 INFO L82 PathProgramCache]: Analyzing trace with hash -806680785, now seen corresponding path program 21 times [2020-11-07 00:28:07,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:28:07,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [526939359] [2020-11-07 00:28:07,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:28:07,283 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:28:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:07,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:28:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:07,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:28:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:07,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:07,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:07,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:07,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:07,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:07,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:08,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:08,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:08,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:08,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:08,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:08,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:08,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:08,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:08,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:09,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:09,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:09,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:09,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:09,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:09,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:10,344 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2020-11-07 00:28:10,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [526939359] [2020-11-07 00:28:10,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:28:10,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2020-11-07 00:28:10,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832421614] [2020-11-07 00:28:10,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 50 states [2020-11-07 00:28:10,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:28:10,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2020-11-07 00:28:10,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=2352, Unknown=0, NotChecked=0, Total=2450 [2020-11-07 00:28:10,346 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 50 states. [2020-11-07 00:28:21,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:28:21,254 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2020-11-07 00:28:21,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2020-11-07 00:28:21,258 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 196 [2020-11-07 00:28:21,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:28:21,259 INFO L225 Difference]: With dead ends: 147 [2020-11-07 00:28:21,259 INFO L226 Difference]: Without dead ends: 140 [2020-11-07 00:28:21,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2325 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=572, Invalid=13470, Unknown=0, NotChecked=0, Total=14042 [2020-11-07 00:28:21,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-11-07 00:28:21,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2020-11-07 00:28:21,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-11-07 00:28:21,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2020-11-07 00:28:21,293 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 196 [2020-11-07 00:28:21,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:28:21,294 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2020-11-07 00:28:21,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2020-11-07 00:28:21,294 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2020-11-07 00:28:21,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-11-07 00:28:21,295 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:28:21,296 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:28:21,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-07 00:28:21,296 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:28:21,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:28:21,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1040196027, now seen corresponding path program 22 times [2020-11-07 00:28:21,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:28:21,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [839346135] [2020-11-07 00:28:21,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:28:21,299 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:28:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:21,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:28:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:21,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:28:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:21,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:21,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:21,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:21,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:21,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:21,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:22,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:22,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:22,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:22,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:22,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:22,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:22,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:22,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:22,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:23,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:23,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:23,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:23,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:23,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:23,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:24,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2020-11-07 00:28:24,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [839346135] [2020-11-07 00:28:24,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:28:24,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2020-11-07 00:28:24,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108596678] [2020-11-07 00:28:24,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 52 states [2020-11-07 00:28:24,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:28:24,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2020-11-07 00:28:24,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=2550, Unknown=0, NotChecked=0, Total=2652 [2020-11-07 00:28:24,677 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 52 states. [2020-11-07 00:28:36,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:28:36,660 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2020-11-07 00:28:36,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2020-11-07 00:28:36,661 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 204 [2020-11-07 00:28:36,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:28:36,663 INFO L225 Difference]: With dead ends: 152 [2020-11-07 00:28:36,663 INFO L226 Difference]: Without dead ends: 145 [2020-11-07 00:28:36,665 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2534 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=597, Invalid=14655, Unknown=0, NotChecked=0, Total=15252 [2020-11-07 00:28:36,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-11-07 00:28:36,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2020-11-07 00:28:36,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-11-07 00:28:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2020-11-07 00:28:36,689 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 204 [2020-11-07 00:28:36,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:28:36,689 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2020-11-07 00:28:36,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2020-11-07 00:28:36,689 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2020-11-07 00:28:36,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-11-07 00:28:36,691 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:28:36,691 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:28:36,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-07 00:28:36,692 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:28:36,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:28:36,692 INFO L82 PathProgramCache]: Analyzing trace with hash 109865199, now seen corresponding path program 23 times [2020-11-07 00:28:36,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:28:36,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2106820436] [2020-11-07 00:28:36,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:28:36,695 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:28:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:36,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:28:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:36,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:28:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:36,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:37,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:37,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:37,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:37,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:37,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:37,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:37,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:37,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:37,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:37,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:38,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:38,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:38,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:38,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:38,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:38,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:38,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:39,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:39,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:39,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:39,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:39,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:40,447 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2020-11-07 00:28:40,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2106820436] [2020-11-07 00:28:40,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:28:40,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2020-11-07 00:28:40,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80008801] [2020-11-07 00:28:40,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 54 states [2020-11-07 00:28:40,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:28:40,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2020-11-07 00:28:40,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=2756, Unknown=0, NotChecked=0, Total=2862 [2020-11-07 00:28:40,449 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 54 states. [2020-11-07 00:28:53,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:28:53,354 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2020-11-07 00:28:53,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2020-11-07 00:28:53,355 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 212 [2020-11-07 00:28:53,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:28:53,361 INFO L225 Difference]: With dead ends: 157 [2020-11-07 00:28:53,361 INFO L226 Difference]: Without dead ends: 150 [2020-11-07 00:28:53,363 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2752 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=622, Invalid=15890, Unknown=0, NotChecked=0, Total=16512 [2020-11-07 00:28:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-11-07 00:28:53,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2020-11-07 00:28:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-11-07 00:28:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2020-11-07 00:28:53,398 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 212 [2020-11-07 00:28:53,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:28:53,398 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2020-11-07 00:28:53,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2020-11-07 00:28:53,398 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2020-11-07 00:28:53,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-11-07 00:28:53,400 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:28:53,400 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:28:53,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-07 00:28:53,400 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:28:53,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:28:53,401 INFO L82 PathProgramCache]: Analyzing trace with hash -295543675, now seen corresponding path program 24 times [2020-11-07 00:28:53,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:28:53,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [349737161] [2020-11-07 00:28:53,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:28:53,404 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:28:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:53,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:28:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:53,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:28:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:53,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:53,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:53,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:53,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:53,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:54,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:54,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:54,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:54,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:54,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:54,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:54,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:54,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:54,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:55,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:55,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:55,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:55,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:55,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:55,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:56,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:56,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:56,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:56,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:28:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:28:57,329 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2020-11-07 00:28:57,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [349737161] [2020-11-07 00:28:57,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:28:57,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2020-11-07 00:28:57,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015516162] [2020-11-07 00:28:57,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 56 states [2020-11-07 00:28:57,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:28:57,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2020-11-07 00:28:57,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=2970, Unknown=0, NotChecked=0, Total=3080 [2020-11-07 00:28:57,332 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 56 states. [2020-11-07 00:29:11,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:29:11,430 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2020-11-07 00:29:11,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2020-11-07 00:29:11,431 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 220 [2020-11-07 00:29:11,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:29:11,433 INFO L225 Difference]: With dead ends: 162 [2020-11-07 00:29:11,433 INFO L226 Difference]: Without dead ends: 155 [2020-11-07 00:29:11,435 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2979 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=647, Invalid=17175, Unknown=0, NotChecked=0, Total=17822 [2020-11-07 00:29:11,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-11-07 00:29:11,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2020-11-07 00:29:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-11-07 00:29:11,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2020-11-07 00:29:11,466 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 220 [2020-11-07 00:29:11,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:29:11,467 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2020-11-07 00:29:11,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2020-11-07 00:29:11,467 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2020-11-07 00:29:11,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-11-07 00:29:11,468 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:29:11,468 INFO L422 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:29:11,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-07 00:29:11,469 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:29:11,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:29:11,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1520671407, now seen corresponding path program 25 times [2020-11-07 00:29:11,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:29:11,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [695002272] [2020-11-07 00:29:11,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:29:11,472 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:29:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:11,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:29:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:11,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:29:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:11,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:11,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:11,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:11,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:12,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:12,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:12,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:12,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:12,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:12,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:12,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:12,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:12,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:13,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:13,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:13,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:13,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:13,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:13,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:14,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:14,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:14,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:14,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:14,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:15,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:15,875 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2020-11-07 00:29:15,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [695002272] [2020-11-07 00:29:15,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:29:15,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2020-11-07 00:29:15,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356436291] [2020-11-07 00:29:15,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 58 states [2020-11-07 00:29:15,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:29:15,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2020-11-07 00:29:15,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=3192, Unknown=0, NotChecked=0, Total=3306 [2020-11-07 00:29:15,877 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 58 states. [2020-11-07 00:29:31,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:29:31,620 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2020-11-07 00:29:31,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2020-11-07 00:29:31,622 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 228 [2020-11-07 00:29:31,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:29:31,623 INFO L225 Difference]: With dead ends: 167 [2020-11-07 00:29:31,623 INFO L226 Difference]: Without dead ends: 160 [2020-11-07 00:29:31,625 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3215 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=672, Invalid=18510, Unknown=0, NotChecked=0, Total=19182 [2020-11-07 00:29:31,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-11-07 00:29:31,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2020-11-07 00:29:31,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-11-07 00:29:31,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2020-11-07 00:29:31,658 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 228 [2020-11-07 00:29:31,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:29:31,658 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2020-11-07 00:29:31,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2020-11-07 00:29:31,658 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2020-11-07 00:29:31,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-11-07 00:29:31,660 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:29:31,660 INFO L422 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:29:31,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-07 00:29:31,660 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:29:31,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:29:31,661 INFO L82 PathProgramCache]: Analyzing trace with hash -337573179, now seen corresponding path program 26 times [2020-11-07 00:29:31,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:29:31,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [106078338] [2020-11-07 00:29:31,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:29:31,664 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:29:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:31,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:29:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:31,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:29:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:31,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:32,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:32,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:32,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:32,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:32,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:32,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:32,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:32,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:33,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:33,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:33,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:33,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:33,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:33,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:33,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:34,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:34,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:34,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:34,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:34,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:34,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:35,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:35,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:35,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:35,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:36,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2020-11-07 00:29:36,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [106078338] [2020-11-07 00:29:36,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:29:36,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2020-11-07 00:29:36,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943224262] [2020-11-07 00:29:36,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 60 states [2020-11-07 00:29:36,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:29:36,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2020-11-07 00:29:36,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=3422, Unknown=0, NotChecked=0, Total=3540 [2020-11-07 00:29:36,649 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 60 states. [2020-11-07 00:29:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:29:53,486 INFO L93 Difference]: Finished difference Result 172 states and 173 transitions. [2020-11-07 00:29:53,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2020-11-07 00:29:53,488 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 236 [2020-11-07 00:29:53,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:29:53,491 INFO L225 Difference]: With dead ends: 172 [2020-11-07 00:29:53,491 INFO L226 Difference]: Without dead ends: 165 [2020-11-07 00:29:53,493 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3460 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=697, Invalid=19895, Unknown=0, NotChecked=0, Total=20592 [2020-11-07 00:29:53,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-11-07 00:29:53,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2020-11-07 00:29:53,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-11-07 00:29:53,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2020-11-07 00:29:53,526 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 236 [2020-11-07 00:29:53,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:29:53,527 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2020-11-07 00:29:53,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2020-11-07 00:29:53,527 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2020-11-07 00:29:53,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2020-11-07 00:29:53,529 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:29:53,529 INFO L422 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:29:53,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-07 00:29:53,529 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:29:53,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:29:53,530 INFO L82 PathProgramCache]: Analyzing trace with hash -2060673937, now seen corresponding path program 27 times [2020-11-07 00:29:53,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:29:53,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1573542482] [2020-11-07 00:29:53,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:29:53,532 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:29:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:53,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:29:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:53,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:29:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:53,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:53,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:53,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:54,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:54,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:54,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:54,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:54,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:54,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:55,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:55,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:55,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:55,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:55,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:55,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:55,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:56,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:56,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:56,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:56,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:56,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:57,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:57,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:57,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:57,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:57,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:58,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:29:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:29:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2020-11-07 00:29:59,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1573542482] [2020-11-07 00:29:59,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:29:59,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2020-11-07 00:29:59,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636636789] [2020-11-07 00:29:59,071 INFO L461 AbstractCegarLoop]: Interpolant automaton has 62 states [2020-11-07 00:29:59,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:29:59,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2020-11-07 00:29:59,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=3660, Unknown=0, NotChecked=0, Total=3782 [2020-11-07 00:29:59,072 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 62 states. [2020-11-07 00:30:17,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:30:17,482 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2020-11-07 00:30:17,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2020-11-07 00:30:17,484 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 244 [2020-11-07 00:30:17,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:30:17,485 INFO L225 Difference]: With dead ends: 177 [2020-11-07 00:30:17,485 INFO L226 Difference]: Without dead ends: 170 [2020-11-07 00:30:17,487 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3714 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=722, Invalid=21330, Unknown=0, NotChecked=0, Total=22052 [2020-11-07 00:30:17,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-11-07 00:30:17,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2020-11-07 00:30:17,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-11-07 00:30:17,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2020-11-07 00:30:17,530 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 244 [2020-11-07 00:30:17,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:30:17,531 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2020-11-07 00:30:17,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2020-11-07 00:30:17,531 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2020-11-07 00:30:17,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2020-11-07 00:30:17,533 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:30:17,533 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:30:17,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-07 00:30:17,533 INFO L429 AbstractCegarLoop]: === Iteration 29 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:30:17,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:30:17,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1593829637, now seen corresponding path program 28 times [2020-11-07 00:30:17,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:30:17,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1771288923] [2020-11-07 00:30:17,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:30:17,536 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:30:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:17,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:30:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:17,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:30:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:17,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:17,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:18,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:18,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:18,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:18,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:18,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:18,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:18,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:18,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:19,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:19,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:19,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:19,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:19,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:19,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:19,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:20,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:20,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:20,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:20,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:20,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:21,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:21,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:21,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:21,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:22,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:22,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:23,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2020-11-07 00:30:23,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1771288923] [2020-11-07 00:30:23,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:30:23,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2020-11-07 00:30:23,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212507639] [2020-11-07 00:30:23,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 64 states [2020-11-07 00:30:23,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:30:23,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2020-11-07 00:30:23,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=3906, Unknown=0, NotChecked=0, Total=4032 [2020-11-07 00:30:23,502 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 64 states. [2020-11-07 00:30:43,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:30:43,255 INFO L93 Difference]: Finished difference Result 182 states and 183 transitions. [2020-11-07 00:30:43,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2020-11-07 00:30:43,256 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 252 [2020-11-07 00:30:43,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:30:43,258 INFO L225 Difference]: With dead ends: 182 [2020-11-07 00:30:43,258 INFO L226 Difference]: Without dead ends: 175 [2020-11-07 00:30:43,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3977 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=747, Invalid=22815, Unknown=0, NotChecked=0, Total=23562 [2020-11-07 00:30:43,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-11-07 00:30:43,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2020-11-07 00:30:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-11-07 00:30:43,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2020-11-07 00:30:43,301 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 252 [2020-11-07 00:30:43,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:30:43,301 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2020-11-07 00:30:43,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2020-11-07 00:30:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2020-11-07 00:30:43,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2020-11-07 00:30:43,303 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:30:43,303 INFO L422 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:30:43,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-07 00:30:43,303 INFO L429 AbstractCegarLoop]: === Iteration 30 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:30:43,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:30:43,304 INFO L82 PathProgramCache]: Analyzing trace with hash 874737199, now seen corresponding path program 29 times [2020-11-07 00:30:43,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:30:43,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1695587660] [2020-11-07 00:30:43,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:30:43,307 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:30:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:43,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:30:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:43,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:30:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:43,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:43,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:43,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:43,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:43,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:44,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:44,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:44,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:44,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:44,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:44,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:45,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:45,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:45,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:45,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:45,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:45,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:46,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:46,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:46,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:46,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:46,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:47,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:47,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:47,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:47,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:48,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:48,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:48,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:30:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:30:49,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2020-11-07 00:30:49,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1695587660] [2020-11-07 00:30:49,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:30:49,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2020-11-07 00:30:49,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622460689] [2020-11-07 00:30:49,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 66 states [2020-11-07 00:30:49,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:30:49,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2020-11-07 00:30:49,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=4160, Unknown=0, NotChecked=0, Total=4290 [2020-11-07 00:30:49,808 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 66 states. [2020-11-07 00:31:12,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:31:12,150 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2020-11-07 00:31:12,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2020-11-07 00:31:12,152 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 260 [2020-11-07 00:31:12,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:31:12,154 INFO L225 Difference]: With dead ends: 187 [2020-11-07 00:31:12,154 INFO L226 Difference]: Without dead ends: 180 [2020-11-07 00:31:12,157 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4249 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=772, Invalid=24350, Unknown=0, NotChecked=0, Total=25122 [2020-11-07 00:31:12,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-11-07 00:31:12,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2020-11-07 00:31:12,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-11-07 00:31:12,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2020-11-07 00:31:12,199 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 260 [2020-11-07 00:31:12,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:31:12,200 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2020-11-07 00:31:12,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2020-11-07 00:31:12,200 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2020-11-07 00:31:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2020-11-07 00:31:12,202 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:31:12,202 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:31:12,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-07 00:31:12,202 INFO L429 AbstractCegarLoop]: === Iteration 31 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:31:12,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:31:12,203 INFO L82 PathProgramCache]: Analyzing trace with hash 390264645, now seen corresponding path program 30 times [2020-11-07 00:31:12,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:31:12,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2112783099] [2020-11-07 00:31:12,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:31:12,205 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:31:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:12,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:31:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:12,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:31:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:12,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:12,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:12,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:13,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:13,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:13,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:13,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:13,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:13,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:14,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:14,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:14,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:14,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:14,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:14,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:15,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:15,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:15,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:15,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:15,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:16,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:16,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:16,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:16,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:16,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:16,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:17,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:17,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:17,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:17,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:31:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:31:18,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1365 trivial. 0 not checked. [2020-11-07 00:31:18,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2112783099] [2020-11-07 00:31:18,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:31:18,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2020-11-07 00:31:18,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69689407] [2020-11-07 00:31:18,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 67 states [2020-11-07 00:31:18,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:31:18,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2020-11-07 00:31:18,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=972, Invalid=3450, Unknown=0, NotChecked=0, Total=4422 [2020-11-07 00:31:18,291 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 67 states. [2020-11-07 00:31:33,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:31:33,579 INFO L93 Difference]: Finished difference Result 180 states and 181 transitions. [2020-11-07 00:31:33,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2020-11-07 00:31:33,579 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 268 [2020-11-07 00:31:33,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:31:33,580 INFO L225 Difference]: With dead ends: 180 [2020-11-07 00:31:33,580 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:31:33,583 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3674 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=5221, Invalid=20861, Unknown=0, NotChecked=0, Total=26082 [2020-11-07 00:31:33,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:31:33,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:31:33,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:31:33,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:31:33,583 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 268 [2020-11-07 00:31:33,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:31:33,584 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:31:33,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2020-11-07 00:31:33,584 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:31:33,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:31:33,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-07 00:31:33,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:31:35,774 WARN L194 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 1867 DAG size of output: 157 [2020-11-07 00:31:35,929 WARN L194 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 1432 [2020-11-07 00:31:37,439 WARN L194 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 1805 DAG size of output: 156 [2020-11-07 00:31:37,549 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 1399 [2020-11-07 00:31:40,264 WARN L194 SmtUtils]: Spent 2.70 s on a formula simplification. DAG size of input: 3087 DAG size of output: 245 [2020-11-07 00:31:40,443 WARN L194 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 2652 [2020-11-07 00:31:41,815 WARN L194 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 1867 DAG size of output: 157 [2020-11-07 00:31:41,930 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 1432 [2020-11-07 00:31:42,968 WARN L194 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 1805 DAG size of output: 156 [2020-11-07 00:31:43,849 WARN L194 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 1455 DAG size of output: 17 [2020-11-07 00:31:44,172 WARN L194 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 13 [2020-11-07 00:31:44,395 WARN L194 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 9 [2020-11-07 00:31:44,653 WARN L194 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 9 [2020-11-07 00:31:45,454 WARN L194 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 1421 DAG size of output: 19 [2020-11-07 00:31:46,815 WARN L194 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 2674 DAG size of output: 32 [2020-11-07 00:31:47,491 WARN L194 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 1455 DAG size of output: 17 [2020-11-07 00:31:48,175 WARN L194 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 1421 DAG size of output: 19 [2020-11-07 00:31:48,395 WARN L194 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 9 [2020-11-07 00:31:48,399 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 00:31:48,400 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 00:31:48,400 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:31:48,400 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 00:31:48,400 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 00:31:48,401 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 00:31:48,401 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:31:48,401 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 00:31:48,401 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:31:48,401 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:31:48,402 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 00:31:48,402 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 00:31:48,402 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 00:31:48,402 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:31:48,402 INFO L262 CegarLoopResult]: At program point hanoiEXIT(lines 18 23) the Hoare annotation is: (let ((.cse0 (= hanoi_~n |hanoi_#in~n|))) (or (and .cse0 (<= 2147483647 |hanoi_#res|)) (and .cse0 (<= (+ |hanoi_#in~n| 1) |hanoi_#res|) (<= 3 |hanoi_#res|)) (and (= |hanoi_#in~n| 1) .cse0 (= |hanoi_#res| 1)))) [2020-11-07 00:31:48,402 INFO L269 CegarLoopResult]: At program point hanoiENTRY(lines 18 23) the Hoare annotation is: true [2020-11-07 00:31:48,402 INFO L262 CegarLoopResult]: At program point hanoiFINAL(lines 18 23) the Hoare annotation is: (let ((.cse0 (= hanoi_~n |hanoi_#in~n|))) (or (and .cse0 (<= 2147483647 |hanoi_#res|)) (and .cse0 (<= (+ |hanoi_#in~n| 1) |hanoi_#res|) (<= 3 |hanoi_#res|)) (and (= |hanoi_#in~n| 1) .cse0 (= |hanoi_#res| 1)))) [2020-11-07 00:31:48,403 INFO L262 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (= hanoi_~n |hanoi_#in~n|) [2020-11-07 00:31:48,403 INFO L262 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: (let ((.cse0 (= hanoi_~n |hanoi_#in~n|))) (or (and (<= |hanoi_#in~n| 2) .cse0 (= |hanoi_#t~ret7| 1)) (and .cse0 (<= 1073741823 |hanoi_#t~ret7|)) (and .cse0 (<= 3 |hanoi_#t~ret7|) (<= (+ |hanoi_#in~n| 3) (* 2 |hanoi_#t~ret7|))))) [2020-11-07 00:31:48,403 INFO L262 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (= |hanoi_#in~n| 1) (= hanoi_~n |hanoi_#in~n|)) [2020-11-07 00:31:48,403 INFO L262 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse0 (= hanoi_~n |hanoi_#in~n|))) (or (and (<= |hanoi_#in~n| 2) .cse0 (= |hanoi_#t~ret7| 1)) (and .cse0 (<= 1073741823 |hanoi_#t~ret7|)) (and .cse0 (<= 3 |hanoi_#t~ret7|) (<= (+ |hanoi_#in~n| 3) (* 2 |hanoi_#t~ret7|))))) [2020-11-07 00:31:48,403 INFO L262 CegarLoopResult]: At program point L19(lines 19 21) the Hoare annotation is: (= hanoi_~n |hanoi_#in~n|) [2020-11-07 00:31:48,403 INFO L262 CegarLoopResult]: At program point L22-3(line 22) the Hoare annotation is: (and (or (and (= |hanoi_#t~ret7| 1) (<= 3 |hanoi_#res|)) (and (<= 3 |hanoi_#t~ret7|) (<= 7 |hanoi_#res|))) (let ((.cse0 (= hanoi_~n |hanoi_#in~n|))) (or (and (<= |hanoi_#in~n| 2) .cse0) (and .cse0 (<= 1073741823 |hanoi_#t~ret7|) (<= 2147483647 |hanoi_#res|)) (and .cse0 (<= (+ |hanoi_#in~n| 4) |hanoi_#res|) (<= (+ |hanoi_#in~n| 3) (* 2 |hanoi_#t~ret7|)))))) [2020-11-07 00:31:48,403 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:31:48,403 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:31:48,404 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:31:48,404 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:31:48,404 INFO L269 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-11-07 00:31:48,404 INFO L262 CegarLoopResult]: At program point L32(lines 32 36) the Hoare annotation is: (or (and (= main_~result~0 1) (<= main_~n~0 1)) (<= (+ main_~n~0 1) main_~result~0)) [2020-11-07 00:31:48,404 INFO L262 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (<= main_~n~0 31) [2020-11-07 00:31:48,404 INFO L262 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (or (<= (+ main_~n~0 1) |main_#t~ret9|) (and (<= main_~n~0 1) (= |main_#t~ret9| 1))) [2020-11-07 00:31:48,404 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 26 37) the Hoare annotation is: true [2020-11-07 00:31:48,404 INFO L269 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-11-07 00:31:48,404 INFO L262 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: (or (<= (+ main_~n~0 1) |main_#t~ret9|) (and (<= main_~n~0 1) (= |main_#t~ret9| 1))) [2020-11-07 00:31:48,405 INFO L269 CegarLoopResult]: At program point L28(lines 28 30) the Hoare annotation is: true [2020-11-07 00:31:48,405 INFO L262 CegarLoopResult]: At program point L31-3(line 31) the Hoare annotation is: (or (and (= main_~result~0 1) (<= main_~n~0 1) (= |main_#t~ret9| 1)) (let ((.cse0 (+ main_~n~0 1))) (and (<= .cse0 |main_#t~ret9|) (<= .cse0 main_~result~0)))) [2020-11-07 00:31:48,405 INFO L269 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-11-07 00:31:48,405 INFO L269 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-11-07 00:31:48,405 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 26 37) the Hoare annotation is: true [2020-11-07 00:31:48,405 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 26 37) the Hoare annotation is: true [2020-11-07 00:31:48,405 INFO L262 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: false [2020-11-07 00:31:48,405 INFO L262 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: false [2020-11-07 00:31:48,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:31:48 BoogieIcfgContainer [2020-11-07 00:31:48,423 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:31:48,425 INFO L168 Benchmark]: Toolchain (without parser) took 329355.09 ms. Allocated memory was 151.0 MB in the beginning and 558.9 MB in the end (delta: 407.9 MB). Free memory was 127.3 MB in the beginning and 368.8 MB in the end (delta: -241.5 MB). Peak memory consumption was 381.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:31:48,425 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 151.0 MB. Free memory is still 125.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:31:48,426 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.68 ms. Allocated memory is still 151.0 MB. Free memory was 126.7 MB in the beginning and 117.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:31:48,426 INFO L168 Benchmark]: Boogie Preprocessor took 29.12 ms. Allocated memory is still 151.0 MB. Free memory was 117.6 MB in the beginning and 116.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:31:48,427 INFO L168 Benchmark]: RCFGBuilder took 363.75 ms. Allocated memory is still 151.0 MB. Free memory was 116.2 MB in the beginning and 102.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:31:48,427 INFO L168 Benchmark]: TraceAbstraction took 328728.71 ms. Allocated memory was 151.0 MB in the beginning and 558.9 MB in the end (delta: 407.9 MB). Free memory was 102.3 MB in the beginning and 368.8 MB in the end (delta: -266.5 MB). Peak memory consumption was 355.8 MB. Max. memory is 8.0 GB. [2020-11-07 00:31:48,429 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.21 ms. Allocated memory is still 151.0 MB. Free memory is still 125.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 221.68 ms. Allocated memory is still 151.0 MB. Free memory was 126.7 MB in the beginning and 117.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 29.12 ms. Allocated memory is still 151.0 MB. Free memory was 117.6 MB in the beginning and 116.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 363.75 ms. Allocated memory is still 151.0 MB. Free memory was 116.2 MB in the beginning and 102.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 328728.71 ms. Allocated memory was 151.0 MB in the beginning and 558.9 MB in the end (delta: 407.9 MB). Free memory was 102.3 MB in the beginning and 368.8 MB in the end (delta: -266.5 MB). Peak memory consumption was 355.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 18]: Procedure Contract for hanoi Derived contract for procedure hanoi: ((n == \old(n) && 2147483647 <= \result) || ((n == \old(n) && \old(n) + 1 <= \result) && 3 <= \result)) || ((\old(n) == 1 && n == \old(n)) && \result == 1) - ProcedureContractResult [Line: 26]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 313.8s, OverallIterations: 31, TraceHistogramMax: 31, AutomataDifference: 240.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1715 SDtfs, 4909 SDslu, 13316 SDs, 0 SdLazy, 111269 SolverSat, 1116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 65.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3750 GetRequests, 1055 SyntacticMatches, 0 SemanticMatches, 2695 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49364 ImplicationChecksByTransitivity, 187.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 42 LocationsWithAnnotation, 171 PreInvPairs, 2709 NumberOfFragments, 310 HoareAnnotationTreeSize, 171 FomulaSimplifications, 266288 FormulaSimplificationTreeSizeReduction, 9.4s HoareSimplificationTime, 42 FomulaSimplificationsInter, 34265 FormulaSimplificationTreeSizeReductionInter, 5.3s 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...