/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-b8ad66e [2020-10-24 00:55:10,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:55:10,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:55:10,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:55:10,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:55:10,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:55:10,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:55:10,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:55:10,746 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:55:10,753 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:55:10,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:55:10,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:55:10,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:55:10,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:55:10,762 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:55:10,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:55:10,765 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:55:10,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:55:10,776 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:55:10,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:55:10,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:55:10,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:55:10,794 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:55:10,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:55:10,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:55:10,805 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:55:10,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:55:10,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:55:10,808 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:55:10,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:55:10,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:55:10,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:55:10,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:55:10,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:55:10,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:55:10,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:55:10,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:55:10,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:55:10,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:55:10,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:55:10,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:55:10,819 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:55:10,842 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:55:10,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:55:10,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:55:10,846 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:55:10,847 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:55:10,847 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:55:10,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:55:10,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:55:10,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:55:10,848 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:55:10,849 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:55:10,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:55:10,849 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:55:10,849 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:55:10,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:55:10,850 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:55:10,850 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:55:10,850 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:55:10,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:55:10,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:55:10,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:55:10,851 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:55:10,851 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 00:55:11,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:55:11,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:55:11,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:55:11,316 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:55:11,317 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:55:11,318 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-10-24 00:55:11,394 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c7749fd3/de8218087a95408ba742e07a59aac9c6/FLAG049fe7532 [2020-10-24 00:55:12,111 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:55:12,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i25_o25-2.c [2020-10-24 00:55:12,119 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c7749fd3/de8218087a95408ba742e07a59aac9c6/FLAG049fe7532 [2020-10-24 00:55:12,481 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c7749fd3/de8218087a95408ba742e07a59aac9c6 [2020-10-24 00:55:12,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:55:12,492 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:55:12,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:55:12,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:55:12,504 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:55:12,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:55:12" (1/1) ... [2020-10-24 00:55:12,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d47503e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:12, skipping insertion in model container [2020-10-24 00:55:12,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:55:12" (1/1) ... [2020-10-24 00:55:12,518 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:55:12,535 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:55:12,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:55:12,758 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:55:12,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:55:12,794 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:55:12,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:12 WrapperNode [2020-10-24 00:55:12,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:55:12,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:55:12,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:55:12,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:55:12,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:12" (1/1) ... [2020-10-24 00:55:12,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:12" (1/1) ... [2020-10-24 00:55:12,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:12" (1/1) ... [2020-10-24 00:55:12,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:12" (1/1) ... [2020-10-24 00:55:12,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:12" (1/1) ... [2020-10-24 00:55:12,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:12" (1/1) ... [2020-10-24 00:55:12,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:12" (1/1) ... [2020-10-24 00:55:12,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:55:12,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:55:12,840 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:55:12,840 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:55:12,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:55:12,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:55:12,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:55:12,929 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:55:12,929 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-10-24 00:55:12,929 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:55:12,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:55:12,930 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:55:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:55:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:55:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:55:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-10-24 00:55:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:55:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:55:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:55:12,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:55:12,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:55:12,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:55:12,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:55:13,468 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:55:13,469 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:55:13,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:55:13 BoogieIcfgContainer [2020-10-24 00:55:13,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:55:13,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:55:13,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:55:13,483 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:55:13,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:55:12" (1/3) ... [2020-10-24 00:55:13,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab94895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:55:13, skipping insertion in model container [2020-10-24 00:55:13,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:12" (2/3) ... [2020-10-24 00:55:13,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab94895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:55:13, skipping insertion in model container [2020-10-24 00:55:13,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:55:13" (3/3) ... [2020-10-24 00:55:13,489 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i25_o25-2.c [2020-10-24 00:55:13,503 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:55:13,510 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:55:13,525 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:55:13,569 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:55:13,569 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:55:13,570 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:55:13,570 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:55:13,570 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:55:13,570 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:55:13,570 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:55:13,570 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:55:13,592 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-10-24 00:55:13,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 00:55:13,604 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:13,605 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:13,606 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:13,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:13,620 INFO L82 PathProgramCache]: Analyzing trace with hash -742560695, now seen corresponding path program 1 times [2020-10-24 00:55:13,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:13,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1184167742] [2020-10-24 00:55:13,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:55:14,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1184167742] [2020-10-24 00:55:14,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:55:14,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:55:14,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582906244] [2020-10-24 00:55:14,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:55:14,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:14,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:55:14,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:55:14,093 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 6 states. [2020-10-24 00:55:14,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:14,479 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-10-24 00:55:14,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:55:14,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-24 00:55:14,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:14,493 INFO L225 Difference]: With dead ends: 52 [2020-10-24 00:55:14,493 INFO L226 Difference]: Without dead ends: 32 [2020-10-24 00:55:14,497 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-10-24 00:55:14,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-10-24 00:55:14,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-10-24 00:55:14,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-24 00:55:14,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-10-24 00:55:14,573 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-10-24 00:55:14,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:14,573 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-10-24 00:55:14,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:55:14,574 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-10-24 00:55:14,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-24 00:55:14,578 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:14,578 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:14,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:55:14,579 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:14,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:14,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1024612499, now seen corresponding path program 1 times [2020-10-24 00:55:14,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:14,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1599425396] [2020-10-24 00:55:14,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 00:55:14,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1599425396] [2020-10-24 00:55:14,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:14,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:55:14,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652851416] [2020-10-24 00:55:14,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:55:14,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:14,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:55:14,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:55:14,856 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2020-10-24 00:55:15,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:15,180 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-10-24 00:55:15,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:55:15,180 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-10-24 00:55:15,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:15,182 INFO L225 Difference]: With dead ends: 44 [2020-10-24 00:55:15,183 INFO L226 Difference]: Without dead ends: 37 [2020-10-24 00:55:15,184 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:55:15,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-24 00:55:15,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-24 00:55:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-24 00:55:15,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-10-24 00:55:15,200 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2020-10-24 00:55:15,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:15,200 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-10-24 00:55:15,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:55:15,200 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-10-24 00:55:15,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-24 00:55:15,202 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:15,202 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:15,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:55:15,203 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:15,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:15,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1157111945, now seen corresponding path program 2 times [2020-10-24 00:55:15,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:15,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1229975877] [2020-10-24 00:55:15,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:15,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:15,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:15,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:15,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:15,437 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-24 00:55:15,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1229975877] [2020-10-24 00:55:15,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:15,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:55:15,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198069678] [2020-10-24 00:55:15,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:55:15,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:15,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:55:15,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:55:15,441 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2020-10-24 00:55:15,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:15,812 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-10-24 00:55:15,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:55:15,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-10-24 00:55:15,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:15,816 INFO L225 Difference]: With dead ends: 49 [2020-10-24 00:55:15,816 INFO L226 Difference]: Without dead ends: 42 [2020-10-24 00:55:15,817 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:55:15,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-10-24 00:55:15,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-10-24 00:55:15,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-24 00:55:15,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-10-24 00:55:15,835 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 41 [2020-10-24 00:55:15,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:15,835 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-10-24 00:55:15,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:55:15,836 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-10-24 00:55:15,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-24 00:55:15,838 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:15,838 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:15,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:55:15,838 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:15,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:15,840 INFO L82 PathProgramCache]: Analyzing trace with hash 2083092563, now seen corresponding path program 3 times [2020-10-24 00:55:15,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:15,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2115473281] [2020-10-24 00:55:15,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:15,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:15,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:15,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,075 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-24 00:55:16,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2115473281] [2020-10-24 00:55:16,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:16,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:55:16,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523990176] [2020-10-24 00:55:16,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:55:16,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:16,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:55:16,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:55:16,079 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 9 states. [2020-10-24 00:55:16,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:16,481 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-10-24 00:55:16,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 00:55:16,482 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-10-24 00:55:16,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:16,484 INFO L225 Difference]: With dead ends: 54 [2020-10-24 00:55:16,484 INFO L226 Difference]: Without dead ends: 47 [2020-10-24 00:55:16,485 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:55:16,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-24 00:55:16,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-24 00:55:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-24 00:55:16,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-10-24 00:55:16,500 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 49 [2020-10-24 00:55:16,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:16,501 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-10-24 00:55:16,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:55:16,501 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-10-24 00:55:16,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-10-24 00:55:16,503 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:16,503 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:16,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:55:16,504 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:16,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:16,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2025718985, now seen corresponding path program 4 times [2020-10-24 00:55:16,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:16,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1774038621] [2020-10-24 00:55:16,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,782 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-24 00:55:16,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1774038621] [2020-10-24 00:55:16,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:16,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:55:16,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129268740] [2020-10-24 00:55:16,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:55:16,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:16,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:55:16,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:55:16,786 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 10 states. [2020-10-24 00:55:17,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:17,252 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-10-24 00:55:17,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:55:17,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-10-24 00:55:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:17,255 INFO L225 Difference]: With dead ends: 59 [2020-10-24 00:55:17,256 INFO L226 Difference]: Without dead ends: 52 [2020-10-24 00:55:17,257 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:55:17,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-10-24 00:55:17,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-10-24 00:55:17,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-24 00:55:17,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2020-10-24 00:55:17,272 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 57 [2020-10-24 00:55:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:17,273 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2020-10-24 00:55:17,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:55:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-10-24 00:55:17,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-24 00:55:17,275 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:17,275 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:17,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:55:17,276 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:17,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:17,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2086365203, now seen corresponding path program 5 times [2020-10-24 00:55:17,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:17,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [543311109] [2020-10-24 00:55:17,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,551 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-24 00:55:17,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [543311109] [2020-10-24 00:55:17,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:17,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:55:17,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747225180] [2020-10-24 00:55:17,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:55:17,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:17,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:55:17,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:55:17,558 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 11 states. [2020-10-24 00:55:18,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:18,061 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-10-24 00:55:18,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:55:18,061 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2020-10-24 00:55:18,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:18,063 INFO L225 Difference]: With dead ends: 64 [2020-10-24 00:55:18,063 INFO L226 Difference]: Without dead ends: 57 [2020-10-24 00:55:18,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-10-24 00:55:18,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-24 00:55:18,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-10-24 00:55:18,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-24 00:55:18,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-10-24 00:55:18,079 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 65 [2020-10-24 00:55:18,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:18,080 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-10-24 00:55:18,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:55:18,080 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-10-24 00:55:18,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-24 00:55:18,082 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:18,082 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:18,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:55:18,082 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:18,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:18,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1881990903, now seen corresponding path program 6 times [2020-10-24 00:55:18,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:18,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1848798201] [2020-10-24 00:55:18,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-10-24 00:55:18,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1848798201] [2020-10-24 00:55:18,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:18,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 00:55:18,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763465609] [2020-10-24 00:55:18,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 00:55:18,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:18,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 00:55:18,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:55:18,382 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2020-10-24 00:55:18,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:18,947 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-10-24 00:55:18,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 00:55:18,948 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-10-24 00:55:18,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:18,951 INFO L225 Difference]: With dead ends: 69 [2020-10-24 00:55:18,951 INFO L226 Difference]: Without dead ends: 62 [2020-10-24 00:55:18,952 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-10-24 00:55:18,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-24 00:55:18,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-24 00:55:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-24 00:55:18,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2020-10-24 00:55:18,983 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 73 [2020-10-24 00:55:18,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:18,984 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2020-10-24 00:55:18,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 00:55:18,984 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2020-10-24 00:55:18,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-10-24 00:55:18,994 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:18,994 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:18,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:55:18,994 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:18,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:18,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1486608429, now seen corresponding path program 7 times [2020-10-24 00:55:18,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:18,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [157369748] [2020-10-24 00:55:18,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:19,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:19,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:19,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:19,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:19,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:19,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:19,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:19,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:19,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:19,387 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-10-24 00:55:19,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [157369748] [2020-10-24 00:55:19,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:19,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 00:55:19,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908860832] [2020-10-24 00:55:19,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 00:55:19,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:19,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 00:55:19,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:55:19,390 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 13 states. [2020-10-24 00:55:19,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:19,963 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-10-24 00:55:19,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:55:19,965 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2020-10-24 00:55:19,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:19,967 INFO L225 Difference]: With dead ends: 74 [2020-10-24 00:55:19,967 INFO L226 Difference]: Without dead ends: 67 [2020-10-24 00:55:19,969 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-10-24 00:55:19,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-10-24 00:55:19,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-10-24 00:55:20,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-24 00:55:20,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-10-24 00:55:20,001 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 81 [2020-10-24 00:55:20,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:20,003 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-10-24 00:55:20,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 00:55:20,003 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-10-24 00:55:20,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-10-24 00:55:20,004 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:20,004 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:20,005 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:55:20,005 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:20,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:20,005 INFO L82 PathProgramCache]: Analyzing trace with hash -2047124151, now seen corresponding path program 8 times [2020-10-24 00:55:20,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:20,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [59554963] [2020-10-24 00:55:20,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:20,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:20,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:20,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:20,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:20,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:20,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:20,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:20,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:20,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:20,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:20,412 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-10-24 00:55:20,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [59554963] [2020-10-24 00:55:20,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:20,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 00:55:20,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484268019] [2020-10-24 00:55:20,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 00:55:20,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:20,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 00:55:20,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:55:20,416 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 14 states. [2020-10-24 00:55:21,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:21,053 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-10-24 00:55:21,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-24 00:55:21,054 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2020-10-24 00:55:21,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:21,055 INFO L225 Difference]: With dead ends: 79 [2020-10-24 00:55:21,055 INFO L226 Difference]: Without dead ends: 72 [2020-10-24 00:55:21,057 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-10-24 00:55:21,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-24 00:55:21,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-10-24 00:55:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-24 00:55:21,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-10-24 00:55:21,086 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 89 [2020-10-24 00:55:21,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:21,087 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-10-24 00:55:21,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 00:55:21,087 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-10-24 00:55:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-10-24 00:55:21,093 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:21,093 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:21,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:55:21,093 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:21,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:21,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1811920787, now seen corresponding path program 9 times [2020-10-24 00:55:21,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:21,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1160940127] [2020-10-24 00:55:21,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-10-24 00:55:21,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1160940127] [2020-10-24 00:55:21,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:21,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 00:55:21,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346378575] [2020-10-24 00:55:21,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 00:55:21,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:21,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 00:55:21,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:55:21,580 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2020-10-24 00:55:22,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:22,297 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-10-24 00:55:22,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 00:55:22,298 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2020-10-24 00:55:22,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:22,299 INFO L225 Difference]: With dead ends: 84 [2020-10-24 00:55:22,299 INFO L226 Difference]: Without dead ends: 77 [2020-10-24 00:55:22,301 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-10-24 00:55:22,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-24 00:55:22,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-10-24 00:55:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-24 00:55:22,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2020-10-24 00:55:22,325 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 97 [2020-10-24 00:55:22,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:22,325 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2020-10-24 00:55:22,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 00:55:22,325 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2020-10-24 00:55:22,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-10-24 00:55:22,327 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:22,327 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:22,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 00:55:22,327 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:22,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:22,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1912263049, now seen corresponding path program 10 times [2020-10-24 00:55:22,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:22,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [970414887] [2020-10-24 00:55:22,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:22,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:22,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:22,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:22,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:22,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:22,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:22,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:22,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:22,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:22,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:22,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:22,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:22,904 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-10-24 00:55:22,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [970414887] [2020-10-24 00:55:22,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:22,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-10-24 00:55:22,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391455303] [2020-10-24 00:55:22,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 00:55:22,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:22,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 00:55:22,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-10-24 00:55:22,911 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 16 states. [2020-10-24 00:55:23,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:23,674 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-10-24 00:55:23,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 00:55:23,675 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-10-24 00:55:23,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:23,676 INFO L225 Difference]: With dead ends: 89 [2020-10-24 00:55:23,676 INFO L226 Difference]: Without dead ends: 82 [2020-10-24 00:55:23,678 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=268, Invalid=544, Unknown=0, NotChecked=0, Total=812 [2020-10-24 00:55:23,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-24 00:55:23,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-10-24 00:55:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-24 00:55:23,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2020-10-24 00:55:23,693 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 105 [2020-10-24 00:55:23,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:23,693 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2020-10-24 00:55:23,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-24 00:55:23,694 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2020-10-24 00:55:23,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-10-24 00:55:23,695 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:23,695 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:23,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 00:55:23,696 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:23,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:23,697 INFO L82 PathProgramCache]: Analyzing trace with hash -34990253, now seen corresponding path program 11 times [2020-10-24 00:55:23,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:23,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [918348740] [2020-10-24 00:55:23,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:23,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:23,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:23,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:23,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:23,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:23,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:23,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:23,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:23,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:24,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:24,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:24,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:24,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:24,301 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-10-24 00:55:24,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [918348740] [2020-10-24 00:55:24,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:24,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-10-24 00:55:24,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159820506] [2020-10-24 00:55:24,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 00:55:24,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:24,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 00:55:24,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:55:24,307 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 17 states. [2020-10-24 00:55:25,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:25,161 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-10-24 00:55:25,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-24 00:55:25,162 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 113 [2020-10-24 00:55:25,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:25,164 INFO L225 Difference]: With dead ends: 94 [2020-10-24 00:55:25,164 INFO L226 Difference]: Without dead ends: 87 [2020-10-24 00:55:25,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2020-10-24 00:55:25,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-24 00:55:25,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-10-24 00:55:25,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-24 00:55:25,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2020-10-24 00:55:25,180 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 113 [2020-10-24 00:55:25,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:25,181 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2020-10-24 00:55:25,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 00:55:25,181 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2020-10-24 00:55:25,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-10-24 00:55:25,182 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:25,182 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:25,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 00:55:25,183 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:25,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:25,183 INFO L82 PathProgramCache]: Analyzing trace with hash -980060727, now seen corresponding path program 12 times [2020-10-24 00:55:25,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:25,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1939638902] [2020-10-24 00:55:25,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:25,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:25,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:25,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:25,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:25,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:25,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:25,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:25,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:25,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:25,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:25,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:25,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:25,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:25,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:25,816 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-10-24 00:55:25,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1939638902] [2020-10-24 00:55:25,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:25,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-10-24 00:55:25,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958878819] [2020-10-24 00:55:25,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-24 00:55:25,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:25,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-24 00:55:25,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-10-24 00:55:25,820 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 18 states. [2020-10-24 00:55:26,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:26,755 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-10-24 00:55:26,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-24 00:55:26,756 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2020-10-24 00:55:26,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:26,758 INFO L225 Difference]: With dead ends: 99 [2020-10-24 00:55:26,758 INFO L226 Difference]: Without dead ends: 92 [2020-10-24 00:55:26,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2020-10-24 00:55:26,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-24 00:55:26,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-10-24 00:55:26,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-24 00:55:26,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2020-10-24 00:55:26,783 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 121 [2020-10-24 00:55:26,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:26,784 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2020-10-24 00:55:26,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-24 00:55:26,784 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2020-10-24 00:55:26,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-10-24 00:55:26,786 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:26,786 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:26,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 00:55:26,787 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:26,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:26,787 INFO L82 PathProgramCache]: Analyzing trace with hash 366954259, now seen corresponding path program 13 times [2020-10-24 00:55:26,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:26,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [591658169] [2020-10-24 00:55:26,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:26,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:26,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:26,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:26,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:26,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:27,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:27,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:27,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:27,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:27,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:27,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:27,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:27,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:27,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:27,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-10-24 00:55:27,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [591658169] [2020-10-24 00:55:27,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:27,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-10-24 00:55:27,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293294883] [2020-10-24 00:55:27,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-24 00:55:27,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:27,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-24 00:55:27,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-10-24 00:55:27,463 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 19 states. [2020-10-24 00:55:28,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:28,439 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2020-10-24 00:55:28,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 00:55:28,439 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 129 [2020-10-24 00:55:28,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:28,441 INFO L225 Difference]: With dead ends: 104 [2020-10-24 00:55:28,441 INFO L226 Difference]: Without dead ends: 97 [2020-10-24 00:55:28,443 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2020-10-24 00:55:28,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-24 00:55:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-10-24 00:55:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-24 00:55:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2020-10-24 00:55:28,457 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 129 [2020-10-24 00:55:28,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:28,458 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2020-10-24 00:55:28,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-24 00:55:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2020-10-24 00:55:28,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-10-24 00:55:28,460 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:28,460 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:28,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-24 00:55:28,460 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:28,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:28,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1919989239, now seen corresponding path program 14 times [2020-10-24 00:55:28,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:28,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1253971881] [2020-10-24 00:55:28,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:29,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:29,184 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-10-24 00:55:29,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1253971881] [2020-10-24 00:55:29,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:29,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-10-24 00:55:29,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274963230] [2020-10-24 00:55:29,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-24 00:55:29,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:29,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-24 00:55:29,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-10-24 00:55:29,189 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 20 states. [2020-10-24 00:55:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:30,258 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2020-10-24 00:55:30,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-24 00:55:30,259 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 137 [2020-10-24 00:55:30,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:30,261 INFO L225 Difference]: With dead ends: 109 [2020-10-24 00:55:30,261 INFO L226 Difference]: Without dead ends: 102 [2020-10-24 00:55:30,263 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=450, Invalid=882, Unknown=0, NotChecked=0, Total=1332 [2020-10-24 00:55:30,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-24 00:55:30,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-10-24 00:55:30,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-24 00:55:30,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2020-10-24 00:55:30,282 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 137 [2020-10-24 00:55:30,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:30,283 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2020-10-24 00:55:30,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-24 00:55:30,283 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2020-10-24 00:55:30,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-10-24 00:55:30,286 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:30,286 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:30,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-24 00:55:30,287 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:30,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:30,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1315223853, now seen corresponding path program 15 times [2020-10-24 00:55:30,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:30,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [909457498] [2020-10-24 00:55:30,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:31,113 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-10-24 00:55:31,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [909457498] [2020-10-24 00:55:31,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:31,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-10-24 00:55:31,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559053434] [2020-10-24 00:55:31,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-24 00:55:31,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:31,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-24 00:55:31,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2020-10-24 00:55:31,116 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 21 states. [2020-10-24 00:55:32,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:32,192 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2020-10-24 00:55:32,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-24 00:55:32,193 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 145 [2020-10-24 00:55:32,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:32,199 INFO L225 Difference]: With dead ends: 114 [2020-10-24 00:55:32,200 INFO L226 Difference]: Without dead ends: 107 [2020-10-24 00:55:32,202 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-10-24 00:55:32,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-24 00:55:32,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-24 00:55:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-24 00:55:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2020-10-24 00:55:32,226 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 145 [2020-10-24 00:55:32,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:32,227 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2020-10-24 00:55:32,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-24 00:55:32,227 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2020-10-24 00:55:32,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-10-24 00:55:32,229 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:32,229 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:32,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-24 00:55:32,230 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:32,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:32,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1314107831, now seen corresponding path program 16 times [2020-10-24 00:55:32,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:32,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1766467790] [2020-10-24 00:55:32,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:33,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-10-24 00:55:33,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1766467790] [2020-10-24 00:55:33,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:33,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-10-24 00:55:33,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669677383] [2020-10-24 00:55:33,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-24 00:55:33,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:33,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-24 00:55:33,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2020-10-24 00:55:33,075 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 22 states. [2020-10-24 00:55:34,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:34,206 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2020-10-24 00:55:34,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-24 00:55:34,207 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 153 [2020-10-24 00:55:34,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:34,209 INFO L225 Difference]: With dead ends: 119 [2020-10-24 00:55:34,209 INFO L226 Difference]: Without dead ends: 112 [2020-10-24 00:55:34,211 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=559, Invalid=1081, Unknown=0, NotChecked=0, Total=1640 [2020-10-24 00:55:34,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-24 00:55:34,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-24 00:55:34,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-24 00:55:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2020-10-24 00:55:34,224 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 153 [2020-10-24 00:55:34,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:34,224 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2020-10-24 00:55:34,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-24 00:55:34,224 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2020-10-24 00:55:34,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-10-24 00:55:34,229 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:34,229 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:34,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-24 00:55:34,229 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:34,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:34,230 INFO L82 PathProgramCache]: Analyzing trace with hash -740682093, now seen corresponding path program 17 times [2020-10-24 00:55:34,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:34,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1761507455] [2020-10-24 00:55:34,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-10-24 00:55:35,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1761507455] [2020-10-24 00:55:35,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:35,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-10-24 00:55:35,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369320640] [2020-10-24 00:55:35,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-24 00:55:35,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:35,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-24 00:55:35,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2020-10-24 00:55:35,173 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 23 states. [2020-10-24 00:55:36,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:36,382 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2020-10-24 00:55:36,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-24 00:55:36,389 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 161 [2020-10-24 00:55:36,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:36,391 INFO L225 Difference]: With dead ends: 124 [2020-10-24 00:55:36,391 INFO L226 Difference]: Without dead ends: 117 [2020-10-24 00:55:36,392 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=618, Invalid=1188, Unknown=0, NotChecked=0, Total=1806 [2020-10-24 00:55:36,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-24 00:55:36,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2020-10-24 00:55:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-10-24 00:55:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2020-10-24 00:55:36,408 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 161 [2020-10-24 00:55:36,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:36,409 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2020-10-24 00:55:36,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-24 00:55:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2020-10-24 00:55:36,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-10-24 00:55:36,410 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:36,411 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:36,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-24 00:55:36,411 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:36,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:36,411 INFO L82 PathProgramCache]: Analyzing trace with hash 883982985, now seen corresponding path program 18 times [2020-10-24 00:55:36,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:36,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [888309628] [2020-10-24 00:55:36,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:36,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:36,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:36,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:36,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:36,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:36,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:36,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:36,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:36,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:36,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:36,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:36,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:36,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:36,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:36,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-10-24 00:55:37,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [888309628] [2020-10-24 00:55:37,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:37,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-10-24 00:55:37,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658556968] [2020-10-24 00:55:37,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-24 00:55:37,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:37,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-24 00:55:37,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=336, Unknown=0, NotChecked=0, Total=552 [2020-10-24 00:55:37,323 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 24 states. [2020-10-24 00:55:38,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:38,613 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2020-10-24 00:55:38,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-24 00:55:38,613 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 169 [2020-10-24 00:55:38,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:38,615 INFO L225 Difference]: With dead ends: 129 [2020-10-24 00:55:38,616 INFO L226 Difference]: Without dead ends: 122 [2020-10-24 00:55:38,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=680, Invalid=1300, Unknown=0, NotChecked=0, Total=1980 [2020-10-24 00:55:38,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-10-24 00:55:38,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-10-24 00:55:38,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-10-24 00:55:38,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2020-10-24 00:55:38,633 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 169 [2020-10-24 00:55:38,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:38,633 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2020-10-24 00:55:38,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-24 00:55:38,634 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2020-10-24 00:55:38,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-10-24 00:55:38,635 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:38,636 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:38,636 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-24 00:55:38,636 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:38,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:38,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1146598995, now seen corresponding path program 19 times [2020-10-24 00:55:38,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:38,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1251885754] [2020-10-24 00:55:38,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:38,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:38,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:38,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:38,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:38,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:38,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:38,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:38,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-10-24 00:55:39,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1251885754] [2020-10-24 00:55:39,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:39,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-10-24 00:55:39,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092567923] [2020-10-24 00:55:39,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-24 00:55:39,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:39,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-24 00:55:39,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=363, Unknown=0, NotChecked=0, Total=600 [2020-10-24 00:55:39,721 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 25 states. [2020-10-24 00:55:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:41,087 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2020-10-24 00:55:41,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-24 00:55:41,088 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 177 [2020-10-24 00:55:41,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:41,090 INFO L225 Difference]: With dead ends: 134 [2020-10-24 00:55:41,090 INFO L226 Difference]: Without dead ends: 127 [2020-10-24 00:55:41,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=745, Invalid=1417, Unknown=0, NotChecked=0, Total=2162 [2020-10-24 00:55:41,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-10-24 00:55:41,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-10-24 00:55:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-24 00:55:41,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2020-10-24 00:55:41,109 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 177 [2020-10-24 00:55:41,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:41,110 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2020-10-24 00:55:41,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-24 00:55:41,110 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2020-10-24 00:55:41,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-10-24 00:55:41,111 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:41,112 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:41,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-24 00:55:41,112 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:41,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:41,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1952442057, now seen corresponding path program 20 times [2020-10-24 00:55:41,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:41,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [448710538] [2020-10-24 00:55:41,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:42,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2020-10-24 00:55:42,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [448710538] [2020-10-24 00:55:42,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:42,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-10-24 00:55:42,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009577800] [2020-10-24 00:55:42,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-10-24 00:55:42,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:42,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-10-24 00:55:42,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2020-10-24 00:55:42,239 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 26 states. [2020-10-24 00:55:43,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:43,702 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2020-10-24 00:55:43,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-24 00:55:43,703 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 185 [2020-10-24 00:55:43,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:43,705 INFO L225 Difference]: With dead ends: 139 [2020-10-24 00:55:43,705 INFO L226 Difference]: Without dead ends: 132 [2020-10-24 00:55:43,707 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-10-24 00:55:43,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-24 00:55:43,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-10-24 00:55:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-10-24 00:55:43,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2020-10-24 00:55:43,723 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 185 [2020-10-24 00:55:43,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:43,724 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2020-10-24 00:55:43,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-10-24 00:55:43,724 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2020-10-24 00:55:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-10-24 00:55:43,725 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:43,726 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:43,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-24 00:55:43,726 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:43,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:43,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1339041299, now seen corresponding path program 21 times [2020-10-24 00:55:43,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:43,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [205373037] [2020-10-24 00:55:43,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:43,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:43,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:43,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:43,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2020-10-24 00:55:44,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [205373037] [2020-10-24 00:55:44,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:44,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-10-24 00:55:44,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113195323] [2020-10-24 00:55:44,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-10-24 00:55:44,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:44,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-10-24 00:55:44,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=420, Unknown=0, NotChecked=0, Total=702 [2020-10-24 00:55:44,951 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 27 states. [2020-10-24 00:55:46,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:46,575 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2020-10-24 00:55:46,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-24 00:55:46,579 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 193 [2020-10-24 00:55:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:46,581 INFO L225 Difference]: With dead ends: 144 [2020-10-24 00:55:46,581 INFO L226 Difference]: Without dead ends: 137 [2020-10-24 00:55:46,583 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=884, Invalid=1666, Unknown=0, NotChecked=0, Total=2550 [2020-10-24 00:55:46,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-24 00:55:46,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-10-24 00:55:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-10-24 00:55:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2020-10-24 00:55:46,599 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 193 [2020-10-24 00:55:46,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:46,600 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2020-10-24 00:55:46,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-10-24 00:55:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2020-10-24 00:55:46,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-10-24 00:55:46,602 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:46,602 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:46,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-24 00:55:46,602 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:46,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:46,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1769896713, now seen corresponding path program 22 times [2020-10-24 00:55:46,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:46,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [51293729] [2020-10-24 00:55:46,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:47,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:47,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:47,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:47,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:47,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:47,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:47,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:47,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:47,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:47,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:47,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:47,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:47,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:47,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:47,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:47,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:47,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2020-10-24 00:55:47,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [51293729] [2020-10-24 00:55:47,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:47,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-10-24 00:55:47,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989232994] [2020-10-24 00:55:47,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-10-24 00:55:47,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:47,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-10-24 00:55:47,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=450, Unknown=0, NotChecked=0, Total=756 [2020-10-24 00:55:47,886 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 28 states. [2020-10-24 00:55:49,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:49,480 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2020-10-24 00:55:49,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-24 00:55:49,481 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 201 [2020-10-24 00:55:49,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:49,483 INFO L225 Difference]: With dead ends: 149 [2020-10-24 00:55:49,483 INFO L226 Difference]: Without dead ends: 142 [2020-10-24 00:55:49,485 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-10-24 00:55:49,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-10-24 00:55:49,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-10-24 00:55:49,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-10-24 00:55:49,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2020-10-24 00:55:49,502 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 201 [2020-10-24 00:55:49,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:49,502 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2020-10-24 00:55:49,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-10-24 00:55:49,503 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2020-10-24 00:55:49,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-10-24 00:55:49,504 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:49,504 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:49,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-24 00:55:49,505 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:49,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:49,505 INFO L82 PathProgramCache]: Analyzing trace with hash -2013305389, now seen corresponding path program 23 times [2020-10-24 00:55:49,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:49,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1704672425] [2020-10-24 00:55:49,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2020-10-24 00:55:50,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1704672425] [2020-10-24 00:55:50,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:50,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2020-10-24 00:55:50,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851817954] [2020-10-24 00:55:50,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-10-24 00:55:50,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:50,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-10-24 00:55:50,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=481, Unknown=0, NotChecked=0, Total=812 [2020-10-24 00:55:50,999 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 29 states. [2020-10-24 00:55:52,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:52,713 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2020-10-24 00:55:52,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-24 00:55:52,714 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 209 [2020-10-24 00:55:52,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:52,716 INFO L225 Difference]: With dead ends: 154 [2020-10-24 00:55:52,716 INFO L226 Difference]: Without dead ends: 147 [2020-10-24 00:55:52,718 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1935, Unknown=0, NotChecked=0, Total=2970 [2020-10-24 00:55:52,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-10-24 00:55:52,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2020-10-24 00:55:52,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-10-24 00:55:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2020-10-24 00:55:52,736 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 209 [2020-10-24 00:55:52,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:52,737 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2020-10-24 00:55:52,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-10-24 00:55:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2020-10-24 00:55:52,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2020-10-24 00:55:52,738 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:52,739 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:52,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-24 00:55:52,739 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:52,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:52,740 INFO L82 PathProgramCache]: Analyzing trace with hash -405782711, now seen corresponding path program 24 times [2020-10-24 00:55:52,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:52,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [504914596] [2020-10-24 00:55:52,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:54,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2020-10-24 00:55:54,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [504914596] [2020-10-24 00:55:54,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:54,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2020-10-24 00:55:54,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146608908] [2020-10-24 00:55:54,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-10-24 00:55:54,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:54,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-10-24 00:55:54,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=513, Unknown=0, NotChecked=0, Total=870 [2020-10-24 00:55:54,321 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 30 states. [2020-10-24 00:55:56,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:56,128 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2020-10-24 00:55:56,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-10-24 00:55:56,129 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 217 [2020-10-24 00:55:56,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:56,131 INFO L225 Difference]: With dead ends: 159 [2020-10-24 00:55:56,131 INFO L226 Difference]: Without dead ends: 152 [2020-10-24 00:55:56,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1115, Invalid=2077, Unknown=0, NotChecked=0, Total=3192 [2020-10-24 00:55:56,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-10-24 00:55:56,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2020-10-24 00:55:56,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-24 00:55:56,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2020-10-24 00:55:56,152 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 217 [2020-10-24 00:55:56,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:56,153 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2020-10-24 00:55:56,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-10-24 00:55:56,153 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2020-10-24 00:55:56,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-10-24 00:55:56,155 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:56,155 INFO L422 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:56,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-24 00:55:56,155 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:56,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:56,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2086570605, now seen corresponding path program 25 times [2020-10-24 00:55:56,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:56,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [696574530] [2020-10-24 00:55:56,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 00:55:56,193 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 00:55:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 00:55:56,257 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 00:55:56,330 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-24 00:55:56,330 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 00:55:56,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-24 00:55:56,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:55:56 BoogieIcfgContainer [2020-10-24 00:55:56,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:55:56,435 INFO L168 Benchmark]: Toolchain (without parser) took 43948.12 ms. Allocated memory was 159.4 MB in the beginning and 576.7 MB in the end (delta: 417.3 MB). Free memory was 136.1 MB in the beginning and 366.4 MB in the end (delta: -230.3 MB). Peak memory consumption was 187.8 MB. Max. memory is 8.0 GB. [2020-10-24 00:55:56,436 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 125.8 MB. Free memory was 98.8 MB in the beginning and 98.8 MB in the end (delta: 65.4 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:55:56,436 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.70 ms. Allocated memory is still 159.4 MB. Free memory was 135.4 MB in the beginning and 126.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:55:56,437 INFO L168 Benchmark]: Boogie Preprocessor took 42.54 ms. Allocated memory is still 159.4 MB. Free memory was 126.1 MB in the beginning and 124.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-24 00:55:56,437 INFO L168 Benchmark]: RCFGBuilder took 634.24 ms. Allocated memory is still 159.4 MB. Free memory was 124.7 MB in the beginning and 138.5 MB in the end (delta: -13.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 8.0 GB. [2020-10-24 00:55:56,438 INFO L168 Benchmark]: TraceAbstraction took 42954.91 ms. Allocated memory was 159.4 MB in the beginning and 576.7 MB in the end (delta: 417.3 MB). Free memory was 138.2 MB in the beginning and 366.4 MB in the end (delta: -228.2 MB). Peak memory consumption was 189.6 MB. Max. memory is 8.0 GB. [2020-10-24 00:55:56,441 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 125.8 MB. Free memory was 98.8 MB in the beginning and 98.8 MB in the end (delta: 65.4 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 295.70 ms. Allocated memory is still 159.4 MB. Free memory was 135.4 MB in the beginning and 126.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 42.54 ms. Allocated memory is still 159.4 MB. Free memory was 126.1 MB in the beginning and 124.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 634.24 ms. Allocated memory is still 159.4 MB. Free memory was 124.7 MB in the beginning and 138.5 MB in the end (delta: -13.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 42954.91 ms. Allocated memory was 159.4 MB in the beginning and 576.7 MB in the end (delta: 417.3 MB). Free memory was 138.2 MB in the beginning and 366.4 MB in the end (delta: -228.2 MB). Peak memory consumption was 189.6 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: 42.7s, OverallIterations: 26, TraceHistogramMax: 26, AutomataDifference: 23.9s, 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, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1477 GetRequests, 701 SyntacticMatches, 0 SemanticMatches, 776 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5853 ImplicationChecksByTransitivity, 22.7s 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.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 16.6s 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...