/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:35:09,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:35:09,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:35:09,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:35:09,638 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:35:09,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:35:09,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:35:09,655 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:35:09,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:35:09,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:35:09,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:35:09,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:35:09,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:35:09,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:35:09,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:35:09,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:35:09,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:35:09,716 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:35:09,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:35:09,721 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:35:09,723 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:35:09,724 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:35:09,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:35:09,727 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:35:09,729 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:35:09,730 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:35:09,730 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:35:09,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:35:09,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:35:09,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:35:09,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:35:09,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:35:09,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:35:09,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:35:09,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:35:09,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:35:09,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:35:09,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:35:09,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:35:09,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:35:09,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:35:09,742 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:35:09,754 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:35:09,755 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:35:09,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:35:09,757 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:35:09,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:35:09,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:35:09,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:35:09,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:35:09,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:35:09,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:35:09,758 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:35:09,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:35:09,758 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:35:09,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:35:09,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:35:09,759 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:35:09,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:35:09,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:35:09,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:35:09,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:35:09,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:35:09,760 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:35:09,760 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 00:35:10,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:35:10,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:35:10,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:35:10,155 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:35:10,156 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:35:10,157 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c [2020-10-24 00:35:10,249 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb905b673/414997dc33f8429988c58e4b23060d7b/FLAG88aa37e73 [2020-10-24 00:35:10,926 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:35:10,927 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c [2020-10-24 00:35:10,942 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb905b673/414997dc33f8429988c58e4b23060d7b/FLAG88aa37e73 [2020-10-24 00:35:11,238 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb905b673/414997dc33f8429988c58e4b23060d7b [2020-10-24 00:35:11,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:35:11,259 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:35:11,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:35:11,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:35:11,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:35:11,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:35:11" (1/1) ... [2020-10-24 00:35:11,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be277ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:11, skipping insertion in model container [2020-10-24 00:35:11,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:35:11" (1/1) ... [2020-10-24 00:35:11,282 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:35:11,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:35:11,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:35:11,602 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:35:11,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:35:11,667 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:35:11,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:11 WrapperNode [2020-10-24 00:35:11,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:35:11,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:35:11,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:35:11,669 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:35:11,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:11" (1/1) ... [2020-10-24 00:35:11,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:11" (1/1) ... [2020-10-24 00:35:11,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:11" (1/1) ... [2020-10-24 00:35:11,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:11" (1/1) ... [2020-10-24 00:35:11,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:11" (1/1) ... [2020-10-24 00:35:11,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:11" (1/1) ... [2020-10-24 00:35:11,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:11" (1/1) ... [2020-10-24 00:35:11,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:35:11,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:35:11,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:35:11,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:35:11,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:35:11,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:35:11,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:35:11,866 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:35:11,866 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-10-24 00:35:11,866 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2020-10-24 00:35:11,867 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2020-10-24 00:35:11,867 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2020-10-24 00:35:11,867 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:35:11,867 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:35:11,867 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:35:11,867 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:35:11,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:35:11,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-10-24 00:35:11,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-10-24 00:35:11,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-10-24 00:35:11,869 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2020-10-24 00:35:11,869 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2020-10-24 00:35:11,869 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2020-10-24 00:35:11,870 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:35:11,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:35:11,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:35:11,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:35:11,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:35:11,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:35:11,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:35:12,465 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:35:12,465 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-10-24 00:35:12,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:35:12 BoogieIcfgContainer [2020-10-24 00:35:12,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:35:12,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:35:12,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:35:12,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:35:12,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:35:11" (1/3) ... [2020-10-24 00:35:12,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f0368f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:35:12, skipping insertion in model container [2020-10-24 00:35:12,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:11" (2/3) ... [2020-10-24 00:35:12,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f0368f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:35:12, skipping insertion in model container [2020-10-24 00:35:12,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:35:12" (3/3) ... [2020-10-24 00:35:12,485 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_2a.c.cil.c [2020-10-24 00:35:12,497 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:35:12,502 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:35:12,518 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:35:12,556 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:35:12,556 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:35:12,556 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:35:12,556 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:35:12,557 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:35:12,557 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:35:12,557 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:35:12,557 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:35:12,588 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2020-10-24 00:35:12,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-10-24 00:35:12,617 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:12,618 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:12,619 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:12,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:12,630 INFO L82 PathProgramCache]: Analyzing trace with hash -415784909, now seen corresponding path program 1 times [2020-10-24 00:35:12,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:12,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [983945615] [2020-10-24 00:35:12,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:13,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:13,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:13,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:13,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-10-24 00:35:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:13,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-10-24 00:35:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:13,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-10-24 00:35:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:13,208 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2020-10-24 00:35:13,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [983945615] [2020-10-24 00:35:13,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:35:13,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:35:13,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981525067] [2020-10-24 00:35:13,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:35:13,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:13,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:35:13,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:35:13,247 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 4 states. [2020-10-24 00:35:13,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:13,780 INFO L93 Difference]: Finished difference Result 266 states and 323 transitions. [2020-10-24 00:35:13,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:35:13,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2020-10-24 00:35:13,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:13,795 INFO L225 Difference]: With dead ends: 266 [2020-10-24 00:35:13,796 INFO L226 Difference]: Without dead ends: 135 [2020-10-24 00:35:13,801 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:35:13,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-10-24 00:35:13,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2020-10-24 00:35:13,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-10-24 00:35:13,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 153 transitions. [2020-10-24 00:35:13,887 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 153 transitions. Word has length 109 [2020-10-24 00:35:13,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:13,889 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 153 transitions. [2020-10-24 00:35:13,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:35:13,889 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 153 transitions. [2020-10-24 00:35:13,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-10-24 00:35:13,894 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:13,894 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:13,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:35:13,895 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:13,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:13,896 INFO L82 PathProgramCache]: Analyzing trace with hash -2075471796, now seen corresponding path program 1 times [2020-10-24 00:35:13,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:13,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1061285285] [2020-10-24 00:35:13,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:14,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:14,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:14,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:14,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-10-24 00:35:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:14,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-10-24 00:35:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:14,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-10-24 00:35:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:14,111 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2020-10-24 00:35:14,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1061285285] [2020-10-24 00:35:14,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:35:14,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-24 00:35:14,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999821884] [2020-10-24 00:35:14,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 00:35:14,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:14,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 00:35:14,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:35:14,115 INFO L87 Difference]: Start difference. First operand 135 states and 153 transitions. Second operand 5 states. [2020-10-24 00:35:14,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:14,591 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2020-10-24 00:35:14,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 00:35:14,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2020-10-24 00:35:14,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:14,595 INFO L225 Difference]: With dead ends: 152 [2020-10-24 00:35:14,596 INFO L226 Difference]: Without dead ends: 134 [2020-10-24 00:35:14,597 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:35:14,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-10-24 00:35:14,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2020-10-24 00:35:14,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-10-24 00:35:14,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 151 transitions. [2020-10-24 00:35:14,627 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 151 transitions. Word has length 111 [2020-10-24 00:35:14,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:14,628 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 151 transitions. [2020-10-24 00:35:14,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 00:35:14,628 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 151 transitions. [2020-10-24 00:35:14,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-10-24 00:35:14,630 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:14,630 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:14,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:35:14,631 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:14,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:14,632 INFO L82 PathProgramCache]: Analyzing trace with hash 37781676, now seen corresponding path program 1 times [2020-10-24 00:35:14,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:14,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [746753317] [2020-10-24 00:35:14,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:14,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:14,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:14,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:14,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-10-24 00:35:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:14,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-10-24 00:35:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:14,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-10-24 00:35:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:14,879 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:35:14,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [746753317] [2020-10-24 00:35:14,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:14,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-24 00:35:14,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192222652] [2020-10-24 00:35:14,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 00:35:14,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:14,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 00:35:14,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:35:14,882 INFO L87 Difference]: Start difference. First operand 134 states and 151 transitions. Second operand 5 states. [2020-10-24 00:35:15,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:15,399 INFO L93 Difference]: Finished difference Result 273 states and 320 transitions. [2020-10-24 00:35:15,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 00:35:15,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2020-10-24 00:35:15,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:15,404 INFO L225 Difference]: With dead ends: 273 [2020-10-24 00:35:15,404 INFO L226 Difference]: Without dead ends: 175 [2020-10-24 00:35:15,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:35:15,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-10-24 00:35:15,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 152. [2020-10-24 00:35:15,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-24 00:35:15,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 174 transitions. [2020-10-24 00:35:15,442 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 174 transitions. Word has length 111 [2020-10-24 00:35:15,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:15,443 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 174 transitions. [2020-10-24 00:35:15,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 00:35:15,443 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 174 transitions. [2020-10-24 00:35:15,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-10-24 00:35:15,445 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:15,445 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:15,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:35:15,446 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:15,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:15,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1061811624, now seen corresponding path program 1 times [2020-10-24 00:35:15,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:15,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [264803180] [2020-10-24 00:35:15,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:15,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:15,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:15,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:15,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-10-24 00:35:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:15,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-24 00:35:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:15,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-24 00:35:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:15,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [264803180] [2020-10-24 00:35:15,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:15,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-24 00:35:15,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770848744] [2020-10-24 00:35:15,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 00:35:15,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:15,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 00:35:15,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:35:15,579 INFO L87 Difference]: Start difference. First operand 152 states and 174 transitions. Second operand 5 states. [2020-10-24 00:35:16,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:16,146 INFO L93 Difference]: Finished difference Result 284 states and 333 transitions. [2020-10-24 00:35:16,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 00:35:16,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2020-10-24 00:35:16,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:16,149 INFO L225 Difference]: With dead ends: 284 [2020-10-24 00:35:16,150 INFO L226 Difference]: Without dead ends: 176 [2020-10-24 00:35:16,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:35:16,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-24 00:35:16,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-10-24 00:35:16,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-10-24 00:35:16,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 190 transitions. [2020-10-24 00:35:16,221 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 190 transitions. Word has length 114 [2020-10-24 00:35:16,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:16,222 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 190 transitions. [2020-10-24 00:35:16,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 00:35:16,223 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 190 transitions. [2020-10-24 00:35:16,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-10-24 00:35:16,226 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:16,226 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:16,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:35:16,227 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:16,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:16,227 INFO L82 PathProgramCache]: Analyzing trace with hash -503903925, now seen corresponding path program 1 times [2020-10-24 00:35:16,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:16,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1905951722] [2020-10-24 00:35:16,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:16,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:16,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:16,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:16,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 00:35:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:16,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-10-24 00:35:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:16,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-10-24 00:35:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:16,387 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:16,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1905951722] [2020-10-24 00:35:16,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:16,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-24 00:35:16,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150794093] [2020-10-24 00:35:16,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:35:16,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:16,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:35:16,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:35:16,390 INFO L87 Difference]: Start difference. First operand 164 states and 190 transitions. Second operand 6 states. [2020-10-24 00:35:17,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:17,058 INFO L93 Difference]: Finished difference Result 320 states and 377 transitions. [2020-10-24 00:35:17,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:35:17,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2020-10-24 00:35:17,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:17,061 INFO L225 Difference]: With dead ends: 320 [2020-10-24 00:35:17,062 INFO L226 Difference]: Without dead ends: 199 [2020-10-24 00:35:17,063 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:35:17,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-10-24 00:35:17,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 180. [2020-10-24 00:35:17,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-10-24 00:35:17,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 209 transitions. [2020-10-24 00:35:17,103 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 209 transitions. Word has length 119 [2020-10-24 00:35:17,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:17,103 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 209 transitions. [2020-10-24 00:35:17,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:35:17,104 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 209 transitions. [2020-10-24 00:35:17,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-10-24 00:35:17,106 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:17,106 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:17,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:35:17,107 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:17,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:17,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1598599897, now seen corresponding path program 1 times [2020-10-24 00:35:17,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:17,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [47982988] [2020-10-24 00:35:17,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:17,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:17,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:17,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:17,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 00:35:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:17,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-10-24 00:35:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:17,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-10-24 00:35:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:17,286 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:35:17,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [47982988] [2020-10-24 00:35:17,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:17,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-24 00:35:17,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22088210] [2020-10-24 00:35:17,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:35:17,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:17,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:35:17,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:35:17,289 INFO L87 Difference]: Start difference. First operand 180 states and 209 transitions. Second operand 6 states. [2020-10-24 00:35:17,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:17,951 INFO L93 Difference]: Finished difference Result 320 states and 377 transitions. [2020-10-24 00:35:17,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:35:17,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2020-10-24 00:35:17,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:17,954 INFO L225 Difference]: With dead ends: 320 [2020-10-24 00:35:17,954 INFO L226 Difference]: Without dead ends: 201 [2020-10-24 00:35:17,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:35:17,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-10-24 00:35:17,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 183. [2020-10-24 00:35:17,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-10-24 00:35:17,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 212 transitions. [2020-10-24 00:35:17,997 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 212 transitions. Word has length 119 [2020-10-24 00:35:17,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:17,997 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 212 transitions. [2020-10-24 00:35:17,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:35:17,998 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 212 transitions. [2020-10-24 00:35:18,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-10-24 00:35:18,001 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:18,001 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:18,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:35:18,001 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:18,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:18,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1705231240, now seen corresponding path program 2 times [2020-10-24 00:35:18,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:18,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1905706714] [2020-10-24 00:35:18,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:18,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:18,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:18,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:18,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-10-24 00:35:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:18,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:35:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:18,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-10-24 00:35:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:18,206 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:18,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1905706714] [2020-10-24 00:35:18,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:18,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:35:18,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677683931] [2020-10-24 00:35:18,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:35:18,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:18,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:35:18,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:35:18,209 INFO L87 Difference]: Start difference. First operand 183 states and 212 transitions. Second operand 7 states. [2020-10-24 00:35:18,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:18,912 INFO L93 Difference]: Finished difference Result 354 states and 418 transitions. [2020-10-24 00:35:18,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:35:18,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2020-10-24 00:35:18,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:18,915 INFO L225 Difference]: With dead ends: 354 [2020-10-24 00:35:18,915 INFO L226 Difference]: Without dead ends: 225 [2020-10-24 00:35:18,916 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:35:18,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-10-24 00:35:18,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 193. [2020-10-24 00:35:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-10-24 00:35:18,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 225 transitions. [2020-10-24 00:35:18,950 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 225 transitions. Word has length 124 [2020-10-24 00:35:18,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:18,950 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 225 transitions. [2020-10-24 00:35:18,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:35:18,951 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 225 transitions. [2020-10-24 00:35:18,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-10-24 00:35:18,953 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:18,953 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:18,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:35:18,953 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:18,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:18,954 INFO L82 PathProgramCache]: Analyzing trace with hash -487232234, now seen corresponding path program 1 times [2020-10-24 00:35:18,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:18,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1739816933] [2020-10-24 00:35:18,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:19,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:19,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:19,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:19,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-10-24 00:35:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:19,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:35:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:19,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-10-24 00:35:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:19,127 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:35:19,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1739816933] [2020-10-24 00:35:19,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:19,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:35:19,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587556655] [2020-10-24 00:35:19,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:35:19,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:19,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:35:19,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:35:19,130 INFO L87 Difference]: Start difference. First operand 193 states and 225 transitions. Second operand 7 states. [2020-10-24 00:35:19,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:19,962 INFO L93 Difference]: Finished difference Result 348 states and 412 transitions. [2020-10-24 00:35:19,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:35:19,966 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2020-10-24 00:35:19,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:19,970 INFO L225 Difference]: With dead ends: 348 [2020-10-24 00:35:19,970 INFO L226 Difference]: Without dead ends: 221 [2020-10-24 00:35:19,971 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:35:19,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-10-24 00:35:20,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 193. [2020-10-24 00:35:20,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-10-24 00:35:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 225 transitions. [2020-10-24 00:35:20,013 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 225 transitions. Word has length 124 [2020-10-24 00:35:20,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:20,014 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 225 transitions. [2020-10-24 00:35:20,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:35:20,014 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 225 transitions. [2020-10-24 00:35:20,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-10-24 00:35:20,016 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:20,016 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:20,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:35:20,017 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:20,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:20,017 INFO L82 PathProgramCache]: Analyzing trace with hash 452126571, now seen corresponding path program 3 times [2020-10-24 00:35:20,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:20,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1048823318] [2020-10-24 00:35:20,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:20,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:20,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:20,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:20,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-10-24 00:35:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:20,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-10-24 00:35:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:20,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-10-24 00:35:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:20,230 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:20,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1048823318] [2020-10-24 00:35:20,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:20,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:35:20,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283963964] [2020-10-24 00:35:20,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:35:20,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:20,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:35:20,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:35:20,240 INFO L87 Difference]: Start difference. First operand 193 states and 225 transitions. Second operand 8 states. [2020-10-24 00:35:21,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:21,265 INFO L93 Difference]: Finished difference Result 381 states and 451 transitions. [2020-10-24 00:35:21,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 00:35:21,266 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 129 [2020-10-24 00:35:21,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:21,268 INFO L225 Difference]: With dead ends: 381 [2020-10-24 00:35:21,269 INFO L226 Difference]: Without dead ends: 247 [2020-10-24 00:35:21,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:35:21,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2020-10-24 00:35:21,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 203. [2020-10-24 00:35:21,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-10-24 00:35:21,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 238 transitions. [2020-10-24 00:35:21,323 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 238 transitions. Word has length 129 [2020-10-24 00:35:21,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:21,324 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 238 transitions. [2020-10-24 00:35:21,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:35:21,324 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 238 transitions. [2020-10-24 00:35:21,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-10-24 00:35:21,326 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:21,326 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:21,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:35:21,327 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:21,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:21,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1740336903, now seen corresponding path program 2 times [2020-10-24 00:35:21,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:21,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1795382316] [2020-10-24 00:35:21,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:21,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:21,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:21,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:21,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-10-24 00:35:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:21,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-10-24 00:35:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:21,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-10-24 00:35:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:21,560 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:35:21,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1795382316] [2020-10-24 00:35:21,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:21,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:35:21,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282529575] [2020-10-24 00:35:21,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:35:21,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:21,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:35:21,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:35:21,563 INFO L87 Difference]: Start difference. First operand 203 states and 238 transitions. Second operand 8 states. [2020-10-24 00:35:22,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:22,455 INFO L93 Difference]: Finished difference Result 367 states and 437 transitions. [2020-10-24 00:35:22,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 00:35:22,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 129 [2020-10-24 00:35:22,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:22,465 INFO L225 Difference]: With dead ends: 367 [2020-10-24 00:35:22,465 INFO L226 Difference]: Without dead ends: 235 [2020-10-24 00:35:22,466 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:35:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-10-24 00:35:22,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 203. [2020-10-24 00:35:22,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-10-24 00:35:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 238 transitions. [2020-10-24 00:35:22,511 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 238 transitions. Word has length 129 [2020-10-24 00:35:22,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:22,511 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 238 transitions. [2020-10-24 00:35:22,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:35:22,511 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 238 transitions. [2020-10-24 00:35:22,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-10-24 00:35:22,513 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:22,514 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:22,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 00:35:22,514 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:22,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:22,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1677870744, now seen corresponding path program 4 times [2020-10-24 00:35:22,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:22,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [83395755] [2020-10-24 00:35:22,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:22,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:22,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:22,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:22,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 00:35:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:22,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-24 00:35:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:22,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-10-24 00:35:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:22,758 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:22,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [83395755] [2020-10-24 00:35:22,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:22,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:35:22,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931903721] [2020-10-24 00:35:22,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:35:22,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:22,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:35:22,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:35:22,761 INFO L87 Difference]: Start difference. First operand 203 states and 238 transitions. Second operand 9 states. [2020-10-24 00:35:23,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:23,952 INFO L93 Difference]: Finished difference Result 408 states and 484 transitions. [2020-10-24 00:35:23,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:35:23,953 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2020-10-24 00:35:23,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:23,955 INFO L225 Difference]: With dead ends: 408 [2020-10-24 00:35:23,956 INFO L226 Difference]: Without dead ends: 269 [2020-10-24 00:35:23,957 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2020-10-24 00:35:23,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-10-24 00:35:24,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 213. [2020-10-24 00:35:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-10-24 00:35:24,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 251 transitions. [2020-10-24 00:35:24,007 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 251 transitions. Word has length 134 [2020-10-24 00:35:24,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:24,008 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 251 transitions. [2020-10-24 00:35:24,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:35:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 251 transitions. [2020-10-24 00:35:24,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-10-24 00:35:24,010 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:24,010 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:24,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 00:35:24,011 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:24,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:24,011 INFO L82 PathProgramCache]: Analyzing trace with hash 424633078, now seen corresponding path program 3 times [2020-10-24 00:35:24,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:24,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [781389896] [2020-10-24 00:35:24,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:24,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:24,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:24,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:24,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 00:35:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:24,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-24 00:35:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:24,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-10-24 00:35:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:24,255 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 44 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:35:24,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [781389896] [2020-10-24 00:35:24,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:24,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:35:24,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834984117] [2020-10-24 00:35:24,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:35:24,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:24,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:35:24,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:35:24,257 INFO L87 Difference]: Start difference. First operand 213 states and 251 transitions. Second operand 9 states. [2020-10-24 00:35:25,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:25,375 INFO L93 Difference]: Finished difference Result 386 states and 462 transitions. [2020-10-24 00:35:25,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:35:25,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2020-10-24 00:35:25,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:25,378 INFO L225 Difference]: With dead ends: 386 [2020-10-24 00:35:25,378 INFO L226 Difference]: Without dead ends: 249 [2020-10-24 00:35:25,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-10-24 00:35:25,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-10-24 00:35:25,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 213. [2020-10-24 00:35:25,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-10-24 00:35:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 251 transitions. [2020-10-24 00:35:25,417 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 251 transitions. Word has length 134 [2020-10-24 00:35:25,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:25,417 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 251 transitions. [2020-10-24 00:35:25,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:35:25,418 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 251 transitions. [2020-10-24 00:35:25,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-10-24 00:35:25,420 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:25,420 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:25,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 00:35:25,420 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:25,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:25,421 INFO L82 PathProgramCache]: Analyzing trace with hash -2050515573, now seen corresponding path program 5 times [2020-10-24 00:35:25,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:25,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1128169833] [2020-10-24 00:35:25,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:25,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:25,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:25,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:25,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-10-24 00:35:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:25,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-10-24 00:35:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:25,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-10-24 00:35:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:25,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1128169833] [2020-10-24 00:35:25,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:25,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:35:25,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048781150] [2020-10-24 00:35:25,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:35:25,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:25,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:35:25,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:35:25,628 INFO L87 Difference]: Start difference. First operand 213 states and 251 transitions. Second operand 10 states. [2020-10-24 00:35:26,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:26,941 INFO L93 Difference]: Finished difference Result 435 states and 517 transitions. [2020-10-24 00:35:26,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:35:26,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 139 [2020-10-24 00:35:26,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:26,946 INFO L225 Difference]: With dead ends: 435 [2020-10-24 00:35:26,946 INFO L226 Difference]: Without dead ends: 291 [2020-10-24 00:35:26,947 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=184, Unknown=0, NotChecked=0, Total=306 [2020-10-24 00:35:26,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-10-24 00:35:26,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 223. [2020-10-24 00:35:26,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-10-24 00:35:26,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 264 transitions. [2020-10-24 00:35:26,989 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 264 transitions. Word has length 139 [2020-10-24 00:35:26,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:26,990 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 264 transitions. [2020-10-24 00:35:26,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:35:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 264 transitions. [2020-10-24 00:35:26,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-10-24 00:35:26,992 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:26,992 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:26,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 00:35:26,993 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:26,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:26,993 INFO L82 PathProgramCache]: Analyzing trace with hash 51988249, now seen corresponding path program 4 times [2020-10-24 00:35:26,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:26,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1540438522] [2020-10-24 00:35:26,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:27,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:27,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:27,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:27,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-10-24 00:35:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:27,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-10-24 00:35:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:27,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-10-24 00:35:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:27,224 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:35:27,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1540438522] [2020-10-24 00:35:27,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:27,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:35:27,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23135177] [2020-10-24 00:35:27,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:35:27,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:27,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:35:27,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:35:27,227 INFO L87 Difference]: Start difference. First operand 223 states and 264 transitions. Second operand 10 states. [2020-10-24 00:35:28,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:28,715 INFO L93 Difference]: Finished difference Result 405 states and 487 transitions. [2020-10-24 00:35:28,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:35:28,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 139 [2020-10-24 00:35:28,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:28,721 INFO L225 Difference]: With dead ends: 405 [2020-10-24 00:35:28,721 INFO L226 Difference]: Without dead ends: 263 [2020-10-24 00:35:28,722 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2020-10-24 00:35:28,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2020-10-24 00:35:28,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 223. [2020-10-24 00:35:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-10-24 00:35:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 264 transitions. [2020-10-24 00:35:28,763 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 264 transitions. Word has length 139 [2020-10-24 00:35:28,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:28,763 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 264 transitions. [2020-10-24 00:35:28,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:35:28,763 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 264 transitions. [2020-10-24 00:35:28,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-10-24 00:35:28,765 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:28,766 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:28,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-24 00:35:28,766 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:28,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:28,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1639590072, now seen corresponding path program 6 times [2020-10-24 00:35:28,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:28,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [557831429] [2020-10-24 00:35:28,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:28,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:28,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:28,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:28,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-10-24 00:35:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:28,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-24 00:35:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:28,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-10-24 00:35:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:28,998 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 6 proven. 99 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:28,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [557831429] [2020-10-24 00:35:28,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:28,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:35:28,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137903552] [2020-10-24 00:35:29,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:35:29,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:29,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:35:29,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:35:29,001 INFO L87 Difference]: Start difference. First operand 223 states and 264 transitions. Second operand 11 states. [2020-10-24 00:35:30,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:30,316 INFO L93 Difference]: Finished difference Result 462 states and 550 transitions. [2020-10-24 00:35:30,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 00:35:30,320 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 144 [2020-10-24 00:35:30,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:30,322 INFO L225 Difference]: With dead ends: 462 [2020-10-24 00:35:30,323 INFO L226 Difference]: Without dead ends: 313 [2020-10-24 00:35:30,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=229, Unknown=0, NotChecked=0, Total=380 [2020-10-24 00:35:30,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-10-24 00:35:30,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 233. [2020-10-24 00:35:30,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-10-24 00:35:30,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 277 transitions. [2020-10-24 00:35:30,371 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 277 transitions. Word has length 144 [2020-10-24 00:35:30,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:30,372 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 277 transitions. [2020-10-24 00:35:30,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:35:30,372 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 277 transitions. [2020-10-24 00:35:30,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-10-24 00:35:30,374 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:30,374 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:30,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-24 00:35:30,375 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:30,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:30,375 INFO L82 PathProgramCache]: Analyzing trace with hash 462913750, now seen corresponding path program 5 times [2020-10-24 00:35:30,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:30,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1952787160] [2020-10-24 00:35:30,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:30,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:30,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:30,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:30,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-10-24 00:35:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:30,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-24 00:35:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:30,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-10-24 00:35:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:30,652 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 7 proven. 89 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:35:30,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1952787160] [2020-10-24 00:35:30,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:30,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:35:30,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225729636] [2020-10-24 00:35:30,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:35:30,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:30,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:35:30,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:35:30,654 INFO L87 Difference]: Start difference. First operand 233 states and 277 transitions. Second operand 11 states. [2020-10-24 00:35:32,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:32,275 INFO L93 Difference]: Finished difference Result 424 states and 512 transitions. [2020-10-24 00:35:32,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 00:35:32,279 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 144 [2020-10-24 00:35:32,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:32,282 INFO L225 Difference]: With dead ends: 424 [2020-10-24 00:35:32,282 INFO L226 Difference]: Without dead ends: 277 [2020-10-24 00:35:32,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2020-10-24 00:35:32,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-10-24 00:35:32,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 233. [2020-10-24 00:35:32,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-10-24 00:35:32,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 277 transitions. [2020-10-24 00:35:32,338 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 277 transitions. Word has length 144 [2020-10-24 00:35:32,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:32,338 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 277 transitions. [2020-10-24 00:35:32,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:35:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 277 transitions. [2020-10-24 00:35:32,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-10-24 00:35:32,341 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:32,341 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:32,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-24 00:35:32,341 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:32,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:32,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1421399125, now seen corresponding path program 7 times [2020-10-24 00:35:32,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:32,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [254997407] [2020-10-24 00:35:32,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:32,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:32,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:32,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:32,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-10-24 00:35:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:32,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-24 00:35:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:32,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-10-24 00:35:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 6 proven. 131 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:32,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [254997407] [2020-10-24 00:35:32,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:32,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 00:35:32,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979834139] [2020-10-24 00:35:32,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 00:35:32,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:32,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 00:35:32,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:35:32,608 INFO L87 Difference]: Start difference. First operand 233 states and 277 transitions. Second operand 12 states. [2020-10-24 00:35:33,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:33,985 INFO L93 Difference]: Finished difference Result 489 states and 583 transitions. [2020-10-24 00:35:33,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:35:33,986 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 149 [2020-10-24 00:35:33,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:33,989 INFO L225 Difference]: With dead ends: 489 [2020-10-24 00:35:33,989 INFO L226 Difference]: Without dead ends: 335 [2020-10-24 00:35:33,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2020-10-24 00:35:33,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-10-24 00:35:34,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 243. [2020-10-24 00:35:34,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-10-24 00:35:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 290 transitions. [2020-10-24 00:35:34,042 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 290 transitions. Word has length 149 [2020-10-24 00:35:34,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:34,043 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 290 transitions. [2020-10-24 00:35:34,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 00:35:34,043 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 290 transitions. [2020-10-24 00:35:34,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-10-24 00:35:34,045 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:34,045 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:34,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-24 00:35:34,046 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:34,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:34,046 INFO L82 PathProgramCache]: Analyzing trace with hash 681104697, now seen corresponding path program 6 times [2020-10-24 00:35:34,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:34,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1983927034] [2020-10-24 00:35:34,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:34,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:34,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:34,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:34,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-10-24 00:35:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:34,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-24 00:35:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:34,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-10-24 00:35:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:34,338 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 119 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:35:34,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1983927034] [2020-10-24 00:35:34,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:34,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 00:35:34,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085032258] [2020-10-24 00:35:34,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 00:35:34,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:34,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 00:35:34,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:35:34,340 INFO L87 Difference]: Start difference. First operand 243 states and 290 transitions. Second operand 12 states. [2020-10-24 00:35:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:36,239 INFO L93 Difference]: Finished difference Result 443 states and 537 transitions. [2020-10-24 00:35:36,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:35:36,244 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 149 [2020-10-24 00:35:36,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:36,246 INFO L225 Difference]: With dead ends: 443 [2020-10-24 00:35:36,246 INFO L226 Difference]: Without dead ends: 291 [2020-10-24 00:35:36,248 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2020-10-24 00:35:36,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-10-24 00:35:36,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 243. [2020-10-24 00:35:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-10-24 00:35:36,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 290 transitions. [2020-10-24 00:35:36,300 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 290 transitions. Word has length 149 [2020-10-24 00:35:36,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:36,300 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 290 transitions. [2020-10-24 00:35:36,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 00:35:36,301 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 290 transitions. [2020-10-24 00:35:36,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-10-24 00:35:36,302 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:36,302 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:36,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-24 00:35:36,303 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:36,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:36,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1763042008, now seen corresponding path program 8 times [2020-10-24 00:35:36,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:36,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [515489439] [2020-10-24 00:35:36,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:36,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:36,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:36,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:36,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-10-24 00:35:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:36,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-10-24 00:35:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:36,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-10-24 00:35:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:36,588 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 6 proven. 168 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:36,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [515489439] [2020-10-24 00:35:36,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:36,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 00:35:36,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274301413] [2020-10-24 00:35:36,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 00:35:36,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:36,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 00:35:36,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:35:36,590 INFO L87 Difference]: Start difference. First operand 243 states and 290 transitions. Second operand 13 states. [2020-10-24 00:35:38,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:38,512 INFO L93 Difference]: Finished difference Result 516 states and 616 transitions. [2020-10-24 00:35:38,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-24 00:35:38,513 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 154 [2020-10-24 00:35:38,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:38,517 INFO L225 Difference]: With dead ends: 516 [2020-10-24 00:35:38,517 INFO L226 Difference]: Without dead ends: 357 [2020-10-24 00:35:38,518 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=218, Invalid=334, Unknown=0, NotChecked=0, Total=552 [2020-10-24 00:35:38,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2020-10-24 00:35:38,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 253. [2020-10-24 00:35:38,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-10-24 00:35:38,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 303 transitions. [2020-10-24 00:35:38,574 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 303 transitions. Word has length 154 [2020-10-24 00:35:38,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:38,574 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 303 transitions. [2020-10-24 00:35:38,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 00:35:38,574 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 303 transitions. [2020-10-24 00:35:38,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-10-24 00:35:38,576 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:38,576 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:38,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-24 00:35:38,576 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:38,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:38,577 INFO L82 PathProgramCache]: Analyzing trace with hash 339461814, now seen corresponding path program 7 times [2020-10-24 00:35:38,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:38,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [555134076] [2020-10-24 00:35:38,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:38,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:38,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:38,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:38,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-10-24 00:35:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:38,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-10-24 00:35:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:38,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-10-24 00:35:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:38,960 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 7 proven. 154 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:35:38,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [555134076] [2020-10-24 00:35:38,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:38,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 00:35:38,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419453717] [2020-10-24 00:35:38,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 00:35:38,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:38,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 00:35:38,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:35:38,962 INFO L87 Difference]: Start difference. First operand 253 states and 303 transitions. Second operand 13 states. [2020-10-24 00:35:40,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:40,878 INFO L93 Difference]: Finished difference Result 462 states and 562 transitions. [2020-10-24 00:35:40,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-24 00:35:40,879 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 154 [2020-10-24 00:35:40,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:40,881 INFO L225 Difference]: With dead ends: 462 [2020-10-24 00:35:40,881 INFO L226 Difference]: Without dead ends: 305 [2020-10-24 00:35:40,883 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2020-10-24 00:35:40,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-10-24 00:35:40,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 253. [2020-10-24 00:35:40,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-10-24 00:35:40,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 303 transitions. [2020-10-24 00:35:40,947 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 303 transitions. Word has length 154 [2020-10-24 00:35:40,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:40,949 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 303 transitions. [2020-10-24 00:35:40,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 00:35:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 303 transitions. [2020-10-24 00:35:40,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-10-24 00:35:40,951 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:40,951 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:40,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-24 00:35:40,952 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:40,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:40,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1245474357, now seen corresponding path program 9 times [2020-10-24 00:35:40,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:40,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1322510578] [2020-10-24 00:35:40,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:40,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:41,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:41,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:41,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-10-24 00:35:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:41,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-10-24 00:35:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:41,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-10-24 00:35:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 6 proven. 210 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:41,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1322510578] [2020-10-24 00:35:41,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:41,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 00:35:41,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197356448] [2020-10-24 00:35:41,229 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 00:35:41,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:41,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 00:35:41,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=103, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:35:41,229 INFO L87 Difference]: Start difference. First operand 253 states and 303 transitions. Second operand 14 states. [2020-10-24 00:35:43,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:43,084 INFO L93 Difference]: Finished difference Result 543 states and 649 transitions. [2020-10-24 00:35:43,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 00:35:43,085 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 159 [2020-10-24 00:35:43,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:43,088 INFO L225 Difference]: With dead ends: 543 [2020-10-24 00:35:43,088 INFO L226 Difference]: Without dead ends: 379 [2020-10-24 00:35:43,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=256, Invalid=394, Unknown=0, NotChecked=0, Total=650 [2020-10-24 00:35:43,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2020-10-24 00:35:43,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 263. [2020-10-24 00:35:43,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2020-10-24 00:35:43,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 316 transitions. [2020-10-24 00:35:43,149 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 316 transitions. Word has length 159 [2020-10-24 00:35:43,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:43,149 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 316 transitions. [2020-10-24 00:35:43,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 00:35:43,149 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 316 transitions. [2020-10-24 00:35:43,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-10-24 00:35:43,151 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:43,151 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:43,151 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-24 00:35:43,151 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:43,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:43,152 INFO L82 PathProgramCache]: Analyzing trace with hash 857029465, now seen corresponding path program 8 times [2020-10-24 00:35:43,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:43,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [942161505] [2020-10-24 00:35:43,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:43,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:43,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:43,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:43,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-10-24 00:35:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:43,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-10-24 00:35:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:43,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-10-24 00:35:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:43,567 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 7 proven. 194 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:35:43,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [942161505] [2020-10-24 00:35:43,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:43,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 00:35:43,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9771749] [2020-10-24 00:35:43,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 00:35:43,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:43,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 00:35:43,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:35:43,569 INFO L87 Difference]: Start difference. First operand 263 states and 316 transitions. Second operand 14 states. [2020-10-24 00:35:45,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:45,640 INFO L93 Difference]: Finished difference Result 481 states and 587 transitions. [2020-10-24 00:35:45,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 00:35:45,643 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 159 [2020-10-24 00:35:45,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:45,645 INFO L225 Difference]: With dead ends: 481 [2020-10-24 00:35:45,645 INFO L226 Difference]: Without dead ends: 319 [2020-10-24 00:35:45,647 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2020-10-24 00:35:45,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-10-24 00:35:45,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 263. [2020-10-24 00:35:45,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2020-10-24 00:35:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 316 transitions. [2020-10-24 00:35:45,701 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 316 transitions. Word has length 159 [2020-10-24 00:35:45,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:45,702 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 316 transitions. [2020-10-24 00:35:45,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 00:35:45,702 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 316 transitions. [2020-10-24 00:35:45,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-10-24 00:35:45,703 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:45,704 INFO L422 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:45,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-24 00:35:45,704 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:45,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:45,704 INFO L82 PathProgramCache]: Analyzing trace with hash -19363064, now seen corresponding path program 10 times [2020-10-24 00:35:45,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:45,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1444548717] [2020-10-24 00:35:45,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:45,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:45,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:45,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:46,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-10-24 00:35:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:46,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-10-24 00:35:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:46,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-10-24 00:35:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 6 proven. 257 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:46,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1444548717] [2020-10-24 00:35:46,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:46,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 00:35:46,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110315738] [2020-10-24 00:35:46,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 00:35:46,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:46,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 00:35:46,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=118, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:35:46,055 INFO L87 Difference]: Start difference. First operand 263 states and 316 transitions. Second operand 15 states. [2020-10-24 00:35:48,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:48,370 INFO L93 Difference]: Finished difference Result 570 states and 682 transitions. [2020-10-24 00:35:48,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 00:35:48,371 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 164 [2020-10-24 00:35:48,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:48,374 INFO L225 Difference]: With dead ends: 570 [2020-10-24 00:35:48,374 INFO L226 Difference]: Without dead ends: 401 [2020-10-24 00:35:48,376 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=459, Unknown=0, NotChecked=0, Total=756 [2020-10-24 00:35:48,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2020-10-24 00:35:48,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 273. [2020-10-24 00:35:48,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2020-10-24 00:35:48,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 329 transitions. [2020-10-24 00:35:48,449 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 329 transitions. Word has length 164 [2020-10-24 00:35:48,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:48,449 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 329 transitions. [2020-10-24 00:35:48,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 00:35:48,449 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 329 transitions. [2020-10-24 00:35:48,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-10-24 00:35:48,451 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:48,451 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:48,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-24 00:35:48,451 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:48,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:48,452 INFO L82 PathProgramCache]: Analyzing trace with hash 2083140758, now seen corresponding path program 9 times [2020-10-24 00:35:48,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:48,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [741995400] [2020-10-24 00:35:48,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:48,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:48,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:48,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:48,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-10-24 00:35:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:48,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-10-24 00:35:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:48,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-10-24 00:35:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:48,932 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 7 proven. 239 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:35:48,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [741995400] [2020-10-24 00:35:48,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:48,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 00:35:48,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692690812] [2020-10-24 00:35:48,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 00:35:48,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:48,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 00:35:48,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:35:48,935 INFO L87 Difference]: Start difference. First operand 273 states and 329 transitions. Second operand 15 states. [2020-10-24 00:35:51,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:51,942 INFO L93 Difference]: Finished difference Result 500 states and 612 transitions. [2020-10-24 00:35:51,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 00:35:51,943 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 164 [2020-10-24 00:35:51,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:51,946 INFO L225 Difference]: With dead ends: 500 [2020-10-24 00:35:51,946 INFO L226 Difference]: Without dead ends: 333 [2020-10-24 00:35:51,948 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2020-10-24 00:35:51,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-10-24 00:35:52,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 273. [2020-10-24 00:35:52,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2020-10-24 00:35:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 329 transitions. [2020-10-24 00:35:52,019 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 329 transitions. Word has length 164 [2020-10-24 00:35:52,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:52,019 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 329 transitions. [2020-10-24 00:35:52,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 00:35:52,020 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 329 transitions. [2020-10-24 00:35:52,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-10-24 00:35:52,021 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:52,021 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:52,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-24 00:35:52,022 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:52,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:52,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1861300245, now seen corresponding path program 11 times [2020-10-24 00:35:52,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:52,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2091909195] [2020-10-24 00:35:52,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:52,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:52,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:52,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:52,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2020-10-24 00:35:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:52,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-10-24 00:35:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:52,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-10-24 00:35:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:52,405 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 6 proven. 309 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:52,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2091909195] [2020-10-24 00:35:52,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:52,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-10-24 00:35:52,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086911344] [2020-10-24 00:35:52,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 00:35:52,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:52,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 00:35:52,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=134, Unknown=0, NotChecked=0, Total=240 [2020-10-24 00:35:52,407 INFO L87 Difference]: Start difference. First operand 273 states and 329 transitions. Second operand 16 states. [2020-10-24 00:35:54,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:54,952 INFO L93 Difference]: Finished difference Result 597 states and 715 transitions. [2020-10-24 00:35:54,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-24 00:35:54,953 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 169 [2020-10-24 00:35:54,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:54,956 INFO L225 Difference]: With dead ends: 597 [2020-10-24 00:35:54,956 INFO L226 Difference]: Without dead ends: 423 [2020-10-24 00:35:54,958 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=341, Invalid=529, Unknown=0, NotChecked=0, Total=870 [2020-10-24 00:35:54,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2020-10-24 00:35:55,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 283. [2020-10-24 00:35:55,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2020-10-24 00:35:55,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 342 transitions. [2020-10-24 00:35:55,034 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 342 transitions. Word has length 169 [2020-10-24 00:35:55,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:55,034 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 342 transitions. [2020-10-24 00:35:55,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-24 00:35:55,034 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 342 transitions. [2020-10-24 00:35:55,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-10-24 00:35:55,036 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:55,036 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:55,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-24 00:35:55,036 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:55,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:55,037 INFO L82 PathProgramCache]: Analyzing trace with hash 241203577, now seen corresponding path program 10 times [2020-10-24 00:35:55,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:55,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1951797672] [2020-10-24 00:35:55,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:55,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:55,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:55,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:55,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2020-10-24 00:35:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:55,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-10-24 00:35:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:55,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-10-24 00:35:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 7 proven. 289 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:35:55,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1951797672] [2020-10-24 00:35:55,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:55,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-10-24 00:35:55,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292807697] [2020-10-24 00:35:55,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 00:35:55,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:55,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 00:35:55,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-10-24 00:35:55,539 INFO L87 Difference]: Start difference. First operand 283 states and 342 transitions. Second operand 16 states. [2020-10-24 00:35:58,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:58,120 INFO L93 Difference]: Finished difference Result 519 states and 637 transitions. [2020-10-24 00:35:58,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-24 00:35:58,122 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 169 [2020-10-24 00:35:58,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:58,124 INFO L225 Difference]: With dead ends: 519 [2020-10-24 00:35:58,124 INFO L226 Difference]: Without dead ends: 347 [2020-10-24 00:35:58,126 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2020-10-24 00:35:58,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-10-24 00:35:58,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 283. [2020-10-24 00:35:58,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2020-10-24 00:35:58,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 342 transitions. [2020-10-24 00:35:58,195 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 342 transitions. Word has length 169 [2020-10-24 00:35:58,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:58,196 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 342 transitions. [2020-10-24 00:35:58,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-24 00:35:58,196 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 342 transitions. [2020-10-24 00:35:58,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-10-24 00:35:58,197 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:58,197 INFO L422 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:35:58,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-24 00:35:58,198 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:58,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:58,198 INFO L82 PathProgramCache]: Analyzing trace with hash 2105483496, now seen corresponding path program 12 times [2020-10-24 00:35:58,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:58,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [365725516] [2020-10-24 00:35:58,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:58,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:58,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:58,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:58,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2020-10-24 00:35:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:58,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-10-24 00:35:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:58,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-10-24 00:35:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:58,590 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 366 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:58,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [365725516] [2020-10-24 00:35:58,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:58,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-10-24 00:35:58,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192979829] [2020-10-24 00:35:58,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 00:35:58,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:58,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 00:35:58,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=151, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:35:58,593 INFO L87 Difference]: Start difference. First operand 283 states and 342 transitions. Second operand 17 states. [2020-10-24 00:36:01,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:01,284 INFO L93 Difference]: Finished difference Result 624 states and 748 transitions. [2020-10-24 00:36:01,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-24 00:36:01,285 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 174 [2020-10-24 00:36:01,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:01,288 INFO L225 Difference]: With dead ends: 624 [2020-10-24 00:36:01,288 INFO L226 Difference]: Without dead ends: 445 [2020-10-24 00:36:01,290 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=388, Invalid=604, Unknown=0, NotChecked=0, Total=992 [2020-10-24 00:36:01,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-10-24 00:36:01,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 293. [2020-10-24 00:36:01,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2020-10-24 00:36:01,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 355 transitions. [2020-10-24 00:36:01,358 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 355 transitions. Word has length 174 [2020-10-24 00:36:01,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:01,358 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 355 transitions. [2020-10-24 00:36:01,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 00:36:01,359 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 355 transitions. [2020-10-24 00:36:01,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-10-24 00:36:01,360 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:01,360 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:36:01,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-24 00:36:01,361 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:01,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:01,361 INFO L82 PathProgramCache]: Analyzing trace with hash -86979978, now seen corresponding path program 11 times [2020-10-24 00:36:01,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:01,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1780526589] [2020-10-24 00:36:01,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:01,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:01,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:01,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:01,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2020-10-24 00:36:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:01,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-10-24 00:36:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:01,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-10-24 00:36:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:01,897 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 7 proven. 344 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:36:01,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1780526589] [2020-10-24 00:36:01,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:01,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-10-24 00:36:01,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352597483] [2020-10-24 00:36:01,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 00:36:01,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:01,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 00:36:01,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:36:01,899 INFO L87 Difference]: Start difference. First operand 293 states and 355 transitions. Second operand 17 states. [2020-10-24 00:36:04,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:04,879 INFO L93 Difference]: Finished difference Result 538 states and 662 transitions. [2020-10-24 00:36:04,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-24 00:36:04,881 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 174 [2020-10-24 00:36:04,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:04,883 INFO L225 Difference]: With dead ends: 538 [2020-10-24 00:36:04,883 INFO L226 Difference]: Without dead ends: 361 [2020-10-24 00:36:04,884 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2020-10-24 00:36:04,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2020-10-24 00:36:04,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 293. [2020-10-24 00:36:04,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2020-10-24 00:36:04,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 355 transitions. [2020-10-24 00:36:04,966 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 355 transitions. Word has length 174 [2020-10-24 00:36:04,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:04,966 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 355 transitions. [2020-10-24 00:36:04,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 00:36:04,967 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 355 transitions. [2020-10-24 00:36:04,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-10-24 00:36:04,968 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:04,968 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:36:04,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-24 00:36:04,969 INFO L429 AbstractCegarLoop]: === Iteration 29 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:04,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:04,969 INFO L82 PathProgramCache]: Analyzing trace with hash 175826443, now seen corresponding path program 13 times [2020-10-24 00:36:04,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:04,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [503149375] [2020-10-24 00:36:04,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:05,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:05,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:05,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:05,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-10-24 00:36:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:05,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-10-24 00:36:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:05,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-10-24 00:36:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:05,415 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 6 proven. 428 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:36:05,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [503149375] [2020-10-24 00:36:05,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:05,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-10-24 00:36:05,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583768972] [2020-10-24 00:36:05,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-24 00:36:05,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:05,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-24 00:36:05,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=169, Unknown=0, NotChecked=0, Total=306 [2020-10-24 00:36:05,417 INFO L87 Difference]: Start difference. First operand 293 states and 355 transitions. Second operand 18 states. [2020-10-24 00:36:07,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:07,441 INFO L93 Difference]: Finished difference Result 651 states and 781 transitions. [2020-10-24 00:36:07,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 00:36:07,447 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 179 [2020-10-24 00:36:07,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:07,450 INFO L225 Difference]: With dead ends: 651 [2020-10-24 00:36:07,450 INFO L226 Difference]: Without dead ends: 467 [2020-10-24 00:36:07,453 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=438, Invalid=684, Unknown=0, NotChecked=0, Total=1122 [2020-10-24 00:36:07,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2020-10-24 00:36:07,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 303. [2020-10-24 00:36:07,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2020-10-24 00:36:07,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 368 transitions. [2020-10-24 00:36:07,542 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 368 transitions. Word has length 179 [2020-10-24 00:36:07,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:07,542 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 368 transitions. [2020-10-24 00:36:07,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-24 00:36:07,542 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 368 transitions. [2020-10-24 00:36:07,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-10-24 00:36:07,544 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:07,544 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:36:07,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-24 00:36:07,544 INFO L429 AbstractCegarLoop]: === Iteration 30 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:07,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:07,545 INFO L82 PathProgramCache]: Analyzing trace with hash -2016637031, now seen corresponding path program 12 times [2020-10-24 00:36:07,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:07,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [202069704] [2020-10-24 00:36:07,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:07,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:07,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:07,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:08,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-10-24 00:36:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:08,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-10-24 00:36:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:08,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-10-24 00:36:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 7 proven. 404 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:36:08,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [202069704] [2020-10-24 00:36:08,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:08,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-10-24 00:36:08,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587423249] [2020-10-24 00:36:08,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-24 00:36:08,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:08,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-24 00:36:08,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-24 00:36:08,121 INFO L87 Difference]: Start difference. First operand 303 states and 368 transitions. Second operand 18 states. [2020-10-24 00:36:12,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:12,203 INFO L93 Difference]: Finished difference Result 557 states and 687 transitions. [2020-10-24 00:36:12,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 00:36:12,205 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 179 [2020-10-24 00:36:12,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:12,209 INFO L225 Difference]: With dead ends: 557 [2020-10-24 00:36:12,209 INFO L226 Difference]: Without dead ends: 375 [2020-10-24 00:36:12,211 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2020-10-24 00:36:12,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2020-10-24 00:36:12,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 303. [2020-10-24 00:36:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2020-10-24 00:36:12,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 368 transitions. [2020-10-24 00:36:12,296 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 368 transitions. Word has length 179 [2020-10-24 00:36:12,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:12,297 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 368 transitions. [2020-10-24 00:36:12,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-24 00:36:12,297 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 368 transitions. [2020-10-24 00:36:12,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-10-24 00:36:12,298 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:12,299 INFO L422 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:36:12,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-24 00:36:12,299 INFO L429 AbstractCegarLoop]: === Iteration 31 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:12,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:12,299 INFO L82 PathProgramCache]: Analyzing trace with hash -926163256, now seen corresponding path program 14 times [2020-10-24 00:36:12,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:12,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1428376278] [2020-10-24 00:36:12,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:12,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:12,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:12,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:12,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-10-24 00:36:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:12,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-10-24 00:36:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:12,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-10-24 00:36:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 6 proven. 495 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:36:12,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1428376278] [2020-10-24 00:36:12,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:12,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-10-24 00:36:12,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577662036] [2020-10-24 00:36:12,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-24 00:36:12,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:12,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-24 00:36:12,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=188, Unknown=0, NotChecked=0, Total=342 [2020-10-24 00:36:12,843 INFO L87 Difference]: Start difference. First operand 303 states and 368 transitions. Second operand 19 states. [2020-10-24 00:36:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:15,910 INFO L93 Difference]: Finished difference Result 678 states and 814 transitions. [2020-10-24 00:36:15,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-24 00:36:15,911 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 184 [2020-10-24 00:36:15,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:15,914 INFO L225 Difference]: With dead ends: 678 [2020-10-24 00:36:15,914 INFO L226 Difference]: Without dead ends: 489 [2020-10-24 00:36:15,916 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=491, Invalid=769, Unknown=0, NotChecked=0, Total=1260 [2020-10-24 00:36:15,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2020-10-24 00:36:15,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 313. [2020-10-24 00:36:15,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2020-10-24 00:36:15,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 381 transitions. [2020-10-24 00:36:15,993 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 381 transitions. Word has length 184 [2020-10-24 00:36:15,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:15,993 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 381 transitions. [2020-10-24 00:36:15,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-24 00:36:15,994 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 381 transitions. [2020-10-24 00:36:15,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-10-24 00:36:15,995 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:15,995 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:36:15,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-24 00:36:15,995 INFO L429 AbstractCegarLoop]: === Iteration 32 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:15,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:15,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1176340566, now seen corresponding path program 13 times [2020-10-24 00:36:15,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:15,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1315659209] [2020-10-24 00:36:15,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:16,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:16,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:16,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:16,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-10-24 00:36:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:16,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-10-24 00:36:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:16,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-10-24 00:36:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:16,623 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 7 proven. 469 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:36:16,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1315659209] [2020-10-24 00:36:16,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:16,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-10-24 00:36:16,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813392785] [2020-10-24 00:36:16,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-24 00:36:16,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:16,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-24 00:36:16,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2020-10-24 00:36:16,625 INFO L87 Difference]: Start difference. First operand 313 states and 381 transitions. Second operand 19 states. [2020-10-24 00:36:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:20,513 INFO L93 Difference]: Finished difference Result 576 states and 712 transitions. [2020-10-24 00:36:20,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-24 00:36:20,516 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 184 [2020-10-24 00:36:20,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:20,518 INFO L225 Difference]: With dead ends: 576 [2020-10-24 00:36:20,518 INFO L226 Difference]: Without dead ends: 389 [2020-10-24 00:36:20,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2020-10-24 00:36:20,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2020-10-24 00:36:20,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 313. [2020-10-24 00:36:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2020-10-24 00:36:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 381 transitions. [2020-10-24 00:36:20,593 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 381 transitions. Word has length 184 [2020-10-24 00:36:20,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:20,593 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 381 transitions. [2020-10-24 00:36:20,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-24 00:36:20,593 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 381 transitions. [2020-10-24 00:36:20,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-10-24 00:36:20,595 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:20,595 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:36:20,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-24 00:36:20,595 INFO L429 AbstractCegarLoop]: === Iteration 33 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:20,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:20,596 INFO L82 PathProgramCache]: Analyzing trace with hash -254159829, now seen corresponding path program 15 times [2020-10-24 00:36:20,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:20,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [898562575] [2020-10-24 00:36:20,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:20,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:20,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:20,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:21,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-10-24 00:36:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:21,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-10-24 00:36:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:21,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-10-24 00:36:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:21,107 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 6 proven. 567 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:36:21,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [898562575] [2020-10-24 00:36:21,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:21,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-10-24 00:36:21,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732495611] [2020-10-24 00:36:21,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-24 00:36:21,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:21,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-24 00:36:21,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=208, Unknown=0, NotChecked=0, Total=380 [2020-10-24 00:36:21,108 INFO L87 Difference]: Start difference. First operand 313 states and 381 transitions. Second operand 20 states. [2020-10-24 00:36:24,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:24,086 INFO L93 Difference]: Finished difference Result 705 states and 847 transitions. [2020-10-24 00:36:24,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-24 00:36:24,087 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 189 [2020-10-24 00:36:24,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:24,090 INFO L225 Difference]: With dead ends: 705 [2020-10-24 00:36:24,090 INFO L226 Difference]: Without dead ends: 511 [2020-10-24 00:36:24,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=547, Invalid=859, Unknown=0, NotChecked=0, Total=1406 [2020-10-24 00:36:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2020-10-24 00:36:24,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 323. [2020-10-24 00:36:24,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-10-24 00:36:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 394 transitions. [2020-10-24 00:36:24,180 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 394 transitions. Word has length 189 [2020-10-24 00:36:24,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:24,181 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 394 transitions. [2020-10-24 00:36:24,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-24 00:36:24,181 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 394 transitions. [2020-10-24 00:36:24,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-10-24 00:36:24,183 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:24,183 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:36:24,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-24 00:36:24,183 INFO L429 AbstractCegarLoop]: === Iteration 34 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:24,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:24,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1848343993, now seen corresponding path program 14 times [2020-10-24 00:36:24,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:24,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [17606776] [2020-10-24 00:36:24,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:24,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:24,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:24,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:24,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-10-24 00:36:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:24,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-10-24 00:36:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:24,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-10-24 00:36:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:24,834 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 7 proven. 539 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:36:24,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [17606776] [2020-10-24 00:36:24,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:24,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-10-24 00:36:24,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182819064] [2020-10-24 00:36:24,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-24 00:36:24,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:24,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-24 00:36:24,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2020-10-24 00:36:24,836 INFO L87 Difference]: Start difference. First operand 323 states and 394 transitions. Second operand 20 states. [2020-10-24 00:36:29,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:29,302 INFO L93 Difference]: Finished difference Result 595 states and 737 transitions. [2020-10-24 00:36:29,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-24 00:36:29,303 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 189 [2020-10-24 00:36:29,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:29,306 INFO L225 Difference]: With dead ends: 595 [2020-10-24 00:36:29,307 INFO L226 Difference]: Without dead ends: 403 [2020-10-24 00:36:29,308 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=232, Invalid=1174, Unknown=0, NotChecked=0, Total=1406 [2020-10-24 00:36:29,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2020-10-24 00:36:29,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 323. [2020-10-24 00:36:29,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-10-24 00:36:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 394 transitions. [2020-10-24 00:36:29,400 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 394 transitions. Word has length 189 [2020-10-24 00:36:29,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:29,401 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 394 transitions. [2020-10-24 00:36:29,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-24 00:36:29,401 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 394 transitions. [2020-10-24 00:36:29,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-10-24 00:36:29,402 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:29,403 INFO L422 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:36:29,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-24 00:36:29,403 INFO L429 AbstractCegarLoop]: === Iteration 35 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:29,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:29,403 INFO L82 PathProgramCache]: Analyzing trace with hash -2060663640, now seen corresponding path program 16 times [2020-10-24 00:36:29,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:29,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2127304544] [2020-10-24 00:36:29,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:29,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:29,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:29,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:29,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-10-24 00:36:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:29,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-10-24 00:36:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:29,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-10-24 00:36:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:29,952 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 6 proven. 644 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:36:29,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2127304544] [2020-10-24 00:36:29,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:29,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-10-24 00:36:29,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541549497] [2020-10-24 00:36:29,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-24 00:36:29,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:29,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-24 00:36:29,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=229, Unknown=0, NotChecked=0, Total=420 [2020-10-24 00:36:29,954 INFO L87 Difference]: Start difference. First operand 323 states and 394 transitions. Second operand 21 states. [2020-10-24 00:36:33,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:33,423 INFO L93 Difference]: Finished difference Result 732 states and 880 transitions. [2020-10-24 00:36:33,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-24 00:36:33,425 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 194 [2020-10-24 00:36:33,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:33,427 INFO L225 Difference]: With dead ends: 732 [2020-10-24 00:36:33,427 INFO L226 Difference]: Without dead ends: 533 [2020-10-24 00:36:33,430 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=606, Invalid=954, Unknown=0, NotChecked=0, Total=1560 [2020-10-24 00:36:33,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-10-24 00:36:33,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 333. [2020-10-24 00:36:33,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-10-24 00:36:33,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 407 transitions. [2020-10-24 00:36:33,532 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 407 transitions. Word has length 194 [2020-10-24 00:36:33,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:33,532 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 407 transitions. [2020-10-24 00:36:33,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-24 00:36:33,533 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 407 transitions. [2020-10-24 00:36:33,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-10-24 00:36:33,534 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:33,534 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:36:33,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-24 00:36:33,535 INFO L429 AbstractCegarLoop]: === Iteration 36 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:33,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:33,535 INFO L82 PathProgramCache]: Analyzing trace with hash 41840182, now seen corresponding path program 15 times [2020-10-24 00:36:33,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:33,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [259636722] [2020-10-24 00:36:33,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:33,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:33,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:33,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:34,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-10-24 00:36:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:34,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-10-24 00:36:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:34,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-10-24 00:36:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:34,266 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 7 proven. 614 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:36:34,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [259636722] [2020-10-24 00:36:34,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:34,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-10-24 00:36:34,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783346944] [2020-10-24 00:36:34,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-24 00:36:34,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:34,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-24 00:36:34,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2020-10-24 00:36:34,268 INFO L87 Difference]: Start difference. First operand 333 states and 407 transitions. Second operand 21 states. [2020-10-24 00:36:38,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:38,526 INFO L93 Difference]: Finished difference Result 614 states and 762 transitions. [2020-10-24 00:36:38,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-24 00:36:38,527 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 194 [2020-10-24 00:36:38,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:38,529 INFO L225 Difference]: With dead ends: 614 [2020-10-24 00:36:38,529 INFO L226 Difference]: Without dead ends: 417 [2020-10-24 00:36:38,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=246, Invalid=1314, Unknown=0, NotChecked=0, Total=1560 [2020-10-24 00:36:38,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-10-24 00:36:38,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 333. [2020-10-24 00:36:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-10-24 00:36:38,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 407 transitions. [2020-10-24 00:36:38,637 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 407 transitions. Word has length 194 [2020-10-24 00:36:38,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:38,637 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 407 transitions. [2020-10-24 00:36:38,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-24 00:36:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 407 transitions. [2020-10-24 00:36:38,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-10-24 00:36:38,639 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:38,639 INFO L422 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:36:38,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-24 00:36:38,639 INFO L429 AbstractCegarLoop]: === Iteration 37 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:38,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:38,640 INFO L82 PathProgramCache]: Analyzing trace with hash 880646731, now seen corresponding path program 17 times [2020-10-24 00:36:38,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:38,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [557712327] [2020-10-24 00:36:38,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:38,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:38,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:38,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:39,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2020-10-24 00:36:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:39,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2020-10-24 00:36:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:39,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-10-24 00:36:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 6 proven. 726 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:36:39,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [557712327] [2020-10-24 00:36:39,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:39,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-10-24 00:36:39,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381121847] [2020-10-24 00:36:39,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-24 00:36:39,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:39,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-24 00:36:39,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=251, Unknown=0, NotChecked=0, Total=462 [2020-10-24 00:36:39,206 INFO L87 Difference]: Start difference. First operand 333 states and 407 transitions. Second operand 22 states. [2020-10-24 00:36:42,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:42,877 INFO L93 Difference]: Finished difference Result 759 states and 913 transitions. [2020-10-24 00:36:42,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-24 00:36:42,879 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 199 [2020-10-24 00:36:42,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:42,882 INFO L225 Difference]: With dead ends: 759 [2020-10-24 00:36:42,882 INFO L226 Difference]: Without dead ends: 555 [2020-10-24 00:36:42,884 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=668, Invalid=1054, Unknown=0, NotChecked=0, Total=1722 [2020-10-24 00:36:42,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-10-24 00:36:42,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 343. [2020-10-24 00:36:42,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-10-24 00:36:42,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 420 transitions. [2020-10-24 00:36:42,994 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 420 transitions. Word has length 199 [2020-10-24 00:36:42,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:42,995 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 420 transitions. [2020-10-24 00:36:42,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-24 00:36:42,995 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 420 transitions. [2020-10-24 00:36:42,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-10-24 00:36:42,997 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:42,997 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:36:42,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-24 00:36:42,997 INFO L429 AbstractCegarLoop]: === Iteration 38 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:42,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:42,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1311816743, now seen corresponding path program 16 times [2020-10-24 00:36:42,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:42,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2021534565] [2020-10-24 00:36:42,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:43,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:43,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:43,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:43,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2020-10-24 00:36:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:43,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2020-10-24 00:36:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:43,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-10-24 00:36:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 7 proven. 694 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:36:43,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2021534565] [2020-10-24 00:36:43,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:43,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-10-24 00:36:43,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778986632] [2020-10-24 00:36:43,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-24 00:36:43,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:43,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-24 00:36:43,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2020-10-24 00:36:43,751 INFO L87 Difference]: Start difference. First operand 343 states and 420 transitions. Second operand 22 states. [2020-10-24 00:36:49,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:49,779 INFO L93 Difference]: Finished difference Result 633 states and 787 transitions. [2020-10-24 00:36:49,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-24 00:36:49,783 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 199 [2020-10-24 00:36:49,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:49,788 INFO L225 Difference]: With dead ends: 633 [2020-10-24 00:36:49,788 INFO L226 Difference]: Without dead ends: 431 [2020-10-24 00:36:49,790 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=260, Invalid=1462, Unknown=0, NotChecked=0, Total=1722 [2020-10-24 00:36:49,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2020-10-24 00:36:49,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 343. [2020-10-24 00:36:49,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-10-24 00:36:49,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 420 transitions. [2020-10-24 00:36:49,903 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 420 transitions. Word has length 199 [2020-10-24 00:36:49,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:49,903 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 420 transitions. [2020-10-24 00:36:49,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-24 00:36:49,904 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 420 transitions. [2020-10-24 00:36:49,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-10-24 00:36:49,905 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:49,905 INFO L422 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:36:49,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-24 00:36:49,905 INFO L429 AbstractCegarLoop]: === Iteration 39 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:49,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:49,906 INFO L82 PathProgramCache]: Analyzing trace with hash 630182536, now seen corresponding path program 18 times [2020-10-24 00:36:49,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:49,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [970200956] [2020-10-24 00:36:49,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:49,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:49,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:49,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:50,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-10-24 00:36:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:50,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-10-24 00:36:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:50,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2020-10-24 00:36:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:50,518 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 6 proven. 813 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:36:50,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [970200956] [2020-10-24 00:36:50,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:50,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-10-24 00:36:50,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944384421] [2020-10-24 00:36:50,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-24 00:36:50,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:50,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-24 00:36:50,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2020-10-24 00:36:50,520 INFO L87 Difference]: Start difference. First operand 343 states and 420 transitions. Second operand 23 states. [2020-10-24 00:36:53,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:53,087 INFO L93 Difference]: Finished difference Result 786 states and 946 transitions. [2020-10-24 00:36:53,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-24 00:36:53,088 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 204 [2020-10-24 00:36:53,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:53,090 INFO L225 Difference]: With dead ends: 786 [2020-10-24 00:36:53,091 INFO L226 Difference]: Without dead ends: 577 [2020-10-24 00:36:53,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=733, Invalid=1159, Unknown=0, NotChecked=0, Total=1892 [2020-10-24 00:36:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-10-24 00:36:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 353. [2020-10-24 00:36:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-10-24 00:36:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 433 transitions. [2020-10-24 00:36:53,187 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 433 transitions. Word has length 204 [2020-10-24 00:36:53,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:53,187 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 433 transitions. [2020-10-24 00:36:53,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-24 00:36:53,187 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 433 transitions. [2020-10-24 00:36:53,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-10-24 00:36:53,188 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:53,189 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:36:53,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-10-24 00:36:53,189 INFO L429 AbstractCegarLoop]: === Iteration 40 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:53,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:53,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1562280938, now seen corresponding path program 17 times [2020-10-24 00:36:53,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:53,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [643071428] [2020-10-24 00:36:53,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:53,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:53,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:53,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:53,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-10-24 00:36:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:53,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-10-24 00:36:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:53,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2020-10-24 00:36:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:54,060 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 7 proven. 779 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:36:54,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [643071428] [2020-10-24 00:36:54,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:54,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-10-24 00:36:54,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596285785] [2020-10-24 00:36:54,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-24 00:36:54,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:54,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-24 00:36:54,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2020-10-24 00:36:54,061 INFO L87 Difference]: Start difference. First operand 353 states and 433 transitions. Second operand 23 states. [2020-10-24 00:37:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:00,560 INFO L93 Difference]: Finished difference Result 652 states and 812 transitions. [2020-10-24 00:37:00,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-24 00:37:00,561 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 204 [2020-10-24 00:37:00,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:00,563 INFO L225 Difference]: With dead ends: 652 [2020-10-24 00:37:00,563 INFO L226 Difference]: Without dead ends: 445 [2020-10-24 00:37:00,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=274, Invalid=1618, Unknown=0, NotChecked=0, Total=1892 [2020-10-24 00:37:00,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-10-24 00:37:00,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 353. [2020-10-24 00:37:00,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-10-24 00:37:00,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 433 transitions. [2020-10-24 00:37:00,671 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 433 transitions. Word has length 204 [2020-10-24 00:37:00,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:00,671 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 433 transitions. [2020-10-24 00:37:00,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-24 00:37:00,671 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 433 transitions. [2020-10-24 00:37:00,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-10-24 00:37:00,673 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:00,673 INFO L422 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:37:00,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-10-24 00:37:00,673 INFO L429 AbstractCegarLoop]: === Iteration 41 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:00,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:00,674 INFO L82 PathProgramCache]: Analyzing trace with hash 121124971, now seen corresponding path program 19 times [2020-10-24 00:37:00,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:00,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1435173670] [2020-10-24 00:37:00,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:00,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:00,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:37:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:00,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:37:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:01,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-10-24 00:37:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:01,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2020-10-24 00:37:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:01,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-10-24 00:37:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 6 proven. 905 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:37:01,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1435173670] [2020-10-24 00:37:01,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:01,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-10-24 00:37:01,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118993928] [2020-10-24 00:37:01,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-24 00:37:01,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:01,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-24 00:37:01,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=298, Unknown=0, NotChecked=0, Total=552 [2020-10-24 00:37:01,369 INFO L87 Difference]: Start difference. First operand 353 states and 433 transitions. Second operand 24 states. [2020-10-24 00:37:04,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:04,392 INFO L93 Difference]: Finished difference Result 813 states and 979 transitions. [2020-10-24 00:37:04,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-24 00:37:04,394 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 209 [2020-10-24 00:37:04,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:04,397 INFO L225 Difference]: With dead ends: 813 [2020-10-24 00:37:04,397 INFO L226 Difference]: Without dead ends: 599 [2020-10-24 00:37:04,399 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=801, Invalid=1269, Unknown=0, NotChecked=0, Total=2070 [2020-10-24 00:37:04,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-10-24 00:37:04,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 363. [2020-10-24 00:37:04,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2020-10-24 00:37:04,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 446 transitions. [2020-10-24 00:37:04,513 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 446 transitions. Word has length 209 [2020-10-24 00:37:04,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:04,514 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 446 transitions. [2020-10-24 00:37:04,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-24 00:37:04,514 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 446 transitions. [2020-10-24 00:37:04,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-10-24 00:37:04,515 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:04,515 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:37:04,515 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-24 00:37:04,515 INFO L429 AbstractCegarLoop]: === Iteration 42 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:04,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:04,516 INFO L82 PathProgramCache]: Analyzing trace with hash -2071338503, now seen corresponding path program 18 times [2020-10-24 00:37:04,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:04,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1301683435] [2020-10-24 00:37:04,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:04,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:04,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:37:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:04,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:37:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:05,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-10-24 00:37:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:05,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2020-10-24 00:37:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:05,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-10-24 00:37:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:05,460 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 7 proven. 869 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:37:05,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1301683435] [2020-10-24 00:37:05,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:05,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-10-24 00:37:05,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215549259] [2020-10-24 00:37:05,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-24 00:37:05,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:05,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-24 00:37:05,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2020-10-24 00:37:05,462 INFO L87 Difference]: Start difference. First operand 363 states and 446 transitions. Second operand 24 states. [2020-10-24 00:37:12,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:12,105 INFO L93 Difference]: Finished difference Result 671 states and 837 transitions. [2020-10-24 00:37:12,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-24 00:37:12,107 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 209 [2020-10-24 00:37:12,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:12,109 INFO L225 Difference]: With dead ends: 671 [2020-10-24 00:37:12,109 INFO L226 Difference]: Without dead ends: 459 [2020-10-24 00:37:12,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=288, Invalid=1782, Unknown=0, NotChecked=0, Total=2070 [2020-10-24 00:37:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2020-10-24 00:37:12,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 363. [2020-10-24 00:37:12,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2020-10-24 00:37:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 446 transitions. [2020-10-24 00:37:12,217 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 446 transitions. Word has length 209 [2020-10-24 00:37:12,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:12,217 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 446 transitions. [2020-10-24 00:37:12,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-24 00:37:12,217 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 446 transitions. [2020-10-24 00:37:12,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2020-10-24 00:37:12,218 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:12,219 INFO L422 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:37:12,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-10-24 00:37:12,219 INFO L429 AbstractCegarLoop]: === Iteration 43 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:12,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:12,220 INFO L82 PathProgramCache]: Analyzing trace with hash -882702232, now seen corresponding path program 20 times [2020-10-24 00:37:12,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:12,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [108668472] [2020-10-24 00:37:12,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:12,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:12,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:37:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:12,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:37:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:12,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-10-24 00:37:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:12,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-10-24 00:37:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:12,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-10-24 00:37:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:12,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1041 backedges. 6 proven. 1002 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:37:12,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [108668472] [2020-10-24 00:37:12,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:12,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-10-24 00:37:12,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970378646] [2020-10-24 00:37:12,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-24 00:37:12,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:12,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-24 00:37:12,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=323, Unknown=0, NotChecked=0, Total=600 [2020-10-24 00:37:12,918 INFO L87 Difference]: Start difference. First operand 363 states and 446 transitions. Second operand 25 states. [2020-10-24 00:37:16,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:16,011 INFO L93 Difference]: Finished difference Result 840 states and 1012 transitions. [2020-10-24 00:37:16,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-24 00:37:16,012 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 214 [2020-10-24 00:37:16,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:16,015 INFO L225 Difference]: With dead ends: 840 [2020-10-24 00:37:16,015 INFO L226 Difference]: Without dead ends: 621 [2020-10-24 00:37:16,017 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=872, Invalid=1384, Unknown=0, NotChecked=0, Total=2256 [2020-10-24 00:37:16,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-10-24 00:37:16,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 373. [2020-10-24 00:37:16,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-10-24 00:37:16,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 459 transitions. [2020-10-24 00:37:16,124 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 459 transitions. Word has length 214 [2020-10-24 00:37:16,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:16,124 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 459 transitions. [2020-10-24 00:37:16,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-24 00:37:16,124 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 459 transitions. [2020-10-24 00:37:16,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2020-10-24 00:37:16,126 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:16,126 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:37:16,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-10-24 00:37:16,126 INFO L429 AbstractCegarLoop]: === Iteration 44 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:16,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:16,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1219801590, now seen corresponding path program 19 times [2020-10-24 00:37:16,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:16,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [156977153] [2020-10-24 00:37:16,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:16,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:16,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:37:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:16,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:37:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:16,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-10-24 00:37:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:16,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-10-24 00:37:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:16,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-10-24 00:37:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 7 proven. 964 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:37:17,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [156977153] [2020-10-24 00:37:17,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:17,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-10-24 00:37:17,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116415963] [2020-10-24 00:37:17,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-24 00:37:17,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:17,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-24 00:37:17,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2020-10-24 00:37:17,058 INFO L87 Difference]: Start difference. First operand 373 states and 459 transitions. Second operand 25 states. [2020-10-24 00:37:23,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:23,018 INFO L93 Difference]: Finished difference Result 690 states and 862 transitions. [2020-10-24 00:37:23,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-24 00:37:23,020 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 214 [2020-10-24 00:37:23,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:23,022 INFO L225 Difference]: With dead ends: 690 [2020-10-24 00:37:23,022 INFO L226 Difference]: Without dead ends: 473 [2020-10-24 00:37:23,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=302, Invalid=1954, Unknown=0, NotChecked=0, Total=2256 [2020-10-24 00:37:23,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2020-10-24 00:37:23,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 373. [2020-10-24 00:37:23,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-10-24 00:37:23,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 459 transitions. [2020-10-24 00:37:23,129 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 459 transitions. Word has length 214 [2020-10-24 00:37:23,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:23,129 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 459 transitions. [2020-10-24 00:37:23,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-24 00:37:23,129 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 459 transitions. [2020-10-24 00:37:23,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2020-10-24 00:37:23,131 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:23,131 INFO L422 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:37:23,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-10-24 00:37:23,131 INFO L429 AbstractCegarLoop]: === Iteration 45 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:23,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:23,132 INFO L82 PathProgramCache]: Analyzing trace with hash -61100405, now seen corresponding path program 21 times [2020-10-24 00:37:23,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:23,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2071275625] [2020-10-24 00:37:23,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:23,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:23,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:37:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:23,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:37:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:23,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-10-24 00:37:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:23,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2020-10-24 00:37:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:23,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2020-10-24 00:37:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:24,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 6 proven. 1104 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:37:24,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2071275625] [2020-10-24 00:37:24,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:24,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-10-24 00:37:24,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193671019] [2020-10-24 00:37:24,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-10-24 00:37:24,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:24,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-10-24 00:37:24,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=349, Unknown=0, NotChecked=0, Total=650 [2020-10-24 00:37:24,005 INFO L87 Difference]: Start difference. First operand 373 states and 459 transitions. Second operand 26 states. [2020-10-24 00:37:28,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:28,376 INFO L93 Difference]: Finished difference Result 867 states and 1045 transitions. [2020-10-24 00:37:28,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-24 00:37:28,381 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 219 [2020-10-24 00:37:28,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:28,385 INFO L225 Difference]: With dead ends: 867 [2020-10-24 00:37:28,385 INFO L226 Difference]: Without dead ends: 643 [2020-10-24 00:37:28,387 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=946, Invalid=1504, Unknown=0, NotChecked=0, Total=2450 [2020-10-24 00:37:28,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2020-10-24 00:37:28,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 383. [2020-10-24 00:37:28,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-10-24 00:37:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 472 transitions. [2020-10-24 00:37:28,539 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 472 transitions. Word has length 219 [2020-10-24 00:37:28,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:28,540 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 472 transitions. [2020-10-24 00:37:28,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-10-24 00:37:28,540 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 472 transitions. [2020-10-24 00:37:28,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2020-10-24 00:37:28,542 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:28,542 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:37:28,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-10-24 00:37:28,543 INFO L429 AbstractCegarLoop]: === Iteration 46 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:28,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:28,544 INFO L82 PathProgramCache]: Analyzing trace with hash 2041403417, now seen corresponding path program 20 times [2020-10-24 00:37:28,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:28,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1719842877] [2020-10-24 00:37:28,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:28,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:28,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:37:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:28,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:37:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:29,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-10-24 00:37:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:29,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2020-10-24 00:37:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:29,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2020-10-24 00:37:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:29,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 7 proven. 1064 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:37:29,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1719842877] [2020-10-24 00:37:29,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:29,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-10-24 00:37:29,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506982854] [2020-10-24 00:37:29,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-10-24 00:37:29,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:29,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-10-24 00:37:29,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2020-10-24 00:37:29,764 INFO L87 Difference]: Start difference. First operand 383 states and 472 transitions. Second operand 26 states. [2020-10-24 00:37:37,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:37,184 INFO L93 Difference]: Finished difference Result 709 states and 887 transitions. [2020-10-24 00:37:37,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-24 00:37:37,186 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 219 [2020-10-24 00:37:37,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:37,188 INFO L225 Difference]: With dead ends: 709 [2020-10-24 00:37:37,188 INFO L226 Difference]: Without dead ends: 487 [2020-10-24 00:37:37,189 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=316, Invalid=2134, Unknown=0, NotChecked=0, Total=2450 [2020-10-24 00:37:37,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2020-10-24 00:37:37,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 383. [2020-10-24 00:37:37,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-10-24 00:37:37,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 472 transitions. [2020-10-24 00:37:37,293 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 472 transitions. Word has length 219 [2020-10-24 00:37:37,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:37,293 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 472 transitions. [2020-10-24 00:37:37,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-10-24 00:37:37,293 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 472 transitions. [2020-10-24 00:37:37,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2020-10-24 00:37:37,294 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:37,294 INFO L422 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:37:37,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-10-24 00:37:37,295 INFO L429 AbstractCegarLoop]: === Iteration 47 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:37,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:37,295 INFO L82 PathProgramCache]: Analyzing trace with hash 647259720, now seen corresponding path program 22 times [2020-10-24 00:37:37,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:37,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1032661745] [2020-10-24 00:37:37,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:37,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:37,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:37:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:37,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:37:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:38,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2020-10-24 00:37:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:38,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2020-10-24 00:37:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:38,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2020-10-24 00:37:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:38,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 6 proven. 1211 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:37:38,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1032661745] [2020-10-24 00:37:38,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:38,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-10-24 00:37:38,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19677806] [2020-10-24 00:37:38,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-10-24 00:37:38,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:38,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-10-24 00:37:38,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=376, Unknown=0, NotChecked=0, Total=702 [2020-10-24 00:37:38,219 INFO L87 Difference]: Start difference. First operand 383 states and 472 transitions. Second operand 27 states. [2020-10-24 00:37:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:41,847 INFO L93 Difference]: Finished difference Result 894 states and 1078 transitions. [2020-10-24 00:37:41,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-24 00:37:41,848 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 224 [2020-10-24 00:37:41,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:41,851 INFO L225 Difference]: With dead ends: 894 [2020-10-24 00:37:41,852 INFO L226 Difference]: Without dead ends: 665 [2020-10-24 00:37:41,853 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1023, Invalid=1629, Unknown=0, NotChecked=0, Total=2652 [2020-10-24 00:37:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2020-10-24 00:37:42,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 393. [2020-10-24 00:37:42,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-10-24 00:37:42,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 485 transitions. [2020-10-24 00:37:42,029 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 485 transitions. Word has length 224 [2020-10-24 00:37:42,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:42,029 INFO L481 AbstractCegarLoop]: Abstraction has 393 states and 485 transitions. [2020-10-24 00:37:42,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-10-24 00:37:42,030 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 485 transitions. [2020-10-24 00:37:42,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2020-10-24 00:37:42,031 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:42,032 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:37:42,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-10-24 00:37:42,032 INFO L429 AbstractCegarLoop]: === Iteration 48 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:42,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:42,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1545203754, now seen corresponding path program 21 times [2020-10-24 00:37:42,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:42,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2016676499] [2020-10-24 00:37:42,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:42,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:42,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:37:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:42,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:37:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:43,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2020-10-24 00:37:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:43,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2020-10-24 00:37:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:43,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2020-10-24 00:37:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:43,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1206 backedges. 7 proven. 1169 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:37:43,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2016676499] [2020-10-24 00:37:43,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:43,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-10-24 00:37:43,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686763572] [2020-10-24 00:37:43,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-10-24 00:37:43,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:43,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-10-24 00:37:43,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2020-10-24 00:37:43,125 INFO L87 Difference]: Start difference. First operand 393 states and 485 transitions. Second operand 27 states. [2020-10-24 00:37:51,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:51,854 INFO L93 Difference]: Finished difference Result 728 states and 912 transitions. [2020-10-24 00:37:51,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-24 00:37:51,856 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 224 [2020-10-24 00:37:51,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:51,858 INFO L225 Difference]: With dead ends: 728 [2020-10-24 00:37:51,858 INFO L226 Difference]: Without dead ends: 501 [2020-10-24 00:37:51,859 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=330, Invalid=2322, Unknown=0, NotChecked=0, Total=2652 [2020-10-24 00:37:51,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2020-10-24 00:37:51,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 393. [2020-10-24 00:37:51,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-10-24 00:37:51,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 485 transitions. [2020-10-24 00:37:51,958 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 485 transitions. Word has length 224 [2020-10-24 00:37:51,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:51,959 INFO L481 AbstractCegarLoop]: Abstraction has 393 states and 485 transitions. [2020-10-24 00:37:51,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-10-24 00:37:51,959 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 485 transitions. [2020-10-24 00:37:51,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2020-10-24 00:37:51,960 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:51,960 INFO L422 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:37:51,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-10-24 00:37:51,960 INFO L429 AbstractCegarLoop]: === Iteration 49 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:51,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:51,961 INFO L82 PathProgramCache]: Analyzing trace with hash 683277483, now seen corresponding path program 23 times [2020-10-24 00:37:51,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:51,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1550803870] [2020-10-24 00:37:51,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:52,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:52,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:37:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:52,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:37:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:52,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-10-24 00:37:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:52,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-10-24 00:37:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:52,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2020-10-24 00:37:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:52,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1362 backedges. 6 proven. 1323 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:37:52,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1550803870] [2020-10-24 00:37:52,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:52,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-10-24 00:37:52,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419189877] [2020-10-24 00:37:52,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-10-24 00:37:52,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:52,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-10-24 00:37:52,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=404, Unknown=0, NotChecked=0, Total=756 [2020-10-24 00:37:52,866 INFO L87 Difference]: Start difference. First operand 393 states and 485 transitions. Second operand 28 states. [2020-10-24 00:37:56,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:56,710 INFO L93 Difference]: Finished difference Result 921 states and 1111 transitions. [2020-10-24 00:37:56,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-24 00:37:56,711 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 229 [2020-10-24 00:37:56,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:56,714 INFO L225 Difference]: With dead ends: 921 [2020-10-24 00:37:56,714 INFO L226 Difference]: Without dead ends: 687 [2020-10-24 00:37:56,716 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1103, Invalid=1759, Unknown=0, NotChecked=0, Total=2862 [2020-10-24 00:37:56,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-10-24 00:37:56,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 403. [2020-10-24 00:37:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-10-24 00:37:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 498 transitions. [2020-10-24 00:37:56,832 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 498 transitions. Word has length 229 [2020-10-24 00:37:56,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:56,832 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 498 transitions. [2020-10-24 00:37:56,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-10-24 00:37:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 498 transitions. [2020-10-24 00:37:56,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2020-10-24 00:37:56,834 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:56,834 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:37:56,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-10-24 00:37:56,834 INFO L429 AbstractCegarLoop]: === Iteration 50 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:56,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:56,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1509185991, now seen corresponding path program 22 times [2020-10-24 00:37:56,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:56,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [946327164] [2020-10-24 00:37:56,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:56,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:56,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:37:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:56,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:37:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:57,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-10-24 00:37:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:57,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-10-24 00:37:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:57,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2020-10-24 00:37:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1316 backedges. 7 proven. 1279 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:37:57,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [946327164] [2020-10-24 00:37:57,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:57,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-10-24 00:37:57,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529025689] [2020-10-24 00:37:57,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-10-24 00:37:57,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:57,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-10-24 00:37:57,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2020-10-24 00:37:57,999 INFO L87 Difference]: Start difference. First operand 403 states and 498 transitions. Second operand 28 states. [2020-10-24 00:38:07,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:07,577 INFO L93 Difference]: Finished difference Result 747 states and 937 transitions. [2020-10-24 00:38:07,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-24 00:38:07,585 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 229 [2020-10-24 00:38:07,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:07,588 INFO L225 Difference]: With dead ends: 747 [2020-10-24 00:38:07,588 INFO L226 Difference]: Without dead ends: 515 [2020-10-24 00:38:07,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=344, Invalid=2518, Unknown=0, NotChecked=0, Total=2862 [2020-10-24 00:38:07,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2020-10-24 00:38:07,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 403. [2020-10-24 00:38:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-10-24 00:38:07,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 498 transitions. [2020-10-24 00:38:07,722 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 498 transitions. Word has length 229 [2020-10-24 00:38:07,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:07,722 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 498 transitions. [2020-10-24 00:38:07,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-10-24 00:38:07,722 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 498 transitions. [2020-10-24 00:38:07,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-10-24 00:38:07,724 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:07,724 INFO L422 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:38:07,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-10-24 00:38:07,724 INFO L429 AbstractCegarLoop]: === Iteration 51 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:07,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:07,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1435626536, now seen corresponding path program 24 times [2020-10-24 00:38:07,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:07,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [562434891] [2020-10-24 00:38:07,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:07,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:07,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:38:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:07,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:38:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:08,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-10-24 00:38:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:08,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-10-24 00:38:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:08,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2020-10-24 00:38:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:08,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 6 proven. 1440 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:38:08,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [562434891] [2020-10-24 00:38:08,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:08,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2020-10-24 00:38:08,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2284674] [2020-10-24 00:38:08,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-10-24 00:38:08,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:08,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-10-24 00:38:08,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=433, Unknown=0, NotChecked=0, Total=812 [2020-10-24 00:38:08,652 INFO L87 Difference]: Start difference. First operand 403 states and 498 transitions. Second operand 29 states. [2020-10-24 00:38:13,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:13,636 INFO L93 Difference]: Finished difference Result 948 states and 1144 transitions. [2020-10-24 00:38:13,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-10-24 00:38:13,637 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 234 [2020-10-24 00:38:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:13,641 INFO L225 Difference]: With dead ends: 948 [2020-10-24 00:38:13,641 INFO L226 Difference]: Without dead ends: 709 [2020-10-24 00:38:13,642 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1186, Invalid=1894, Unknown=0, NotChecked=0, Total=3080 [2020-10-24 00:38:13,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2020-10-24 00:38:13,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 413. [2020-10-24 00:38:13,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2020-10-24 00:38:13,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 511 transitions. [2020-10-24 00:38:13,750 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 511 transitions. Word has length 234 [2020-10-24 00:38:13,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:13,750 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 511 transitions. [2020-10-24 00:38:13,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-10-24 00:38:13,751 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 511 transitions. [2020-10-24 00:38:13,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-10-24 00:38:13,752 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:13,753 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:38:13,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-10-24 00:38:13,753 INFO L429 AbstractCegarLoop]: === Iteration 52 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:13,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:13,753 INFO L82 PathProgramCache]: Analyzing trace with hash -756836938, now seen corresponding path program 23 times [2020-10-24 00:38:13,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:13,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1578743879] [2020-10-24 00:38:13,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:13,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:13,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:38:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:13,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:38:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:14,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-10-24 00:38:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:14,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-10-24 00:38:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:14,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2020-10-24 00:38:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:14,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2020-10-24 00:38:14,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1578743879] [2020-10-24 00:38:14,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:14,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:38:14,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293115760] [2020-10-24 00:38:14,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:38:14,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:14,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:38:14,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:38:14,149 INFO L87 Difference]: Start difference. First operand 413 states and 511 transitions. Second operand 11 states. [2020-10-24 00:38:15,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:15,883 INFO L93 Difference]: Finished difference Result 470 states and 592 transitions. [2020-10-24 00:38:15,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:38:15,883 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 234 [2020-10-24 00:38:15,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:15,887 INFO L225 Difference]: With dead ends: 470 [2020-10-24 00:38:15,887 INFO L226 Difference]: Without dead ends: 461 [2020-10-24 00:38:15,888 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2020-10-24 00:38:15,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2020-10-24 00:38:16,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 447. [2020-10-24 00:38:16,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2020-10-24 00:38:16,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 558 transitions. [2020-10-24 00:38:16,019 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 558 transitions. Word has length 234 [2020-10-24 00:38:16,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:16,019 INFO L481 AbstractCegarLoop]: Abstraction has 447 states and 558 transitions. [2020-10-24 00:38:16,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:38:16,019 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 558 transitions. [2020-10-24 00:38:16,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-10-24 00:38:16,021 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:16,021 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:38:16,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-10-24 00:38:16,021 INFO L429 AbstractCegarLoop]: === Iteration 53 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:16,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:16,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1646971217, now seen corresponding path program 1 times [2020-10-24 00:38:16,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:16,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1232816727] [2020-10-24 00:38:16,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:16,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:16,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:38:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:16,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:38:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:16,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-10-24 00:38:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:16,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-10-24 00:38:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:16,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2020-10-24 00:38:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:16,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2020-10-24 00:38:16,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1232816727] [2020-10-24 00:38:16,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:38:16,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-24 00:38:16,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543155234] [2020-10-24 00:38:16,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:38:16,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:16,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:38:16,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:38:16,211 INFO L87 Difference]: Start difference. First operand 447 states and 558 transitions. Second operand 7 states. [2020-10-24 00:38:17,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:17,276 INFO L93 Difference]: Finished difference Result 454 states and 564 transitions. [2020-10-24 00:38:17,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:38:17,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 236 [2020-10-24 00:38:17,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:17,282 INFO L225 Difference]: With dead ends: 454 [2020-10-24 00:38:17,282 INFO L226 Difference]: Without dead ends: 441 [2020-10-24 00:38:17,283 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:38:17,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2020-10-24 00:38:17,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2020-10-24 00:38:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-10-24 00:38:17,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 550 transitions. [2020-10-24 00:38:17,429 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 550 transitions. Word has length 236 [2020-10-24 00:38:17,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:17,429 INFO L481 AbstractCegarLoop]: Abstraction has 441 states and 550 transitions. [2020-10-24 00:38:17,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:38:17,429 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 550 transitions. [2020-10-24 00:38:17,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2020-10-24 00:38:17,431 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:17,431 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:38:17,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-10-24 00:38:17,431 INFO L429 AbstractCegarLoop]: === Iteration 54 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:17,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:17,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1615315333, now seen corresponding path program 1 times [2020-10-24 00:38:17,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:17,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [810130766] [2020-10-24 00:38:17,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:38:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-24 00:38:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2020-10-24 00:38:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-10-24 00:38:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2020-10-24 00:38:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1433 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1408 trivial. 0 not checked. [2020-10-24 00:38:17,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [810130766] [2020-10-24 00:38:17,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:17,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-24 00:38:17,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048509484] [2020-10-24 00:38:17,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:38:17,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:17,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:38:17,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:38:17,648 INFO L87 Difference]: Start difference. First operand 441 states and 550 transitions. Second operand 6 states. [2020-10-24 00:38:18,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:18,521 INFO L93 Difference]: Finished difference Result 701 states and 878 transitions. [2020-10-24 00:38:18,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 00:38:18,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2020-10-24 00:38:18,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:18,532 INFO L225 Difference]: With dead ends: 701 [2020-10-24 00:38:18,532 INFO L226 Difference]: Without dead ends: 289 [2020-10-24 00:38:18,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:38:18,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-10-24 00:38:18,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 272. [2020-10-24 00:38:18,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2020-10-24 00:38:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 336 transitions. [2020-10-24 00:38:18,671 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 336 transitions. Word has length 239 [2020-10-24 00:38:18,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:18,672 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 336 transitions. [2020-10-24 00:38:18,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:38:18,672 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 336 transitions. [2020-10-24 00:38:18,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2020-10-24 00:38:18,673 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:18,674 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:38:18,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-10-24 00:38:18,674 INFO L429 AbstractCegarLoop]: === Iteration 55 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:18,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:18,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1727576548, now seen corresponding path program 1 times [2020-10-24 00:38:18,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:18,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2078700211] [2020-10-24 00:38:18,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:18,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:18,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:38:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:18,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:38:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:18,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-10-24 00:38:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:18,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-10-24 00:38:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:18,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2020-10-24 00:38:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2020-10-24 00:38:19,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2078700211] [2020-10-24 00:38:19,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:38:19,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-24 00:38:19,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175350212] [2020-10-24 00:38:19,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:38:19,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:19,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:38:19,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:38:19,052 INFO L87 Difference]: Start difference. First operand 272 states and 336 transitions. Second operand 9 states. [2020-10-24 00:38:20,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:20,441 INFO L93 Difference]: Finished difference Result 327 states and 399 transitions. [2020-10-24 00:38:20,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:38:20,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 245 [2020-10-24 00:38:20,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:20,444 INFO L225 Difference]: With dead ends: 327 [2020-10-24 00:38:20,444 INFO L226 Difference]: Without dead ends: 307 [2020-10-24 00:38:20,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:38:20,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2020-10-24 00:38:20,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 278. [2020-10-24 00:38:20,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2020-10-24 00:38:20,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 342 transitions. [2020-10-24 00:38:20,602 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 342 transitions. Word has length 245 [2020-10-24 00:38:20,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:20,602 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 342 transitions. [2020-10-24 00:38:20,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:38:20,602 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 342 transitions. [2020-10-24 00:38:20,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2020-10-24 00:38:20,604 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:20,605 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:38:20,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-10-24 00:38:20,605 INFO L429 AbstractCegarLoop]: === Iteration 56 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:20,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:20,605 INFO L82 PathProgramCache]: Analyzing trace with hash -685351208, now seen corresponding path program 1 times [2020-10-24 00:38:20,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:20,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [402334489] [2020-10-24 00:38:20,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:20,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:20,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:38:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:20,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:38:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:20,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-10-24 00:38:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:20,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-10-24 00:38:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:20,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2020-10-24 00:38:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:20,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2020-10-24 00:38:20,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [402334489] [2020-10-24 00:38:20,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:20,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:38:20,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030029480] [2020-10-24 00:38:20,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:38:20,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:20,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:38:20,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:38:20,970 INFO L87 Difference]: Start difference. First operand 278 states and 342 transitions. Second operand 10 states. [2020-10-24 00:38:22,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:22,845 INFO L93 Difference]: Finished difference Result 338 states and 409 transitions. [2020-10-24 00:38:22,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:38:22,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 249 [2020-10-24 00:38:22,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:22,848 INFO L225 Difference]: With dead ends: 338 [2020-10-24 00:38:22,848 INFO L226 Difference]: Without dead ends: 325 [2020-10-24 00:38:22,848 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-24 00:38:22,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-10-24 00:38:23,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 317. [2020-10-24 00:38:23,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2020-10-24 00:38:23,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 388 transitions. [2020-10-24 00:38:23,017 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 388 transitions. Word has length 249 [2020-10-24 00:38:23,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:23,017 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 388 transitions. [2020-10-24 00:38:23,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:38:23,017 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 388 transitions. [2020-10-24 00:38:23,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2020-10-24 00:38:23,021 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:23,021 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:38:23,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2020-10-24 00:38:23,021 INFO L429 AbstractCegarLoop]: === Iteration 57 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:23,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:23,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1548901098, now seen corresponding path program 1 times [2020-10-24 00:38:23,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:23,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [7635901] [2020-10-24 00:38:23,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:23,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:23,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:38:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:23,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:38:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:23,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-10-24 00:38:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:23,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-10-24 00:38:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:23,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2020-10-24 00:38:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:23,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2020-10-24 00:38:23,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [7635901] [2020-10-24 00:38:23,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:23,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:38:23,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354602190] [2020-10-24 00:38:23,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:38:23,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:23,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:38:23,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:38:23,354 INFO L87 Difference]: Start difference. First operand 317 states and 388 transitions. Second operand 11 states. [2020-10-24 00:38:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:25,616 INFO L93 Difference]: Finished difference Result 330 states and 400 transitions. [2020-10-24 00:38:25,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:38:25,619 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 252 [2020-10-24 00:38:25,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:25,620 INFO L225 Difference]: With dead ends: 330 [2020-10-24 00:38:25,621 INFO L226 Difference]: Without dead ends: 303 [2020-10-24 00:38:25,621 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-10-24 00:38:25,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-10-24 00:38:25,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 274. [2020-10-24 00:38:25,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2020-10-24 00:38:25,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 311 transitions. [2020-10-24 00:38:25,716 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 311 transitions. Word has length 252 [2020-10-24 00:38:25,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:25,716 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 311 transitions. [2020-10-24 00:38:25,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:38:25,716 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 311 transitions. [2020-10-24 00:38:25,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2020-10-24 00:38:25,718 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:25,718 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:38:25,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2020-10-24 00:38:25,718 INFO L429 AbstractCegarLoop]: === Iteration 58 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:25,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:25,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1452667500, now seen corresponding path program 2 times [2020-10-24 00:38:25,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:25,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1289602813] [2020-10-24 00:38:25,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:25,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:25,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:38:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:25,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:38:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:26,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-10-24 00:38:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:26,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2020-10-24 00:38:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:26,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2020-10-24 00:38:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:26,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1420 trivial. 0 not checked. [2020-10-24 00:38:26,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1289602813] [2020-10-24 00:38:26,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:26,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:38:26,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139778640] [2020-10-24 00:38:26,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:38:26,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:26,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:38:26,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:38:26,125 INFO L87 Difference]: Start difference. First operand 274 states and 311 transitions. Second operand 11 states. [2020-10-24 00:38:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:27,816 INFO L93 Difference]: Finished difference Result 343 states and 388 transitions. [2020-10-24 00:38:27,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:38:27,817 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 253 [2020-10-24 00:38:27,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:27,819 INFO L225 Difference]: With dead ends: 343 [2020-10-24 00:38:27,819 INFO L226 Difference]: Without dead ends: 277 [2020-10-24 00:38:27,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2020-10-24 00:38:27,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-10-24 00:38:27,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2020-10-24 00:38:27,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2020-10-24 00:38:27,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 314 transitions. [2020-10-24 00:38:27,971 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 314 transitions. Word has length 253 [2020-10-24 00:38:27,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:27,971 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 314 transitions. [2020-10-24 00:38:27,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:38:27,972 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 314 transitions. [2020-10-24 00:38:27,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-10-24 00:38:27,973 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:27,973 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:38:27,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2020-10-24 00:38:27,973 INFO L429 AbstractCegarLoop]: === Iteration 59 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:27,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:27,974 INFO L82 PathProgramCache]: Analyzing trace with hash 61920203, now seen corresponding path program 1 times [2020-10-24 00:38:27,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:27,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [171875272] [2020-10-24 00:38:27,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:28,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:28,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:38:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:28,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:38:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:28,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-10-24 00:38:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:28,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-10-24 00:38:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:28,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2020-10-24 00:38:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:28,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2020-10-24 00:38:28,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [171875272] [2020-10-24 00:38:28,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:28,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 00:38:28,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277407426] [2020-10-24 00:38:28,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 00:38:28,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:28,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 00:38:28,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:38:28,693 INFO L87 Difference]: Start difference. First operand 277 states and 314 transitions. Second operand 15 states. [2020-10-24 00:38:30,969 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2020-10-24 00:38:31,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:31,805 INFO L93 Difference]: Finished difference Result 334 states and 376 transitions. [2020-10-24 00:38:31,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-24 00:38:31,806 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 254 [2020-10-24 00:38:31,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:31,808 INFO L225 Difference]: With dead ends: 334 [2020-10-24 00:38:31,808 INFO L226 Difference]: Without dead ends: 321 [2020-10-24 00:38:31,809 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2020-10-24 00:38:31,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2020-10-24 00:38:31,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 313. [2020-10-24 00:38:31,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2020-10-24 00:38:31,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 355 transitions. [2020-10-24 00:38:31,922 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 355 transitions. Word has length 254 [2020-10-24 00:38:31,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:31,923 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 355 transitions. [2020-10-24 00:38:31,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 00:38:31,923 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 355 transitions. [2020-10-24 00:38:31,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2020-10-24 00:38:31,924 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:31,924 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:38:31,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2020-10-24 00:38:31,925 INFO L429 AbstractCegarLoop]: === Iteration 60 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:31,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:31,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1684077380, now seen corresponding path program 1 times [2020-10-24 00:38:31,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:31,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1262747478] [2020-10-24 00:38:31,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:32,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:32,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:38:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:32,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:38:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:32,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-10-24 00:38:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:32,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-10-24 00:38:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:32,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2020-10-24 00:38:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1433 trivial. 0 not checked. [2020-10-24 00:38:32,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1262747478] [2020-10-24 00:38:32,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:32,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 00:38:32,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699516642] [2020-10-24 00:38:32,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 00:38:32,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:32,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 00:38:32,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:38:32,749 INFO L87 Difference]: Start difference. First operand 313 states and 355 transitions. Second operand 12 states. [2020-10-24 00:38:35,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:35,308 INFO L93 Difference]: Finished difference Result 326 states and 367 transitions. [2020-10-24 00:38:35,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 00:38:35,308 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 255 [2020-10-24 00:38:35,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:35,310 INFO L225 Difference]: With dead ends: 326 [2020-10-24 00:38:35,310 INFO L226 Difference]: Without dead ends: 284 [2020-10-24 00:38:35,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-10-24 00:38:35,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-10-24 00:38:35,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 277. [2020-10-24 00:38:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2020-10-24 00:38:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 313 transitions. [2020-10-24 00:38:35,421 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 313 transitions. Word has length 255 [2020-10-24 00:38:35,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:35,422 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 313 transitions. [2020-10-24 00:38:35,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 00:38:35,422 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 313 transitions. [2020-10-24 00:38:35,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2020-10-24 00:38:35,424 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:35,424 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:38:35,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2020-10-24 00:38:35,424 INFO L429 AbstractCegarLoop]: === Iteration 61 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:35,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:35,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1598956265, now seen corresponding path program 1 times [2020-10-24 00:38:35,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:35,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1602845394] [2020-10-24 00:38:35,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:35,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:35,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:38:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:35,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:38:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:35,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-10-24 00:38:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:35,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-10-24 00:38:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:35,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2020-10-24 00:38:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:36,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2020-10-24 00:38:36,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1602845394] [2020-10-24 00:38:36,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:36,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 00:38:36,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874137197] [2020-10-24 00:38:36,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 00:38:36,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:36,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 00:38:36,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:38:36,268 INFO L87 Difference]: Start difference. First operand 277 states and 313 transitions. Second operand 13 states. [2020-10-24 00:38:38,620 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2020-10-24 00:38:38,865 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2020-10-24 00:38:39,106 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-10-24 00:38:39,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:39,532 INFO L93 Difference]: Finished difference Result 277 states and 313 transitions. [2020-10-24 00:38:39,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 00:38:39,536 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 257 [2020-10-24 00:38:39,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:39,537 INFO L225 Difference]: With dead ends: 277 [2020-10-24 00:38:39,537 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 00:38:39,538 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2020-10-24 00:38:39,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 00:38:39,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 00:38:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 00:38:39,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 00:38:39,539 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 257 [2020-10-24 00:38:39,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:39,540 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 00:38:39,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 00:38:39,540 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 00:38:39,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 00:38:39,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2020-10-24 00:38:39,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 00:38:39,955 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 35 [2020-10-24 00:38:40,100 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 35 [2020-10-24 00:38:40,265 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 35 [2020-10-24 00:38:40,665 WARN L193 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 81 [2020-10-24 00:38:41,060 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 82 [2020-10-24 00:38:41,661 WARN L193 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 35 [2020-10-24 00:38:41,941 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 35 [2020-10-24 00:38:42,691 WARN L193 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 35 [2020-10-24 00:38:42,950 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 35 [2020-10-24 00:38:43,359 WARN L193 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 35 [2020-10-24 00:38:43,725 WARN L193 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 35 [2020-10-24 00:38:43,900 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 82 [2020-10-24 00:38:44,179 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 35 [2020-10-24 00:38:44,352 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 82 [2020-10-24 00:38:44,540 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 82 [2020-10-24 00:38:44,837 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 35 [2020-10-24 00:38:44,942 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 35 [2020-10-24 00:38:45,292 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 35 [2020-10-24 00:38:45,582 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 35 [2020-10-24 00:38:45,824 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 35 [2020-10-24 00:38:46,646 WARN L193 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 44 [2020-10-24 00:38:47,656 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 263 DAG size of output: 44 [2020-10-24 00:38:57,624 WARN L193 SmtUtils]: Spent 9.96 s on a formula simplification. DAG size of input: 598 DAG size of output: 42 [2020-10-24 00:39:01,482 WARN L193 SmtUtils]: Spent 3.85 s on a formula simplification. DAG size of input: 442 DAG size of output: 42 [2020-10-24 00:39:08,856 WARN L193 SmtUtils]: Spent 7.37 s on a formula simplification. DAG size of input: 544 DAG size of output: 42 [2020-10-24 00:40:15,252 WARN L193 SmtUtils]: Spent 1.11 m on a formula simplification. DAG size of input: 1646 DAG size of output: 1074 [2020-10-24 00:40:15,697 WARN L193 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 44 [2020-10-24 00:40:52,998 WARN L193 SmtUtils]: Spent 37.30 s on a formula simplification. DAG size of input: 1313 DAG size of output: 728 [2020-10-24 00:42:36,933 WARN L193 SmtUtils]: Spent 1.73 m on a formula simplification. DAG size of input: 1315 DAG size of output: 49 [2020-10-24 00:43:00,783 WARN L193 SmtUtils]: Spent 23.85 s on a formula simplification. DAG size of input: 771 DAG size of output: 45 [2020-10-24 00:43:00,919 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 44 [2020-10-24 00:43:02,842 WARN L193 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 348 DAG size of output: 42 [2020-10-24 00:43:04,237 WARN L193 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 305 DAG size of output: 44 [2020-10-24 00:44:29,935 WARN L193 SmtUtils]: Spent 1.43 m on a formula simplification. DAG size of input: 1247 DAG size of output: 44 [2020-10-24 00:45:05,102 WARN L193 SmtUtils]: Spent 35.16 s on a formula simplification. DAG size of input: 897 DAG size of output: 45 [2020-10-24 00:46:08,296 WARN L193 SmtUtils]: Spent 1.05 m on a formula simplification. DAG size of input: 1101 DAG size of output: 45 [2020-10-24 00:48:11,384 WARN L193 SmtUtils]: Spent 2.05 m on a formula simplification. DAG size of input: 1288 DAG size of output: 44