/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_i25_o25-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:07:35,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:07:35,652 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:07:35,688 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:07:35,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:07:35,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:07:35,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:07:35,694 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:07:35,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:07:35,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:07:35,699 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:07:35,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:07:35,701 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:07:35,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:07:35,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:07:35,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:07:35,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:07:35,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:07:35,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:07:35,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:07:35,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:07:35,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:07:35,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:07:35,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:07:35,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:07:35,749 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:07:35,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:07:35,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:07:35,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:07:35,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:07:35,759 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:07:35,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:07:35,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:07:35,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:07:35,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:07:35,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:07:35,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:07:35,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:07:35,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:07:35,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:07:35,772 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:07:35,774 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:07:35,799 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:07:35,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:07:35,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:07:35,804 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:07:35,805 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:07:35,805 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:07:35,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:07:35,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:07:35,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:07:35,806 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:07:35,807 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:07:35,807 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:07:35,807 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:07:35,807 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:07:35,808 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:07:35,808 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:07:35,808 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:07:35,808 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:07:35,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:07:35,809 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:07:35,809 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:07:35,809 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:07:35,809 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 05:07:36,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:07:36,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:07:36,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:07:36,352 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:07:36,353 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:07:36,354 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i25_o25-2.c [2020-11-07 05:07:36,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47b0da11f/cfe3bd30fd17475b8383839715ecf8c3/FLAGd67bf377f [2020-11-07 05:07:37,185 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:07:37,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i25_o25-2.c [2020-11-07 05:07:37,193 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47b0da11f/cfe3bd30fd17475b8383839715ecf8c3/FLAGd67bf377f [2020-11-07 05:07:37,547 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47b0da11f/cfe3bd30fd17475b8383839715ecf8c3 [2020-11-07 05:07:37,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:07:37,558 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:07:37,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:07:37,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:07:37,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:07:37,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:07:37" (1/1) ... [2020-11-07 05:07:37,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fdb4534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:37, skipping insertion in model container [2020-11-07 05:07:37,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:07:37" (1/1) ... [2020-11-07 05:07:37,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:07:37,600 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:07:37,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:07:37,753 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:07:37,770 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:07:37,786 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:07:37,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:37 WrapperNode [2020-11-07 05:07:37,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:07:37,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:07:37,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:07:37,789 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:07:37,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:37" (1/1) ... [2020-11-07 05:07:37,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:37" (1/1) ... [2020-11-07 05:07:37,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:37" (1/1) ... [2020-11-07 05:07:37,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:37" (1/1) ... [2020-11-07 05:07:37,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:37" (1/1) ... [2020-11-07 05:07:37,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:37" (1/1) ... [2020-11-07 05:07:37,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:37" (1/1) ... [2020-11-07 05:07:37,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:07:37,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:07:37,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:07:37,821 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:07:37,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:07:37,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:07:37,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:07:37,902 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:07:37,903 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-11-07 05:07:37,903 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:07:37,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:07:37,903 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:07:37,903 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:07:37,904 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:07:37,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:07:37,904 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-11-07 05:07:37,904 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:07:37,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:07:37,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:07:37,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:07:37,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:07:37,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:07:37,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:07:38,237 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:07:38,238 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 05:07:38,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:07:38 BoogieIcfgContainer [2020-11-07 05:07:38,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:07:38,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:07:38,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:07:38,247 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:07:38,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:07:37" (1/3) ... [2020-11-07 05:07:38,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247dc372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:07:38, skipping insertion in model container [2020-11-07 05:07:38,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:37" (2/3) ... [2020-11-07 05:07:38,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247dc372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:07:38, skipping insertion in model container [2020-11-07 05:07:38,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:07:38" (3/3) ... [2020-11-07 05:07:38,251 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i25_o25-2.c [2020-11-07 05:07:38,291 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:07:38,296 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:07:38,311 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:07:38,337 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:07:38,338 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:07:38,338 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:07:38,338 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:07:38,338 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:07:38,339 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:07:38,339 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:07:38,339 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:07:38,356 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-11-07 05:07:38,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 05:07:38,366 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:38,366 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-11-07 05:07:38,367 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:38,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:38,374 INFO L82 PathProgramCache]: Analyzing trace with hash -742560695, now seen corresponding path program 1 times [2020-11-07 05:07:38,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:38,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1977627066] [2020-11-07 05:07:38,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:07:38,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1977627066] [2020-11-07 05:07:38,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:07:38,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:07:38,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033258032] [2020-11-07 05:07:38,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:07:38,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:38,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:07:38,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:07:38,859 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 6 states. [2020-11-07 05:07:39,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:39,202 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-11-07 05:07:39,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:07:39,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 05:07:39,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:39,215 INFO L225 Difference]: With dead ends: 52 [2020-11-07 05:07:39,216 INFO L226 Difference]: Without dead ends: 32 [2020-11-07 05:07:39,220 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:07:39,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-11-07 05:07:39,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-11-07 05:07:39,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-07 05:07:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-11-07 05:07:39,282 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-11-07 05:07:39,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:39,283 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-11-07 05:07:39,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:07:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-11-07 05:07:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-07 05:07:39,286 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:39,290 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-11-07 05:07:39,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:07:39,291 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:39,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:39,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1024612499, now seen corresponding path program 1 times [2020-11-07 05:07:39,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:39,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1434121542] [2020-11-07 05:07:39,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:07:39,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1434121542] [2020-11-07 05:07:39,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:39,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:07:39,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181805585] [2020-11-07 05:07:39,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:07:39,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:39,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:07:39,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:07:39,572 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2020-11-07 05:07:39,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:39,833 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-11-07 05:07:39,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:07:39,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-11-07 05:07:39,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:39,835 INFO L225 Difference]: With dead ends: 44 [2020-11-07 05:07:39,835 INFO L226 Difference]: Without dead ends: 37 [2020-11-07 05:07:39,837 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-11-07 05:07:39,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-07 05:07:39,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-07 05:07:39,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 05:07:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-11-07 05:07:39,852 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2020-11-07 05:07:39,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:39,852 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-11-07 05:07:39,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:07:39,853 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-11-07 05:07:39,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-07 05:07:39,854 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:39,855 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-11-07 05:07:39,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:07:39,855 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:39,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:39,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1157111945, now seen corresponding path program 2 times [2020-11-07 05:07:39,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:39,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1721668455] [2020-11-07 05:07:39,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-07 05:07:40,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1721668455] [2020-11-07 05:07:40,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:40,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:07:40,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392116116] [2020-11-07 05:07:40,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:07:40,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:40,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:07:40,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:07:40,026 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2020-11-07 05:07:40,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:40,355 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-11-07 05:07:40,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:07:40,355 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-11-07 05:07:40,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:40,357 INFO L225 Difference]: With dead ends: 49 [2020-11-07 05:07:40,357 INFO L226 Difference]: Without dead ends: 42 [2020-11-07 05:07:40,358 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-11-07 05:07:40,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-07 05:07:40,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-07 05:07:40,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-07 05:07:40,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-11-07 05:07:40,373 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 41 [2020-11-07 05:07:40,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:40,374 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-11-07 05:07:40,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:07:40,374 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-11-07 05:07:40,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-07 05:07:40,376 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:40,376 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-11-07 05:07:40,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:07:40,377 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:40,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:40,378 INFO L82 PathProgramCache]: Analyzing trace with hash 2083092563, now seen corresponding path program 3 times [2020-11-07 05:07:40,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:40,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1518586614] [2020-11-07 05:07:40,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,552 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-07 05:07:40,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1518586614] [2020-11-07 05:07:40,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:40,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:07:40,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537909061] [2020-11-07 05:07:40,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:07:40,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:40,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:07:40,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:07:40,556 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 9 states. [2020-11-07 05:07:40,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:40,890 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-11-07 05:07:40,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 05:07:40,891 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-11-07 05:07:40,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:40,893 INFO L225 Difference]: With dead ends: 54 [2020-11-07 05:07:40,893 INFO L226 Difference]: Without dead ends: 47 [2020-11-07 05:07:40,894 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-11-07 05:07:40,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-07 05:07:40,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-11-07 05:07:40,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-07 05:07:40,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-11-07 05:07:40,909 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 49 [2020-11-07 05:07:40,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:40,909 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-11-07 05:07:40,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:07:40,909 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-11-07 05:07:40,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-07 05:07:40,911 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:40,912 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-11-07 05:07:40,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:07:40,912 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:40,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:40,913 INFO L82 PathProgramCache]: Analyzing trace with hash 2025718985, now seen corresponding path program 4 times [2020-11-07 05:07:40,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:40,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [227769216] [2020-11-07 05:07:40,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,108 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-07 05:07:41,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [227769216] [2020-11-07 05:07:41,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:41,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 05:07:41,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468412369] [2020-11-07 05:07:41,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 05:07:41,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:41,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 05:07:41,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:07:41,111 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 10 states. [2020-11-07 05:07:41,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:41,511 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-11-07 05:07:41,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:07:41,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-11-07 05:07:41,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:41,513 INFO L225 Difference]: With dead ends: 59 [2020-11-07 05:07:41,514 INFO L226 Difference]: Without dead ends: 52 [2020-11-07 05:07:41,515 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:07:41,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-07 05:07:41,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-11-07 05:07:41,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-11-07 05:07:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2020-11-07 05:07:41,529 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 57 [2020-11-07 05:07:41,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:41,530 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2020-11-07 05:07:41,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 05:07:41,530 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-11-07 05:07:41,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 05:07:41,532 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:41,532 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-11-07 05:07:41,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:07:41,532 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:41,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:41,533 INFO L82 PathProgramCache]: Analyzing trace with hash 2086365203, now seen corresponding path program 5 times [2020-11-07 05:07:41,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:41,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1649145538] [2020-11-07 05:07:41,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,754 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 05:07:41,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1649145538] [2020-11-07 05:07:41,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:41,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 05:07:41,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662090628] [2020-11-07 05:07:41,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 05:07:41,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:41,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 05:07:41,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:07:41,757 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 11 states. [2020-11-07 05:07:42,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:42,211 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-11-07 05:07:42,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:07:42,212 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2020-11-07 05:07:42,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:42,214 INFO L225 Difference]: With dead ends: 64 [2020-11-07 05:07:42,214 INFO L226 Difference]: Without dead ends: 57 [2020-11-07 05:07:42,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-11-07 05:07:42,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-07 05:07:42,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-11-07 05:07:42,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-07 05:07:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-11-07 05:07:42,229 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 65 [2020-11-07 05:07:42,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:42,229 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-11-07 05:07:42,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 05:07:42,230 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-11-07 05:07:42,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 05:07:42,231 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:42,231 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-11-07 05:07:42,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:07:42,232 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:42,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:42,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1881990903, now seen corresponding path program 6 times [2020-11-07 05:07:42,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:42,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [914619664] [2020-11-07 05:07:42,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-11-07 05:07:42,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [914619664] [2020-11-07 05:07:42,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:42,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 05:07:42,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600407988] [2020-11-07 05:07:42,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 05:07:42,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:42,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 05:07:42,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:07:42,476 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2020-11-07 05:07:43,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:43,026 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-11-07 05:07:43,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 05:07:43,026 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-11-07 05:07:43,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:43,029 INFO L225 Difference]: With dead ends: 69 [2020-11-07 05:07:43,029 INFO L226 Difference]: Without dead ends: 62 [2020-11-07 05:07:43,030 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2020-11-07 05:07:43,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-11-07 05:07:43,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-11-07 05:07:43,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-07 05:07:43,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2020-11-07 05:07:43,047 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 73 [2020-11-07 05:07:43,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:43,047 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2020-11-07 05:07:43,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 05:07:43,047 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2020-11-07 05:07:43,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-07 05:07:43,049 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:43,049 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-11-07 05:07:43,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:07:43,050 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:43,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:43,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1486608429, now seen corresponding path program 7 times [2020-11-07 05:07:43,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:43,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [262596043] [2020-11-07 05:07:43,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,369 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-11-07 05:07:43,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [262596043] [2020-11-07 05:07:43,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:43,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 05:07:43,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092105690] [2020-11-07 05:07:43,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 05:07:43,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:43,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 05:07:43,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:07:43,372 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 13 states. [2020-11-07 05:07:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:43,939 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-11-07 05:07:43,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 05:07:43,940 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2020-11-07 05:07:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:43,941 INFO L225 Difference]: With dead ends: 74 [2020-11-07 05:07:43,941 INFO L226 Difference]: Without dead ends: 67 [2020-11-07 05:07:43,945 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-11-07 05:07:43,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-11-07 05:07:43,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-11-07 05:07:43,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-07 05:07:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-11-07 05:07:43,972 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 81 [2020-11-07 05:07:43,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:43,973 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-11-07 05:07:43,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 05:07:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-11-07 05:07:43,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-07 05:07:43,977 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:43,977 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-11-07 05:07:43,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:07:43,978 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:43,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:43,978 INFO L82 PathProgramCache]: Analyzing trace with hash -2047124151, now seen corresponding path program 8 times [2020-11-07 05:07:43,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:43,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [21619271] [2020-11-07 05:07:43,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,372 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-07 05:07:44,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [21619271] [2020-11-07 05:07:44,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:44,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 05:07:44,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273789105] [2020-11-07 05:07:44,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 05:07:44,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:44,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 05:07:44,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:07:44,374 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 14 states. [2020-11-07 05:07:45,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:45,038 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-11-07 05:07:45,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 05:07:45,039 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2020-11-07 05:07:45,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:45,041 INFO L225 Difference]: With dead ends: 79 [2020-11-07 05:07:45,041 INFO L226 Difference]: Without dead ends: 72 [2020-11-07 05:07:45,043 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2020-11-07 05:07:45,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-11-07 05:07:45,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-11-07 05:07:45,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-07 05:07:45,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-11-07 05:07:45,059 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 89 [2020-11-07 05:07:45,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:45,059 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-11-07 05:07:45,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 05:07:45,059 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-11-07 05:07:45,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-07 05:07:45,061 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:45,061 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-11-07 05:07:45,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:07:45,061 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:45,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:45,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1811920787, now seen corresponding path program 9 times [2020-11-07 05:07:45,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:45,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1577197519] [2020-11-07 05:07:45,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,429 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-11-07 05:07:45,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1577197519] [2020-11-07 05:07:45,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:45,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 05:07:45,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781362531] [2020-11-07 05:07:45,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 05:07:45,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:45,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 05:07:45,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:07:45,432 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2020-11-07 05:07:46,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:46,108 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-11-07 05:07:46,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 05:07:46,109 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2020-11-07 05:07:46,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:46,110 INFO L225 Difference]: With dead ends: 84 [2020-11-07 05:07:46,110 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 05:07:46,112 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-11-07 05:07:46,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 05:07:46,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-11-07 05:07:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-07 05:07:46,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2020-11-07 05:07:46,143 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 97 [2020-11-07 05:07:46,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:46,143 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2020-11-07 05:07:46,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 05:07:46,144 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2020-11-07 05:07:46,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-11-07 05:07:46,146 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:46,146 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-11-07 05:07:46,146 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:07:46,147 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:46,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:46,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1912263049, now seen corresponding path program 10 times [2020-11-07 05:07:46,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:46,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1460217543] [2020-11-07 05:07:46,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,572 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-11-07 05:07:46,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1460217543] [2020-11-07 05:07:46,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:46,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 05:07:46,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665617720] [2020-11-07 05:07:46,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 05:07:46,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:46,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 05:07:46,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-11-07 05:07:46,575 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 16 states. [2020-11-07 05:07:47,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:47,284 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-11-07 05:07:47,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 05:07:47,284 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-11-07 05:07:47,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:47,285 INFO L225 Difference]: With dead ends: 89 [2020-11-07 05:07:47,285 INFO L226 Difference]: Without dead ends: 82 [2020-11-07 05:07:47,287 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-11-07 05:07:47,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-11-07 05:07:47,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-11-07 05:07:47,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-07 05:07:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2020-11-07 05:07:47,303 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 105 [2020-11-07 05:07:47,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:47,304 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2020-11-07 05:07:47,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 05:07:47,304 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2020-11-07 05:07:47,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-11-07 05:07:47,305 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:47,305 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-11-07 05:07:47,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:07:47,306 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:47,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:47,306 INFO L82 PathProgramCache]: Analyzing trace with hash -34990253, now seen corresponding path program 11 times [2020-11-07 05:07:47,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:47,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [951577385] [2020-11-07 05:07:47,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-11-07 05:07:47,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [951577385] [2020-11-07 05:07:47,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:47,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 05:07:47,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402993897] [2020-11-07 05:07:47,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 05:07:47,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:47,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 05:07:47,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:07:47,817 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 17 states. [2020-11-07 05:07:48,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:48,608 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-11-07 05:07:48,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 05:07:48,608 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 113 [2020-11-07 05:07:48,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:48,609 INFO L225 Difference]: With dead ends: 94 [2020-11-07 05:07:48,610 INFO L226 Difference]: Without dead ends: 87 [2020-11-07 05:07:48,611 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-11-07 05:07:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-07 05:07:48,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-11-07 05:07:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-11-07 05:07:48,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2020-11-07 05:07:48,634 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 113 [2020-11-07 05:07:48,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:48,635 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2020-11-07 05:07:48,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 05:07:48,635 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2020-11-07 05:07:48,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-11-07 05:07:48,640 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:48,641 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-11-07 05:07:48,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 05:07:48,641 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:48,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:48,642 INFO L82 PathProgramCache]: Analyzing trace with hash -980060727, now seen corresponding path program 12 times [2020-11-07 05:07:48,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:48,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [530308065] [2020-11-07 05:07:48,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-11-07 05:07:49,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [530308065] [2020-11-07 05:07:49,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:49,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 05:07:49,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034911910] [2020-11-07 05:07:49,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 05:07:49,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:49,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 05:07:49,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-11-07 05:07:49,359 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 18 states. [2020-11-07 05:07:50,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:50,227 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-11-07 05:07:50,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 05:07:50,228 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2020-11-07 05:07:50,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:50,229 INFO L225 Difference]: With dead ends: 99 [2020-11-07 05:07:50,229 INFO L226 Difference]: Without dead ends: 92 [2020-11-07 05:07:50,231 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2020-11-07 05:07:50,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-07 05:07:50,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-11-07 05:07:50,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-07 05:07:50,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2020-11-07 05:07:50,249 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 121 [2020-11-07 05:07:50,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:50,249 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2020-11-07 05:07:50,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 05:07:50,249 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2020-11-07 05:07:50,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-11-07 05:07:50,251 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:50,251 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-11-07 05:07:50,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 05:07:50,252 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:50,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:50,252 INFO L82 PathProgramCache]: Analyzing trace with hash 366954259, now seen corresponding path program 13 times [2020-11-07 05:07:50,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:50,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [730868801] [2020-11-07 05:07:50,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-11-07 05:07:50,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [730868801] [2020-11-07 05:07:50,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:50,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-11-07 05:07:50,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578490900] [2020-11-07 05:07:50,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 05:07:50,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:50,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 05:07:50,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-11-07 05:07:50,833 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 19 states. [2020-11-07 05:07:51,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:51,754 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2020-11-07 05:07:51,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 05:07:51,755 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 129 [2020-11-07 05:07:51,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:51,757 INFO L225 Difference]: With dead ends: 104 [2020-11-07 05:07:51,757 INFO L226 Difference]: Without dead ends: 97 [2020-11-07 05:07:51,759 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2020-11-07 05:07:51,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-11-07 05:07:51,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-11-07 05:07:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-11-07 05:07:51,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2020-11-07 05:07:51,773 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 129 [2020-11-07 05:07:51,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:51,774 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2020-11-07 05:07:51,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 05:07:51,774 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2020-11-07 05:07:51,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-11-07 05:07:51,776 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:51,776 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-11-07 05:07:51,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 05:07:51,776 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:51,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:51,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1919989239, now seen corresponding path program 14 times [2020-11-07 05:07:51,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:51,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [533067762] [2020-11-07 05:07:51,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,530 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-11-07 05:07:52,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [533067762] [2020-11-07 05:07:52,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:52,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-11-07 05:07:52,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708082470] [2020-11-07 05:07:52,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 05:07:52,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:52,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 05:07:52,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-11-07 05:07:52,533 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 20 states. [2020-11-07 05:07:53,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:53,460 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2020-11-07 05:07:53,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 05:07:53,461 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 137 [2020-11-07 05:07:53,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:53,463 INFO L225 Difference]: With dead ends: 109 [2020-11-07 05:07:53,463 INFO L226 Difference]: Without dead ends: 102 [2020-11-07 05:07:53,468 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-11-07 05:07:53,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-11-07 05:07:53,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-11-07 05:07:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-11-07 05:07:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2020-11-07 05:07:53,488 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 137 [2020-11-07 05:07:53,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:53,489 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2020-11-07 05:07:53,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 05:07:53,490 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2020-11-07 05:07:53,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-11-07 05:07:53,491 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:53,491 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-11-07 05:07:53,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 05:07:53,493 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:53,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:53,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1315223853, now seen corresponding path program 15 times [2020-11-07 05:07:53,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:53,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1063310247] [2020-11-07 05:07:53,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-11-07 05:07:54,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1063310247] [2020-11-07 05:07:54,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:54,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-11-07 05:07:54,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813801956] [2020-11-07 05:07:54,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-07 05:07:54,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:54,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-07 05:07:54,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2020-11-07 05:07:54,334 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 21 states. [2020-11-07 05:07:55,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:55,446 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2020-11-07 05:07:55,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 05:07:55,447 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 145 [2020-11-07 05:07:55,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:55,448 INFO L225 Difference]: With dead ends: 114 [2020-11-07 05:07:55,448 INFO L226 Difference]: Without dead ends: 107 [2020-11-07 05:07:55,450 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=503, Invalid=979, Unknown=0, NotChecked=0, Total=1482 [2020-11-07 05:07:55,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-11-07 05:07:55,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-11-07 05:07:55,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-11-07 05:07:55,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2020-11-07 05:07:55,465 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 145 [2020-11-07 05:07:55,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:55,465 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2020-11-07 05:07:55,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-07 05:07:55,466 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2020-11-07 05:07:55,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-11-07 05:07:55,467 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:55,468 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-11-07 05:07:55,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 05:07:55,468 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:55,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:55,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1314107831, now seen corresponding path program 16 times [2020-11-07 05:07:55,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:55,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1087811395] [2020-11-07 05:07:55,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-11-07 05:07:56,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1087811395] [2020-11-07 05:07:56,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:56,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-11-07 05:07:56,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995213333] [2020-11-07 05:07:56,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 05:07:56,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:56,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 05:07:56,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2020-11-07 05:07:56,363 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 22 states. [2020-11-07 05:07:57,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:57,493 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2020-11-07 05:07:57,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 05:07:57,499 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 153 [2020-11-07 05:07:57,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:57,501 INFO L225 Difference]: With dead ends: 119 [2020-11-07 05:07:57,501 INFO L226 Difference]: Without dead ends: 112 [2020-11-07 05:07:57,502 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-11-07 05:07:57,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-07 05:07:57,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-11-07 05:07:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-07 05:07:57,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2020-11-07 05:07:57,517 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 153 [2020-11-07 05:07:57,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:57,517 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2020-11-07 05:07:57,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 05:07:57,518 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2020-11-07 05:07:57,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-11-07 05:07:57,519 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:57,520 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-11-07 05:07:57,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 05:07:57,520 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:57,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:57,520 INFO L82 PathProgramCache]: Analyzing trace with hash -740682093, now seen corresponding path program 17 times [2020-11-07 05:07:57,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:57,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2020430891] [2020-11-07 05:07:57,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:58,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:58,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:58,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:58,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:58,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:58,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:58,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-11-07 05:07:58,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2020430891] [2020-11-07 05:07:58,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:58,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-11-07 05:07:58,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309166274] [2020-11-07 05:07:58,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 05:07:58,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:58,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 05:07:58,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2020-11-07 05:07:58,359 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 23 states. [2020-11-07 05:07:59,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:59,510 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2020-11-07 05:07:59,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 05:07:59,510 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 161 [2020-11-07 05:07:59,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:59,512 INFO L225 Difference]: With dead ends: 124 [2020-11-07 05:07:59,512 INFO L226 Difference]: Without dead ends: 117 [2020-11-07 05:07:59,513 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=618, Invalid=1188, Unknown=0, NotChecked=0, Total=1806 [2020-11-07 05:07:59,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-11-07 05:07:59,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2020-11-07 05:07:59,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-11-07 05:07:59,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2020-11-07 05:07:59,529 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 161 [2020-11-07 05:07:59,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:59,529 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2020-11-07 05:07:59,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 05:07:59,529 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2020-11-07 05:07:59,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-11-07 05:07:59,531 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:59,532 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-11-07 05:07:59,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 05:07:59,532 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:59,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:59,533 INFO L82 PathProgramCache]: Analyzing trace with hash 883982985, now seen corresponding path program 18 times [2020-11-07 05:07:59,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:59,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1718361262] [2020-11-07 05:07:59,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:00,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:00,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:00,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:00,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:00,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:00,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:00,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:00,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:00,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-11-07 05:08:00,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1718361262] [2020-11-07 05:08:00,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:00,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-11-07 05:08:00,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678051744] [2020-11-07 05:08:00,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-07 05:08:00,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:00,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-07 05:08:00,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=336, Unknown=0, NotChecked=0, Total=552 [2020-11-07 05:08:00,471 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 24 states. [2020-11-07 05:08:01,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:01,707 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2020-11-07 05:08:01,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-07 05:08:01,707 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 169 [2020-11-07 05:08:01,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:01,710 INFO L225 Difference]: With dead ends: 129 [2020-11-07 05:08:01,710 INFO L226 Difference]: Without dead ends: 122 [2020-11-07 05:08:01,711 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-11-07 05:08:01,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-11-07 05:08:01,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-11-07 05:08:01,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-11-07 05:08:01,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2020-11-07 05:08:01,727 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 169 [2020-11-07 05:08:01,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:01,727 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2020-11-07 05:08:01,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-07 05:08:01,727 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2020-11-07 05:08:01,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-11-07 05:08:01,730 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:01,730 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-11-07 05:08:01,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-07 05:08:01,730 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:01,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:01,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1146598995, now seen corresponding path program 19 times [2020-11-07 05:08:01,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:01,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2130306606] [2020-11-07 05:08:01,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:08:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:02,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:02,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:02,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:02,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:02,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:02,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:02,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:02,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:02,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:02,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:02,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:02,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:02,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:02,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:02,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-11-07 05:08:02,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2130306606] [2020-11-07 05:08:02,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:02,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-11-07 05:08:02,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308480961] [2020-11-07 05:08:02,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-07 05:08:02,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:02,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-07 05:08:02,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=363, Unknown=0, NotChecked=0, Total=600 [2020-11-07 05:08:02,762 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 25 states. [2020-11-07 05:08:04,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:04,066 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2020-11-07 05:08:04,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 05:08:04,067 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 177 [2020-11-07 05:08:04,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:04,069 INFO L225 Difference]: With dead ends: 134 [2020-11-07 05:08:04,069 INFO L226 Difference]: Without dead ends: 127 [2020-11-07 05:08:04,070 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-11-07 05:08:04,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-11-07 05:08:04,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-11-07 05:08:04,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-07 05:08:04,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2020-11-07 05:08:04,084 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 177 [2020-11-07 05:08:04,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:04,085 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2020-11-07 05:08:04,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-07 05:08:04,085 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2020-11-07 05:08:04,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-11-07 05:08:04,086 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:04,087 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-11-07 05:08:04,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-07 05:08:04,087 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:04,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:04,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1952442057, now seen corresponding path program 20 times [2020-11-07 05:08:04,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:04,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1827805939] [2020-11-07 05:08:04,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:08:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2020-11-07 05:08:05,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1827805939] [2020-11-07 05:08:05,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:05,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-11-07 05:08:05,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591418136] [2020-11-07 05:08:05,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-11-07 05:08:05,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:05,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-07 05:08:05,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2020-11-07 05:08:05,169 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 26 states. [2020-11-07 05:08:06,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:06,546 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2020-11-07 05:08:06,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-07 05:08:06,547 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 185 [2020-11-07 05:08:06,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:06,549 INFO L225 Difference]: With dead ends: 139 [2020-11-07 05:08:06,549 INFO L226 Difference]: Without dead ends: 132 [2020-11-07 05:08:06,554 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=813, Invalid=1539, Unknown=0, NotChecked=0, Total=2352 [2020-11-07 05:08:06,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-11-07 05:08:06,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-11-07 05:08:06,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-11-07 05:08:06,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2020-11-07 05:08:06,575 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 185 [2020-11-07 05:08:06,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:06,577 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2020-11-07 05:08:06,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-11-07 05:08:06,577 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2020-11-07 05:08:06,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-11-07 05:08:06,579 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:06,579 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-11-07 05:08:06,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-07 05:08:06,579 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:06,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:06,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1339041299, now seen corresponding path program 21 times [2020-11-07 05:08:06,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:06,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1836772070] [2020-11-07 05:08:06,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:06,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:06,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:08:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:06,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:06,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:06,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:06,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:06,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:06,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2020-11-07 05:08:07,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1836772070] [2020-11-07 05:08:07,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:07,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-11-07 05:08:07,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289279362] [2020-11-07 05:08:07,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-11-07 05:08:07,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:07,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-11-07 05:08:07,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=420, Unknown=0, NotChecked=0, Total=702 [2020-11-07 05:08:07,808 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 27 states. [2020-11-07 05:08:09,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:09,267 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2020-11-07 05:08:09,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-07 05:08:09,268 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 193 [2020-11-07 05:08:09,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:09,270 INFO L225 Difference]: With dead ends: 144 [2020-11-07 05:08:09,270 INFO L226 Difference]: Without dead ends: 137 [2020-11-07 05:08:09,271 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=884, Invalid=1666, Unknown=0, NotChecked=0, Total=2550 [2020-11-07 05:08:09,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-11-07 05:08:09,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-11-07 05:08:09,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-11-07 05:08:09,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2020-11-07 05:08:09,289 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 193 [2020-11-07 05:08:09,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:09,290 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2020-11-07 05:08:09,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-11-07 05:08:09,290 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2020-11-07 05:08:09,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-11-07 05:08:09,291 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:09,291 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-11-07 05:08:09,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-07 05:08:09,292 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:09,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:09,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1769896713, now seen corresponding path program 22 times [2020-11-07 05:08:09,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:09,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2089253761] [2020-11-07 05:08:09,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:08:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2020-11-07 05:08:10,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2089253761] [2020-11-07 05:08:10,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:10,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-11-07 05:08:10,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956453537] [2020-11-07 05:08:10,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-11-07 05:08:10,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:10,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-11-07 05:08:10,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=450, Unknown=0, NotChecked=0, Total=756 [2020-11-07 05:08:10,830 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 28 states. [2020-11-07 05:08:12,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:12,338 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2020-11-07 05:08:12,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 05:08:12,339 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 201 [2020-11-07 05:08:12,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:12,341 INFO L225 Difference]: With dead ends: 149 [2020-11-07 05:08:12,342 INFO L226 Difference]: Without dead ends: 142 [2020-11-07 05:08:12,344 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=958, Invalid=1798, Unknown=0, NotChecked=0, Total=2756 [2020-11-07 05:08:12,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-11-07 05:08:12,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-11-07 05:08:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-11-07 05:08:12,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2020-11-07 05:08:12,361 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 201 [2020-11-07 05:08:12,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:12,362 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2020-11-07 05:08:12,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-11-07 05:08:12,362 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2020-11-07 05:08:12,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-11-07 05:08:12,363 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:12,364 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-11-07 05:08:12,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-07 05:08:12,364 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:12,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:12,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2013305389, now seen corresponding path program 23 times [2020-11-07 05:08:12,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:12,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1370616136] [2020-11-07 05:08:12,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:12,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:12,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:08:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:12,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:12,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:12,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:12,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:12,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:12,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:12,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:12,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:12,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:12,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:12,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2020-11-07 05:08:13,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1370616136] [2020-11-07 05:08:13,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:13,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2020-11-07 05:08:13,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952158716] [2020-11-07 05:08:13,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-11-07 05:08:13,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:13,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-11-07 05:08:13,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=481, Unknown=0, NotChecked=0, Total=812 [2020-11-07 05:08:13,756 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 29 states. [2020-11-07 05:08:15,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:15,429 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2020-11-07 05:08:15,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-07 05:08:15,430 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 209 [2020-11-07 05:08:15,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:15,432 INFO L225 Difference]: With dead ends: 154 [2020-11-07 05:08:15,433 INFO L226 Difference]: Without dead ends: 147 [2020-11-07 05:08:15,434 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-11-07 05:08:15,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-11-07 05:08:15,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2020-11-07 05:08:15,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-11-07 05:08:15,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2020-11-07 05:08:15,453 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 209 [2020-11-07 05:08:15,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:15,454 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2020-11-07 05:08:15,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-11-07 05:08:15,454 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2020-11-07 05:08:15,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2020-11-07 05:08:15,455 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:15,455 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-11-07 05:08:15,456 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-07 05:08:15,456 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:15,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:15,456 INFO L82 PathProgramCache]: Analyzing trace with hash -405782711, now seen corresponding path program 24 times [2020-11-07 05:08:15,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:15,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [119096890] [2020-11-07 05:08:15,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:15,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:15,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:08:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:15,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:15,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:15,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:15,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:15,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:15,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:15,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:15,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:15,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2020-11-07 05:08:16,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [119096890] [2020-11-07 05:08:16,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:16,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2020-11-07 05:08:16,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770079983] [2020-11-07 05:08:16,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-11-07 05:08:16,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:16,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-11-07 05:08:16,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=513, Unknown=0, NotChecked=0, Total=870 [2020-11-07 05:08:16,937 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 30 states. [2020-11-07 05:08:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:18,629 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2020-11-07 05:08:18,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-07 05:08:18,629 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 217 [2020-11-07 05:08:18,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:18,631 INFO L225 Difference]: With dead ends: 159 [2020-11-07 05:08:18,631 INFO L226 Difference]: Without dead ends: 152 [2020-11-07 05:08:18,633 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-11-07 05:08:18,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-11-07 05:08:18,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2020-11-07 05:08:18,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-11-07 05:08:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2020-11-07 05:08:18,654 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 217 [2020-11-07 05:08:18,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:18,655 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2020-11-07 05:08:18,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-11-07 05:08:18,655 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2020-11-07 05:08:18,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-11-07 05:08:18,658 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:18,658 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-11-07 05:08:18,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-07 05:08:18,658 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:18,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:18,659 INFO L82 PathProgramCache]: Analyzing trace with hash -2086570605, now seen corresponding path program 25 times [2020-11-07 05:08:18,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:18,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1435169036] [2020-11-07 05:08:18,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:08:18,720 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:08:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:08:18,786 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:08:18,875 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 05:08:18,875 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 05:08:18,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-07 05:08:19,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:08:19 BoogieIcfgContainer [2020-11-07 05:08:19,014 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:08:19,017 INFO L168 Benchmark]: Toolchain (without parser) took 41462.99 ms. Allocated memory was 152.0 MB in the beginning and 571.5 MB in the end (delta: 419.4 MB). Free memory was 129.1 MB in the beginning and 484.1 MB in the end (delta: -355.1 MB). Peak memory consumption was 65.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:19,017 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 152.0 MB. Free memory was 126.7 MB in the beginning and 126.6 MB in the end (delta: 120.3 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:08:19,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.00 ms. Allocated memory is still 152.0 MB. Free memory was 128.6 MB in the beginning and 119.6 MB in the end (delta: 8.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:19,018 INFO L168 Benchmark]: Boogie Preprocessor took 31.82 ms. Allocated memory is still 152.0 MB. Free memory was 119.6 MB in the beginning and 118.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:19,023 INFO L168 Benchmark]: RCFGBuilder took 419.82 ms. Allocated memory is still 152.0 MB. Free memory was 118.1 MB in the beginning and 105.5 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:19,024 INFO L168 Benchmark]: TraceAbstraction took 40771.44 ms. Allocated memory was 152.0 MB in the beginning and 571.5 MB in the end (delta: 419.4 MB). Free memory was 105.1 MB in the beginning and 484.1 MB in the end (delta: -379.1 MB). Peak memory consumption was 41.3 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:19,026 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 152.0 MB. Free memory was 126.7 MB in the beginning and 126.6 MB in the end (delta: 120.3 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 226.00 ms. Allocated memory is still 152.0 MB. Free memory was 128.6 MB in the beginning and 119.6 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.82 ms. Allocated memory is still 152.0 MB. Free memory was 119.6 MB in the beginning and 118.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 419.82 ms. Allocated memory is still 152.0 MB. Free memory was 118.1 MB in the beginning and 105.5 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 40771.44 ms. Allocated memory was 152.0 MB in the beginning and 571.5 MB in the end (delta: 419.4 MB). Free memory was 105.1 MB in the beginning and 484.1 MB in the end (delta: -379.1 MB). Peak memory consumption was 41.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int input = 25; VAL [input=25] [L13] CALL, EXPR id(input) VAL [\old(x)=25] [L7] COND FALSE !(x==0) VAL [\old(x)=25, x=25] [L8] CALL, EXPR id(x-1) VAL [\old(x)=24] [L7] COND FALSE !(x==0) VAL [\old(x)=24, x=24] [L8] CALL, EXPR id(x-1) VAL [\old(x)=23] [L7] COND FALSE !(x==0) VAL [\old(x)=23, x=23] [L8] CALL, EXPR id(x-1) VAL [\old(x)=22] [L7] COND FALSE !(x==0) VAL [\old(x)=22, x=22] [L8] CALL, EXPR id(x-1) VAL [\old(x)=21] [L7] COND FALSE !(x==0) VAL [\old(x)=21, x=21] [L8] CALL, EXPR id(x-1) VAL [\old(x)=20] [L7] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L8] CALL, EXPR id(x-1) VAL [\old(x)=19] [L7] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L8] CALL, EXPR id(x-1) VAL [\old(x)=18] [L7] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L8] CALL, EXPR id(x-1) VAL [\old(x)=17] [L7] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L8] CALL, EXPR id(x-1) VAL [\old(x)=16] [L7] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L8] CALL, EXPR id(x-1) VAL [\old(x)=15] [L7] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L8] CALL, EXPR id(x-1) VAL [\old(x)=14] [L7] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L8] CALL, EXPR id(x-1) VAL [\old(x)=13] [L7] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L8] CALL, EXPR id(x-1) VAL [\old(x)=12] [L7] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L8] CALL, EXPR id(x-1) VAL [\old(x)=11] [L7] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L8] CALL, EXPR id(x-1) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 VAL [\old(x)=0, x=0] [L7] return 0; VAL [\old(x)=0, \result=0, x=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L8] return id(x-1) + 1; VAL [\old(x)=1, \result=1, id(x-1)=0, x=1] [L8] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L8] return id(x-1) + 1; VAL [\old(x)=2, \result=2, id(x-1)=1, x=2] [L8] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L8] return id(x-1) + 1; VAL [\old(x)=3, \result=3, id(x-1)=2, x=3] [L8] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L8] return id(x-1) + 1; VAL [\old(x)=4, \result=4, id(x-1)=3, x=4] [L8] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L8] return id(x-1) + 1; VAL [\old(x)=5, \result=5, id(x-1)=4, x=5] [L8] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L8] return id(x-1) + 1; VAL [\old(x)=6, \result=6, id(x-1)=5, x=6] [L8] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L8] return id(x-1) + 1; VAL [\old(x)=7, \result=7, id(x-1)=6, x=7] [L8] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L8] return id(x-1) + 1; VAL [\old(x)=8, \result=8, id(x-1)=7, x=8] [L8] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L8] return id(x-1) + 1; VAL [\old(x)=9, \result=9, id(x-1)=8, x=9] [L8] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L8] return id(x-1) + 1; VAL [\old(x)=10, \result=10, id(x-1)=9, x=10] [L8] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L8] return id(x-1) + 1; VAL [\old(x)=11, \result=11, id(x-1)=10, x=11] [L8] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L8] return id(x-1) + 1; VAL [\old(x)=12, \result=12, id(x-1)=11, x=12] [L8] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L8] return id(x-1) + 1; VAL [\old(x)=13, \result=13, id(x-1)=12, x=13] [L8] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L8] return id(x-1) + 1; VAL [\old(x)=14, \result=14, id(x-1)=13, x=14] [L8] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L8] return id(x-1) + 1; VAL [\old(x)=15, \result=15, id(x-1)=14, x=15] [L8] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L8] return id(x-1) + 1; VAL [\old(x)=16, \result=16, id(x-1)=15, x=16] [L8] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L8] return id(x-1) + 1; VAL [\old(x)=17, \result=17, id(x-1)=16, x=17] [L8] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L8] return id(x-1) + 1; VAL [\old(x)=18, \result=18, id(x-1)=17, x=18] [L8] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L8] return id(x-1) + 1; VAL [\old(x)=19, \result=19, id(x-1)=18, x=19] [L8] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L8] return id(x-1) + 1; VAL [\old(x)=20, \result=20, id(x-1)=19, x=20] [L8] RET, EXPR id(x-1) VAL [\old(x)=21, id(x-1)=20, x=21] [L8] return id(x-1) + 1; VAL [\old(x)=21, \result=21, id(x-1)=20, x=21] [L8] RET, EXPR id(x-1) VAL [\old(x)=22, id(x-1)=21, x=22] [L8] return id(x-1) + 1; VAL [\old(x)=22, \result=22, id(x-1)=21, x=22] [L8] RET, EXPR id(x-1) VAL [\old(x)=23, id(x-1)=22, x=23] [L8] return id(x-1) + 1; VAL [\old(x)=23, \result=23, id(x-1)=22, x=23] [L8] RET, EXPR id(x-1) VAL [\old(x)=24, id(x-1)=23, x=24] [L8] return id(x-1) + 1; VAL [\old(x)=24, \result=24, id(x-1)=23, x=24] [L8] RET, EXPR id(x-1) VAL [\old(x)=25, id(x-1)=24, x=25] [L8] return id(x-1) + 1; VAL [\old(x)=25, \result=25, id(x-1)=24, x=25] [L13] RET, EXPR id(input) VAL [id(input)=25, input=25] [L13] int result = id(input); VAL [id(input)=25, input=25, result=25] [L14] COND TRUE result == 25 VAL [input=25, result=25] [L15] CALL reach_error() [L4] __assert_fail("0", "id_i25_o25-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 40.5s, OverallIterations: 26, TraceHistogramMax: 26, AutomataDifference: 22.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 678 SDtfs, 3123 SDslu, 1646 SDs, 0 SdLazy, 3167 SolverSat, 918 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1477 GetRequests, 701 SyntacticMatches, 0 SemanticMatches, 776 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5853 ImplicationChecksByTransitivity, 21.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 3250 NumberOfCodeBlocks, 3250 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3000 ConstructedInterpolants, 0 QuantifiedInterpolants, 1212848 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 1 PerfectInterpolantSequences, 7500/19600 InterpolantCoveringCapability, 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 incorrect! Received shutdown request...