/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_i25_o25-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 20:27:20,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 20:27:20,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 20:27:20,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 20:27:20,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 20:27:20,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 20:27:20,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 20:27:20,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 20:27:20,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 20:27:20,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 20:27:20,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 20:27:20,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 20:27:20,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 20:27:20,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 20:27:20,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 20:27:20,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 20:27:20,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 20:27:20,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 20:27:20,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 20:27:20,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 20:27:20,426 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 20:27:20,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 20:27:20,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 20:27:20,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 20:27:20,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 20:27:20,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 20:27:20,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 20:27:20,454 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 20:27:20,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 20:27:20,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 20:27:20,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 20:27:20,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 20:27:20,459 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 20:27:20,460 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 20:27:20,461 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 20:27:20,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 20:27:20,462 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 20:27:20,462 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 20:27:20,463 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 20:27:20,463 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 20:27:20,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 20:27:20,465 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-23 20:27:20,488 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 20:27:20,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 20:27:20,492 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 20:27:20,493 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 20:27:20,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 20:27:20,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 20:27:20,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 20:27:20,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 20:27:20,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 20:27:20,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 20:27:20,496 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 20:27:20,496 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 20:27:20,497 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 20:27:20,497 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 20:27:20,497 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 20:27:20,498 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-23 20:27:20,498 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 20:27:20,498 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 20:27:20,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 20:27:20,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 20:27:20,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-23 20:27:20,501 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 20:27:20,501 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-10-23 20:27:20,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 20:27:20,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 20:27:20,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 20:27:20,992 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 20:27:20,992 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 20:27:20,993 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i25_o25-1.c [2020-10-23 20:27:21,089 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62cb37501/86a26923d5c64531932e9da93f64465f/FLAGf3095adfc [2020-10-23 20:27:21,829 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 20:27:21,830 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i25_o25-1.c [2020-10-23 20:27:21,837 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62cb37501/86a26923d5c64531932e9da93f64465f/FLAGf3095adfc [2020-10-23 20:27:22,179 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62cb37501/86a26923d5c64531932e9da93f64465f [2020-10-23 20:27:22,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 20:27:22,195 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 20:27:22,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 20:27:22,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 20:27:22,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 20:27:22,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:27:22" (1/1) ... [2020-10-23 20:27:22,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45108812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:22, skipping insertion in model container [2020-10-23 20:27:22,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:27:22" (1/1) ... [2020-10-23 20:27:22,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 20:27:22,233 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 20:27:22,392 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:27:22,403 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 20:27:22,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:27:22,433 INFO L208 MainTranslator]: Completed translation [2020-10-23 20:27:22,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:22 WrapperNode [2020-10-23 20:27:22,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 20:27:22,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 20:27:22,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 20:27:22,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 20:27:22,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:22" (1/1) ... [2020-10-23 20:27:22,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:22" (1/1) ... [2020-10-23 20:27:22,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:22" (1/1) ... [2020-10-23 20:27:22,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:22" (1/1) ... [2020-10-23 20:27:22,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:22" (1/1) ... [2020-10-23 20:27:22,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:22" (1/1) ... [2020-10-23 20:27:22,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:22" (1/1) ... [2020-10-23 20:27:22,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 20:27:22,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 20:27:22,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 20:27:22,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 20:27:22,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 20:27:22,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 20:27:22,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 20:27:22,558 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 20:27:22,558 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-10-23 20:27:22,558 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 20:27:22,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-23 20:27:22,559 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 20:27:22,559 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 20:27:22,559 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 20:27:22,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 20:27:22,560 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-10-23 20:27:22,560 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 20:27:22,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 20:27:22,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 20:27:22,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 20:27:22,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 20:27:22,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 20:27:22,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 20:27:23,030 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 20:27:23,031 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-23 20:27:23,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:27:23 BoogieIcfgContainer [2020-10-23 20:27:23,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 20:27:23,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 20:27:23,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 20:27:23,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 20:27:23,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:27:22" (1/3) ... [2020-10-23 20:27:23,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c139fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:27:23, skipping insertion in model container [2020-10-23 20:27:23,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:22" (2/3) ... [2020-10-23 20:27:23,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c139fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:27:23, skipping insertion in model container [2020-10-23 20:27:23,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:27:23" (3/3) ... [2020-10-23 20:27:23,051 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i25_o25-1.c [2020-10-23 20:27:23,068 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-23 20:27:23,074 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 20:27:23,103 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 20:27:23,160 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 20:27:23,161 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 20:27:23,161 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-10-23 20:27:23,161 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 20:27:23,161 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 20:27:23,161 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 20:27:23,161 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 20:27:23,162 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 20:27:23,182 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-10-23 20:27:23,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-23 20:27:23,197 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:23,199 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:23,200 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:23,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:23,213 INFO L82 PathProgramCache]: Analyzing trace with hash -742560695, now seen corresponding path program 1 times [2020-10-23 20:27:23,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:23,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1579202792] [2020-10-23 20:27:23,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:23,323 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:27:23,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1579202792] [2020-10-23 20:27:23,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:23,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 20:27:23,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772952945] [2020-10-23 20:27:23,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 20:27:23,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:23,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 20:27:23,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-23 20:27:23,755 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 6 states. [2020-10-23 20:27:24,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:24,035 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-10-23 20:27:24,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-23 20:27:24,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-23 20:27:24,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:24,049 INFO L225 Difference]: With dead ends: 50 [2020-10-23 20:27:24,050 INFO L226 Difference]: Without dead ends: 32 [2020-10-23 20:27:24,054 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-23 20:27:24,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-10-23 20:27:24,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-10-23 20:27:24,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-23 20:27:24,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-10-23 20:27:24,114 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-10-23 20:27:24,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:24,115 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-10-23 20:27:24,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 20:27:24,115 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-10-23 20:27:24,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-23 20:27:24,118 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:24,118 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:24,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 20:27:24,119 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:24,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:24,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1024612499, now seen corresponding path program 1 times [2020-10-23 20:27:24,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:24,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1138790016] [2020-10-23 20:27:24,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:24,125 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-23 20:27:24,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1138790016] [2020-10-23 20:27:24,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:24,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-23 20:27:24,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591270289] [2020-10-23 20:27:24,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 20:27:24,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:24,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 20:27:24,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-23 20:27:24,295 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2020-10-23 20:27:24,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:24,532 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-10-23 20:27:24,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-23 20:27:24,533 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-10-23 20:27:24,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:24,535 INFO L225 Difference]: With dead ends: 44 [2020-10-23 20:27:24,535 INFO L226 Difference]: Without dead ends: 37 [2020-10-23 20:27:24,537 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:27:24,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-23 20:27:24,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-23 20:27:24,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-23 20:27:24,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-10-23 20:27:24,550 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2020-10-23 20:27:24,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:24,551 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-10-23 20:27:24,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 20:27:24,551 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-10-23 20:27:24,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-23 20:27:24,553 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:24,553 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:24,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 20:27:24,554 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:24,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:24,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1157111945, now seen corresponding path program 2 times [2020-10-23 20:27:24,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:24,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [551166297] [2020-10-23 20:27:24,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:24,558 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,718 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-23 20:27:24,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [551166297] [2020-10-23 20:27:24,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:24,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 20:27:24,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351741464] [2020-10-23 20:27:24,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 20:27:24,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:24,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 20:27:24,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-23 20:27:24,722 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2020-10-23 20:27:25,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:25,057 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-10-23 20:27:25,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 20:27:25,057 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-10-23 20:27:25,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:25,059 INFO L225 Difference]: With dead ends: 49 [2020-10-23 20:27:25,059 INFO L226 Difference]: Without dead ends: 42 [2020-10-23 20:27:25,060 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-23 20:27:25,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-10-23 20:27:25,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-10-23 20:27:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-23 20:27:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-10-23 20:27:25,074 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 41 [2020-10-23 20:27:25,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:25,075 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-10-23 20:27:25,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 20:27:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-10-23 20:27:25,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-23 20:27:25,077 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:25,077 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:25,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 20:27:25,078 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:25,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:25,079 INFO L82 PathProgramCache]: Analyzing trace with hash 2083092563, now seen corresponding path program 3 times [2020-10-23 20:27:25,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:25,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [97412150] [2020-10-23 20:27:25,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:25,083 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-23 20:27:25,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [97412150] [2020-10-23 20:27:25,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:25,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 20:27:25,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524941892] [2020-10-23 20:27:25,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 20:27:25,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:25,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 20:27:25,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-23 20:27:25,277 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 9 states. [2020-10-23 20:27:25,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:25,666 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-10-23 20:27:25,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 20:27:25,667 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-10-23 20:27:25,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:25,669 INFO L225 Difference]: With dead ends: 54 [2020-10-23 20:27:25,669 INFO L226 Difference]: Without dead ends: 47 [2020-10-23 20:27:25,670 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-10-23 20:27:25,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-23 20:27:25,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-23 20:27:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-23 20:27:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-10-23 20:27:25,684 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 49 [2020-10-23 20:27:25,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:25,684 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-10-23 20:27:25,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 20:27:25,684 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-10-23 20:27:25,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-10-23 20:27:25,686 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:25,687 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:25,687 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 20:27:25,687 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:25,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:25,688 INFO L82 PathProgramCache]: Analyzing trace with hash 2025718985, now seen corresponding path program 4 times [2020-10-23 20:27:25,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:25,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1651194871] [2020-10-23 20:27:25,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:25,691 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,905 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-23 20:27:25,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1651194871] [2020-10-23 20:27:25,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:25,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 20:27:25,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854297357] [2020-10-23 20:27:25,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 20:27:25,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:25,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 20:27:25,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-23 20:27:25,908 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 10 states. [2020-10-23 20:27:26,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:26,380 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-10-23 20:27:26,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-23 20:27:26,381 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-10-23 20:27:26,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:26,382 INFO L225 Difference]: With dead ends: 59 [2020-10-23 20:27:26,383 INFO L226 Difference]: Without dead ends: 52 [2020-10-23 20:27:26,384 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-10-23 20:27:26,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-10-23 20:27:26,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-10-23 20:27:26,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-23 20:27:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2020-10-23 20:27:26,401 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 57 [2020-10-23 20:27:26,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:26,401 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2020-10-23 20:27:26,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 20:27:26,401 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-10-23 20:27:26,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-23 20:27:26,403 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:26,404 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:26,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 20:27:26,404 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:26,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:26,405 INFO L82 PathProgramCache]: Analyzing trace with hash 2086365203, now seen corresponding path program 5 times [2020-10-23 20:27:26,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:26,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [700771058] [2020-10-23 20:27:26,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:26,409 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,673 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-23 20:27:26,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [700771058] [2020-10-23 20:27:26,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:26,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-23 20:27:26,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178490736] [2020-10-23 20:27:26,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 20:27:26,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:26,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 20:27:26,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:27:26,677 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 11 states. [2020-10-23 20:27:27,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:27,231 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-10-23 20:27:27,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-23 20:27:27,232 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2020-10-23 20:27:27,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:27,235 INFO L225 Difference]: With dead ends: 64 [2020-10-23 20:27:27,235 INFO L226 Difference]: Without dead ends: 57 [2020-10-23 20:27:27,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-10-23 20:27:27,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-23 20:27:27,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-10-23 20:27:27,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-23 20:27:27,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-10-23 20:27:27,250 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 65 [2020-10-23 20:27:27,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:27,251 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-10-23 20:27:27,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 20:27:27,251 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-10-23 20:27:27,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-23 20:27:27,253 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:27,253 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:27,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 20:27:27,253 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:27,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:27,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1881990903, now seen corresponding path program 6 times [2020-10-23 20:27:27,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:27,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [888654851] [2020-10-23 20:27:27,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:27,258 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:27,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:27,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:27,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:27,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:27,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:27,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:27,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:27,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:27,528 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-10-23 20:27:27,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [888654851] [2020-10-23 20:27:27,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:27,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-23 20:27:27,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441399279] [2020-10-23 20:27:27,530 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 20:27:27,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:27,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 20:27:27,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-23 20:27:27,532 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2020-10-23 20:27:28,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:28,183 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-10-23 20:27:28,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 20:27:28,184 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-10-23 20:27:28,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:28,187 INFO L225 Difference]: With dead ends: 69 [2020-10-23 20:27:28,187 INFO L226 Difference]: Without dead ends: 62 [2020-10-23 20:27:28,189 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2020-10-23 20:27:28,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-23 20:27:28,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-23 20:27:28,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-23 20:27:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2020-10-23 20:27:28,207 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 73 [2020-10-23 20:27:28,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:28,207 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2020-10-23 20:27:28,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 20:27:28,208 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2020-10-23 20:27:28,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-10-23 20:27:28,210 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:28,210 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:28,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-23 20:27:28,210 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:28,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:28,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1486608429, now seen corresponding path program 7 times [2020-10-23 20:27:28,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:28,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1259953663] [2020-10-23 20:27:28,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:28,217 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-10-23 20:27:28,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1259953663] [2020-10-23 20:27:28,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:28,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-23 20:27:28,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72298494] [2020-10-23 20:27:28,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-23 20:27:28,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:28,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-23 20:27:28,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-10-23 20:27:28,529 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 13 states. [2020-10-23 20:27:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:29,143 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-10-23 20:27:29,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 20:27:29,143 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2020-10-23 20:27:29,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:29,147 INFO L225 Difference]: With dead ends: 74 [2020-10-23 20:27:29,147 INFO L226 Difference]: Without dead ends: 67 [2020-10-23 20:27:29,151 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-10-23 20:27:29,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-10-23 20:27:29,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-10-23 20:27:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-23 20:27:29,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-10-23 20:27:29,181 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 81 [2020-10-23 20:27:29,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:29,184 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-10-23 20:27:29,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-23 20:27:29,184 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-10-23 20:27:29,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-10-23 20:27:29,191 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:29,192 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:29,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-23 20:27:29,193 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:29,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:29,194 INFO L82 PathProgramCache]: Analyzing trace with hash -2047124151, now seen corresponding path program 8 times [2020-10-23 20:27:29,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:29,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [508893431] [2020-10-23 20:27:29,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:29,205 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,751 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-10-23 20:27:29,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [508893431] [2020-10-23 20:27:29,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:29,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-23 20:27:29,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836186836] [2020-10-23 20:27:29,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-23 20:27:29,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:29,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-23 20:27:29,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-10-23 20:27:29,754 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 14 states. [2020-10-23 20:27:30,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:30,417 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-10-23 20:27:30,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-23 20:27:30,418 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2020-10-23 20:27:30,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:30,420 INFO L225 Difference]: With dead ends: 79 [2020-10-23 20:27:30,420 INFO L226 Difference]: Without dead ends: 72 [2020-10-23 20:27:30,421 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2020-10-23 20:27:30,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-23 20:27:30,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-10-23 20:27:30,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-23 20:27:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-10-23 20:27:30,438 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 89 [2020-10-23 20:27:30,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:30,438 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-10-23 20:27:30,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-23 20:27:30,439 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-10-23 20:27:30,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-10-23 20:27:30,440 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:30,441 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:30,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-23 20:27:30,441 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:30,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:30,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1811920787, now seen corresponding path program 9 times [2020-10-23 20:27:30,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:30,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2038616474] [2020-10-23 20:27:30,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:30,447 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-10-23 20:27:30,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2038616474] [2020-10-23 20:27:30,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:30,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-23 20:27:30,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845348633] [2020-10-23 20:27:30,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-23 20:27:30,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:30,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-23 20:27:30,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-23 20:27:30,865 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2020-10-23 20:27:31,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:31,634 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-10-23 20:27:31,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-23 20:27:31,634 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2020-10-23 20:27:31,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:31,636 INFO L225 Difference]: With dead ends: 84 [2020-10-23 20:27:31,636 INFO L226 Difference]: Without dead ends: 77 [2020-10-23 20:27:31,637 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-10-23 20:27:31,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-23 20:27:31,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-10-23 20:27:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-23 20:27:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2020-10-23 20:27:31,667 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 97 [2020-10-23 20:27:31,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:31,668 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2020-10-23 20:27:31,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-23 20:27:31,668 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2020-10-23 20:27:31,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-10-23 20:27:31,671 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:31,672 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:31,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-23 20:27:31,672 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:31,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:31,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1912263049, now seen corresponding path program 10 times [2020-10-23 20:27:31,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:31,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [568199580] [2020-10-23 20:27:31,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:31,680 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:32,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:32,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-10-23 20:27:32,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [568199580] [2020-10-23 20:27:32,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:32,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-10-23 20:27:32,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270995727] [2020-10-23 20:27:32,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-23 20:27:32,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:32,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-23 20:27:32,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-10-23 20:27:32,126 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 16 states. [2020-10-23 20:27:32,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:32,872 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-10-23 20:27:32,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-23 20:27:32,873 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-10-23 20:27:32,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:32,875 INFO L225 Difference]: With dead ends: 89 [2020-10-23 20:27:32,875 INFO L226 Difference]: Without dead ends: 82 [2020-10-23 20:27:32,877 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=268, Invalid=544, Unknown=0, NotChecked=0, Total=812 [2020-10-23 20:27:32,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-23 20:27:32,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-10-23 20:27:32,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-23 20:27:32,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2020-10-23 20:27:32,894 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 105 [2020-10-23 20:27:32,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:32,895 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2020-10-23 20:27:32,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-23 20:27:32,895 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2020-10-23 20:27:32,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-10-23 20:27:32,897 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:32,897 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:32,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-23 20:27:32,897 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:32,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:32,898 INFO L82 PathProgramCache]: Analyzing trace with hash -34990253, now seen corresponding path program 11 times [2020-10-23 20:27:32,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:32,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1974200660] [2020-10-23 20:27:32,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:32,905 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:32,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:32,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-10-23 20:27:33,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1974200660] [2020-10-23 20:27:33,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:33,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-10-23 20:27:33,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230085239] [2020-10-23 20:27:33,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-23 20:27:33,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:33,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-23 20:27:33,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-10-23 20:27:33,418 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 17 states. [2020-10-23 20:27:34,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:34,243 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-10-23 20:27:34,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-23 20:27:34,243 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 113 [2020-10-23 20:27:34,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:34,245 INFO L225 Difference]: With dead ends: 94 [2020-10-23 20:27:34,245 INFO L226 Difference]: Without dead ends: 87 [2020-10-23 20:27:34,246 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2020-10-23 20:27:34,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-23 20:27:34,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-10-23 20:27:34,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-23 20:27:34,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2020-10-23 20:27:34,278 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 113 [2020-10-23 20:27:34,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:34,283 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2020-10-23 20:27:34,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-23 20:27:34,283 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2020-10-23 20:27:34,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-10-23 20:27:34,285 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:34,285 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:34,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-23 20:27:34,285 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:34,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:34,286 INFO L82 PathProgramCache]: Analyzing trace with hash -980060727, now seen corresponding path program 12 times [2020-10-23 20:27:34,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:34,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [213203581] [2020-10-23 20:27:34,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:34,295 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:34,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:34,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:34,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:34,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:34,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:34,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:34,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:34,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:34,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:34,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:34,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:34,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:34,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:34,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-10-23 20:27:35,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [213203581] [2020-10-23 20:27:35,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:35,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-10-23 20:27:35,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544667869] [2020-10-23 20:27:35,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-23 20:27:35,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:35,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-23 20:27:35,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-10-23 20:27:35,005 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 18 states. [2020-10-23 20:27:35,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:35,944 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-10-23 20:27:35,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-23 20:27:35,945 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2020-10-23 20:27:35,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:35,946 INFO L225 Difference]: With dead ends: 99 [2020-10-23 20:27:35,947 INFO L226 Difference]: Without dead ends: 92 [2020-10-23 20:27:35,948 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2020-10-23 20:27:35,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-23 20:27:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-10-23 20:27:35,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-23 20:27:35,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2020-10-23 20:27:35,963 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 121 [2020-10-23 20:27:35,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:35,963 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2020-10-23 20:27:35,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-23 20:27:35,964 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2020-10-23 20:27:35,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-10-23 20:27:35,965 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:35,966 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:35,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-23 20:27:35,966 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:35,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:35,967 INFO L82 PathProgramCache]: Analyzing trace with hash 366954259, now seen corresponding path program 13 times [2020-10-23 20:27:35,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:35,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [253734487] [2020-10-23 20:27:35,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:35,975 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:36,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:36,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:36,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:36,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:36,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:36,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:36,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:36,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:36,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:36,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:36,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:36,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:36,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:36,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:36,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:36,616 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-10-23 20:27:36,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [253734487] [2020-10-23 20:27:36,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:36,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-10-23 20:27:36,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470438105] [2020-10-23 20:27:36,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-23 20:27:36,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:36,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-23 20:27:36,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-10-23 20:27:36,620 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 19 states. [2020-10-23 20:27:37,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:37,629 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2020-10-23 20:27:37,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-23 20:27:37,629 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 129 [2020-10-23 20:27:37,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:37,631 INFO L225 Difference]: With dead ends: 104 [2020-10-23 20:27:37,631 INFO L226 Difference]: Without dead ends: 97 [2020-10-23 20:27:37,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2020-10-23 20:27:37,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-23 20:27:37,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-10-23 20:27:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-23 20:27:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2020-10-23 20:27:37,657 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 129 [2020-10-23 20:27:37,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:37,657 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2020-10-23 20:27:37,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-23 20:27:37,658 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2020-10-23 20:27:37,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-10-23 20:27:37,661 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:37,661 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:37,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-23 20:27:37,662 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:37,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:37,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1919989239, now seen corresponding path program 14 times [2020-10-23 20:27:37,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:37,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [281398284] [2020-10-23 20:27:37,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:37,672 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:38,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:38,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:38,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:38,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:38,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:38,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:38,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-10-23 20:27:38,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [281398284] [2020-10-23 20:27:38,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:38,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-10-23 20:27:38,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766005458] [2020-10-23 20:27:38,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-23 20:27:38,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:38,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-23 20:27:38,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-10-23 20:27:38,401 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 20 states. [2020-10-23 20:27:39,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:39,364 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2020-10-23 20:27:39,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-23 20:27:39,365 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 137 [2020-10-23 20:27:39,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:39,367 INFO L225 Difference]: With dead ends: 109 [2020-10-23 20:27:39,367 INFO L226 Difference]: Without dead ends: 102 [2020-10-23 20:27:39,371 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=450, Invalid=882, Unknown=0, NotChecked=0, Total=1332 [2020-10-23 20:27:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-23 20:27:39,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-10-23 20:27:39,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-23 20:27:39,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2020-10-23 20:27:39,388 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 137 [2020-10-23 20:27:39,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:39,392 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2020-10-23 20:27:39,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-23 20:27:39,392 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2020-10-23 20:27:39,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-10-23 20:27:39,394 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:39,394 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:39,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-23 20:27:39,395 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:39,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:39,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1315223853, now seen corresponding path program 15 times [2020-10-23 20:27:39,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:39,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1352556477] [2020-10-23 20:27:39,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:39,413 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:40,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:40,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:40,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:40,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:40,272 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-10-23 20:27:40,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1352556477] [2020-10-23 20:27:40,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:40,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-10-23 20:27:40,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616140967] [2020-10-23 20:27:40,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-23 20:27:40,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:40,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-23 20:27:40,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2020-10-23 20:27:40,276 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 21 states. [2020-10-23 20:27:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:41,503 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2020-10-23 20:27:41,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-23 20:27:41,503 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 145 [2020-10-23 20:27:41,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:41,505 INFO L225 Difference]: With dead ends: 114 [2020-10-23 20:27:41,505 INFO L226 Difference]: Without dead ends: 107 [2020-10-23 20:27:41,507 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=503, Invalid=979, Unknown=0, NotChecked=0, Total=1482 [2020-10-23 20:27:41,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-23 20:27:41,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-23 20:27:41,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-23 20:27:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2020-10-23 20:27:41,524 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 145 [2020-10-23 20:27:41,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:41,524 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2020-10-23 20:27:41,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-23 20:27:41,525 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2020-10-23 20:27:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-10-23 20:27:41,527 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:41,527 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:41,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-23 20:27:41,527 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:41,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:41,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1314107831, now seen corresponding path program 16 times [2020-10-23 20:27:41,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:41,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1354000345] [2020-10-23 20:27:41,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:41,534 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,376 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-10-23 20:27:42,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1354000345] [2020-10-23 20:27:42,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:42,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-10-23 20:27:42,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678945661] [2020-10-23 20:27:42,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-23 20:27:42,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:42,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-23 20:27:42,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2020-10-23 20:27:42,378 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 22 states. [2020-10-23 20:27:43,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:43,565 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2020-10-23 20:27:43,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-23 20:27:43,565 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 153 [2020-10-23 20:27:43,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:43,567 INFO L225 Difference]: With dead ends: 119 [2020-10-23 20:27:43,567 INFO L226 Difference]: Without dead ends: 112 [2020-10-23 20:27:43,569 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=559, Invalid=1081, Unknown=0, NotChecked=0, Total=1640 [2020-10-23 20:27:43,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-23 20:27:43,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-23 20:27:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-23 20:27:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2020-10-23 20:27:43,585 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 153 [2020-10-23 20:27:43,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:43,586 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2020-10-23 20:27:43,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-23 20:27:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2020-10-23 20:27:43,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-10-23 20:27:43,588 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:43,588 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:43,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-23 20:27:43,589 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:43,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:43,589 INFO L82 PathProgramCache]: Analyzing trace with hash -740682093, now seen corresponding path program 17 times [2020-10-23 20:27:43,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:43,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [696354143] [2020-10-23 20:27:43,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:43,594 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:43,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:43,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:43,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:43,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:43,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:43,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:43,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:43,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:43,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-10-23 20:27:44,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [696354143] [2020-10-23 20:27:44,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:44,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-10-23 20:27:44,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643874402] [2020-10-23 20:27:44,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-23 20:27:44,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:44,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-23 20:27:44,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2020-10-23 20:27:44,491 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 23 states. [2020-10-23 20:27:45,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:45,773 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2020-10-23 20:27:45,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-23 20:27:45,773 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 161 [2020-10-23 20:27:45,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:45,775 INFO L225 Difference]: With dead ends: 124 [2020-10-23 20:27:45,775 INFO L226 Difference]: Without dead ends: 117 [2020-10-23 20:27:45,777 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=618, Invalid=1188, Unknown=0, NotChecked=0, Total=1806 [2020-10-23 20:27:45,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-23 20:27:45,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2020-10-23 20:27:45,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-10-23 20:27:45,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2020-10-23 20:27:45,792 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 161 [2020-10-23 20:27:45,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:45,793 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2020-10-23 20:27:45,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-23 20:27:45,793 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2020-10-23 20:27:45,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-10-23 20:27:45,795 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:45,795 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:45,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-23 20:27:45,796 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:45,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:45,796 INFO L82 PathProgramCache]: Analyzing trace with hash 883982985, now seen corresponding path program 18 times [2020-10-23 20:27:45,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:45,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1691352308] [2020-10-23 20:27:45,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:45,804 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:46,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:46,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:46,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:46,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:46,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:46,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:46,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:46,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:46,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:46,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:46,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:46,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:46,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:46,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:46,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:46,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:46,889 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-10-23 20:27:46,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1691352308] [2020-10-23 20:27:46,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:46,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-10-23 20:27:46,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130714897] [2020-10-23 20:27:46,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-23 20:27:46,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:46,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-23 20:27:46,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=336, Unknown=0, NotChecked=0, Total=552 [2020-10-23 20:27:46,892 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 24 states. [2020-10-23 20:27:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:48,112 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2020-10-23 20:27:48,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-23 20:27:48,113 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 169 [2020-10-23 20:27:48,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:48,115 INFO L225 Difference]: With dead ends: 129 [2020-10-23 20:27:48,115 INFO L226 Difference]: Without dead ends: 122 [2020-10-23 20:27:48,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=680, Invalid=1300, Unknown=0, NotChecked=0, Total=1980 [2020-10-23 20:27:48,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-10-23 20:27:48,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-10-23 20:27:48,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-10-23 20:27:48,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2020-10-23 20:27:48,132 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 169 [2020-10-23 20:27:48,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:48,133 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2020-10-23 20:27:48,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-23 20:27:48,133 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2020-10-23 20:27:48,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-10-23 20:27:48,135 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:48,136 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:48,136 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-23 20:27:48,136 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:48,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:48,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1146598995, now seen corresponding path program 19 times [2020-10-23 20:27:48,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:48,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1677295942] [2020-10-23 20:27:48,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:48,141 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:49,197 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-10-23 20:27:49,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1677295942] [2020-10-23 20:27:49,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:49,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-10-23 20:27:49,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509916970] [2020-10-23 20:27:49,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-23 20:27:49,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:49,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-23 20:27:49,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=363, Unknown=0, NotChecked=0, Total=600 [2020-10-23 20:27:49,200 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 25 states. [2020-10-23 20:27:50,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:50,570 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2020-10-23 20:27:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-23 20:27:50,570 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 177 [2020-10-23 20:27:50,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:50,572 INFO L225 Difference]: With dead ends: 134 [2020-10-23 20:27:50,572 INFO L226 Difference]: Without dead ends: 127 [2020-10-23 20:27:50,574 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=745, Invalid=1417, Unknown=0, NotChecked=0, Total=2162 [2020-10-23 20:27:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-10-23 20:27:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-10-23 20:27:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-23 20:27:50,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2020-10-23 20:27:50,591 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 177 [2020-10-23 20:27:50,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:50,592 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2020-10-23 20:27:50,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-23 20:27:50,592 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2020-10-23 20:27:50,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-10-23 20:27:50,594 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:50,594 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:50,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-23 20:27:50,595 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:50,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:50,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1952442057, now seen corresponding path program 20 times [2020-10-23 20:27:50,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:50,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [522151183] [2020-10-23 20:27:50,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:50,601 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:50,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:50,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:50,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:50,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:50,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:50,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:50,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:50,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2020-10-23 20:27:51,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [522151183] [2020-10-23 20:27:51,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:51,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2020-10-23 20:27:51,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963878547] [2020-10-23 20:27:51,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-10-23 20:27:51,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:51,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-10-23 20:27:51,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2020-10-23 20:27:51,743 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 26 states. [2020-10-23 20:27:53,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:53,073 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2020-10-23 20:27:53,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-23 20:27:53,074 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 185 [2020-10-23 20:27:53,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:53,076 INFO L225 Difference]: With dead ends: 139 [2020-10-23 20:27:53,076 INFO L226 Difference]: Without dead ends: 132 [2020-10-23 20:27:53,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=813, Invalid=1539, Unknown=0, NotChecked=0, Total=2352 [2020-10-23 20:27:53,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-23 20:27:53,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-10-23 20:27:53,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-10-23 20:27:53,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2020-10-23 20:27:53,096 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 185 [2020-10-23 20:27:53,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:53,098 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2020-10-23 20:27:53,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-10-23 20:27:53,098 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2020-10-23 20:27:53,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-10-23 20:27:53,101 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:53,102 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:53,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-23 20:27:53,102 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:53,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:53,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1339041299, now seen corresponding path program 21 times [2020-10-23 20:27:53,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:53,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1150739695] [2020-10-23 20:27:53,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:53,110 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:53,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:53,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:53,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:53,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:53,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:53,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:53,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:53,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:53,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:53,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:53,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:53,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:53,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:53,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:53,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:53,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:53,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:53,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:53,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:53,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:53,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2020-10-23 20:27:54,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1150739695] [2020-10-23 20:27:54,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:54,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2020-10-23 20:27:54,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697417573] [2020-10-23 20:27:54,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-10-23 20:27:54,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:54,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-10-23 20:27:54,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=420, Unknown=0, NotChecked=0, Total=702 [2020-10-23 20:27:54,355 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 27 states. [2020-10-23 20:27:55,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:55,902 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2020-10-23 20:27:55,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-23 20:27:55,908 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 193 [2020-10-23 20:27:55,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:55,911 INFO L225 Difference]: With dead ends: 144 [2020-10-23 20:27:55,911 INFO L226 Difference]: Without dead ends: 137 [2020-10-23 20:27:55,913 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=884, Invalid=1666, Unknown=0, NotChecked=0, Total=2550 [2020-10-23 20:27:55,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-23 20:27:55,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-10-23 20:27:55,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-10-23 20:27:55,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2020-10-23 20:27:55,932 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 193 [2020-10-23 20:27:55,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:55,933 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2020-10-23 20:27:55,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-10-23 20:27:55,933 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2020-10-23 20:27:55,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-10-23 20:27:55,936 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:55,936 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:55,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-23 20:27:55,936 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:55,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:55,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1769896713, now seen corresponding path program 22 times [2020-10-23 20:27:55,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:55,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2116420961] [2020-10-23 20:27:55,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:55,942 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:56,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:57,278 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2020-10-23 20:27:57,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2116420961] [2020-10-23 20:27:57,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:57,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2020-10-23 20:27:57,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900563325] [2020-10-23 20:27:57,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-10-23 20:27:57,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:57,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-10-23 20:27:57,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=450, Unknown=0, NotChecked=0, Total=756 [2020-10-23 20:27:57,281 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 28 states. [2020-10-23 20:27:58,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:58,845 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2020-10-23 20:27:58,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-23 20:27:58,847 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 201 [2020-10-23 20:27:58,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:58,849 INFO L225 Difference]: With dead ends: 149 [2020-10-23 20:27:58,849 INFO L226 Difference]: Without dead ends: 142 [2020-10-23 20:27:58,851 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=958, Invalid=1798, Unknown=0, NotChecked=0, Total=2756 [2020-10-23 20:27:58,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-10-23 20:27:58,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-10-23 20:27:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-10-23 20:27:58,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2020-10-23 20:27:58,868 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 201 [2020-10-23 20:27:58,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:58,868 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2020-10-23 20:27:58,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-10-23 20:27:58,869 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2020-10-23 20:27:58,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-10-23 20:27:58,871 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:58,871 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:58,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-23 20:27:58,872 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:58,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:58,872 INFO L82 PathProgramCache]: Analyzing trace with hash -2013305389, now seen corresponding path program 23 times [2020-10-23 20:27:58,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:58,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [586192922] [2020-10-23 20:27:58,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:58,878 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:58,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:58,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:59,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:59,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:59,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:59,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:59,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:59,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:59,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:59,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:59,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:59,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:59,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:59,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:59,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:59,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:59,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:59,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:59,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:59,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:59,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:59,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:59,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:59,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:59,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2020-10-23 20:28:00,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [586192922] [2020-10-23 20:28:00,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:00,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2020-10-23 20:28:00,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513954059] [2020-10-23 20:28:00,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-10-23 20:28:00,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:00,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-10-23 20:28:00,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=481, Unknown=0, NotChecked=0, Total=812 [2020-10-23 20:28:00,279 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 29 states. [2020-10-23 20:28:01,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:01,905 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2020-10-23 20:28:01,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-23 20:28:01,906 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 209 [2020-10-23 20:28:01,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:01,909 INFO L225 Difference]: With dead ends: 154 [2020-10-23 20:28:01,909 INFO L226 Difference]: Without dead ends: 147 [2020-10-23 20:28:01,911 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1935, Unknown=0, NotChecked=0, Total=2970 [2020-10-23 20:28:01,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-10-23 20:28:01,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2020-10-23 20:28:01,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-10-23 20:28:01,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2020-10-23 20:28:01,932 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 209 [2020-10-23 20:28:01,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:01,933 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2020-10-23 20:28:01,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-10-23 20:28:01,933 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2020-10-23 20:28:01,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2020-10-23 20:28:01,935 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:01,936 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:01,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-23 20:28:01,936 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:01,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:01,937 INFO L82 PathProgramCache]: Analyzing trace with hash -405782711, now seen corresponding path program 24 times [2020-10-23 20:28:01,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:01,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1296771735] [2020-10-23 20:28:01,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:01,944 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:02,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:02,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:28:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:02,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:02,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:02,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:02,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:02,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:02,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:02,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:02,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:02,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:02,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:02,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:02,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:02,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:02,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:02,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:02,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:02,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:02,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:02,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:02,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:02,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:03,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:03,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:03,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:03,483 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2020-10-23 20:28:03,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1296771735] [2020-10-23 20:28:03,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:03,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2020-10-23 20:28:03,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69242503] [2020-10-23 20:28:03,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-10-23 20:28:03,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:03,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-10-23 20:28:03,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=513, Unknown=0, NotChecked=0, Total=870 [2020-10-23 20:28:03,486 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 30 states. [2020-10-23 20:28:05,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:05,141 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2020-10-23 20:28:05,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-10-23 20:28:05,143 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 217 [2020-10-23 20:28:05,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:05,146 INFO L225 Difference]: With dead ends: 159 [2020-10-23 20:28:05,146 INFO L226 Difference]: Without dead ends: 152 [2020-10-23 20:28:05,147 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1115, Invalid=2077, Unknown=0, NotChecked=0, Total=3192 [2020-10-23 20:28:05,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-10-23 20:28:05,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2020-10-23 20:28:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-23 20:28:05,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2020-10-23 20:28:05,166 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 217 [2020-10-23 20:28:05,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:05,167 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2020-10-23 20:28:05,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-10-23 20:28:05,167 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2020-10-23 20:28:05,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-10-23 20:28:05,168 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:05,168 INFO L422 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:05,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-23 20:28:05,169 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:05,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:05,169 INFO L82 PathProgramCache]: Analyzing trace with hash -2086570605, now seen corresponding path program 25 times [2020-10-23 20:28:05,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:05,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1722934854] [2020-10-23 20:28:05,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:05,175 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:05,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:05,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:28:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:05,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:05,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:05,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:05,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:06,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:06,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:06,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:06,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:06,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:06,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:06,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:06,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:06,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:07,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:07,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:07,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:07,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:07,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:07,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:07,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:08,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:08,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:08,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:08,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:08,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:09,427 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2020-10-23 20:28:09,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1722934854] [2020-10-23 20:28:09,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:09,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2020-10-23 20:28:09,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484306003] [2020-10-23 20:28:09,434 INFO L461 AbstractCegarLoop]: Interpolant automaton has 56 states [2020-10-23 20:28:09,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:09,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2020-10-23 20:28:09,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2020-10-23 20:28:09,436 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 56 states. [2020-10-23 20:28:22,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:22,129 INFO L93 Difference]: Finished difference Result 164 states and 165 transitions. [2020-10-23 20:28:22,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2020-10-23 20:28:22,130 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 225 [2020-10-23 20:28:22,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:22,131 INFO L225 Difference]: With dead ends: 164 [2020-10-23 20:28:22,131 INFO L226 Difference]: Without dead ends: 157 [2020-10-23 20:28:22,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3055 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=503, Invalid=17587, Unknown=0, NotChecked=0, Total=18090 [2020-10-23 20:28:22,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-10-23 20:28:22,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2020-10-23 20:28:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-10-23 20:28:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2020-10-23 20:28:22,160 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 225 [2020-10-23 20:28:22,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:22,161 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2020-10-23 20:28:22,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2020-10-23 20:28:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2020-10-23 20:28:22,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2020-10-23 20:28:22,162 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:22,163 INFO L422 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:22,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-23 20:28:22,163 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:22,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:22,164 INFO L82 PathProgramCache]: Analyzing trace with hash -568773751, now seen corresponding path program 26 times [2020-10-23 20:28:22,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:22,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [267775116] [2020-10-23 20:28:22,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:22,168 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:28:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:23,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:23,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:23,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:23,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:23,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:23,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:23,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:23,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:23,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:23,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:23,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:23,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:23,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:23,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:28:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2020-10-23 20:28:24,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [267775116] [2020-10-23 20:28:24,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:24,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2020-10-23 20:28:24,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117616529] [2020-10-23 20:28:24,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-10-23 20:28:24,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:24,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-10-23 20:28:24,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=606, Unknown=0, NotChecked=0, Total=992 [2020-10-23 20:28:24,192 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 32 states. [2020-10-23 20:28:26,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:26,641 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2020-10-23 20:28:26,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-10-23 20:28:26,642 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 233 [2020-10-23 20:28:26,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:26,643 INFO L225 Difference]: With dead ends: 157 [2020-10-23 20:28:26,643 INFO L226 Difference]: Without dead ends: 0 [2020-10-23 20:28:26,645 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1206, Invalid=2454, Unknown=0, NotChecked=0, Total=3660 [2020-10-23 20:28:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-23 20:28:26,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-23 20:28:26,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-23 20:28:26,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-23 20:28:26,646 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 233 [2020-10-23 20:28:26,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:26,646 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-23 20:28:26,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-10-23 20:28:26,646 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-23 20:28:26,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-23 20:28:26,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-23 20:28:26,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-23 20:28:26,901 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 117 [2020-10-23 20:28:27,211 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 117 [2020-10-23 20:28:27,528 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 113 [2020-10-23 20:28:27,782 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 113 [2020-10-23 20:28:28,107 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 117 [2020-10-23 20:28:29,481 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 210 DAG size of output: 161 [2020-10-23 20:28:30,957 WARN L193 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 210 DAG size of output: 161 [2020-10-23 20:28:32,419 WARN L193 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 205 DAG size of output: 160 [2020-10-23 20:28:33,823 WARN L193 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 205 DAG size of output: 160 [2020-10-23 20:28:35,507 WARN L193 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 256 DAG size of output: 208 [2020-10-23 20:28:35,513 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-10-23 20:28:35,513 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-10-23 20:28:35,513 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-10-23 20:28:35,513 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-10-23 20:28:35,513 INFO L277 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-10-23 20:28:35,513 INFO L277 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-10-23 20:28:35,513 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 20:28:35,514 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-23 20:28:35,514 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-10-23 20:28:35,514 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-23 20:28:35,514 INFO L277 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-10-23 20:28:35,514 INFO L277 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-10-23 20:28:35,515 INFO L277 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-10-23 20:28:35,515 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:28:35,515 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:28:35,515 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 20:28:35,515 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-23 20:28:35,515 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-23 20:28:35,515 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-10-23 20:28:35,516 INFO L270 CegarLoopResult]: At program point mainEXIT(lines 11 17) the Hoare annotation is: (<= 25 main_~input~0) [2020-10-23 20:28:35,516 INFO L270 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: false [2020-10-23 20:28:35,516 INFO L270 CegarLoopResult]: At program point L14(lines 14 16) the Hoare annotation is: (and (<= 25 main_~input~0) (<= main_~result~0 25) (< 24 main_~result~0)) [2020-10-23 20:28:35,516 INFO L270 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: false [2020-10-23 20:28:35,517 INFO L270 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= 25 main_~input~0) (<= main_~input~0 25)) [2020-10-23 20:28:35,517 INFO L270 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (<= |main_#t~ret8| 25) (<= 25 main_~input~0) (<= 25 |main_#t~ret8|)) [2020-10-23 20:28:35,517 INFO L270 CegarLoopResult]: At program point L14-2(lines 11 17) the Hoare annotation is: (<= 25 main_~input~0) [2020-10-23 20:28:35,517 INFO L270 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (<= |main_#t~ret8| 25) (<= 25 main_~input~0) (<= 25 |main_#t~ret8|)) [2020-10-23 20:28:35,517 INFO L270 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (and (<= |main_#t~ret8| 25) (<= 25 main_~input~0) (<= main_~result~0 25) (< 24 main_~result~0) (<= 25 |main_#t~ret8|)) [2020-10-23 20:28:35,518 INFO L270 CegarLoopResult]: At program point idFINAL(lines 6 9) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= |id_#res| 16) .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) .cse0 (<= |id_#in~x| 15) (<= |id_#res| 15)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 9 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|)) (and .cse0 (<= 22 |id_#res|) (<= |id_#res| 22) (<= |id_#in~x| 22) (<= 22 |id_#in~x|)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) (and .cse0 (<= |id_#in~x| 24) (<= |id_#res| 24) (<= 24 |id_#in~x|) (<= 24 |id_#res|)) (and (<= 19 |id_#res|) (<= |id_#res| 19) .cse0 (<= |id_#in~x| 19) (<= 19 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and .cse0 (<= 26 |id_#in~x|)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) (and (<= |id_#res| 23) .cse0 (<= 23 |id_#in~x|) (<= |id_#in~x| 23) (<= 23 |id_#res|)) (and (<= |id_#res| 17) (<= 17 |id_#res|) .cse0 (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 25 |id_#in~x|) .cse0 (<= |id_#res| 25) (<= 25 |id_#res|)) (and .cse0 (<= |id_#in~x| 20) (<= 20 |id_#res|) (<= |id_#res| 20) (<= 20 |id_#in~x|)) (and (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse0 (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= 12 |id_#in~x|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) (and (<= |id_#res| 18) (<= 18 |id_#in~x|) .cse0 (<= 18 |id_#res|) (<= |id_#in~x| 18)) (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) (<= 21 |id_#res|) .cse0 (<= |id_#res| 21)))) [2020-10-23 20:28:35,519 INFO L270 CegarLoopResult]: At program point idEXIT(lines 6 9) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= |id_#res| 16) .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) .cse0 (<= |id_#in~x| 15) (<= |id_#res| 15)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 9 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|)) (and .cse0 (<= 22 |id_#res|) (<= |id_#res| 22) (<= |id_#in~x| 22) (<= 22 |id_#in~x|)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) (and .cse0 (<= |id_#in~x| 24) (<= |id_#res| 24) (<= 24 |id_#in~x|) (<= 24 |id_#res|)) (and (<= 19 |id_#res|) (<= |id_#res| 19) .cse0 (<= |id_#in~x| 19) (<= 19 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and .cse0 (<= 26 |id_#in~x|)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) (and (<= |id_#res| 23) .cse0 (<= 23 |id_#in~x|) (<= |id_#in~x| 23) (<= 23 |id_#res|)) (and (<= |id_#res| 17) (<= 17 |id_#res|) .cse0 (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 25 |id_#in~x|) .cse0 (<= |id_#res| 25) (<= 25 |id_#res|)) (and .cse0 (<= |id_#in~x| 20) (<= 20 |id_#res|) (<= |id_#res| 20) (<= 20 |id_#in~x|)) (and (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse0 (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= 12 |id_#in~x|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) (and (<= |id_#res| 18) (<= 18 |id_#in~x|) .cse0 (<= 18 |id_#res|) (<= |id_#in~x| 18)) (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) (<= 21 |id_#res|) .cse0 (<= |id_#res| 21)))) [2020-10-23 20:28:35,519 INFO L270 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-10-23 20:28:35,519 INFO L277 CegarLoopResult]: At program point idENTRY(lines 6 9) the Hoare annotation is: true [2020-10-23 20:28:35,519 INFO L270 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-10-23 20:28:35,520 INFO L270 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: (and (let ((.cse0 (= |id_#in~x| id_~x))) (or (and .cse0 (<= |id_#t~ret7| 24) (<= 24 |id_#t~ret7|)) (and .cse0 (<= 26 |id_#in~x|)) (and .cse0 (<= |id_#in~x| 24)))) (or (and (<= 12 |id_#in~x|) (<= |id_#in~x| 12) (<= |id_#t~ret7| 11) (<= 11 |id_#t~ret7|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret7| 12) (<= 12 |id_#t~ret7|)) (and (<= |id_#in~x| 10) (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9)) (and (<= |id_#in~x| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and (<= 3 |id_#in~x|) (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3)) (and (<= 5 |id_#t~ret7|) (<= |id_#t~ret7| 5) (<= 6 |id_#in~x|) (<= |id_#in~x| 6)) (and (<= |id_#t~ret7| 16) (<= 16 |id_#t~ret7|) (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 15 |id_#t~ret7|) (<= |id_#t~ret7| 15)) (and (<= 18 |id_#t~ret7|) (<= |id_#in~x| 19) (<= |id_#t~ret7| 18) (<= 19 |id_#in~x|)) (and (<= 14 |id_#in~x|) (<= |id_#t~ret7| 13) (<= 13 |id_#t~ret7|) (<= |id_#in~x| 14)) (<= 25 |id_#in~x|) (and (<= |id_#t~ret7| 23) (<= 23 |id_#t~ret7|) (<= 24 |id_#in~x|)) (and (<= 5 |id_#in~x|) (<= |id_#in~x| 5) (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and (<= 21 |id_#t~ret7|) (<= |id_#t~ret7| 21) (<= |id_#in~x| 22) (<= 22 |id_#in~x|)) (and (<= 15 |id_#in~x|) (<= |id_#t~ret7| 14) (<= |id_#in~x| 15) (<= 14 |id_#t~ret7|)) (and (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= 22 |id_#t~ret7|) (<= 23 |id_#in~x|) (<= |id_#in~x| 23) (<= |id_#t~ret7| 22)) (and (<= 18 |id_#in~x|) (<= |id_#t~ret7| 17) (<= |id_#in~x| 18) (<= 17 |id_#t~ret7|)) (and (<= |id_#t~ret7| 10) (<= 10 |id_#t~ret7|) (<= |id_#in~x| 11) (<= 11 |id_#in~x|)) (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) (<= |id_#t~ret7| 20) (<= 20 |id_#t~ret7|)) (and (<= 1 |id_#in~x|) (= |id_#t~ret7| 0) (<= |id_#in~x| 1)) (and (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and (<= |id_#t~ret7| 6) (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and (<= |id_#t~ret7| 19) (<= |id_#in~x| 20) (<= 20 |id_#in~x|) (<= 19 |id_#t~ret7|)))) [2020-10-23 20:28:35,520 INFO L270 CegarLoopResult]: At program point L7-1(line 7) the Hoare annotation is: (and (= |id_#in~x| id_~x) (= |id_#in~x| 0)) [2020-10-23 20:28:35,521 INFO L270 CegarLoopResult]: At program point L8-2(line 8) the Hoare annotation is: (and (let ((.cse0 (= |id_#in~x| id_~x))) (or (and .cse0 (<= |id_#t~ret7| 24) (<= 24 |id_#t~ret7|)) (and .cse0 (<= 26 |id_#in~x|)) (and .cse0 (<= |id_#in~x| 24)))) (or (and (<= 12 |id_#in~x|) (<= |id_#in~x| 12) (<= |id_#t~ret7| 11) (<= 11 |id_#t~ret7|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret7| 12) (<= 12 |id_#t~ret7|)) (and (<= |id_#in~x| 10) (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9)) (and (<= |id_#in~x| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and (<= 3 |id_#in~x|) (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3)) (and (<= 5 |id_#t~ret7|) (<= |id_#t~ret7| 5) (<= 6 |id_#in~x|) (<= |id_#in~x| 6)) (and (<= |id_#t~ret7| 16) (<= 16 |id_#t~ret7|) (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 15 |id_#t~ret7|) (<= |id_#t~ret7| 15)) (and (<= 18 |id_#t~ret7|) (<= |id_#in~x| 19) (<= |id_#t~ret7| 18) (<= 19 |id_#in~x|)) (and (<= 14 |id_#in~x|) (<= |id_#t~ret7| 13) (<= 13 |id_#t~ret7|) (<= |id_#in~x| 14)) (<= 25 |id_#in~x|) (and (<= |id_#t~ret7| 23) (<= 23 |id_#t~ret7|) (<= 24 |id_#in~x|)) (and (<= 5 |id_#in~x|) (<= |id_#in~x| 5) (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and (<= 21 |id_#t~ret7|) (<= |id_#t~ret7| 21) (<= |id_#in~x| 22) (<= 22 |id_#in~x|)) (and (<= 15 |id_#in~x|) (<= |id_#t~ret7| 14) (<= |id_#in~x| 15) (<= 14 |id_#t~ret7|)) (and (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= 22 |id_#t~ret7|) (<= 23 |id_#in~x|) (<= |id_#in~x| 23) (<= |id_#t~ret7| 22)) (and (<= 18 |id_#in~x|) (<= |id_#t~ret7| 17) (<= |id_#in~x| 18) (<= 17 |id_#t~ret7|)) (and (<= |id_#t~ret7| 10) (<= 10 |id_#t~ret7|) (<= |id_#in~x| 11) (<= 11 |id_#in~x|)) (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) (<= |id_#t~ret7| 20) (<= 20 |id_#t~ret7|)) (and (<= 1 |id_#in~x|) (= |id_#t~ret7| 0) (<= |id_#in~x| 1)) (and (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and (<= |id_#t~ret7| 6) (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and (<= |id_#t~ret7| 19) (<= |id_#in~x| 20) (<= 20 |id_#in~x|) (<= 19 |id_#t~ret7|)))) [2020-10-23 20:28:35,522 INFO L270 CegarLoopResult]: At program point L8-3(line 8) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 25 |id_#in~x|) .cse0 (<= |id_#res| 25) (<= |id_#t~ret7| 24) (<= 24 |id_#t~ret7|) (<= 25 |id_#res|)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (= |id_#t~ret7| 0) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 8 |id_#res|) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) (<= |id_#t~ret7| 14) .cse0 (<= |id_#in~x| 15) (<= 14 |id_#t~ret7|) (<= |id_#res| 15)) (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) (<= 21 |id_#res|) .cse0 (<= |id_#t~ret7| 20) (<= |id_#res| 21) (<= 20 |id_#t~ret7|)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and (<= |id_#t~ret7| 23) .cse0 (<= |id_#in~x| 24) (<= |id_#res| 24) (<= 23 |id_#t~ret7|) (<= 24 |id_#in~x|) (<= 24 |id_#res|)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and .cse0 (<= |id_#in~x| 10) (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= 12 |id_#in~x|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|) (<= |id_#t~ret7| 11) (<= 11 |id_#t~ret7|)) (and (<= 21 |id_#t~ret7|) (<= |id_#t~ret7| 21) .cse0 (<= 22 |id_#res|) (<= |id_#res| 22) (<= |id_#in~x| 22) (<= 22 |id_#in~x|)) (and (<= |id_#res| 18) (<= 18 |id_#in~x|) (<= |id_#t~ret7| 17) .cse0 (<= 18 |id_#res|) (<= |id_#in~x| 18) (<= 17 |id_#t~ret7|)) (and (<= 19 |id_#res|) (<= |id_#res| 19) .cse0 (<= 18 |id_#t~ret7|) (<= |id_#in~x| 19) (<= |id_#t~ret7| 18) (<= 19 |id_#in~x|)) (and (<= |id_#t~ret7| 10) (<= 10 |id_#t~ret7|) (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5) (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and (<= 5 |id_#t~ret7|) (<= |id_#res| 6) (<= |id_#t~ret7| 5) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and (<= 22 |id_#t~ret7|) (<= |id_#res| 23) .cse0 (<= 23 |id_#in~x|) (<= |id_#in~x| 23) (<= |id_#t~ret7| 22) (<= 23 |id_#res|)) (and .cse0 (<= 26 |id_#in~x|)) (and (<= |id_#t~ret7| 6) (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= |id_#t~ret7| 19) .cse0 (<= |id_#in~x| 20) (<= 20 |id_#res|) (<= |id_#res| 20) (<= 20 |id_#in~x|) (<= 19 |id_#t~ret7|)) (and (<= |id_#res| 17) (<= 17 |id_#res|) .cse0 (<= |id_#t~ret7| 16) (<= 16 |id_#t~ret7|) (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret7| 12) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|) (<= 12 |id_#t~ret7|)) (and (<= |id_#res| 14) (<= 14 |id_#in~x|) (<= |id_#t~ret7| 13) .cse0 (<= 13 |id_#t~ret7|) (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= |id_#res| 16) .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|) (<= 15 |id_#t~ret7|) (<= |id_#t~ret7| 15)) (and (<= 2 |id_#res|) .cse0 (<= |id_#t~ret7| 1) (<= |id_#res| 2) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)))) [2020-10-23 20:28:35,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:28:35 BoogieIcfgContainer [2020-10-23 20:28:35,564 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 20:28:35,566 INFO L168 Benchmark]: Toolchain (without parser) took 73378.96 ms. Allocated memory was 157.3 MB in the beginning and 566.2 MB in the end (delta: 408.9 MB). Free memory was 133.9 MB in the beginning and 246.3 MB in the end (delta: -112.4 MB). Peak memory consumption was 337.5 MB. Max. memory is 8.0 GB. [2020-10-23 20:28:35,568 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 157.3 MB. Free memory is still 132.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 20:28:35,569 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.50 ms. Allocated memory is still 157.3 MB. Free memory was 133.3 MB in the beginning and 124.4 MB in the end (delta: 8.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-23 20:28:35,570 INFO L168 Benchmark]: Boogie Preprocessor took 31.11 ms. Allocated memory is still 157.3 MB. Free memory was 124.4 MB in the beginning and 122.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-23 20:28:35,570 INFO L168 Benchmark]: RCFGBuilder took 570.87 ms. Allocated memory is still 157.3 MB. Free memory was 122.9 MB in the beginning and 109.9 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-10-23 20:28:35,571 INFO L168 Benchmark]: TraceAbstraction took 72523.73 ms. Allocated memory was 157.3 MB in the beginning and 566.2 MB in the end (delta: 408.9 MB). Free memory was 109.5 MB in the beginning and 246.3 MB in the end (delta: -136.8 MB). Peak memory consumption was 313.3 MB. Max. memory is 8.0 GB. [2020-10-23 20:28:35,573 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 157.3 MB. Free memory is still 132.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 233.50 ms. Allocated memory is still 157.3 MB. Free memory was 133.3 MB in the beginning and 124.4 MB in the end (delta: 8.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 31.11 ms. Allocated memory is still 157.3 MB. Free memory was 124.4 MB in the beginning and 122.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 570.87 ms. Allocated memory is still 157.3 MB. Free memory was 122.9 MB in the beginning and 109.9 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 72523.73 ms. Allocated memory was 157.3 MB in the beginning and 566.2 MB in the end (delta: 408.9 MB). Free memory was 109.5 MB in the beginning and 246.3 MB in the end (delta: -136.8 MB). Peak memory consumption was 313.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 25 <= input - ProcedureContractResult [Line: 6]: Procedure Contract for id Derived contract for procedure id: (((((((((((((((((((((((((((((7 <= \result && \old(x) == x) && \result <= 7) && 7 <= \old(x)) && \old(x) <= 7) || ((((\old(x) <= 11 && 11 <= \old(x)) && \old(x) == x) && \result <= 11) && 11 <= \result)) || ((((\old(x) == x && \old(x) <= 10) && 10 <= \old(x)) && 10 <= \result) && \result <= 10)) || ((((\result <= 16 && \old(x) == x) && 16 <= \old(x)) && \old(x) <= 16) && 16 <= \result)) || ((((15 <= \result && 15 <= \old(x)) && \old(x) == x) && \old(x) <= 15) && \result <= 15)) || ((((2 <= \result && \old(x) == x) && \result <= 2) && 2 <= \old(x)) && \old(x) <= 2)) || ((((\result <= 3 && 3 <= \old(x)) && \old(x) == x) && \old(x) <= 3) && 3 <= \result)) || ((((9 <= \result && \old(x) == x) && \old(x) <= 9) && \result <= 9) && 9 <= \old(x))) || ((((13 <= \old(x) && \old(x) <= 13) && \old(x) == x) && \result <= 13) && 13 <= \result)) || ((((\old(x) == x && 22 <= \result) && \result <= 22) && \old(x) <= 22) && 22 <= \old(x))) || ((((\result <= 4 && 4 <= \result) && \old(x) == x) && \old(x) <= 4) && 4 <= \old(x))) || ((((\result <= 6 && \old(x) == x) && 6 <= \old(x)) && 6 <= \result) && \old(x) <= 6)) || ((((\result <= 8 && \old(x) == x) && 8 <= \old(x)) && 8 <= \result) && \old(x) <= 8)) || ((((\old(x) == x && \old(x) <= 24) && \result <= 24) && 24 <= \old(x)) && 24 <= \result)) || ((((19 <= \result && \result <= 19) && \old(x) == x) && \old(x) <= 19) && 19 <= \old(x))) || ((((1 <= \old(x) && \old(x) == x) && \result <= 1) && 1 <= \result) && \old(x) <= 1)) || (\old(x) == x && 26 <= \old(x))) || ((((5 <= \result && 5 <= \old(x)) && \old(x) <= 5) && \old(x) == x) && \result <= 5)) || ((((\result <= 23 && \old(x) == x) && 23 <= \old(x)) && \old(x) <= 23) && 23 <= \result)) || ((((\result <= 17 && 17 <= \result) && \old(x) == x) && \old(x) <= 17) && 17 <= \old(x))) || (((25 <= \old(x) && \old(x) == x) && \result <= 25) && 25 <= \result)) || ((((\old(x) == x && \old(x) <= 20) && 20 <= \result) && \result <= 20) && 20 <= \old(x))) || ((((\result <= 14 && 14 <= \old(x)) && \old(x) == x) && 14 <= \result) && \old(x) <= 14)) || ((((12 <= \old(x) && \old(x) == x) && \result <= 12) && \old(x) <= 12) && 12 <= \result)) || ((\old(x) == x && \result == 0) && \old(x) == 0)) || ((((\result <= 18 && 18 <= \old(x)) && \old(x) == x) && 18 <= \result) && \old(x) <= 18)) || ((((\old(x) <= 21 && 21 <= \old(x)) && 21 <= \result) && \old(x) == x) && \result <= 21) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 63.4s, OverallIterations: 27, TraceHistogramMax: 27, AutomataDifference: 38.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 875 SDtfs, 3301 SDslu, 2556 SDs, 0 SdLazy, 11161 SolverSat, 947 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1778 GetRequests, 811 SyntacticMatches, 0 SemanticMatches, 967 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8984 ImplicationChecksByTransitivity, 33.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 150 PreInvPairs, 659 NumberOfFragments, 2178 HoareAnnotationTreeSize, 150 FomulaSimplifications, 11251 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 37 FomulaSimplificationsInter, 9371 FormulaSimplificationTreeSizeReductionInter, 7.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...