/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_5a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 04:47:44,927 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 04:47:44,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 04:47:44,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 04:47:44,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 04:47:44,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 04:47:44,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 04:47:44,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 04:47:44,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 04:47:44,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 04:47:44,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 04:47:44,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 04:47:44,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 04:47:44,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 04:47:44,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 04:47:44,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 04:47:44,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 04:47:44,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 04:47:44,991 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 04:47:44,993 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 04:47:44,995 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 04:47:44,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 04:47:44,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 04:47:44,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 04:47:45,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 04:47:45,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 04:47:45,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 04:47:45,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 04:47:45,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 04:47:45,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 04:47:45,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 04:47:45,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 04:47:45,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 04:47:45,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 04:47:45,011 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 04:47:45,025 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 04:47:45,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 04:47:45,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 04:47:45,027 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 04:47:45,028 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 04:47:45,029 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 04:47:45,030 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 04:47:45,043 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 04:47:45,043 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 04:47:45,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 04:47:45,045 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 04:47:45,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 04:47:45,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 04:47:45,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 04:47:45,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 04:47:45,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 04:47:45,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 04:47:45,047 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 04:47:45,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 04:47:45,047 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 04:47:45,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 04:47:45,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 04:47:45,048 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 04:47:45,048 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 04:47:45,049 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 04:47:45,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 04:47:45,049 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 04:47:45,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 04:47:45,050 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 04:47:45,050 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-11-07 04:47:45,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 04:47:45,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 04:47:45,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 04:47:45,444 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 04:47:45,444 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 04:47:45,445 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_5a.c.cil.c [2020-11-07 04:47:45,544 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4919adf6/c7e00012523844c7b94213e193306b41/FLAG2ed8d39d9 [2020-11-07 04:47:46,202 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 04:47:46,202 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_5a.c.cil.c [2020-11-07 04:47:46,212 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4919adf6/c7e00012523844c7b94213e193306b41/FLAG2ed8d39d9 [2020-11-07 04:47:46,586 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4919adf6/c7e00012523844c7b94213e193306b41 [2020-11-07 04:47:46,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 04:47:46,600 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 04:47:46,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 04:47:46,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 04:47:46,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 04:47:46,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:47:46" (1/1) ... [2020-11-07 04:47:46,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2abacc19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:46, skipping insertion in model container [2020-11-07 04:47:46,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:47:46" (1/1) ... [2020-11-07 04:47:46,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 04:47:46,676 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 04:47:46,913 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 04:47:46,928 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 04:47:47,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 04:47:47,055 INFO L208 MainTranslator]: Completed translation [2020-11-07 04:47:47,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:47 WrapperNode [2020-11-07 04:47:47,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 04:47:47,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 04:47:47,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 04:47:47,057 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 04:47:47,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:47" (1/1) ... [2020-11-07 04:47:47,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:47" (1/1) ... [2020-11-07 04:47:47,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:47" (1/1) ... [2020-11-07 04:47:47,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:47" (1/1) ... [2020-11-07 04:47:47,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:47" (1/1) ... [2020-11-07 04:47:47,101 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:47" (1/1) ... [2020-11-07 04:47:47,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:47" (1/1) ... [2020-11-07 04:47:47,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 04:47:47,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 04:47:47,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 04:47:47,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 04:47:47,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 04:47:47,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 04:47:47,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 04:47:47,201 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 04:47:47,201 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-07 04:47:47,202 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2020-11-07 04:47:47,202 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2020-11-07 04:47:47,202 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2020-11-07 04:47:47,202 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 04:47:47,202 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 04:47:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 04:47:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 04:47:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 04:47:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-11-07 04:47:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-11-07 04:47:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-07 04:47:47,204 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2020-11-07 04:47:47,204 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2020-11-07 04:47:47,204 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2020-11-07 04:47:47,204 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 04:47:47,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 04:47:47,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 04:47:47,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 04:47:47,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 04:47:47,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 04:47:47,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 04:47:48,009 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 04:47:48,009 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-11-07 04:47:48,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:47:48 BoogieIcfgContainer [2020-11-07 04:47:48,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 04:47:48,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 04:47:48,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 04:47:48,019 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 04:47:48,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:47:46" (1/3) ... [2020-11-07 04:47:48,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2557e546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:47:48, skipping insertion in model container [2020-11-07 04:47:48,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:47" (2/3) ... [2020-11-07 04:47:48,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2557e546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:47:48, skipping insertion in model container [2020-11-07 04:47:48,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:47:48" (3/3) ... [2020-11-07 04:47:48,023 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_5a.c.cil.c [2020-11-07 04:47:48,042 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 04:47:48,047 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 04:47:48,072 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 04:47:48,123 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 04:47:48,128 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 04:47:48,128 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 04:47:48,129 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 04:47:48,129 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 04:47:48,129 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 04:47:48,129 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 04:47:48,129 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 04:47:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2020-11-07 04:47:48,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-11-07 04:47:48,197 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:48,198 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-11-07 04:47:48,199 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:48,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:48,211 INFO L82 PathProgramCache]: Analyzing trace with hash -415784909, now seen corresponding path program 1 times [2020-11-07 04:47:48,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:48,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1613562229] [2020-11-07 04:47:48,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:48,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:48,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:48,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:48,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 04:47:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:48,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-11-07 04:47:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:48,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 04:47:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2020-11-07 04:47:48,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1613562229] [2020-11-07 04:47:48,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:47:48,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 04:47:48,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714788201] [2020-11-07 04:47:48,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 04:47:48,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:48,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 04:47:48,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 04:47:48,672 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 4 states. [2020-11-07 04:47:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:47:49,456 INFO L93 Difference]: Finished difference Result 266 states and 323 transitions. [2020-11-07 04:47:49,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 04:47:49,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2020-11-07 04:47:49,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:47:49,471 INFO L225 Difference]: With dead ends: 266 [2020-11-07 04:47:49,471 INFO L226 Difference]: Without dead ends: 135 [2020-11-07 04:47:49,477 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-11-07 04:47:49,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-11-07 04:47:49,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2020-11-07 04:47:49,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-11-07 04:47:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 153 transitions. [2020-11-07 04:47:49,558 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 153 transitions. Word has length 109 [2020-11-07 04:47:49,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:47:49,560 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 153 transitions. [2020-11-07 04:47:49,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 04:47:49,560 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 153 transitions. [2020-11-07 04:47:49,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-11-07 04:47:49,565 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:49,565 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-11-07 04:47:49,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 04:47:49,566 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:49,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:49,570 INFO L82 PathProgramCache]: Analyzing trace with hash -2075471796, now seen corresponding path program 1 times [2020-11-07 04:47:49,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:49,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1782377925] [2020-11-07 04:47:49,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:49,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:49,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:49,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:49,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 04:47:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:49,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-11-07 04:47:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:49,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-11-07 04:47:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:49,818 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2020-11-07 04:47:49,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1782377925] [2020-11-07 04:47:49,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:47:49,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-07 04:47:49,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066785767] [2020-11-07 04:47:49,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 04:47:49,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:49,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 04:47:49,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 04:47:49,823 INFO L87 Difference]: Start difference. First operand 135 states and 153 transitions. Second operand 5 states. [2020-11-07 04:47:50,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:47:50,530 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2020-11-07 04:47:50,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 04:47:50,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2020-11-07 04:47:50,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:47:50,534 INFO L225 Difference]: With dead ends: 152 [2020-11-07 04:47:50,534 INFO L226 Difference]: Without dead ends: 134 [2020-11-07 04:47:50,535 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-11-07 04:47:50,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-11-07 04:47:50,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2020-11-07 04:47:50,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-11-07 04:47:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 151 transitions. [2020-11-07 04:47:50,563 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 151 transitions. Word has length 111 [2020-11-07 04:47:50,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:47:50,564 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 151 transitions. [2020-11-07 04:47:50,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 04:47:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 151 transitions. [2020-11-07 04:47:50,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-11-07 04:47:50,566 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:50,566 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-11-07 04:47:50,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 04:47:50,567 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:50,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:50,568 INFO L82 PathProgramCache]: Analyzing trace with hash 37781676, now seen corresponding path program 1 times [2020-11-07 04:47:50,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:50,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1132124429] [2020-11-07 04:47:50,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:50,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:50,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:50,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:50,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 04:47:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:50,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-11-07 04:47:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:50,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-11-07 04:47:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:50,809 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:47:50,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1132124429] [2020-11-07 04:47:50,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:47:50,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-11-07 04:47:50,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497703192] [2020-11-07 04:47:50,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 04:47:50,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:50,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 04:47:50,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 04:47:50,812 INFO L87 Difference]: Start difference. First operand 134 states and 151 transitions. Second operand 5 states. [2020-11-07 04:47:51,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:47:51,480 INFO L93 Difference]: Finished difference Result 273 states and 320 transitions. [2020-11-07 04:47:51,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 04:47:51,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2020-11-07 04:47:51,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:47:51,485 INFO L225 Difference]: With dead ends: 273 [2020-11-07 04:47:51,485 INFO L226 Difference]: Without dead ends: 175 [2020-11-07 04:47:51,487 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-07 04:47:51,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-11-07 04:47:51,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 152. [2020-11-07 04:47:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-11-07 04:47:51,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 174 transitions. [2020-11-07 04:47:51,536 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 174 transitions. Word has length 111 [2020-11-07 04:47:51,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:47:51,537 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 174 transitions. [2020-11-07 04:47:51,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 04:47:51,539 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 174 transitions. [2020-11-07 04:47:51,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-11-07 04:47:51,541 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:51,542 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-11-07 04:47:51,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 04:47:51,545 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:51,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:51,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1061811624, now seen corresponding path program 1 times [2020-11-07 04:47:51,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:51,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1465408680] [2020-11-07 04:47:51,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:51,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:51,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:51,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:51,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-11-07 04:47:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:51,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-07 04:47:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:51,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-11-07 04:47:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:51,764 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:47:51,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1465408680] [2020-11-07 04:47:51,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:47:51,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-11-07 04:47:51,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70955112] [2020-11-07 04:47:51,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 04:47:51,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:51,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 04:47:51,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 04:47:51,769 INFO L87 Difference]: Start difference. First operand 152 states and 174 transitions. Second operand 5 states. [2020-11-07 04:47:52,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:47:52,468 INFO L93 Difference]: Finished difference Result 284 states and 333 transitions. [2020-11-07 04:47:52,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 04:47:52,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2020-11-07 04:47:52,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:47:52,472 INFO L225 Difference]: With dead ends: 284 [2020-11-07 04:47:52,472 INFO L226 Difference]: Without dead ends: 176 [2020-11-07 04:47:52,474 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 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-11-07 04:47:52,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-11-07 04:47:52,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-11-07 04:47:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-11-07 04:47:52,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 190 transitions. [2020-11-07 04:47:52,511 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 190 transitions. Word has length 114 [2020-11-07 04:47:52,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:47:52,512 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 190 transitions. [2020-11-07 04:47:52,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 04:47:52,512 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 190 transitions. [2020-11-07 04:47:52,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-11-07 04:47:52,514 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:52,514 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-11-07 04:47:52,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 04:47:52,514 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:52,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:52,515 INFO L82 PathProgramCache]: Analyzing trace with hash -503903925, now seen corresponding path program 1 times [2020-11-07 04:47:52,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:52,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1967447087] [2020-11-07 04:47:52,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:52,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:52,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:52,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:52,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 04:47:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:52,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-11-07 04:47:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:52,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 04:47:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:52,747 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:47:52,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1967447087] [2020-11-07 04:47:52,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:47:52,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-07 04:47:52,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907359135] [2020-11-07 04:47:52,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 04:47:52,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:52,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 04:47:52,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-07 04:47:52,750 INFO L87 Difference]: Start difference. First operand 164 states and 190 transitions. Second operand 6 states. [2020-11-07 04:47:53,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:47:53,480 INFO L93 Difference]: Finished difference Result 320 states and 377 transitions. [2020-11-07 04:47:53,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 04:47:53,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2020-11-07 04:47:53,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:47:53,483 INFO L225 Difference]: With dead ends: 320 [2020-11-07 04:47:53,483 INFO L226 Difference]: Without dead ends: 199 [2020-11-07 04:47:53,484 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-11-07 04:47:53,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-11-07 04:47:53,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 180. [2020-11-07 04:47:53,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-11-07 04:47:53,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 209 transitions. [2020-11-07 04:47:53,526 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 209 transitions. Word has length 119 [2020-11-07 04:47:53,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:47:53,527 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 209 transitions. [2020-11-07 04:47:53,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 04:47:53,527 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 209 transitions. [2020-11-07 04:47:53,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-11-07 04:47:53,529 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:53,529 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-11-07 04:47:53,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 04:47:53,529 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:53,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:53,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1598599897, now seen corresponding path program 1 times [2020-11-07 04:47:53,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:53,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2101122888] [2020-11-07 04:47:53,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:53,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:53,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:53,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:53,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 04:47:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:53,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-11-07 04:47:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:53,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 04:47:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:47:53,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2101122888] [2020-11-07 04:47:53,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:47:53,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-07 04:47:53,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027425178] [2020-11-07 04:47:53,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 04:47:53,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:53,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 04:47:53,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-07 04:47:53,713 INFO L87 Difference]: Start difference. First operand 180 states and 209 transitions. Second operand 6 states. [2020-11-07 04:47:54,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:47:54,402 INFO L93 Difference]: Finished difference Result 320 states and 377 transitions. [2020-11-07 04:47:54,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 04:47:54,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2020-11-07 04:47:54,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:47:54,405 INFO L225 Difference]: With dead ends: 320 [2020-11-07 04:47:54,405 INFO L226 Difference]: Without dead ends: 201 [2020-11-07 04:47:54,406 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-11-07 04:47:54,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-11-07 04:47:54,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 183. [2020-11-07 04:47:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-11-07 04:47:54,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 212 transitions. [2020-11-07 04:47:54,447 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 212 transitions. Word has length 119 [2020-11-07 04:47:54,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:47:54,447 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 212 transitions. [2020-11-07 04:47:54,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 04:47:54,448 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 212 transitions. [2020-11-07 04:47:54,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-11-07 04:47:54,450 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:54,450 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-11-07 04:47:54,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 04:47:54,450 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:54,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:54,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1705231240, now seen corresponding path program 2 times [2020-11-07 04:47:54,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:54,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1809424217] [2020-11-07 04:47:54,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:54,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:54,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:54,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:54,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 04:47:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:54,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:47:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:54,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 04:47:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:47:54,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1809424217] [2020-11-07 04:47:54,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:47:54,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 04:47:54,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228456607] [2020-11-07 04:47:54,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 04:47:54,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:54,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 04:47:54,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-07 04:47:54,679 INFO L87 Difference]: Start difference. First operand 183 states and 212 transitions. Second operand 7 states. [2020-11-07 04:47:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:47:55,358 INFO L93 Difference]: Finished difference Result 354 states and 418 transitions. [2020-11-07 04:47:55,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 04:47:55,362 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2020-11-07 04:47:55,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:47:55,365 INFO L225 Difference]: With dead ends: 354 [2020-11-07 04:47:55,365 INFO L226 Difference]: Without dead ends: 225 [2020-11-07 04:47:55,366 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-11-07 04:47:55,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-11-07 04:47:55,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 193. [2020-11-07 04:47:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-11-07 04:47:55,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 225 transitions. [2020-11-07 04:47:55,413 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 225 transitions. Word has length 124 [2020-11-07 04:47:55,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:47:55,413 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 225 transitions. [2020-11-07 04:47:55,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 04:47:55,413 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 225 transitions. [2020-11-07 04:47:55,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-11-07 04:47:55,419 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:55,419 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-11-07 04:47:55,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 04:47:55,420 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:55,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:55,421 INFO L82 PathProgramCache]: Analyzing trace with hash -487232234, now seen corresponding path program 1 times [2020-11-07 04:47:55,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:55,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1976820430] [2020-11-07 04:47:55,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:55,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:55,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:55,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:55,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 04:47:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:55,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:47:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:55,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 04:47:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:47:55,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1976820430] [2020-11-07 04:47:55,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:47:55,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 04:47:55,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070982094] [2020-11-07 04:47:55,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 04:47:55,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:55,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 04:47:55,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-07 04:47:55,673 INFO L87 Difference]: Start difference. First operand 193 states and 225 transitions. Second operand 7 states. [2020-11-07 04:47:56,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:47:56,573 INFO L93 Difference]: Finished difference Result 348 states and 412 transitions. [2020-11-07 04:47:56,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 04:47:56,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2020-11-07 04:47:56,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:47:56,576 INFO L225 Difference]: With dead ends: 348 [2020-11-07 04:47:56,576 INFO L226 Difference]: Without dead ends: 221 [2020-11-07 04:47:56,577 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-11-07 04:47:56,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-11-07 04:47:56,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 193. [2020-11-07 04:47:56,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-11-07 04:47:56,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 225 transitions. [2020-11-07 04:47:56,624 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 225 transitions. Word has length 124 [2020-11-07 04:47:56,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:47:56,624 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 225 transitions. [2020-11-07 04:47:56,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 04:47:56,625 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 225 transitions. [2020-11-07 04:47:56,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-11-07 04:47:56,627 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:56,627 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-11-07 04:47:56,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 04:47:56,627 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:56,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:56,628 INFO L82 PathProgramCache]: Analyzing trace with hash 452126571, now seen corresponding path program 3 times [2020-11-07 04:47:56,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:56,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [455921966] [2020-11-07 04:47:56,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:56,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:56,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:56,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:56,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-11-07 04:47:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:56,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-11-07 04:47:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:56,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-11-07 04:47:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:56,799 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:47:56,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [455921966] [2020-11-07 04:47:56,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:47:56,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 04:47:56,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061271972] [2020-11-07 04:47:56,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 04:47:56,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:56,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 04:47:56,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-07 04:47:56,802 INFO L87 Difference]: Start difference. First operand 193 states and 225 transitions. Second operand 8 states. [2020-11-07 04:47:57,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:47:57,796 INFO L93 Difference]: Finished difference Result 381 states and 451 transitions. [2020-11-07 04:47:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 04:47:57,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 129 [2020-11-07 04:47:57,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:47:57,799 INFO L225 Difference]: With dead ends: 381 [2020-11-07 04:47:57,799 INFO L226 Difference]: Without dead ends: 247 [2020-11-07 04:47:57,800 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2020-11-07 04:47:57,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2020-11-07 04:47:57,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 203. [2020-11-07 04:47:57,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-11-07 04:47:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 238 transitions. [2020-11-07 04:47:57,842 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 238 transitions. Word has length 129 [2020-11-07 04:47:57,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:47:57,842 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 238 transitions. [2020-11-07 04:47:57,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 04:47:57,842 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 238 transitions. [2020-11-07 04:47:57,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-11-07 04:47:57,844 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:57,844 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-11-07 04:47:57,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 04:47:57,845 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:57,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:57,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1740336903, now seen corresponding path program 2 times [2020-11-07 04:47:57,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:57,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2047519426] [2020-11-07 04:47:57,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:57,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:57,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:57,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:58,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-11-07 04:47:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:58,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-11-07 04:47:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:58,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-11-07 04:47:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:47:58,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2047519426] [2020-11-07 04:47:58,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:47:58,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 04:47:58,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937455639] [2020-11-07 04:47:58,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 04:47:58,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:58,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 04:47:58,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-07 04:47:58,051 INFO L87 Difference]: Start difference. First operand 203 states and 238 transitions. Second operand 8 states. [2020-11-07 04:47:58,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:47:58,949 INFO L93 Difference]: Finished difference Result 367 states and 437 transitions. [2020-11-07 04:47:58,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 04:47:58,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 129 [2020-11-07 04:47:58,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:47:58,952 INFO L225 Difference]: With dead ends: 367 [2020-11-07 04:47:58,952 INFO L226 Difference]: Without dead ends: 235 [2020-11-07 04:47:58,953 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-11-07 04:47:58,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-11-07 04:47:58,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 203. [2020-11-07 04:47:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-11-07 04:47:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 238 transitions. [2020-11-07 04:47:58,991 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 238 transitions. Word has length 129 [2020-11-07 04:47:58,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:47:58,992 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 238 transitions. [2020-11-07 04:47:58,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 04:47:58,992 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 238 transitions. [2020-11-07 04:47:58,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-07 04:47:58,994 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:58,994 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-11-07 04:47:58,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 04:47:58,995 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:58,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:58,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1677870744, now seen corresponding path program 4 times [2020-11-07 04:47:58,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:58,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [652180017] [2020-11-07 04:47:58,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:59,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:59,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:59,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:59,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 04:47:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:59,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 04:47:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:59,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-11-07 04:47:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:59,238 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:47:59,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [652180017] [2020-11-07 04:47:59,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:47:59,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 04:47:59,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771236033] [2020-11-07 04:47:59,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 04:47:59,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:59,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 04:47:59,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-07 04:47:59,240 INFO L87 Difference]: Start difference. First operand 203 states and 238 transitions. Second operand 9 states. [2020-11-07 04:48:00,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:00,398 INFO L93 Difference]: Finished difference Result 408 states and 484 transitions. [2020-11-07 04:48:00,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 04:48:00,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2020-11-07 04:48:00,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:00,402 INFO L225 Difference]: With dead ends: 408 [2020-11-07 04:48:00,402 INFO L226 Difference]: Without dead ends: 269 [2020-11-07 04:48:00,403 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-11-07 04:48:00,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-11-07 04:48:00,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 213. [2020-11-07 04:48:00,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-11-07 04:48:00,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 251 transitions. [2020-11-07 04:48:00,455 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 251 transitions. Word has length 134 [2020-11-07 04:48:00,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:00,456 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 251 transitions. [2020-11-07 04:48:00,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 04:48:00,456 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 251 transitions. [2020-11-07 04:48:00,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-07 04:48:00,458 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:00,458 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-11-07 04:48:00,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 04:48:00,459 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:00,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:00,460 INFO L82 PathProgramCache]: Analyzing trace with hash 424633078, now seen corresponding path program 3 times [2020-11-07 04:48:00,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:00,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [306820892] [2020-11-07 04:48:00,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:00,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:00,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:00,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:00,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 04:48:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:00,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 04:48:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:00,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-11-07 04:48:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:00,674 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 44 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:48:00,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [306820892] [2020-11-07 04:48:00,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:00,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 04:48:00,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61882803] [2020-11-07 04:48:00,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 04:48:00,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:00,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 04:48:00,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 04:48:00,676 INFO L87 Difference]: Start difference. First operand 213 states and 251 transitions. Second operand 9 states. [2020-11-07 04:48:01,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:01,820 INFO L93 Difference]: Finished difference Result 386 states and 462 transitions. [2020-11-07 04:48:01,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 04:48:01,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2020-11-07 04:48:01,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:01,823 INFO L225 Difference]: With dead ends: 386 [2020-11-07 04:48:01,823 INFO L226 Difference]: Without dead ends: 249 [2020-11-07 04:48:01,825 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-11-07 04:48:01,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-11-07 04:48:01,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 213. [2020-11-07 04:48:01,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-11-07 04:48:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 251 transitions. [2020-11-07 04:48:01,868 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 251 transitions. Word has length 134 [2020-11-07 04:48:01,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:01,868 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 251 transitions. [2020-11-07 04:48:01,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 04:48:01,868 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 251 transitions. [2020-11-07 04:48:01,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-11-07 04:48:01,870 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:01,871 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-11-07 04:48:01,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 04:48:01,871 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:01,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:01,872 INFO L82 PathProgramCache]: Analyzing trace with hash -2050515573, now seen corresponding path program 5 times [2020-11-07 04:48:01,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:01,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1913129319] [2020-11-07 04:48:01,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:01,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:01,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:01,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:02,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-11-07 04:48:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:02,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-11-07 04:48:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:02,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-11-07 04:48:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:02,074 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:48:02,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1913129319] [2020-11-07 04:48:02,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:02,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 04:48:02,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657528359] [2020-11-07 04:48:02,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 04:48:02,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:02,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 04:48:02,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-11-07 04:48:02,077 INFO L87 Difference]: Start difference. First operand 213 states and 251 transitions. Second operand 10 states. [2020-11-07 04:48:03,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:03,356 INFO L93 Difference]: Finished difference Result 435 states and 517 transitions. [2020-11-07 04:48:03,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 04:48:03,357 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 139 [2020-11-07 04:48:03,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:03,360 INFO L225 Difference]: With dead ends: 435 [2020-11-07 04:48:03,360 INFO L226 Difference]: Without dead ends: 291 [2020-11-07 04:48:03,361 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-11-07 04:48:03,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-11-07 04:48:03,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 223. [2020-11-07 04:48:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-11-07 04:48:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 264 transitions. [2020-11-07 04:48:03,405 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 264 transitions. Word has length 139 [2020-11-07 04:48:03,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:03,405 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 264 transitions. [2020-11-07 04:48:03,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 04:48:03,405 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 264 transitions. [2020-11-07 04:48:03,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-11-07 04:48:03,407 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:03,407 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-11-07 04:48:03,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 04:48:03,408 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:03,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:03,408 INFO L82 PathProgramCache]: Analyzing trace with hash 51988249, now seen corresponding path program 4 times [2020-11-07 04:48:03,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:03,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [818428260] [2020-11-07 04:48:03,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:03,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:03,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:03,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:03,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-11-07 04:48:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:03,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-11-07 04:48:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:03,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-11-07 04:48:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:03,659 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:48:03,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [818428260] [2020-11-07 04:48:03,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:03,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 04:48:03,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667007807] [2020-11-07 04:48:03,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 04:48:03,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:03,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 04:48:03,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 04:48:03,661 INFO L87 Difference]: Start difference. First operand 223 states and 264 transitions. Second operand 10 states. [2020-11-07 04:48:05,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:05,078 INFO L93 Difference]: Finished difference Result 405 states and 487 transitions. [2020-11-07 04:48:05,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 04:48:05,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 139 [2020-11-07 04:48:05,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:05,082 INFO L225 Difference]: With dead ends: 405 [2020-11-07 04:48:05,082 INFO L226 Difference]: Without dead ends: 263 [2020-11-07 04:48:05,084 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-11-07 04:48:05,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2020-11-07 04:48:05,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 223. [2020-11-07 04:48:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-11-07 04:48:05,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 264 transitions. [2020-11-07 04:48:05,131 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 264 transitions. Word has length 139 [2020-11-07 04:48:05,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:05,131 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 264 transitions. [2020-11-07 04:48:05,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 04:48:05,131 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 264 transitions. [2020-11-07 04:48:05,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-11-07 04:48:05,134 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:05,134 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-11-07 04:48:05,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 04:48:05,134 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:05,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:05,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1639590072, now seen corresponding path program 6 times [2020-11-07 04:48:05,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:05,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1731104151] [2020-11-07 04:48:05,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:05,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:05,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:05,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:05,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-11-07 04:48:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:05,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 04:48:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:05,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-11-07 04:48:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 6 proven. 99 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:48:05,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1731104151] [2020-11-07 04:48:05,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:05,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 04:48:05,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501523861] [2020-11-07 04:48:05,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 04:48:05,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:05,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 04:48:05,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2020-11-07 04:48:05,393 INFO L87 Difference]: Start difference. First operand 223 states and 264 transitions. Second operand 11 states. [2020-11-07 04:48:06,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:06,736 INFO L93 Difference]: Finished difference Result 462 states and 550 transitions. [2020-11-07 04:48:06,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 04:48:06,737 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 144 [2020-11-07 04:48:06,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:06,740 INFO L225 Difference]: With dead ends: 462 [2020-11-07 04:48:06,740 INFO L226 Difference]: Without dead ends: 313 [2020-11-07 04:48:06,741 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-11-07 04:48:06,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-11-07 04:48:06,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 233. [2020-11-07 04:48:06,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-11-07 04:48:06,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 277 transitions. [2020-11-07 04:48:06,788 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 277 transitions. Word has length 144 [2020-11-07 04:48:06,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:06,789 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 277 transitions. [2020-11-07 04:48:06,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 04:48:06,789 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 277 transitions. [2020-11-07 04:48:06,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-11-07 04:48:06,791 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:06,791 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-11-07 04:48:06,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 04:48:06,791 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:06,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:06,792 INFO L82 PathProgramCache]: Analyzing trace with hash 462913750, now seen corresponding path program 5 times [2020-11-07 04:48:06,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:06,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [255531136] [2020-11-07 04:48:06,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:06,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:06,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:06,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:07,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-11-07 04:48:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:07,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 04:48:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:07,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-11-07 04:48:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:07,073 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 7 proven. 89 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:48:07,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [255531136] [2020-11-07 04:48:07,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:07,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 04:48:07,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998094803] [2020-11-07 04:48:07,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 04:48:07,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:07,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 04:48:07,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-11-07 04:48:07,076 INFO L87 Difference]: Start difference. First operand 233 states and 277 transitions. Second operand 11 states. [2020-11-07 04:48:08,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:08,760 INFO L93 Difference]: Finished difference Result 424 states and 512 transitions. [2020-11-07 04:48:08,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 04:48:08,762 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 144 [2020-11-07 04:48:08,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:08,765 INFO L225 Difference]: With dead ends: 424 [2020-11-07 04:48:08,765 INFO L226 Difference]: Without dead ends: 277 [2020-11-07 04:48:08,766 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-11-07 04:48:08,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-11-07 04:48:08,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 233. [2020-11-07 04:48:08,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-11-07 04:48:08,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 277 transitions. [2020-11-07 04:48:08,814 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 277 transitions. Word has length 144 [2020-11-07 04:48:08,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:08,815 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 277 transitions. [2020-11-07 04:48:08,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 04:48:08,815 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 277 transitions. [2020-11-07 04:48:08,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-11-07 04:48:08,817 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:08,818 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-11-07 04:48:08,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 04:48:08,818 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:08,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:08,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1421399125, now seen corresponding path program 7 times [2020-11-07 04:48:08,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:08,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1163599673] [2020-11-07 04:48:08,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:08,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:08,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:08,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:09,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-07 04:48:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:09,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-07 04:48:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:09,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-11-07 04:48:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 6 proven. 131 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:48:09,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1163599673] [2020-11-07 04:48:09,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:09,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 04:48:09,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252984857] [2020-11-07 04:48:09,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 04:48:09,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:09,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 04:48:09,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2020-11-07 04:48:09,079 INFO L87 Difference]: Start difference. First operand 233 states and 277 transitions. Second operand 12 states. [2020-11-07 04:48:10,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:10,528 INFO L93 Difference]: Finished difference Result 489 states and 583 transitions. [2020-11-07 04:48:10,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 04:48:10,529 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 149 [2020-11-07 04:48:10,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:10,532 INFO L225 Difference]: With dead ends: 489 [2020-11-07 04:48:10,532 INFO L226 Difference]: Without dead ends: 335 [2020-11-07 04:48:10,533 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-11-07 04:48:10,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-11-07 04:48:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 243. [2020-11-07 04:48:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-11-07 04:48:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 290 transitions. [2020-11-07 04:48:10,585 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 290 transitions. Word has length 149 [2020-11-07 04:48:10,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:10,585 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 290 transitions. [2020-11-07 04:48:10,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 04:48:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 290 transitions. [2020-11-07 04:48:10,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-11-07 04:48:10,587 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:10,587 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-11-07 04:48:10,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 04:48:10,588 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:10,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:10,588 INFO L82 PathProgramCache]: Analyzing trace with hash 681104697, now seen corresponding path program 6 times [2020-11-07 04:48:10,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:10,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [381939947] [2020-11-07 04:48:10,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:10,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:10,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:10,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:10,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-07 04:48:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:10,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-07 04:48:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:10,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-11-07 04:48:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:10,890 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 119 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:48:10,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [381939947] [2020-11-07 04:48:10,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:10,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 04:48:10,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874610100] [2020-11-07 04:48:10,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 04:48:10,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:10,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 04:48:10,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-11-07 04:48:10,893 INFO L87 Difference]: Start difference. First operand 243 states and 290 transitions. Second operand 12 states. [2020-11-07 04:48:12,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:12,873 INFO L93 Difference]: Finished difference Result 443 states and 537 transitions. [2020-11-07 04:48:12,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 04:48:12,874 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 149 [2020-11-07 04:48:12,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:12,877 INFO L225 Difference]: With dead ends: 443 [2020-11-07 04:48:12,877 INFO L226 Difference]: Without dead ends: 291 [2020-11-07 04:48:12,879 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-11-07 04:48:12,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-11-07 04:48:12,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 243. [2020-11-07 04:48:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-11-07 04:48:12,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 290 transitions. [2020-11-07 04:48:12,927 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 290 transitions. Word has length 149 [2020-11-07 04:48:12,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:12,928 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 290 transitions. [2020-11-07 04:48:12,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 04:48:12,928 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 290 transitions. [2020-11-07 04:48:12,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-11-07 04:48:12,929 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:12,930 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-11-07 04:48:12,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 04:48:12,930 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:12,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:12,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1763042008, now seen corresponding path program 8 times [2020-11-07 04:48:12,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:12,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1589147259] [2020-11-07 04:48:12,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:12,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:12,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:12,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:13,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-11-07 04:48:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:13,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-11-07 04:48:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:13,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-11-07 04:48:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 6 proven. 168 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:48:13,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1589147259] [2020-11-07 04:48:13,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:13,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 04:48:13,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974656117] [2020-11-07 04:48:13,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 04:48:13,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:13,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 04:48:13,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2020-11-07 04:48:13,198 INFO L87 Difference]: Start difference. First operand 243 states and 290 transitions. Second operand 13 states. [2020-11-07 04:48:14,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:14,996 INFO L93 Difference]: Finished difference Result 516 states and 616 transitions. [2020-11-07 04:48:14,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 04:48:14,999 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 154 [2020-11-07 04:48:14,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:15,003 INFO L225 Difference]: With dead ends: 516 [2020-11-07 04:48:15,004 INFO L226 Difference]: Without dead ends: 357 [2020-11-07 04:48:15,006 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-11-07 04:48:15,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2020-11-07 04:48:15,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 253. [2020-11-07 04:48:15,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-11-07 04:48:15,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 303 transitions. [2020-11-07 04:48:15,065 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 303 transitions. Word has length 154 [2020-11-07 04:48:15,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:15,065 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 303 transitions. [2020-11-07 04:48:15,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 04:48:15,066 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 303 transitions. [2020-11-07 04:48:15,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-11-07 04:48:15,067 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:15,068 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-11-07 04:48:15,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-07 04:48:15,068 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:15,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:15,069 INFO L82 PathProgramCache]: Analyzing trace with hash 339461814, now seen corresponding path program 7 times [2020-11-07 04:48:15,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:15,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1071670259] [2020-11-07 04:48:15,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:15,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:15,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:15,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:15,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-11-07 04:48:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:15,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-11-07 04:48:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:15,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-11-07 04:48:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 7 proven. 154 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:48:15,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1071670259] [2020-11-07 04:48:15,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:15,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 04:48:15,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230053541] [2020-11-07 04:48:15,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 04:48:15,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:15,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 04:48:15,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-11-07 04:48:15,474 INFO L87 Difference]: Start difference. First operand 253 states and 303 transitions. Second operand 13 states. [2020-11-07 04:48:17,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:17,303 INFO L93 Difference]: Finished difference Result 462 states and 562 transitions. [2020-11-07 04:48:17,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 04:48:17,304 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 154 [2020-11-07 04:48:17,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:17,306 INFO L225 Difference]: With dead ends: 462 [2020-11-07 04:48:17,306 INFO L226 Difference]: Without dead ends: 305 [2020-11-07 04:48:17,307 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-11-07 04:48:17,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-11-07 04:48:17,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 253. [2020-11-07 04:48:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-11-07 04:48:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 303 transitions. [2020-11-07 04:48:17,363 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 303 transitions. Word has length 154 [2020-11-07 04:48:17,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:17,363 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 303 transitions. [2020-11-07 04:48:17,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 04:48:17,363 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 303 transitions. [2020-11-07 04:48:17,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-11-07 04:48:17,365 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:17,365 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-11-07 04:48:17,365 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-07 04:48:17,365 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:17,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:17,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1245474357, now seen corresponding path program 9 times [2020-11-07 04:48:17,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:17,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1633471308] [2020-11-07 04:48:17,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:17,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:17,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:17,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:17,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-11-07 04:48:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:17,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-11-07 04:48:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:17,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-11-07 04:48:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:17,644 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 6 proven. 210 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:48:17,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1633471308] [2020-11-07 04:48:17,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:17,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 04:48:17,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768324860] [2020-11-07 04:48:17,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 04:48:17,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:17,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 04:48:17,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=103, Unknown=0, NotChecked=0, Total=182 [2020-11-07 04:48:17,646 INFO L87 Difference]: Start difference. First operand 253 states and 303 transitions. Second operand 14 states. [2020-11-07 04:48:19,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:19,473 INFO L93 Difference]: Finished difference Result 543 states and 649 transitions. [2020-11-07 04:48:19,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 04:48:19,474 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 159 [2020-11-07 04:48:19,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:19,477 INFO L225 Difference]: With dead ends: 543 [2020-11-07 04:48:19,477 INFO L226 Difference]: Without dead ends: 379 [2020-11-07 04:48:19,478 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=394, Unknown=0, NotChecked=0, Total=650 [2020-11-07 04:48:19,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2020-11-07 04:48:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 263. [2020-11-07 04:48:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2020-11-07 04:48:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 316 transitions. [2020-11-07 04:48:19,538 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 316 transitions. Word has length 159 [2020-11-07 04:48:19,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:19,538 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 316 transitions. [2020-11-07 04:48:19,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 04:48:19,538 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 316 transitions. [2020-11-07 04:48:19,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-11-07 04:48:19,540 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:19,540 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-11-07 04:48:19,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-07 04:48:19,540 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:19,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:19,541 INFO L82 PathProgramCache]: Analyzing trace with hash 857029465, now seen corresponding path program 8 times [2020-11-07 04:48:19,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:19,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [97847378] [2020-11-07 04:48:19,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:19,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:19,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:19,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:19,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-11-07 04:48:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:19,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-11-07 04:48:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:19,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-11-07 04:48:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:19,935 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 7 proven. 194 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:48:19,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [97847378] [2020-11-07 04:48:19,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:19,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 04:48:19,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747792136] [2020-11-07 04:48:19,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 04:48:19,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:19,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 04:48:19,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-11-07 04:48:19,936 INFO L87 Difference]: Start difference. First operand 263 states and 316 transitions. Second operand 14 states. [2020-11-07 04:48:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:21,935 INFO L93 Difference]: Finished difference Result 481 states and 587 transitions. [2020-11-07 04:48:21,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 04:48:21,939 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 159 [2020-11-07 04:48:21,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:21,942 INFO L225 Difference]: With dead ends: 481 [2020-11-07 04:48:21,942 INFO L226 Difference]: Without dead ends: 319 [2020-11-07 04:48:21,943 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-11-07 04:48:21,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-11-07 04:48:22,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 263. [2020-11-07 04:48:22,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2020-11-07 04:48:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 316 transitions. [2020-11-07 04:48:22,003 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 316 transitions. Word has length 159 [2020-11-07 04:48:22,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:22,004 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 316 transitions. [2020-11-07 04:48:22,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 04:48:22,004 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 316 transitions. [2020-11-07 04:48:22,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-11-07 04:48:22,005 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:22,006 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-11-07 04:48:22,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-07 04:48:22,006 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:22,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:22,006 INFO L82 PathProgramCache]: Analyzing trace with hash -19363064, now seen corresponding path program 10 times [2020-11-07 04:48:22,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:22,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1915326772] [2020-11-07 04:48:22,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:22,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:22,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:22,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:22,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-11-07 04:48:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:22,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-11-07 04:48:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:22,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-11-07 04:48:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 6 proven. 257 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:48:22,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1915326772] [2020-11-07 04:48:22,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:22,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 04:48:22,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081695487] [2020-11-07 04:48:22,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 04:48:22,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:22,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 04:48:22,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=118, Unknown=0, NotChecked=0, Total=210 [2020-11-07 04:48:22,371 INFO L87 Difference]: Start difference. First operand 263 states and 316 transitions. Second operand 15 states. [2020-11-07 04:48:24,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:24,571 INFO L93 Difference]: Finished difference Result 570 states and 682 transitions. [2020-11-07 04:48:24,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 04:48:24,571 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 164 [2020-11-07 04:48:24,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:24,574 INFO L225 Difference]: With dead ends: 570 [2020-11-07 04:48:24,574 INFO L226 Difference]: Without dead ends: 401 [2020-11-07 04:48:24,576 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=297, Invalid=459, Unknown=0, NotChecked=0, Total=756 [2020-11-07 04:48:24,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2020-11-07 04:48:24,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 273. [2020-11-07 04:48:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2020-11-07 04:48:24,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 329 transitions. [2020-11-07 04:48:24,642 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 329 transitions. Word has length 164 [2020-11-07 04:48:24,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:24,642 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 329 transitions. [2020-11-07 04:48:24,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 04:48:24,643 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 329 transitions. [2020-11-07 04:48:24,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-11-07 04:48:24,644 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:24,644 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-11-07 04:48:24,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-07 04:48:24,645 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:24,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:24,645 INFO L82 PathProgramCache]: Analyzing trace with hash 2083140758, now seen corresponding path program 9 times [2020-11-07 04:48:24,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:24,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1180190526] [2020-11-07 04:48:24,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:24,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:24,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:24,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:25,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-11-07 04:48:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:25,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-11-07 04:48:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:25,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-11-07 04:48:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 7 proven. 239 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:48:25,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1180190526] [2020-11-07 04:48:25,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:25,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 04:48:25,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668472979] [2020-11-07 04:48:25,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 04:48:25,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:25,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 04:48:25,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-11-07 04:48:25,079 INFO L87 Difference]: Start difference. First operand 273 states and 329 transitions. Second operand 15 states. [2020-11-07 04:48:27,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:27,840 INFO L93 Difference]: Finished difference Result 500 states and 612 transitions. [2020-11-07 04:48:27,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 04:48:27,841 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 164 [2020-11-07 04:48:27,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:27,846 INFO L225 Difference]: With dead ends: 500 [2020-11-07 04:48:27,846 INFO L226 Difference]: Without dead ends: 333 [2020-11-07 04:48:27,847 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2020-11-07 04:48:27,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-11-07 04:48:27,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 273. [2020-11-07 04:48:27,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2020-11-07 04:48:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 329 transitions. [2020-11-07 04:48:27,924 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 329 transitions. Word has length 164 [2020-11-07 04:48:27,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:27,925 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 329 transitions. [2020-11-07 04:48:27,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 04:48:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 329 transitions. [2020-11-07 04:48:27,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-11-07 04:48:27,927 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:27,927 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-11-07 04:48:27,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-07 04:48:27,927 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:27,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:27,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1861300245, now seen corresponding path program 11 times [2020-11-07 04:48:27,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:27,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [807876639] [2020-11-07 04:48:27,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:28,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:28,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:28,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:28,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2020-11-07 04:48:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:28,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-11-07 04:48:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:28,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-11-07 04:48:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 6 proven. 309 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:48:28,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [807876639] [2020-11-07 04:48:28,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:28,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 04:48:28,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639387579] [2020-11-07 04:48:28,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 04:48:28,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:28,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 04:48:28,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=134, Unknown=0, NotChecked=0, Total=240 [2020-11-07 04:48:28,314 INFO L87 Difference]: Start difference. First operand 273 states and 329 transitions. Second operand 16 states. [2020-11-07 04:48:30,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:30,657 INFO L93 Difference]: Finished difference Result 597 states and 715 transitions. [2020-11-07 04:48:30,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 04:48:30,657 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 169 [2020-11-07 04:48:30,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:30,660 INFO L225 Difference]: With dead ends: 597 [2020-11-07 04:48:30,660 INFO L226 Difference]: Without dead ends: 423 [2020-11-07 04:48:30,661 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-11-07 04:48:30,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2020-11-07 04:48:30,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 283. [2020-11-07 04:48:30,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2020-11-07 04:48:30,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 342 transitions. [2020-11-07 04:48:30,732 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 342 transitions. Word has length 169 [2020-11-07 04:48:30,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:30,732 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 342 transitions. [2020-11-07 04:48:30,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 04:48:30,732 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 342 transitions. [2020-11-07 04:48:30,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-11-07 04:48:30,734 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:30,734 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-11-07 04:48:30,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-07 04:48:30,734 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:30,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:30,735 INFO L82 PathProgramCache]: Analyzing trace with hash 241203577, now seen corresponding path program 10 times [2020-11-07 04:48:30,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:30,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [263832505] [2020-11-07 04:48:30,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:30,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:30,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:30,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:31,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2020-11-07 04:48:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:31,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-11-07 04:48:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:31,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-11-07 04:48:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:31,176 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 7 proven. 289 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:48:31,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [263832505] [2020-11-07 04:48:31,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:31,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 04:48:31,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901801118] [2020-11-07 04:48:31,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 04:48:31,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:31,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 04:48:31,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-11-07 04:48:31,178 INFO L87 Difference]: Start difference. First operand 283 states and 342 transitions. Second operand 16 states. [2020-11-07 04:48:33,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:33,557 INFO L93 Difference]: Finished difference Result 519 states and 637 transitions. [2020-11-07 04:48:33,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 04:48:33,558 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 169 [2020-11-07 04:48:33,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:33,560 INFO L225 Difference]: With dead ends: 519 [2020-11-07 04:48:33,560 INFO L226 Difference]: Without dead ends: 347 [2020-11-07 04:48:33,561 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2020-11-07 04:48:33,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-11-07 04:48:33,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 283. [2020-11-07 04:48:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2020-11-07 04:48:33,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 342 transitions. [2020-11-07 04:48:33,633 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 342 transitions. Word has length 169 [2020-11-07 04:48:33,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:33,633 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 342 transitions. [2020-11-07 04:48:33,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 04:48:33,634 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 342 transitions. [2020-11-07 04:48:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-11-07 04:48:33,635 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:33,635 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-11-07 04:48:33,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-07 04:48:33,636 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:33,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:33,636 INFO L82 PathProgramCache]: Analyzing trace with hash 2105483496, now seen corresponding path program 12 times [2020-11-07 04:48:33,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:33,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1917850185] [2020-11-07 04:48:33,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:33,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:33,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:33,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:33,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2020-11-07 04:48:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:33,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-11-07 04:48:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:33,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-11-07 04:48:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:34,045 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 366 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:48:34,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1917850185] [2020-11-07 04:48:34,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:34,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 04:48:34,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971966971] [2020-11-07 04:48:34,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 04:48:34,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:34,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 04:48:34,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=151, Unknown=0, NotChecked=0, Total=272 [2020-11-07 04:48:34,047 INFO L87 Difference]: Start difference. First operand 283 states and 342 transitions. Second operand 17 states. [2020-11-07 04:48:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:36,524 INFO L93 Difference]: Finished difference Result 624 states and 748 transitions. [2020-11-07 04:48:36,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 04:48:36,531 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 174 [2020-11-07 04:48:36,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:36,534 INFO L225 Difference]: With dead ends: 624 [2020-11-07 04:48:36,534 INFO L226 Difference]: Without dead ends: 445 [2020-11-07 04:48:36,536 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-11-07 04:48:36,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-11-07 04:48:36,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 293. [2020-11-07 04:48:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2020-11-07 04:48:36,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 355 transitions. [2020-11-07 04:48:36,617 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 355 transitions. Word has length 174 [2020-11-07 04:48:36,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:36,618 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 355 transitions. [2020-11-07 04:48:36,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 04:48:36,618 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 355 transitions. [2020-11-07 04:48:36,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-11-07 04:48:36,619 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:36,620 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-11-07 04:48:36,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-07 04:48:36,620 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:36,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:36,620 INFO L82 PathProgramCache]: Analyzing trace with hash -86979978, now seen corresponding path program 11 times [2020-11-07 04:48:36,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:36,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1220877340] [2020-11-07 04:48:36,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:37,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2020-11-07 04:48:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:37,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-11-07 04:48:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:37,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-11-07 04:48:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 7 proven. 344 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:48:37,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1220877340] [2020-11-07 04:48:37,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:37,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 04:48:37,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208083652] [2020-11-07 04:48:37,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 04:48:37,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:37,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 04:48:37,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-11-07 04:48:37,143 INFO L87 Difference]: Start difference. First operand 293 states and 355 transitions. Second operand 17 states. [2020-11-07 04:48:39,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:39,907 INFO L93 Difference]: Finished difference Result 538 states and 662 transitions. [2020-11-07 04:48:39,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 04:48:39,908 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 174 [2020-11-07 04:48:39,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:39,910 INFO L225 Difference]: With dead ends: 538 [2020-11-07 04:48:39,910 INFO L226 Difference]: Without dead ends: 361 [2020-11-07 04:48:39,911 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2020-11-07 04:48:39,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2020-11-07 04:48:39,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 293. [2020-11-07 04:48:39,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2020-11-07 04:48:39,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 355 transitions. [2020-11-07 04:48:39,988 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 355 transitions. Word has length 174 [2020-11-07 04:48:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:39,989 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 355 transitions. [2020-11-07 04:48:39,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 04:48:39,989 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 355 transitions. [2020-11-07 04:48:39,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-07 04:48:39,991 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:39,991 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-11-07 04:48:39,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-07 04:48:39,991 INFO L429 AbstractCegarLoop]: === Iteration 29 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:39,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:39,992 INFO L82 PathProgramCache]: Analyzing trace with hash 175826443, now seen corresponding path program 13 times [2020-11-07 04:48:39,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:39,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1465879906] [2020-11-07 04:48:39,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:40,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:40,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:40,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:40,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-11-07 04:48:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:40,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-11-07 04:48:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:40,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-11-07 04:48:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 6 proven. 428 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:48:40,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1465879906] [2020-11-07 04:48:40,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:40,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 04:48:40,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664355610] [2020-11-07 04:48:40,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 04:48:40,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:40,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 04:48:40,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=169, Unknown=0, NotChecked=0, Total=306 [2020-11-07 04:48:40,392 INFO L87 Difference]: Start difference. First operand 293 states and 355 transitions. Second operand 18 states. [2020-11-07 04:48:42,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:42,266 INFO L93 Difference]: Finished difference Result 651 states and 781 transitions. [2020-11-07 04:48:42,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 04:48:42,267 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 179 [2020-11-07 04:48:42,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:42,270 INFO L225 Difference]: With dead ends: 651 [2020-11-07 04:48:42,270 INFO L226 Difference]: Without dead ends: 467 [2020-11-07 04:48:42,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=438, Invalid=684, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 04:48:42,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2020-11-07 04:48:42,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 303. [2020-11-07 04:48:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2020-11-07 04:48:42,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 368 transitions. [2020-11-07 04:48:42,356 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 368 transitions. Word has length 179 [2020-11-07 04:48:42,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:42,357 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 368 transitions. [2020-11-07 04:48:42,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 04:48:42,357 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 368 transitions. [2020-11-07 04:48:42,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-07 04:48:42,359 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:42,359 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-11-07 04:48:42,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-07 04:48:42,359 INFO L429 AbstractCegarLoop]: === Iteration 30 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:42,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:42,360 INFO L82 PathProgramCache]: Analyzing trace with hash -2016637031, now seen corresponding path program 12 times [2020-11-07 04:48:42,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:42,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1362697411] [2020-11-07 04:48:42,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:42,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:42,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:42,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:42,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-11-07 04:48:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:42,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-11-07 04:48:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:42,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-11-07 04:48:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:42,873 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 7 proven. 404 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:48:42,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1362697411] [2020-11-07 04:48:42,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:42,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 04:48:42,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345625928] [2020-11-07 04:48:42,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 04:48:42,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:42,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 04:48:42,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-11-07 04:48:42,875 INFO L87 Difference]: Start difference. First operand 303 states and 368 transitions. Second operand 18 states. [2020-11-07 04:48:46,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:46,799 INFO L93 Difference]: Finished difference Result 557 states and 687 transitions. [2020-11-07 04:48:46,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 04:48:46,800 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 179 [2020-11-07 04:48:46,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:46,803 INFO L225 Difference]: With dead ends: 557 [2020-11-07 04:48:46,803 INFO L226 Difference]: Without dead ends: 375 [2020-11-07 04:48:46,805 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 04:48:46,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2020-11-07 04:48:46,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 303. [2020-11-07 04:48:46,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2020-11-07 04:48:46,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 368 transitions. [2020-11-07 04:48:46,887 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 368 transitions. Word has length 179 [2020-11-07 04:48:46,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:46,887 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 368 transitions. [2020-11-07 04:48:46,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 04:48:46,888 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 368 transitions. [2020-11-07 04:48:46,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-11-07 04:48:46,889 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:46,890 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-11-07 04:48:46,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-07 04:48:46,890 INFO L429 AbstractCegarLoop]: === Iteration 31 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:46,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:46,890 INFO L82 PathProgramCache]: Analyzing trace with hash -926163256, now seen corresponding path program 14 times [2020-11-07 04:48:46,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:46,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [413522974] [2020-11-07 04:48:46,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:46,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:46,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:46,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:47,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-11-07 04:48:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:47,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-11-07 04:48:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:47,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-11-07 04:48:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:47,330 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 6 proven. 495 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:48:47,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [413522974] [2020-11-07 04:48:47,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:47,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-11-07 04:48:47,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935634449] [2020-11-07 04:48:47,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 04:48:47,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:47,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 04:48:47,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=188, Unknown=0, NotChecked=0, Total=342 [2020-11-07 04:48:47,332 INFO L87 Difference]: Start difference. First operand 303 states and 368 transitions. Second operand 19 states. [2020-11-07 04:48:50,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:50,307 INFO L93 Difference]: Finished difference Result 678 states and 814 transitions. [2020-11-07 04:48:50,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 04:48:50,308 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 184 [2020-11-07 04:48:50,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:50,310 INFO L225 Difference]: With dead ends: 678 [2020-11-07 04:48:50,310 INFO L226 Difference]: Without dead ends: 489 [2020-11-07 04:48:50,312 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=491, Invalid=769, Unknown=0, NotChecked=0, Total=1260 [2020-11-07 04:48:50,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2020-11-07 04:48:50,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 313. [2020-11-07 04:48:50,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2020-11-07 04:48:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 381 transitions. [2020-11-07 04:48:50,377 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 381 transitions. Word has length 184 [2020-11-07 04:48:50,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:50,377 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 381 transitions. [2020-11-07 04:48:50,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 04:48:50,377 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 381 transitions. [2020-11-07 04:48:50,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-11-07 04:48:50,379 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:50,379 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-11-07 04:48:50,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-07 04:48:50,379 INFO L429 AbstractCegarLoop]: === Iteration 32 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:50,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:50,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1176340566, now seen corresponding path program 13 times [2020-11-07 04:48:50,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:50,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [522912847] [2020-11-07 04:48:50,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:50,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:50,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:50,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:50,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-11-07 04:48:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:50,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-11-07 04:48:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:50,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-11-07 04:48:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:50,989 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 7 proven. 469 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:48:50,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [522912847] [2020-11-07 04:48:50,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:50,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-11-07 04:48:50,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121626935] [2020-11-07 04:48:50,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 04:48:50,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:50,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 04:48:50,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2020-11-07 04:48:50,991 INFO L87 Difference]: Start difference. First operand 313 states and 381 transitions. Second operand 19 states. [2020-11-07 04:48:54,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:54,767 INFO L93 Difference]: Finished difference Result 576 states and 712 transitions. [2020-11-07 04:48:54,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 04:48:54,770 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 184 [2020-11-07 04:48:54,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:54,772 INFO L225 Difference]: With dead ends: 576 [2020-11-07 04:48:54,772 INFO L226 Difference]: Without dead ends: 389 [2020-11-07 04:48:54,773 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-11-07 04:48:54,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2020-11-07 04:48:54,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 313. [2020-11-07 04:48:54,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2020-11-07 04:48:54,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 381 transitions. [2020-11-07 04:48:54,871 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 381 transitions. Word has length 184 [2020-11-07 04:48:54,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:54,871 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 381 transitions. [2020-11-07 04:48:54,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 04:48:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 381 transitions. [2020-11-07 04:48:54,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-11-07 04:48:54,873 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:54,874 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-11-07 04:48:54,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-07 04:48:54,874 INFO L429 AbstractCegarLoop]: === Iteration 33 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:54,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:54,875 INFO L82 PathProgramCache]: Analyzing trace with hash -254159829, now seen corresponding path program 15 times [2020-11-07 04:48:54,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:54,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2049150978] [2020-11-07 04:48:54,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:54,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:54,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:54,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:55,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 04:48:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:55,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-11-07 04:48:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:55,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-11-07 04:48:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:55,345 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 6 proven. 567 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:48:55,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2049150978] [2020-11-07 04:48:55,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:55,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-11-07 04:48:55,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945774850] [2020-11-07 04:48:55,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 04:48:55,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:55,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 04:48:55,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=208, Unknown=0, NotChecked=0, Total=380 [2020-11-07 04:48:55,347 INFO L87 Difference]: Start difference. First operand 313 states and 381 transitions. Second operand 20 states. [2020-11-07 04:48:58,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:58,330 INFO L93 Difference]: Finished difference Result 705 states and 847 transitions. [2020-11-07 04:48:58,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 04:48:58,331 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 189 [2020-11-07 04:48:58,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:58,333 INFO L225 Difference]: With dead ends: 705 [2020-11-07 04:48:58,333 INFO L226 Difference]: Without dead ends: 511 [2020-11-07 04:48:58,335 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=547, Invalid=859, Unknown=0, NotChecked=0, Total=1406 [2020-11-07 04:48:58,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2020-11-07 04:48:58,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 323. [2020-11-07 04:48:58,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-11-07 04:48:58,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 394 transitions. [2020-11-07 04:48:58,429 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 394 transitions. Word has length 189 [2020-11-07 04:48:58,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:58,430 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 394 transitions. [2020-11-07 04:48:58,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 04:48:58,430 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 394 transitions. [2020-11-07 04:48:58,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-11-07 04:48:58,431 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:58,432 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-11-07 04:48:58,432 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-07 04:48:58,432 INFO L429 AbstractCegarLoop]: === Iteration 34 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:58,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:58,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1848343993, now seen corresponding path program 14 times [2020-11-07 04:48:58,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:58,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [420969523] [2020-11-07 04:48:58,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:58,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:58,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:58,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:58,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 04:48:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:58,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-11-07 04:48:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:58,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-11-07 04:48:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:59,050 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 7 proven. 539 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:48:59,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [420969523] [2020-11-07 04:48:59,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:59,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-11-07 04:48:59,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395514469] [2020-11-07 04:48:59,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 04:48:59,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:59,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 04:48:59,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2020-11-07 04:48:59,052 INFO L87 Difference]: Start difference. First operand 323 states and 394 transitions. Second operand 20 states. [2020-11-07 04:49:03,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:49:03,491 INFO L93 Difference]: Finished difference Result 595 states and 737 transitions. [2020-11-07 04:49:03,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 04:49:03,492 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 189 [2020-11-07 04:49:03,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:49:03,495 INFO L225 Difference]: With dead ends: 595 [2020-11-07 04:49:03,495 INFO L226 Difference]: Without dead ends: 403 [2020-11-07 04:49:03,497 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-11-07 04:49:03,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2020-11-07 04:49:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 323. [2020-11-07 04:49:03,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-11-07 04:49:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 394 transitions. [2020-11-07 04:49:03,574 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 394 transitions. Word has length 189 [2020-11-07 04:49:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:49:03,575 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 394 transitions. [2020-11-07 04:49:03,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 04:49:03,575 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 394 transitions. [2020-11-07 04:49:03,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-11-07 04:49:03,577 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:49:03,577 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-11-07 04:49:03,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-07 04:49:03,577 INFO L429 AbstractCegarLoop]: === Iteration 35 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:49:03,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:49:03,578 INFO L82 PathProgramCache]: Analyzing trace with hash -2060663640, now seen corresponding path program 16 times [2020-11-07 04:49:03,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:49:03,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [818951793] [2020-11-07 04:49:03,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:49:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:03,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:49:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:03,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:49:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:03,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:49:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:04,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-11-07 04:49:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:04,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-11-07 04:49:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:04,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-11-07 04:49:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 6 proven. 644 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:49:04,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [818951793] [2020-11-07 04:49:04,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:49:04,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-11-07 04:49:04,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533973486] [2020-11-07 04:49:04,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-07 04:49:04,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:49:04,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-07 04:49:04,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=229, Unknown=0, NotChecked=0, Total=420 [2020-11-07 04:49:04,135 INFO L87 Difference]: Start difference. First operand 323 states and 394 transitions. Second operand 21 states. [2020-11-07 04:49:07,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:49:07,583 INFO L93 Difference]: Finished difference Result 732 states and 880 transitions. [2020-11-07 04:49:07,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 04:49:07,584 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 194 [2020-11-07 04:49:07,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:49:07,587 INFO L225 Difference]: With dead ends: 732 [2020-11-07 04:49:07,587 INFO L226 Difference]: Without dead ends: 533 [2020-11-07 04:49:07,588 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=606, Invalid=954, Unknown=0, NotChecked=0, Total=1560 [2020-11-07 04:49:07,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-11-07 04:49:07,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 333. [2020-11-07 04:49:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-11-07 04:49:07,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 407 transitions. [2020-11-07 04:49:07,688 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 407 transitions. Word has length 194 [2020-11-07 04:49:07,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:49:07,689 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 407 transitions. [2020-11-07 04:49:07,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-07 04:49:07,689 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 407 transitions. [2020-11-07 04:49:07,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-11-07 04:49:07,690 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:49:07,691 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-11-07 04:49:07,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-07 04:49:07,691 INFO L429 AbstractCegarLoop]: === Iteration 36 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:49:07,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:49:07,691 INFO L82 PathProgramCache]: Analyzing trace with hash 41840182, now seen corresponding path program 15 times [2020-11-07 04:49:07,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:49:07,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1759025463] [2020-11-07 04:49:07,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:49:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:07,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:49:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:07,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:49:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:07,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:49:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:08,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-11-07 04:49:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:08,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-11-07 04:49:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:08,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-11-07 04:49:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 7 proven. 614 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:49:08,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1759025463] [2020-11-07 04:49:08,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:49:08,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-11-07 04:49:08,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109181682] [2020-11-07 04:49:08,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-07 04:49:08,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:49:08,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-07 04:49:08,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2020-11-07 04:49:08,407 INFO L87 Difference]: Start difference. First operand 333 states and 407 transitions. Second operand 21 states. [2020-11-07 04:49:12,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:49:12,531 INFO L93 Difference]: Finished difference Result 614 states and 762 transitions. [2020-11-07 04:49:12,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 04:49:12,533 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 194 [2020-11-07 04:49:12,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:49:12,535 INFO L225 Difference]: With dead ends: 614 [2020-11-07 04:49:12,535 INFO L226 Difference]: Without dead ends: 417 [2020-11-07 04:49:12,537 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-11-07 04:49:12,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-11-07 04:49:12,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 333. [2020-11-07 04:49:12,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-11-07 04:49:12,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 407 transitions. [2020-11-07 04:49:12,620 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 407 transitions. Word has length 194 [2020-11-07 04:49:12,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:49:12,620 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 407 transitions. [2020-11-07 04:49:12,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-07 04:49:12,620 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 407 transitions. [2020-11-07 04:49:12,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-11-07 04:49:12,621 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:49:12,622 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-11-07 04:49:12,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-07 04:49:12,622 INFO L429 AbstractCegarLoop]: === Iteration 37 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:49:12,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:49:12,622 INFO L82 PathProgramCache]: Analyzing trace with hash 880646731, now seen corresponding path program 17 times [2020-11-07 04:49:12,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:49:12,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1565780446] [2020-11-07 04:49:12,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:49:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:12,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:49:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:12,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:49:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:12,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:49:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:13,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2020-11-07 04:49:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:13,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2020-11-07 04:49:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:13,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-11-07 04:49:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 6 proven. 726 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:49:13,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1565780446] [2020-11-07 04:49:13,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:49:13,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-11-07 04:49:13,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731927262] [2020-11-07 04:49:13,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 04:49:13,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:49:13,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 04:49:13,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=251, Unknown=0, NotChecked=0, Total=462 [2020-11-07 04:49:13,332 INFO L87 Difference]: Start difference. First operand 333 states and 407 transitions. Second operand 22 states. [2020-11-07 04:49:16,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:49:16,798 INFO L93 Difference]: Finished difference Result 759 states and 913 transitions. [2020-11-07 04:49:16,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 04:49:16,799 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 199 [2020-11-07 04:49:16,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:49:16,802 INFO L225 Difference]: With dead ends: 759 [2020-11-07 04:49:16,802 INFO L226 Difference]: Without dead ends: 555 [2020-11-07 04:49:16,804 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-11-07 04:49:16,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-11-07 04:49:16,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 343. [2020-11-07 04:49:16,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-11-07 04:49:16,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 420 transitions. [2020-11-07 04:49:16,916 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 420 transitions. Word has length 199 [2020-11-07 04:49:16,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:49:16,917 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 420 transitions. [2020-11-07 04:49:16,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 04:49:16,917 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 420 transitions. [2020-11-07 04:49:16,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-11-07 04:49:16,919 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:49:16,919 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-11-07 04:49:16,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-11-07 04:49:16,919 INFO L429 AbstractCegarLoop]: === Iteration 38 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:49:16,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:49:16,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1311816743, now seen corresponding path program 16 times [2020-11-07 04:49:16,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:49:16,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1199691161] [2020-11-07 04:49:16,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:49:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:16,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:49:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:16,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:49:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:16,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:49:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:17,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2020-11-07 04:49:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:17,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2020-11-07 04:49:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:17,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-11-07 04:49:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:17,703 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 7 proven. 694 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:49:17,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1199691161] [2020-11-07 04:49:17,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:49:17,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-11-07 04:49:17,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154811702] [2020-11-07 04:49:17,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 04:49:17,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:49:17,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 04:49:17,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2020-11-07 04:49:17,706 INFO L87 Difference]: Start difference. First operand 343 states and 420 transitions. Second operand 22 states. [2020-11-07 04:49:23,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:49:23,382 INFO L93 Difference]: Finished difference Result 633 states and 787 transitions. [2020-11-07 04:49:23,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 04:49:23,384 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 199 [2020-11-07 04:49:23,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:49:23,387 INFO L225 Difference]: With dead ends: 633 [2020-11-07 04:49:23,387 INFO L226 Difference]: Without dead ends: 431 [2020-11-07 04:49:23,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=260, Invalid=1462, Unknown=0, NotChecked=0, Total=1722 [2020-11-07 04:49:23,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2020-11-07 04:49:23,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 343. [2020-11-07 04:49:23,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-11-07 04:49:23,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 420 transitions. [2020-11-07 04:49:23,464 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 420 transitions. Word has length 199 [2020-11-07 04:49:23,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:49:23,465 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 420 transitions. [2020-11-07 04:49:23,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 04:49:23,465 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 420 transitions. [2020-11-07 04:49:23,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-11-07 04:49:23,466 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:49:23,467 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-11-07 04:49:23,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-11-07 04:49:23,467 INFO L429 AbstractCegarLoop]: === Iteration 39 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:49:23,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:49:23,467 INFO L82 PathProgramCache]: Analyzing trace with hash 630182536, now seen corresponding path program 18 times [2020-11-07 04:49:23,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:49:23,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [653777807] [2020-11-07 04:49:23,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:49:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:23,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:49:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:23,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:49:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:23,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:49:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:23,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-11-07 04:49:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:23,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-11-07 04:49:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:23,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2020-11-07 04:49:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 6 proven. 813 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:49:24,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [653777807] [2020-11-07 04:49:24,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:49:24,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-11-07 04:49:24,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618390444] [2020-11-07 04:49:24,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 04:49:24,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:49:24,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 04:49:24,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2020-11-07 04:49:24,068 INFO L87 Difference]: Start difference. First operand 343 states and 420 transitions. Second operand 23 states. [2020-11-07 04:49:26,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:49:26,562 INFO L93 Difference]: Finished difference Result 786 states and 946 transitions. [2020-11-07 04:49:26,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-07 04:49:26,566 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 204 [2020-11-07 04:49:26,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:49:26,570 INFO L225 Difference]: With dead ends: 786 [2020-11-07 04:49:26,570 INFO L226 Difference]: Without dead ends: 577 [2020-11-07 04:49:26,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=733, Invalid=1159, Unknown=0, NotChecked=0, Total=1892 [2020-11-07 04:49:26,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-11-07 04:49:26,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 353. [2020-11-07 04:49:26,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-11-07 04:49:26,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 433 transitions. [2020-11-07 04:49:26,676 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 433 transitions. Word has length 204 [2020-11-07 04:49:26,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:49:26,676 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 433 transitions. [2020-11-07 04:49:26,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 04:49:26,676 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 433 transitions. [2020-11-07 04:49:26,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-11-07 04:49:26,677 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:49:26,678 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-11-07 04:49:26,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-07 04:49:26,678 INFO L429 AbstractCegarLoop]: === Iteration 40 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:49:26,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:49:26,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1562280938, now seen corresponding path program 17 times [2020-11-07 04:49:26,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:49:26,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [91518849] [2020-11-07 04:49:26,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:49:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:26,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:49:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:26,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:49:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:26,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:49:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:27,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-11-07 04:49:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:27,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-11-07 04:49:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:27,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2020-11-07 04:49:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:27,498 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 7 proven. 779 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:49:27,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [91518849] [2020-11-07 04:49:27,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:49:27,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-11-07 04:49:27,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757180994] [2020-11-07 04:49:27,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 04:49:27,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:49:27,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 04:49:27,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2020-11-07 04:49:27,501 INFO L87 Difference]: Start difference. First operand 353 states and 433 transitions. Second operand 23 states. [2020-11-07 04:49:33,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:49:33,732 INFO L93 Difference]: Finished difference Result 652 states and 812 transitions. [2020-11-07 04:49:33,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-07 04:49:33,733 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 204 [2020-11-07 04:49:33,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:49:33,735 INFO L225 Difference]: With dead ends: 652 [2020-11-07 04:49:33,735 INFO L226 Difference]: Without dead ends: 445 [2020-11-07 04:49:33,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=274, Invalid=1618, Unknown=0, NotChecked=0, Total=1892 [2020-11-07 04:49:33,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-11-07 04:49:33,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 353. [2020-11-07 04:49:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-11-07 04:49:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 433 transitions. [2020-11-07 04:49:33,822 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 433 transitions. Word has length 204 [2020-11-07 04:49:33,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:49:33,823 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 433 transitions. [2020-11-07 04:49:33,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 04:49:33,823 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 433 transitions. [2020-11-07 04:49:33,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-11-07 04:49:33,824 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:49:33,825 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-11-07 04:49:33,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-11-07 04:49:33,825 INFO L429 AbstractCegarLoop]: === Iteration 41 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:49:33,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:49:33,825 INFO L82 PathProgramCache]: Analyzing trace with hash 121124971, now seen corresponding path program 19 times [2020-11-07 04:49:33,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:49:33,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [50287480] [2020-11-07 04:49:33,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:49:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:33,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:49:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:33,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:49:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:33,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:49:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:34,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 04:49:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:34,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2020-11-07 04:49:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:34,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-11-07 04:49:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 6 proven. 905 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:49:34,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [50287480] [2020-11-07 04:49:34,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:49:34,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-11-07 04:49:34,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851615705] [2020-11-07 04:49:34,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-07 04:49:34,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:49:34,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-07 04:49:34,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=298, Unknown=0, NotChecked=0, Total=552 [2020-11-07 04:49:34,475 INFO L87 Difference]: Start difference. First operand 353 states and 433 transitions. Second operand 24 states. [2020-11-07 04:49:37,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:49:37,544 INFO L93 Difference]: Finished difference Result 813 states and 979 transitions. [2020-11-07 04:49:37,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 04:49:37,545 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 209 [2020-11-07 04:49:37,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:49:37,548 INFO L225 Difference]: With dead ends: 813 [2020-11-07 04:49:37,549 INFO L226 Difference]: Without dead ends: 599 [2020-11-07 04:49:37,550 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-11-07 04:49:37,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-11-07 04:49:37,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 363. [2020-11-07 04:49:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2020-11-07 04:49:37,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 446 transitions. [2020-11-07 04:49:37,667 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 446 transitions. Word has length 209 [2020-11-07 04:49:37,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:49:37,668 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 446 transitions. [2020-11-07 04:49:37,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-07 04:49:37,668 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 446 transitions. [2020-11-07 04:49:37,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-11-07 04:49:37,669 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:49:37,669 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-11-07 04:49:37,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-11-07 04:49:37,669 INFO L429 AbstractCegarLoop]: === Iteration 42 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:49:37,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:49:37,670 INFO L82 PathProgramCache]: Analyzing trace with hash -2071338503, now seen corresponding path program 18 times [2020-11-07 04:49:37,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:49:37,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1744700473] [2020-11-07 04:49:37,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:49:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:37,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:49:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:37,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:49:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:37,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:49:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:38,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 04:49:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:38,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2020-11-07 04:49:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:38,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-11-07 04:49:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:38,556 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 7 proven. 869 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:49:38,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1744700473] [2020-11-07 04:49:38,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:49:38,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-11-07 04:49:38,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532051223] [2020-11-07 04:49:38,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-07 04:49:38,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:49:38,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-07 04:49:38,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2020-11-07 04:49:38,558 INFO L87 Difference]: Start difference. First operand 363 states and 446 transitions. Second operand 24 states. [2020-11-07 04:49:45,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:49:45,300 INFO L93 Difference]: Finished difference Result 671 states and 837 transitions. [2020-11-07 04:49:45,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 04:49:45,301 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 209 [2020-11-07 04:49:45,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:49:45,303 INFO L225 Difference]: With dead ends: 671 [2020-11-07 04:49:45,303 INFO L226 Difference]: Without dead ends: 459 [2020-11-07 04:49:45,305 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-11-07 04:49:45,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2020-11-07 04:49:45,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 363. [2020-11-07 04:49:45,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2020-11-07 04:49:45,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 446 transitions. [2020-11-07 04:49:45,393 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 446 transitions. Word has length 209 [2020-11-07 04:49:45,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:49:45,393 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 446 transitions. [2020-11-07 04:49:45,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-07 04:49:45,393 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 446 transitions. [2020-11-07 04:49:45,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2020-11-07 04:49:45,394 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:49:45,395 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-11-07 04:49:45,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-11-07 04:49:45,395 INFO L429 AbstractCegarLoop]: === Iteration 43 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:49:45,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:49:45,395 INFO L82 PathProgramCache]: Analyzing trace with hash -882702232, now seen corresponding path program 20 times [2020-11-07 04:49:45,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:49:45,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [548889150] [2020-11-07 04:49:45,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:49:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:45,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:49:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:45,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:49:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:45,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:49:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:46,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-11-07 04:49:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:46,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-11-07 04:49:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:46,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-11-07 04:49:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:46,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1041 backedges. 6 proven. 1002 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:49:46,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [548889150] [2020-11-07 04:49:46,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:49:46,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-11-07 04:49:46,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185900786] [2020-11-07 04:49:46,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-07 04:49:46,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:49:46,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-07 04:49:46,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=323, Unknown=0, NotChecked=0, Total=600 [2020-11-07 04:49:46,100 INFO L87 Difference]: Start difference. First operand 363 states and 446 transitions. Second operand 25 states. [2020-11-07 04:49:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:49:49,261 INFO L93 Difference]: Finished difference Result 840 states and 1012 transitions. [2020-11-07 04:49:49,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-07 04:49:49,262 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 214 [2020-11-07 04:49:49,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:49:49,265 INFO L225 Difference]: With dead ends: 840 [2020-11-07 04:49:49,265 INFO L226 Difference]: Without dead ends: 621 [2020-11-07 04:49:49,267 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-11-07 04:49:49,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-11-07 04:49:49,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 373. [2020-11-07 04:49:49,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-11-07 04:49:49,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 459 transitions. [2020-11-07 04:49:49,356 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 459 transitions. Word has length 214 [2020-11-07 04:49:49,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:49:49,356 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 459 transitions. [2020-11-07 04:49:49,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-07 04:49:49,357 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 459 transitions. [2020-11-07 04:49:49,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2020-11-07 04:49:49,358 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:49:49,359 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-11-07 04:49:49,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-11-07 04:49:49,359 INFO L429 AbstractCegarLoop]: === Iteration 44 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:49:49,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:49:49,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1219801590, now seen corresponding path program 19 times [2020-11-07 04:49:49,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:49:49,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [473882911] [2020-11-07 04:49:49,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:49:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:49,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:49:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:49,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:49:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:49,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:49:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:50,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-11-07 04:49:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:50,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-11-07 04:49:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:50,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-11-07 04:49:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 7 proven. 964 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:49:50,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [473882911] [2020-11-07 04:49:50,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:49:50,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-11-07 04:49:50,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898038560] [2020-11-07 04:49:50,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-07 04:49:50,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:49:50,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-07 04:49:50,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2020-11-07 04:49:50,291 INFO L87 Difference]: Start difference. First operand 373 states and 459 transitions. Second operand 25 states. [2020-11-07 04:49:56,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:49:56,126 INFO L93 Difference]: Finished difference Result 690 states and 862 transitions. [2020-11-07 04:49:56,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-07 04:49:56,127 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 214 [2020-11-07 04:49:56,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:49:56,129 INFO L225 Difference]: With dead ends: 690 [2020-11-07 04:49:56,129 INFO L226 Difference]: Without dead ends: 473 [2020-11-07 04:49:56,131 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-11-07 04:49:56,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2020-11-07 04:49:56,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 373. [2020-11-07 04:49:56,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-11-07 04:49:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 459 transitions. [2020-11-07 04:49:56,241 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 459 transitions. Word has length 214 [2020-11-07 04:49:56,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:49:56,241 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 459 transitions. [2020-11-07 04:49:56,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-07 04:49:56,242 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 459 transitions. [2020-11-07 04:49:56,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2020-11-07 04:49:56,243 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:49:56,244 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-11-07 04:49:56,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-11-07 04:49:56,244 INFO L429 AbstractCegarLoop]: === Iteration 45 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:49:56,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:49:56,244 INFO L82 PathProgramCache]: Analyzing trace with hash -61100405, now seen corresponding path program 21 times [2020-11-07 04:49:56,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:49:56,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [429027994] [2020-11-07 04:49:56,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:49:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:56,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:49:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:56,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:49:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:56,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:49:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:56,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-11-07 04:49:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:56,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2020-11-07 04:49:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:56,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2020-11-07 04:49:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 6 proven. 1104 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:49:57,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [429027994] [2020-11-07 04:49:57,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:49:57,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-11-07 04:49:57,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639659447] [2020-11-07 04:49:57,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-11-07 04:49:57,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:49:57,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-07 04:49:57,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=349, Unknown=0, NotChecked=0, Total=650 [2020-11-07 04:49:57,072 INFO L87 Difference]: Start difference. First operand 373 states and 459 transitions. Second operand 26 states. [2020-11-07 04:50:01,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:01,141 INFO L93 Difference]: Finished difference Result 867 states and 1045 transitions. [2020-11-07 04:50:01,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-07 04:50:01,142 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 219 [2020-11-07 04:50:01,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:01,146 INFO L225 Difference]: With dead ends: 867 [2020-11-07 04:50:01,146 INFO L226 Difference]: Without dead ends: 643 [2020-11-07 04:50:01,148 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=946, Invalid=1504, Unknown=0, NotChecked=0, Total=2450 [2020-11-07 04:50:01,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2020-11-07 04:50:01,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 383. [2020-11-07 04:50:01,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-11-07 04:50:01,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 472 transitions. [2020-11-07 04:50:01,299 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 472 transitions. Word has length 219 [2020-11-07 04:50:01,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:01,299 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 472 transitions. [2020-11-07 04:50:01,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-11-07 04:50:01,300 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 472 transitions. [2020-11-07 04:50:01,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2020-11-07 04:50:01,301 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:01,302 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-11-07 04:50:01,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-11-07 04:50:01,302 INFO L429 AbstractCegarLoop]: === Iteration 46 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:01,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:01,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2041403417, now seen corresponding path program 20 times [2020-11-07 04:50:01,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:01,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1164991869] [2020-11-07 04:50:01,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:01,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:01,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:01,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:02,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-11-07 04:50:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:02,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2020-11-07 04:50:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:02,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2020-11-07 04:50:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 7 proven. 1064 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:50:02,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1164991869] [2020-11-07 04:50:02,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:02,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-11-07 04:50:02,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511168508] [2020-11-07 04:50:02,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-11-07 04:50:02,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:02,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-07 04:50:02,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2020-11-07 04:50:02,313 INFO L87 Difference]: Start difference. First operand 383 states and 472 transitions. Second operand 26 states. [2020-11-07 04:50:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:09,236 INFO L93 Difference]: Finished difference Result 709 states and 887 transitions. [2020-11-07 04:50:09,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-07 04:50:09,237 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 219 [2020-11-07 04:50:09,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:09,240 INFO L225 Difference]: With dead ends: 709 [2020-11-07 04:50:09,240 INFO L226 Difference]: Without dead ends: 487 [2020-11-07 04:50:09,242 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=316, Invalid=2134, Unknown=0, NotChecked=0, Total=2450 [2020-11-07 04:50:09,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2020-11-07 04:50:09,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 383. [2020-11-07 04:50:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-11-07 04:50:09,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 472 transitions. [2020-11-07 04:50:09,339 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 472 transitions. Word has length 219 [2020-11-07 04:50:09,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:09,339 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 472 transitions. [2020-11-07 04:50:09,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-11-07 04:50:09,339 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 472 transitions. [2020-11-07 04:50:09,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2020-11-07 04:50:09,340 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:09,340 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-11-07 04:50:09,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-11-07 04:50:09,341 INFO L429 AbstractCegarLoop]: === Iteration 47 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:09,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:09,341 INFO L82 PathProgramCache]: Analyzing trace with hash 647259720, now seen corresponding path program 22 times [2020-11-07 04:50:09,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:09,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2125016428] [2020-11-07 04:50:09,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:09,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:09,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:09,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:10,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2020-11-07 04:50:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:10,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2020-11-07 04:50:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:10,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2020-11-07 04:50:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 6 proven. 1211 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:50:10,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2125016428] [2020-11-07 04:50:10,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:10,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-11-07 04:50:10,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825070477] [2020-11-07 04:50:10,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-11-07 04:50:10,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:10,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-11-07 04:50:10,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=376, Unknown=0, NotChecked=0, Total=702 [2020-11-07 04:50:10,172 INFO L87 Difference]: Start difference. First operand 383 states and 472 transitions. Second operand 27 states. [2020-11-07 04:50:13,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:13,725 INFO L93 Difference]: Finished difference Result 894 states and 1078 transitions. [2020-11-07 04:50:13,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 04:50:13,725 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 224 [2020-11-07 04:50:13,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:13,728 INFO L225 Difference]: With dead ends: 894 [2020-11-07 04:50:13,729 INFO L226 Difference]: Without dead ends: 665 [2020-11-07 04:50:13,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1023, Invalid=1629, Unknown=0, NotChecked=0, Total=2652 [2020-11-07 04:50:13,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2020-11-07 04:50:13,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 393. [2020-11-07 04:50:13,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-11-07 04:50:13,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 485 transitions. [2020-11-07 04:50:13,826 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 485 transitions. Word has length 224 [2020-11-07 04:50:13,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:13,827 INFO L481 AbstractCegarLoop]: Abstraction has 393 states and 485 transitions. [2020-11-07 04:50:13,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-11-07 04:50:13,827 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 485 transitions. [2020-11-07 04:50:13,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2020-11-07 04:50:13,828 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:13,828 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-11-07 04:50:13,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-11-07 04:50:13,828 INFO L429 AbstractCegarLoop]: === Iteration 48 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:13,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:13,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1545203754, now seen corresponding path program 21 times [2020-11-07 04:50:13,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:13,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [906413024] [2020-11-07 04:50:13,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:13,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:13,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:13,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:14,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2020-11-07 04:50:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:14,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2020-11-07 04:50:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:14,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2020-11-07 04:50:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1206 backedges. 7 proven. 1169 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:50:14,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [906413024] [2020-11-07 04:50:14,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:14,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-11-07 04:50:14,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781096591] [2020-11-07 04:50:14,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-11-07 04:50:14,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:14,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-11-07 04:50:14,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2020-11-07 04:50:14,895 INFO L87 Difference]: Start difference. First operand 393 states and 485 transitions. Second operand 27 states. [2020-11-07 04:50:23,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:23,403 INFO L93 Difference]: Finished difference Result 728 states and 912 transitions. [2020-11-07 04:50:23,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 04:50:23,404 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 224 [2020-11-07 04:50:23,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:23,408 INFO L225 Difference]: With dead ends: 728 [2020-11-07 04:50:23,408 INFO L226 Difference]: Without dead ends: 501 [2020-11-07 04:50:23,410 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=330, Invalid=2322, Unknown=0, NotChecked=0, Total=2652 [2020-11-07 04:50:23,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2020-11-07 04:50:23,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 393. [2020-11-07 04:50:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-11-07 04:50:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 485 transitions. [2020-11-07 04:50:23,519 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 485 transitions. Word has length 224 [2020-11-07 04:50:23,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:23,520 INFO L481 AbstractCegarLoop]: Abstraction has 393 states and 485 transitions. [2020-11-07 04:50:23,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-11-07 04:50:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 485 transitions. [2020-11-07 04:50:23,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2020-11-07 04:50:23,522 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:23,522 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-11-07 04:50:23,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-11-07 04:50:23,522 INFO L429 AbstractCegarLoop]: === Iteration 49 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:23,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:23,523 INFO L82 PathProgramCache]: Analyzing trace with hash 683277483, now seen corresponding path program 23 times [2020-11-07 04:50:23,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:23,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [153988933] [2020-11-07 04:50:23,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:23,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:23,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:23,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:24,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-11-07 04:50:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:24,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-11-07 04:50:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:24,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2020-11-07 04:50:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1362 backedges. 6 proven. 1323 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:50:24,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [153988933] [2020-11-07 04:50:24,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:24,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-11-07 04:50:24,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080256867] [2020-11-07 04:50:24,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-11-07 04:50:24,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:24,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-11-07 04:50:24,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=404, Unknown=0, NotChecked=0, Total=756 [2020-11-07 04:50:24,362 INFO L87 Difference]: Start difference. First operand 393 states and 485 transitions. Second operand 28 states. [2020-11-07 04:50:28,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:28,229 INFO L93 Difference]: Finished difference Result 921 states and 1111 transitions. [2020-11-07 04:50:28,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-07 04:50:28,229 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 229 [2020-11-07 04:50:28,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:28,233 INFO L225 Difference]: With dead ends: 921 [2020-11-07 04:50:28,234 INFO L226 Difference]: Without dead ends: 687 [2020-11-07 04:50:28,236 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-11-07 04:50:28,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-11-07 04:50:28,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 403. [2020-11-07 04:50:28,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-11-07 04:50:28,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 498 transitions. [2020-11-07 04:50:28,369 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 498 transitions. Word has length 229 [2020-11-07 04:50:28,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:28,369 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 498 transitions. [2020-11-07 04:50:28,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-11-07 04:50:28,370 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 498 transitions. [2020-11-07 04:50:28,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2020-11-07 04:50:28,371 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:28,371 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-11-07 04:50:28,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-11-07 04:50:28,371 INFO L429 AbstractCegarLoop]: === Iteration 50 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:28,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:28,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1509185991, now seen corresponding path program 22 times [2020-11-07 04:50:28,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:28,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [437727874] [2020-11-07 04:50:28,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:28,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:28,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:28,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:29,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-11-07 04:50:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:29,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-11-07 04:50:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:29,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2020-11-07 04:50:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:29,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1316 backedges. 7 proven. 1279 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:50:29,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [437727874] [2020-11-07 04:50:29,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:29,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-11-07 04:50:29,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7322560] [2020-11-07 04:50:29,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-11-07 04:50:29,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:29,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-11-07 04:50:29,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2020-11-07 04:50:29,524 INFO L87 Difference]: Start difference. First operand 403 states and 498 transitions. Second operand 28 states. [2020-11-07 04:50:38,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:38,946 INFO L93 Difference]: Finished difference Result 747 states and 937 transitions. [2020-11-07 04:50:38,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-07 04:50:38,952 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 229 [2020-11-07 04:50:38,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:38,955 INFO L225 Difference]: With dead ends: 747 [2020-11-07 04:50:38,955 INFO L226 Difference]: Without dead ends: 515 [2020-11-07 04:50:38,958 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=344, Invalid=2518, Unknown=0, NotChecked=0, Total=2862 [2020-11-07 04:50:38,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2020-11-07 04:50:39,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 403. [2020-11-07 04:50:39,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-11-07 04:50:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 498 transitions. [2020-11-07 04:50:39,105 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 498 transitions. Word has length 229 [2020-11-07 04:50:39,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:39,105 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 498 transitions. [2020-11-07 04:50:39,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-11-07 04:50:39,105 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 498 transitions. [2020-11-07 04:50:39,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-11-07 04:50:39,106 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:39,106 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-11-07 04:50:39,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-11-07 04:50:39,107 INFO L429 AbstractCegarLoop]: === Iteration 51 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:39,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:39,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1435626536, now seen corresponding path program 24 times [2020-11-07 04:50:39,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:39,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [429840686] [2020-11-07 04:50:39,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:39,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:39,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:39,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:39,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-11-07 04:50:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:39,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-11-07 04:50:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:39,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2020-11-07 04:50:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:40,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 6 proven. 1440 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:50:40,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [429840686] [2020-11-07 04:50:40,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:40,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2020-11-07 04:50:40,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939517303] [2020-11-07 04:50:40,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-11-07 04:50:40,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:40,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-11-07 04:50:40,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=433, Unknown=0, NotChecked=0, Total=812 [2020-11-07 04:50:40,047 INFO L87 Difference]: Start difference. First operand 403 states and 498 transitions. Second operand 29 states. [2020-11-07 04:50:44,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:44,960 INFO L93 Difference]: Finished difference Result 948 states and 1144 transitions. [2020-11-07 04:50:44,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-07 04:50:44,961 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 234 [2020-11-07 04:50:44,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:44,965 INFO L225 Difference]: With dead ends: 948 [2020-11-07 04:50:44,965 INFO L226 Difference]: Without dead ends: 709 [2020-11-07 04:50:44,966 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-11-07 04:50:44,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2020-11-07 04:50:45,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 413. [2020-11-07 04:50:45,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2020-11-07 04:50:45,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 511 transitions. [2020-11-07 04:50:45,087 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 511 transitions. Word has length 234 [2020-11-07 04:50:45,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:45,087 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 511 transitions. [2020-11-07 04:50:45,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-11-07 04:50:45,087 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 511 transitions. [2020-11-07 04:50:45,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-11-07 04:50:45,089 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:45,089 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-11-07 04:50:45,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-11-07 04:50:45,089 INFO L429 AbstractCegarLoop]: === Iteration 52 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:45,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:45,090 INFO L82 PathProgramCache]: Analyzing trace with hash -756836938, now seen corresponding path program 23 times [2020-11-07 04:50:45,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:45,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1300727834] [2020-11-07 04:50:45,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:45,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:45,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:45,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:45,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-11-07 04:50:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:45,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-11-07 04:50:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:45,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2020-11-07 04:50:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:45,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2020-11-07 04:50:45,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1300727834] [2020-11-07 04:50:45,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:45,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 04:50:45,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157578843] [2020-11-07 04:50:45,467 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 04:50:45,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:45,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 04:50:45,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-11-07 04:50:45,468 INFO L87 Difference]: Start difference. First operand 413 states and 511 transitions. Second operand 11 states. [2020-11-07 04:50:47,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:47,180 INFO L93 Difference]: Finished difference Result 470 states and 592 transitions. [2020-11-07 04:50:47,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 04:50:47,181 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 234 [2020-11-07 04:50:47,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:47,184 INFO L225 Difference]: With dead ends: 470 [2020-11-07 04:50:47,185 INFO L226 Difference]: Without dead ends: 461 [2020-11-07 04:50:47,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2020-11-07 04:50:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2020-11-07 04:50:47,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 447. [2020-11-07 04:50:47,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2020-11-07 04:50:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 558 transitions. [2020-11-07 04:50:47,317 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 558 transitions. Word has length 234 [2020-11-07 04:50:47,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:47,317 INFO L481 AbstractCegarLoop]: Abstraction has 447 states and 558 transitions. [2020-11-07 04:50:47,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 04:50:47,317 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 558 transitions. [2020-11-07 04:50:47,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-11-07 04:50:47,319 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:47,320 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-11-07 04:50:47,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-11-07 04:50:47,320 INFO L429 AbstractCegarLoop]: === Iteration 53 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:47,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:47,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1646971217, now seen corresponding path program 1 times [2020-11-07 04:50:47,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:47,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [190896643] [2020-11-07 04:50:47,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:47,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:47,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:47,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:47,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-11-07 04:50:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:47,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-11-07 04:50:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:47,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2020-11-07 04:50:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2020-11-07 04:50:47,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [190896643] [2020-11-07 04:50:47,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:50:47,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 04:50:47,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963143648] [2020-11-07 04:50:47,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 04:50:47,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:47,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 04:50:47,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 04:50:47,478 INFO L87 Difference]: Start difference. First operand 447 states and 558 transitions. Second operand 7 states. [2020-11-07 04:50:48,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:48,480 INFO L93 Difference]: Finished difference Result 454 states and 564 transitions. [2020-11-07 04:50:48,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 04:50:48,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 236 [2020-11-07 04:50:48,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:48,485 INFO L225 Difference]: With dead ends: 454 [2020-11-07 04:50:48,485 INFO L226 Difference]: Without dead ends: 441 [2020-11-07 04:50:48,485 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-11-07 04:50:48,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2020-11-07 04:50:48,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2020-11-07 04:50:48,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-11-07 04:50:48,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 550 transitions. [2020-11-07 04:50:48,654 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 550 transitions. Word has length 236 [2020-11-07 04:50:48,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:48,654 INFO L481 AbstractCegarLoop]: Abstraction has 441 states and 550 transitions. [2020-11-07 04:50:48,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 04:50:48,654 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 550 transitions. [2020-11-07 04:50:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2020-11-07 04:50:48,657 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:48,657 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-11-07 04:50:48,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-11-07 04:50:48,657 INFO L429 AbstractCegarLoop]: === Iteration 54 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:48,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:48,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1615315333, now seen corresponding path program 1 times [2020-11-07 04:50:48,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:48,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [565516807] [2020-11-07 04:50:48,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-07 04:50:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2020-11-07 04:50:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-11-07 04:50:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2020-11-07 04:50:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1433 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1408 trivial. 0 not checked. [2020-11-07 04:50:48,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [565516807] [2020-11-07 04:50:48,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:48,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-07 04:50:48,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826386929] [2020-11-07 04:50:48,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 04:50:48,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:48,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 04:50:48,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-07 04:50:48,901 INFO L87 Difference]: Start difference. First operand 441 states and 550 transitions. Second operand 6 states. [2020-11-07 04:50:49,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:49,679 INFO L93 Difference]: Finished difference Result 701 states and 878 transitions. [2020-11-07 04:50:49,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 04:50:49,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2020-11-07 04:50:49,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:49,688 INFO L225 Difference]: With dead ends: 701 [2020-11-07 04:50:49,688 INFO L226 Difference]: Without dead ends: 289 [2020-11-07 04:50:49,690 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-11-07 04:50:49,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-11-07 04:50:49,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 272. [2020-11-07 04:50:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2020-11-07 04:50:49,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 336 transitions. [2020-11-07 04:50:49,786 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 336 transitions. Word has length 239 [2020-11-07 04:50:49,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:49,786 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 336 transitions. [2020-11-07 04:50:49,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 04:50:49,786 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 336 transitions. [2020-11-07 04:50:49,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2020-11-07 04:50:49,788 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:49,788 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-11-07 04:50:49,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-11-07 04:50:49,789 INFO L429 AbstractCegarLoop]: === Iteration 55 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:49,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:49,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1727576548, now seen corresponding path program 1 times [2020-11-07 04:50:49,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:49,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1793059043] [2020-11-07 04:50:49,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:49,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:49,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:49,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:49,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-11-07 04:50:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:49,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-11-07 04:50:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:49,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2020-11-07 04:50:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2020-11-07 04:50:50,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1793059043] [2020-11-07 04:50:50,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:50:50,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 04:50:50,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342300593] [2020-11-07 04:50:50,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 04:50:50,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:50,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 04:50:50,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-07 04:50:50,101 INFO L87 Difference]: Start difference. First operand 272 states and 336 transitions. Second operand 9 states. [2020-11-07 04:50:51,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:51,488 INFO L93 Difference]: Finished difference Result 327 states and 399 transitions. [2020-11-07 04:50:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 04:50:51,489 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 245 [2020-11-07 04:50:51,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:51,491 INFO L225 Difference]: With dead ends: 327 [2020-11-07 04:50:51,491 INFO L226 Difference]: Without dead ends: 307 [2020-11-07 04:50:51,492 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-11-07 04:50:51,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2020-11-07 04:50:51,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 278. [2020-11-07 04:50:51,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2020-11-07 04:50:51,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 342 transitions. [2020-11-07 04:50:51,592 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 342 transitions. Word has length 245 [2020-11-07 04:50:51,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:51,593 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 342 transitions. [2020-11-07 04:50:51,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 04:50:51,593 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 342 transitions. [2020-11-07 04:50:51,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2020-11-07 04:50:51,595 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:51,595 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-11-07 04:50:51,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-11-07 04:50:51,595 INFO L429 AbstractCegarLoop]: === Iteration 56 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:51,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:51,596 INFO L82 PathProgramCache]: Analyzing trace with hash -685351208, now seen corresponding path program 1 times [2020-11-07 04:50:51,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:51,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [931960615] [2020-11-07 04:50:51,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-11-07 04:50:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-11-07 04:50:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2020-11-07 04:50:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1415 trivial. 0 not checked. [2020-11-07 04:50:51,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [931960615] [2020-11-07 04:50:51,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:51,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 04:50:51,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284719320] [2020-11-07 04:50:51,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 04:50:51,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:51,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 04:50:51,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-11-07 04:50:51,999 INFO L87 Difference]: Start difference. First operand 278 states and 342 transitions. Second operand 11 states. [2020-11-07 04:50:53,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:53,859 INFO L93 Difference]: Finished difference Result 344 states and 413 transitions. [2020-11-07 04:50:53,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 04:50:53,859 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 249 [2020-11-07 04:50:53,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:53,861 INFO L225 Difference]: With dead ends: 344 [2020-11-07 04:50:53,861 INFO L226 Difference]: Without dead ends: 281 [2020-11-07 04:50:53,862 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-11-07 04:50:53,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-11-07 04:50:53,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 278. [2020-11-07 04:50:53,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2020-11-07 04:50:53,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 342 transitions. [2020-11-07 04:50:53,961 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 342 transitions. Word has length 249 [2020-11-07 04:50:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:53,961 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 342 transitions. [2020-11-07 04:50:53,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 04:50:53,961 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 342 transitions. [2020-11-07 04:50:53,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2020-11-07 04:50:53,962 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:53,962 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:53,963 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2020-11-07 04:50:53,963 INFO L429 AbstractCegarLoop]: === Iteration 57 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:53,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:53,963 INFO L82 PathProgramCache]: Analyzing trace with hash -6499881, now seen corresponding path program 1 times [2020-11-07 04:50:53,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:53,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1065273932] [2020-11-07 04:50:53,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:54,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:54,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:54,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:54,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-11-07 04:50:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:54,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-11-07 04:50:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:54,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2020-11-07 04:50:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:54,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1433 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1424 trivial. 0 not checked. [2020-11-07 04:50:54,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1065273932] [2020-11-07 04:50:54,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:54,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 04:50:54,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610091097] [2020-11-07 04:50:54,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 04:50:54,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:54,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 04:50:54,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-11-07 04:50:54,316 INFO L87 Difference]: Start difference. First operand 278 states and 342 transitions. Second operand 10 states. [2020-11-07 04:50:56,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:56,270 INFO L93 Difference]: Finished difference Result 341 states and 412 transitions. [2020-11-07 04:50:56,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 04:50:56,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 250 [2020-11-07 04:50:56,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:56,273 INFO L225 Difference]: With dead ends: 341 [2020-11-07 04:50:56,273 INFO L226 Difference]: Without dead ends: 328 [2020-11-07 04:50:56,274 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-11-07 04:50:56,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-11-07 04:50:56,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 320. [2020-11-07 04:50:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2020-11-07 04:50:56,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 391 transitions. [2020-11-07 04:50:56,410 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 391 transitions. Word has length 250 [2020-11-07 04:50:56,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:56,411 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 391 transitions. [2020-11-07 04:50:56,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 04:50:56,411 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 391 transitions. [2020-11-07 04:50:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2020-11-07 04:50:56,412 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:56,413 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:56,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2020-11-07 04:50:56,413 INFO L429 AbstractCegarLoop]: === Iteration 58 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:56,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:56,413 INFO L82 PathProgramCache]: Analyzing trace with hash 207786891, now seen corresponding path program 1 times [2020-11-07 04:50:56,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:56,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [925584280] [2020-11-07 04:50:56,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-11-07 04:50:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-11-07 04:50:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2020-11-07 04:50:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1433 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1424 trivial. 0 not checked. [2020-11-07 04:50:56,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [925584280] [2020-11-07 04:50:56,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:56,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 04:50:56,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338401505] [2020-11-07 04:50:56,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 04:50:56,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:56,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 04:50:56,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-11-07 04:50:56,792 INFO L87 Difference]: Start difference. First operand 320 states and 391 transitions. Second operand 11 states. [2020-11-07 04:50:58,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:58,954 INFO L93 Difference]: Finished difference Result 333 states and 403 transitions. [2020-11-07 04:50:58,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 04:50:58,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 253 [2020-11-07 04:50:58,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:58,958 INFO L225 Difference]: With dead ends: 333 [2020-11-07 04:50:58,959 INFO L226 Difference]: Without dead ends: 306 [2020-11-07 04:50:58,959 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-11-07 04:50:58,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-11-07 04:50:59,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 277. [2020-11-07 04:50:59,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2020-11-07 04:50:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 314 transitions. [2020-11-07 04:50:59,058 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 314 transitions. Word has length 253 [2020-11-07 04:50:59,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:59,058 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 314 transitions. [2020-11-07 04:50:59,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 04:50:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 314 transitions. [2020-11-07 04:50:59,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-11-07 04:50:59,059 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:59,059 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-11-07 04:50:59,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2020-11-07 04:50:59,060 INFO L429 AbstractCegarLoop]: === Iteration 59 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:59,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:59,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1976498843, now seen corresponding path program 1 times [2020-11-07 04:50:59,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:59,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [278751309] [2020-11-07 04:50:59,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-11-07 04:50:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2020-11-07 04:50:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2020-11-07 04:50:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2020-11-07 04:50:59,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [278751309] [2020-11-07 04:50:59,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:59,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 04:50:59,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523164132] [2020-11-07 04:50:59,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 04:50:59,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:59,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 04:50:59,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-11-07 04:50:59,509 INFO L87 Difference]: Start difference. First operand 277 states and 314 transitions. Second operand 10 states. [2020-11-07 04:51:01,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:51:01,364 INFO L93 Difference]: Finished difference Result 306 states and 347 transitions. [2020-11-07 04:51:01,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 04:51:01,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 254 [2020-11-07 04:51:01,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:51:01,366 INFO L225 Difference]: With dead ends: 306 [2020-11-07 04:51:01,366 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 04:51:01,367 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2020-11-07 04:51:01,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 04:51:01,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 04:51:01,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 04:51:01,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 04:51:01,368 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 254 [2020-11-07 04:51:01,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:51:01,368 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 04:51:01,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 04:51:01,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 04:51:01,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 04:51:01,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2020-11-07 04:51:01,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 04:51:01,984 WARN L194 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 82 [2020-11-07 04:51:02,205 WARN L194 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 35 [2020-11-07 04:51:02,568 WARN L194 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 82 [2020-11-07 04:51:02,710 WARN L194 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 35 [2020-11-07 04:51:02,844 WARN L194 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 35 [2020-11-07 04:51:03,180 WARN L194 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 35 [2020-11-07 04:51:03,771 WARN L194 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 35 [2020-11-07 04:51:04,022 WARN L194 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 35 [2020-11-07 04:51:04,348 WARN L194 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 82 [2020-11-07 04:51:04,777 WARN L194 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 35 [2020-11-07 04:51:05,207 WARN L194 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 35 [2020-11-07 04:51:05,513 WARN L194 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 35 [2020-11-07 04:51:05,705 WARN L194 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 81 [2020-11-07 04:51:06,024 WARN L194 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 35 [2020-11-07 04:51:06,146 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 35 [2020-11-07 04:51:06,554 WARN L194 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 35 [2020-11-07 04:51:06,894 WARN L194 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 35 [2020-11-07 04:51:07,199 WARN L194 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 35 [2020-11-07 04:51:07,448 WARN L194 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 35 [2020-11-07 04:51:08,199 WARN L194 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 44 [2020-11-07 04:51:48,187 WARN L194 SmtUtils]: Spent 39.98 s on a formula simplification. DAG size of input: 1316 DAG size of output: 730 [2020-11-07 04:51:49,148 WARN L194 SmtUtils]: Spent 956.00 ms on a formula simplification. DAG size of input: 263 DAG size of output: 44 [2020-11-07 04:51:59,312 WARN L194 SmtUtils]: Spent 10.16 s on a formula simplification. DAG size of input: 598 DAG size of output: 42 [2020-11-07 04:52:38,105 WARN L194 SmtUtils]: Spent 38.79 s on a formula simplification. DAG size of input: 1316 DAG size of output: 730 [2020-11-07 04:52:42,241 WARN L194 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 442 DAG size of output: 42 [2020-11-07 04:52:49,796 WARN L194 SmtUtils]: Spent 7.55 s on a formula simplification. DAG size of input: 544 DAG size of output: 42 [2020-11-07 04:52:50,249 WARN L194 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 44 [2020-11-07 04:53:12,762 WARN L194 SmtUtils]: Spent 22.45 s on a formula simplification. DAG size of input: 771 DAG size of output: 45 [2020-11-07 04:53:12,901 WARN L194 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 44 [2020-11-07 04:53:14,713 WARN L194 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 348 DAG size of output: 42 [2020-11-07 04:53:16,105 WARN L194 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 305 DAG size of output: 44 [2020-11-07 04:54:40,138 WARN L194 SmtUtils]: Spent 1.40 m on a formula simplification. DAG size of input: 1247 DAG size of output: 44 [2020-11-07 04:55:15,280 WARN L194 SmtUtils]: Spent 35.14 s on a formula simplification. DAG size of input: 897 DAG size of output: 45 [2020-11-07 04:55:54,344 WARN L194 SmtUtils]: Spent 39.06 s on a formula simplification. DAG size of input: 1316 DAG size of output: 730 [2020-11-07 04:56:52,149 WARN L194 SmtUtils]: Spent 57.80 s on a formula simplification. DAG size of input: 1101 DAG size of output: 45 [2020-11-07 04:58:46,545 WARN L194 SmtUtils]: Spent 1.91 m on a formula simplification. DAG size of input: 1288 DAG size of output: 44 [2020-11-07 04:59:00,855 WARN L194 SmtUtils]: Spent 14.31 s on a formula simplification. DAG size of input: 654 DAG size of output: 42 [2020-11-07 04:59:26,860 WARN L194 SmtUtils]: Spent 26.00 s on a formula simplification. DAG size of input: 833 DAG size of output: 45 [2020-11-07 05:00:34,760 WARN L194 SmtUtils]: Spent 1.13 m on a formula simplification. DAG size of input: 1646 DAG size of output: 1074