/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_8.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 13:25:09,662 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:25:09,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:25:09,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:25:09,709 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:25:09,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:25:09,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:25:09,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:25:09,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:25:09,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:25:09,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:25:09,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:25:09,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:25:09,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:25:09,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:25:09,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:25:09,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:25:09,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:25:09,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:25:09,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:25:09,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:25:09,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:25:09,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:25:09,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:25:09,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:25:09,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:25:09,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:25:09,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:25:09,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:25:09,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:25:09,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:25:09,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:25:09,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:25:09,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:25:09,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:25:09,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:25:09,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:25:09,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:25:09,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:25:09,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:25:09,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:25:09,788 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:25:09,833 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:25:09,833 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:25:09,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:25:09,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:25:09,835 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:25:09,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:25:09,836 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:25:09,836 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:25:09,836 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:25:09,837 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:25:09,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:25:09,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:25:09,838 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:25:09,838 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:25:09,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:25:09,839 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:25:09,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:25:09,839 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:25:09,839 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:25:09,840 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:25:09,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:25:09,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:25:09,840 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:25:09,840 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:25:09,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:25:09,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:25:09,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:25:09,841 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:25:09,841 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:25:09,842 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:25:10,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:25:10,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:25:10,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:25:10,320 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:25:10,320 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:25:10,321 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2020-09-04 13:25:10,402 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/df86b0908/2e38551b3e92455c9a97f9f57722cc20/FLAG76539afef [2020-09-04 13:25:10,958 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:25:10,959 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/locks/test_locks_8.c [2020-09-04 13:25:10,970 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/df86b0908/2e38551b3e92455c9a97f9f57722cc20/FLAG76539afef [2020-09-04 13:25:11,239 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/df86b0908/2e38551b3e92455c9a97f9f57722cc20 [2020-09-04 13:25:11,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:25:11,254 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:25:11,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:25:11,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:25:11,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:25:11,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:25:11" (1/1) ... [2020-09-04 13:25:11,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75e37eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:11, skipping insertion in model container [2020-09-04 13:25:11,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:25:11" (1/1) ... [2020-09-04 13:25:11,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:25:11,306 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:25:11,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:25:11,541 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:25:11,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:25:11,586 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:25:11,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:11 WrapperNode [2020-09-04 13:25:11,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:25:11,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:25:11,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:25:11,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:25:11,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:11" (1/1) ... [2020-09-04 13:25:11,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:11" (1/1) ... [2020-09-04 13:25:11,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:11" (1/1) ... [2020-09-04 13:25:11,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:11" (1/1) ... [2020-09-04 13:25:11,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:11" (1/1) ... [2020-09-04 13:25:11,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:11" (1/1) ... [2020-09-04 13:25:11,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:11" (1/1) ... [2020-09-04 13:25:11,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:25:11,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:25:11,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:25:11,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:25:11,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:11" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:25:11,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:25:11,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:25:11,797 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:25:11,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:25:11,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:25:11,797 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:25:11,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:25:11,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:25:12,107 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:25:12,108 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-04 13:25:12,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:25:12 BoogieIcfgContainer [2020-09-04 13:25:12,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:25:12,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:25:12,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:25:12,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:25:12,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:25:11" (1/3) ... [2020-09-04 13:25:12,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6edeac62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:25:12, skipping insertion in model container [2020-09-04 13:25:12,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:11" (2/3) ... [2020-09-04 13:25:12,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6edeac62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:25:12, skipping insertion in model container [2020-09-04 13:25:12,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:25:12" (3/3) ... [2020-09-04 13:25:12,125 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2020-09-04 13:25:12,141 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:25:12,151 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:25:12,176 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:25:12,208 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:25:12,212 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:25:12,212 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:25:12,212 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:25:12,213 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:25:12,213 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:25:12,213 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:25:12,214 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:25:12,244 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-09-04 13:25:12,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-04 13:25:12,253 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:12,254 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:12,255 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:12,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:12,263 INFO L82 PathProgramCache]: Analyzing trace with hash 577441593, now seen corresponding path program 1 times [2020-09-04 13:25:12,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:12,274 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561572015] [2020-09-04 13:25:12,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:12,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:12,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:12,513 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561572015] [2020-09-04 13:25:12,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:12,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:12,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937947251] [2020-09-04 13:25:12,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:12,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:12,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:12,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:12,546 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2020-09-04 13:25:12,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:12,652 INFO L93 Difference]: Finished difference Result 75 states and 126 transitions. [2020-09-04 13:25:12,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:12,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-09-04 13:25:12,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:12,670 INFO L225 Difference]: With dead ends: 75 [2020-09-04 13:25:12,670 INFO L226 Difference]: Without dead ends: 60 [2020-09-04 13:25:12,675 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:12,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-09-04 13:25:12,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2020-09-04 13:25:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 13:25:12,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2020-09-04 13:25:12,729 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 18 [2020-09-04 13:25:12,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:12,729 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2020-09-04 13:25:12,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:12,730 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2020-09-04 13:25:12,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-04 13:25:12,731 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:12,731 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:12,732 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:25:12,732 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:12,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:12,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1278506171, now seen corresponding path program 1 times [2020-09-04 13:25:12,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:12,733 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928165232] [2020-09-04 13:25:12,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:12,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:12,801 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928165232] [2020-09-04 13:25:12,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:12,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:12,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218637028] [2020-09-04 13:25:12,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:12,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:12,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:12,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:12,805 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2020-09-04 13:25:12,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:12,841 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2020-09-04 13:25:12,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:12,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-09-04 13:25:12,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:12,843 INFO L225 Difference]: With dead ends: 97 [2020-09-04 13:25:12,844 INFO L226 Difference]: Without dead ends: 60 [2020-09-04 13:25:12,845 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:12,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-09-04 13:25:12,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2020-09-04 13:25:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-09-04 13:25:12,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2020-09-04 13:25:12,857 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 18 [2020-09-04 13:25:12,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:12,857 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2020-09-04 13:25:12,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:12,858 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2020-09-04 13:25:12,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-04 13:25:12,859 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:12,859 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:12,859 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:25:12,860 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:12,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:12,860 INFO L82 PathProgramCache]: Analyzing trace with hash 721034227, now seen corresponding path program 1 times [2020-09-04 13:25:12,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:12,861 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873412318] [2020-09-04 13:25:12,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:12,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:12,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:12,932 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873412318] [2020-09-04 13:25:12,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:12,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:12,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367499730] [2020-09-04 13:25:12,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:12,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:12,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:12,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:12,935 INFO L87 Difference]: Start difference. First operand 58 states and 101 transitions. Second operand 3 states. [2020-09-04 13:25:12,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:12,961 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2020-09-04 13:25:12,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:12,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-09-04 13:25:12,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:12,963 INFO L225 Difference]: With dead ends: 90 [2020-09-04 13:25:12,964 INFO L226 Difference]: Without dead ends: 63 [2020-09-04 13:25:12,964 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:12,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-09-04 13:25:12,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2020-09-04 13:25:12,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-09-04 13:25:12,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2020-09-04 13:25:12,976 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 19 [2020-09-04 13:25:12,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:12,977 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2020-09-04 13:25:12,977 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:12,977 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2020-09-04 13:25:12,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-04 13:25:12,978 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:12,979 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:12,979 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 13:25:12,979 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:12,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:12,980 INFO L82 PathProgramCache]: Analyzing trace with hash 979199665, now seen corresponding path program 1 times [2020-09-04 13:25:12,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:12,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519167380] [2020-09-04 13:25:12,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:13,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:13,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:13,053 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519167380] [2020-09-04 13:25:13,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:13,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:13,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705876549] [2020-09-04 13:25:13,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:13,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:13,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:13,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:13,055 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2020-09-04 13:25:13,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:13,077 INFO L93 Difference]: Finished difference Result 112 states and 192 transitions. [2020-09-04 13:25:13,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:13,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-09-04 13:25:13,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:13,079 INFO L225 Difference]: With dead ends: 112 [2020-09-04 13:25:13,080 INFO L226 Difference]: Without dead ends: 110 [2020-09-04 13:25:13,080 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:13,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-09-04 13:25:13,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2020-09-04 13:25:13,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-09-04 13:25:13,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2020-09-04 13:25:13,094 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 19 [2020-09-04 13:25:13,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:13,095 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2020-09-04 13:25:13,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:13,095 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2020-09-04 13:25:13,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-04 13:25:13,096 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:13,096 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:13,097 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 13:25:13,097 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:13,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:13,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1680264243, now seen corresponding path program 1 times [2020-09-04 13:25:13,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:13,098 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261002778] [2020-09-04 13:25:13,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:13,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:13,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:13,137 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261002778] [2020-09-04 13:25:13,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:13,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:13,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869769964] [2020-09-04 13:25:13,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:13,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:13,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:13,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:13,139 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2020-09-04 13:25:13,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:13,163 INFO L93 Difference]: Finished difference Result 184 states and 318 transitions. [2020-09-04 13:25:13,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:13,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-09-04 13:25:13,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:13,166 INFO L225 Difference]: With dead ends: 184 [2020-09-04 13:25:13,166 INFO L226 Difference]: Without dead ends: 112 [2020-09-04 13:25:13,167 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-09-04 13:25:13,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2020-09-04 13:25:13,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-09-04 13:25:13,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2020-09-04 13:25:13,181 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 19 [2020-09-04 13:25:13,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:13,182 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2020-09-04 13:25:13,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:13,182 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2020-09-04 13:25:13,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-04 13:25:13,183 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:13,184 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] [2020-09-04 13:25:13,184 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 13:25:13,184 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:13,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:13,185 INFO L82 PathProgramCache]: Analyzing trace with hash 290632912, now seen corresponding path program 1 times [2020-09-04 13:25:13,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:13,186 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885583035] [2020-09-04 13:25:13,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:13,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:13,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:13,228 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885583035] [2020-09-04 13:25:13,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:13,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:13,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137874568] [2020-09-04 13:25:13,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:13,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:13,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:13,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:13,231 INFO L87 Difference]: Start difference. First operand 110 states and 186 transitions. Second operand 3 states. [2020-09-04 13:25:13,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:13,252 INFO L93 Difference]: Finished difference Result 165 states and 277 transitions. [2020-09-04 13:25:13,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:13,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-09-04 13:25:13,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:13,255 INFO L225 Difference]: With dead ends: 165 [2020-09-04 13:25:13,255 INFO L226 Difference]: Without dead ends: 114 [2020-09-04 13:25:13,256 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:13,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-09-04 13:25:13,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2020-09-04 13:25:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-09-04 13:25:13,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2020-09-04 13:25:13,269 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 20 [2020-09-04 13:25:13,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:13,269 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2020-09-04 13:25:13,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:13,270 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2020-09-04 13:25:13,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-04 13:25:13,271 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:13,271 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] [2020-09-04 13:25:13,271 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 13:25:13,272 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:13,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:13,272 INFO L82 PathProgramCache]: Analyzing trace with hash 548798350, now seen corresponding path program 1 times [2020-09-04 13:25:13,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:13,273 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182389496] [2020-09-04 13:25:13,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:13,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:13,310 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182389496] [2020-09-04 13:25:13,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:13,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:13,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907528208] [2020-09-04 13:25:13,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:13,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:13,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:13,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:13,313 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 3 states. [2020-09-04 13:25:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:13,336 INFO L93 Difference]: Finished difference Result 204 states and 344 transitions. [2020-09-04 13:25:13,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:13,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-09-04 13:25:13,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:13,340 INFO L225 Difference]: With dead ends: 204 [2020-09-04 13:25:13,342 INFO L226 Difference]: Without dead ends: 202 [2020-09-04 13:25:13,343 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:13,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-09-04 13:25:13,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2020-09-04 13:25:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-09-04 13:25:13,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2020-09-04 13:25:13,389 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 20 [2020-09-04 13:25:13,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:13,389 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2020-09-04 13:25:13,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:13,395 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2020-09-04 13:25:13,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-04 13:25:13,396 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:13,397 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] [2020-09-04 13:25:13,397 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 13:25:13,397 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:13,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:13,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1249862928, now seen corresponding path program 1 times [2020-09-04 13:25:13,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:13,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301103839] [2020-09-04 13:25:13,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:13,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:13,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:13,461 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301103839] [2020-09-04 13:25:13,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:13,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:13,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703342388] [2020-09-04 13:25:13,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:13,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:13,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:13,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:13,463 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand 3 states. [2020-09-04 13:25:13,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:13,490 INFO L93 Difference]: Finished difference Result 352 states and 584 transitions. [2020-09-04 13:25:13,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:13,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-09-04 13:25:13,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:13,493 INFO L225 Difference]: With dead ends: 352 [2020-09-04 13:25:13,493 INFO L226 Difference]: Without dead ends: 210 [2020-09-04 13:25:13,495 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:13,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-09-04 13:25:13,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2020-09-04 13:25:13,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-09-04 13:25:13,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 338 transitions. [2020-09-04 13:25:13,509 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 338 transitions. Word has length 20 [2020-09-04 13:25:13,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:13,510 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 338 transitions. [2020-09-04 13:25:13,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:13,510 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 338 transitions. [2020-09-04 13:25:13,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 13:25:13,511 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:13,512 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] [2020-09-04 13:25:13,512 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 13:25:13,512 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:13,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:13,513 INFO L82 PathProgramCache]: Analyzing trace with hash -166905624, now seen corresponding path program 1 times [2020-09-04 13:25:13,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:13,513 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106599364] [2020-09-04 13:25:13,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:13,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:13,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:13,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106599364] [2020-09-04 13:25:13,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:13,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:13,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430366929] [2020-09-04 13:25:13,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:13,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:13,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:13,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:13,559 INFO L87 Difference]: Start difference. First operand 208 states and 338 transitions. Second operand 3 states. [2020-09-04 13:25:13,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:13,580 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2020-09-04 13:25:13,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:13,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-09-04 13:25:13,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:13,583 INFO L225 Difference]: With dead ends: 312 [2020-09-04 13:25:13,583 INFO L226 Difference]: Without dead ends: 214 [2020-09-04 13:25:13,584 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:13,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-09-04 13:25:13,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2020-09-04 13:25:13,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-09-04 13:25:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 338 transitions. [2020-09-04 13:25:13,596 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 338 transitions. Word has length 21 [2020-09-04 13:25:13,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:13,596 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 338 transitions. [2020-09-04 13:25:13,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:13,597 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 338 transitions. [2020-09-04 13:25:13,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 13:25:13,598 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:13,598 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] [2020-09-04 13:25:13,598 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 13:25:13,599 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:13,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:13,599 INFO L82 PathProgramCache]: Analyzing trace with hash 91259814, now seen corresponding path program 1 times [2020-09-04 13:25:13,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:13,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634953310] [2020-09-04 13:25:13,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:13,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:13,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:13,629 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634953310] [2020-09-04 13:25:13,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:13,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:13,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565137556] [2020-09-04 13:25:13,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:13,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:13,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:13,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:13,631 INFO L87 Difference]: Start difference. First operand 212 states and 338 transitions. Second operand 3 states. [2020-09-04 13:25:13,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:13,652 INFO L93 Difference]: Finished difference Result 380 states and 616 transitions. [2020-09-04 13:25:13,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:13,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-09-04 13:25:13,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:13,655 INFO L225 Difference]: With dead ends: 380 [2020-09-04 13:25:13,655 INFO L226 Difference]: Without dead ends: 378 [2020-09-04 13:25:13,656 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:13,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2020-09-04 13:25:13,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 296. [2020-09-04 13:25:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-09-04 13:25:13,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2020-09-04 13:25:13,669 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 21 [2020-09-04 13:25:13,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:13,669 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2020-09-04 13:25:13,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:13,669 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2020-09-04 13:25:13,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 13:25:13,671 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:13,671 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] [2020-09-04 13:25:13,671 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 13:25:13,672 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:13,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:13,672 INFO L82 PathProgramCache]: Analyzing trace with hash 792324392, now seen corresponding path program 1 times [2020-09-04 13:25:13,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:13,673 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559796769] [2020-09-04 13:25:13,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:13,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:13,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559796769] [2020-09-04 13:25:13,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:13,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:13,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177978210] [2020-09-04 13:25:13,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:13,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:13,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:13,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:13,717 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand 3 states. [2020-09-04 13:25:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:13,755 INFO L93 Difference]: Finished difference Result 684 states and 1072 transitions. [2020-09-04 13:25:13,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:13,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-09-04 13:25:13,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:13,759 INFO L225 Difference]: With dead ends: 684 [2020-09-04 13:25:13,759 INFO L226 Difference]: Without dead ends: 402 [2020-09-04 13:25:13,760 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:13,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2020-09-04 13:25:13,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2020-09-04 13:25:13,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-09-04 13:25:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 614 transitions. [2020-09-04 13:25:13,793 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 614 transitions. Word has length 21 [2020-09-04 13:25:13,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:13,794 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 614 transitions. [2020-09-04 13:25:13,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2020-09-04 13:25:13,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-04 13:25:13,796 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:13,796 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] [2020-09-04 13:25:13,796 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 13:25:13,796 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:13,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:13,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1465698011, now seen corresponding path program 1 times [2020-09-04 13:25:13,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:13,797 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400856772] [2020-09-04 13:25:13,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:13,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:13,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:13,826 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400856772] [2020-09-04 13:25:13,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:13,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:13,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106591363] [2020-09-04 13:25:13,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:13,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:13,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:13,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:13,828 INFO L87 Difference]: Start difference. First operand 400 states and 614 transitions. Second operand 3 states. [2020-09-04 13:25:13,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:13,853 INFO L93 Difference]: Finished difference Result 600 states and 916 transitions. [2020-09-04 13:25:13,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:13,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-09-04 13:25:13,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:13,856 INFO L225 Difference]: With dead ends: 600 [2020-09-04 13:25:13,856 INFO L226 Difference]: Without dead ends: 410 [2020-09-04 13:25:13,857 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:13,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2020-09-04 13:25:13,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2020-09-04 13:25:13,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2020-09-04 13:25:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 614 transitions. [2020-09-04 13:25:13,872 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 614 transitions. Word has length 22 [2020-09-04 13:25:13,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:13,872 INFO L479 AbstractCegarLoop]: Abstraction has 408 states and 614 transitions. [2020-09-04 13:25:13,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:13,872 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 614 transitions. [2020-09-04 13:25:13,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-04 13:25:13,874 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:13,874 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] [2020-09-04 13:25:13,874 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 13:25:13,874 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:13,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:13,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1207532573, now seen corresponding path program 1 times [2020-09-04 13:25:13,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:13,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286285092] [2020-09-04 13:25:13,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:13,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:13,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:13,903 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286285092] [2020-09-04 13:25:13,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:13,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:13,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443583099] [2020-09-04 13:25:13,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:13,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:13,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:13,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:13,905 INFO L87 Difference]: Start difference. First operand 408 states and 614 transitions. Second operand 3 states. [2020-09-04 13:25:13,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:13,929 INFO L93 Difference]: Finished difference Result 716 states and 1096 transitions. [2020-09-04 13:25:13,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:13,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-09-04 13:25:13,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:13,934 INFO L225 Difference]: With dead ends: 716 [2020-09-04 13:25:13,934 INFO L226 Difference]: Without dead ends: 714 [2020-09-04 13:25:13,935 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:13,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2020-09-04 13:25:13,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 584. [2020-09-04 13:25:13,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2020-09-04 13:25:13,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 854 transitions. [2020-09-04 13:25:13,954 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 854 transitions. Word has length 22 [2020-09-04 13:25:13,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:13,954 INFO L479 AbstractCegarLoop]: Abstraction has 584 states and 854 transitions. [2020-09-04 13:25:13,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:13,955 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 854 transitions. [2020-09-04 13:25:13,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-04 13:25:13,956 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:13,956 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] [2020-09-04 13:25:13,957 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 13:25:13,957 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:13,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:13,957 INFO L82 PathProgramCache]: Analyzing trace with hash -506467995, now seen corresponding path program 1 times [2020-09-04 13:25:13,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:13,958 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279756274] [2020-09-04 13:25:13,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:13,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:13,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:13,986 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279756274] [2020-09-04 13:25:13,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:13,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:13,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822895249] [2020-09-04 13:25:13,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:13,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:13,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:13,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:13,988 INFO L87 Difference]: Start difference. First operand 584 states and 854 transitions. Second operand 3 states. [2020-09-04 13:25:14,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:14,016 INFO L93 Difference]: Finished difference Result 1340 states and 1960 transitions. [2020-09-04 13:25:14,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:14,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-09-04 13:25:14,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:14,021 INFO L225 Difference]: With dead ends: 1340 [2020-09-04 13:25:14,021 INFO L226 Difference]: Without dead ends: 778 [2020-09-04 13:25:14,023 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:14,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2020-09-04 13:25:14,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2020-09-04 13:25:14,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-09-04 13:25:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1110 transitions. [2020-09-04 13:25:14,050 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1110 transitions. Word has length 22 [2020-09-04 13:25:14,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:14,050 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 1110 transitions. [2020-09-04 13:25:14,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:14,050 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1110 transitions. [2020-09-04 13:25:14,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-04 13:25:14,052 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:14,052 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] [2020-09-04 13:25:14,053 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 13:25:14,053 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:14,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:14,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411293, now seen corresponding path program 1 times [2020-09-04 13:25:14,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:14,054 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442811320] [2020-09-04 13:25:14,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:14,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:14,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:14,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442811320] [2020-09-04 13:25:14,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:14,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:14,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356216160] [2020-09-04 13:25:14,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:14,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:14,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:14,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:14,085 INFO L87 Difference]: Start difference. First operand 776 states and 1110 transitions. Second operand 3 states. [2020-09-04 13:25:14,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:14,113 INFO L93 Difference]: Finished difference Result 1164 states and 1656 transitions. [2020-09-04 13:25:14,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:14,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-09-04 13:25:14,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:14,118 INFO L225 Difference]: With dead ends: 1164 [2020-09-04 13:25:14,118 INFO L226 Difference]: Without dead ends: 794 [2020-09-04 13:25:14,119 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:14,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2020-09-04 13:25:14,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2020-09-04 13:25:14,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-09-04 13:25:14,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1110 transitions. [2020-09-04 13:25:14,149 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1110 transitions. Word has length 23 [2020-09-04 13:25:14,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:14,149 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 1110 transitions. [2020-09-04 13:25:14,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:14,150 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1110 transitions. [2020-09-04 13:25:14,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-04 13:25:14,151 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:14,152 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] [2020-09-04 13:25:14,152 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 13:25:14,152 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:14,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:14,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1479576731, now seen corresponding path program 1 times [2020-09-04 13:25:14,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:14,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847831291] [2020-09-04 13:25:14,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:14,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:14,180 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847831291] [2020-09-04 13:25:14,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:14,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:14,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497765293] [2020-09-04 13:25:14,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:14,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:14,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:14,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:14,182 INFO L87 Difference]: Start difference. First operand 792 states and 1110 transitions. Second operand 3 states. [2020-09-04 13:25:14,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:14,220 INFO L93 Difference]: Finished difference Result 1356 states and 1928 transitions. [2020-09-04 13:25:14,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:14,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-09-04 13:25:14,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:14,247 INFO L225 Difference]: With dead ends: 1356 [2020-09-04 13:25:14,248 INFO L226 Difference]: Without dead ends: 1354 [2020-09-04 13:25:14,248 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:14,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-09-04 13:25:14,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1160. [2020-09-04 13:25:14,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2020-09-04 13:25:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1574 transitions. [2020-09-04 13:25:14,286 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1574 transitions. Word has length 23 [2020-09-04 13:25:14,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:14,287 INFO L479 AbstractCegarLoop]: Abstraction has 1160 states and 1574 transitions. [2020-09-04 13:25:14,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:14,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1574 transitions. [2020-09-04 13:25:14,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-04 13:25:14,289 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:14,290 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] [2020-09-04 13:25:14,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 13:25:14,290 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:14,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:14,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2114325987, now seen corresponding path program 1 times [2020-09-04 13:25:14,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:14,291 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921480009] [2020-09-04 13:25:14,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:14,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:14,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:14,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921480009] [2020-09-04 13:25:14,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:14,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:14,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76976014] [2020-09-04 13:25:14,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:14,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:14,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:14,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:14,319 INFO L87 Difference]: Start difference. First operand 1160 states and 1574 transitions. Second operand 3 states. [2020-09-04 13:25:14,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:14,362 INFO L93 Difference]: Finished difference Result 2636 states and 3560 transitions. [2020-09-04 13:25:14,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:14,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-09-04 13:25:14,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:14,370 INFO L225 Difference]: With dead ends: 2636 [2020-09-04 13:25:14,370 INFO L226 Difference]: Without dead ends: 1514 [2020-09-04 13:25:14,373 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:14,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2020-09-04 13:25:14,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1512. [2020-09-04 13:25:14,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2020-09-04 13:25:14,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1990 transitions. [2020-09-04 13:25:14,423 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1990 transitions. Word has length 23 [2020-09-04 13:25:14,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:14,423 INFO L479 AbstractCegarLoop]: Abstraction has 1512 states and 1990 transitions. [2020-09-04 13:25:14,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:14,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1990 transitions. [2020-09-04 13:25:14,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 13:25:14,426 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:14,426 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] [2020-09-04 13:25:14,427 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 13:25:14,427 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:14,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:14,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1377545862, now seen corresponding path program 1 times [2020-09-04 13:25:14,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:14,428 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408373645] [2020-09-04 13:25:14,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:14,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:14,451 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408373645] [2020-09-04 13:25:14,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:14,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:14,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191644802] [2020-09-04 13:25:14,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:14,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:14,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:14,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:14,453 INFO L87 Difference]: Start difference. First operand 1512 states and 1990 transitions. Second operand 3 states. [2020-09-04 13:25:14,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:14,492 INFO L93 Difference]: Finished difference Result 2268 states and 2968 transitions. [2020-09-04 13:25:14,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:14,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-09-04 13:25:14,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:14,500 INFO L225 Difference]: With dead ends: 2268 [2020-09-04 13:25:14,500 INFO L226 Difference]: Without dead ends: 1546 [2020-09-04 13:25:14,502 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:14,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2020-09-04 13:25:14,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2020-09-04 13:25:14,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2020-09-04 13:25:14,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1990 transitions. [2020-09-04 13:25:14,550 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1990 transitions. Word has length 24 [2020-09-04 13:25:14,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:14,550 INFO L479 AbstractCegarLoop]: Abstraction has 1544 states and 1990 transitions. [2020-09-04 13:25:14,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:14,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1990 transitions. [2020-09-04 13:25:14,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 13:25:14,553 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:14,553 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] [2020-09-04 13:25:14,553 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 13:25:14,553 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:14,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:14,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1119380424, now seen corresponding path program 1 times [2020-09-04 13:25:14,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:14,554 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549517429] [2020-09-04 13:25:14,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:14,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:14,578 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549517429] [2020-09-04 13:25:14,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:14,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:14,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960351729] [2020-09-04 13:25:14,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:14,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:14,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:14,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:14,580 INFO L87 Difference]: Start difference. First operand 1544 states and 1990 transitions. Second operand 3 states. [2020-09-04 13:25:14,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:14,633 INFO L93 Difference]: Finished difference Result 2572 states and 3336 transitions. [2020-09-04 13:25:14,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:14,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-09-04 13:25:14,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:14,646 INFO L225 Difference]: With dead ends: 2572 [2020-09-04 13:25:14,646 INFO L226 Difference]: Without dead ends: 2570 [2020-09-04 13:25:14,647 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:14,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2020-09-04 13:25:14,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2312. [2020-09-04 13:25:14,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2020-09-04 13:25:14,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2886 transitions. [2020-09-04 13:25:14,715 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2886 transitions. Word has length 24 [2020-09-04 13:25:14,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:14,716 INFO L479 AbstractCegarLoop]: Abstraction has 2312 states and 2886 transitions. [2020-09-04 13:25:14,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:14,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2886 transitions. [2020-09-04 13:25:14,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 13:25:14,721 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:14,721 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] [2020-09-04 13:25:14,721 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 13:25:14,721 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:14,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:14,722 INFO L82 PathProgramCache]: Analyzing trace with hash -418315846, now seen corresponding path program 1 times [2020-09-04 13:25:14,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:14,722 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036578624] [2020-09-04 13:25:14,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:14,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:14,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:14,744 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036578624] [2020-09-04 13:25:14,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:14,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:14,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382535093] [2020-09-04 13:25:14,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:14,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:14,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:14,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:14,746 INFO L87 Difference]: Start difference. First operand 2312 states and 2886 transitions. Second operand 3 states. [2020-09-04 13:25:14,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:14,833 INFO L93 Difference]: Finished difference Result 5196 states and 6408 transitions. [2020-09-04 13:25:14,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:14,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-09-04 13:25:14,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:14,847 INFO L225 Difference]: With dead ends: 5196 [2020-09-04 13:25:14,847 INFO L226 Difference]: Without dead ends: 2954 [2020-09-04 13:25:14,853 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:14,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-09-04 13:25:14,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2020-09-04 13:25:14,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2020-09-04 13:25:14,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3526 transitions. [2020-09-04 13:25:14,938 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3526 transitions. Word has length 24 [2020-09-04 13:25:14,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:14,938 INFO L479 AbstractCegarLoop]: Abstraction has 2952 states and 3526 transitions. [2020-09-04 13:25:14,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:14,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3526 transitions. [2020-09-04 13:25:14,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-04 13:25:14,943 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:14,943 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-09-04 13:25:14,944 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 13:25:14,944 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:14,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:14,944 INFO L82 PathProgramCache]: Analyzing trace with hash -340838702, now seen corresponding path program 1 times [2020-09-04 13:25:14,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:14,945 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731484137] [2020-09-04 13:25:14,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:14,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:14,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:14,968 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731484137] [2020-09-04 13:25:14,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:14,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:14,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183787203] [2020-09-04 13:25:14,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:14,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:14,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:14,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:14,970 INFO L87 Difference]: Start difference. First operand 2952 states and 3526 transitions. Second operand 3 states. [2020-09-04 13:25:15,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:15,046 INFO L93 Difference]: Finished difference Result 4428 states and 5256 transitions. [2020-09-04 13:25:15,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:15,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-09-04 13:25:15,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:15,063 INFO L225 Difference]: With dead ends: 4428 [2020-09-04 13:25:15,063 INFO L226 Difference]: Without dead ends: 3018 [2020-09-04 13:25:15,067 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:15,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2020-09-04 13:25:15,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2020-09-04 13:25:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2020-09-04 13:25:15,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3526 transitions. [2020-09-04 13:25:15,168 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3526 transitions. Word has length 25 [2020-09-04 13:25:15,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:15,168 INFO L479 AbstractCegarLoop]: Abstraction has 3016 states and 3526 transitions. [2020-09-04 13:25:15,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:15,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3526 transitions. [2020-09-04 13:25:15,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-04 13:25:15,173 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:15,173 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-09-04 13:25:15,173 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 13:25:15,173 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:15,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:15,174 INFO L82 PathProgramCache]: Analyzing trace with hash -82673264, now seen corresponding path program 1 times [2020-09-04 13:25:15,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:15,174 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595733387] [2020-09-04 13:25:15,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:15,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:15,201 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595733387] [2020-09-04 13:25:15,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:15,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:15,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537232921] [2020-09-04 13:25:15,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:15,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:15,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:15,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:15,202 INFO L87 Difference]: Start difference. First operand 3016 states and 3526 transitions. Second operand 3 states. [2020-09-04 13:25:15,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:15,329 INFO L93 Difference]: Finished difference Result 8650 states and 9799 transitions. [2020-09-04 13:25:15,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:15,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-09-04 13:25:15,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:15,342 INFO L225 Difference]: With dead ends: 8650 [2020-09-04 13:25:15,342 INFO L226 Difference]: Without dead ends: 3016 [2020-09-04 13:25:15,352 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:15,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2020-09-04 13:25:15,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2020-09-04 13:25:15,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2020-09-04 13:25:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3270 transitions. [2020-09-04 13:25:15,444 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3270 transitions. Word has length 25 [2020-09-04 13:25:15,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:15,445 INFO L479 AbstractCegarLoop]: Abstraction has 3016 states and 3270 transitions. [2020-09-04 13:25:15,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:15,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2020-09-04 13:25:15,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-04 13:25:15,449 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:15,449 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-09-04 13:25:15,450 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-04 13:25:15,450 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:15,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:15,450 INFO L82 PathProgramCache]: Analyzing trace with hash -783737842, now seen corresponding path program 1 times [2020-09-04 13:25:15,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:15,451 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647006259] [2020-09-04 13:25:15,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:15,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:15,475 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647006259] [2020-09-04 13:25:15,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:15,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:15,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128201857] [2020-09-04 13:25:15,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:15,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:15,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:15,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:15,477 INFO L87 Difference]: Start difference. First operand 3016 states and 3270 transitions. Second operand 3 states. [2020-09-04 13:25:15,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:15,520 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2020-09-04 13:25:15,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:15,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-09-04 13:25:15,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:15,521 INFO L225 Difference]: With dead ends: 3016 [2020-09-04 13:25:15,521 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 13:25:15,526 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:15,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 13:25:15,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 13:25:15,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 13:25:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 13:25:15,527 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2020-09-04 13:25:15,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:15,528 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 13:25:15,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:15,528 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 13:25:15,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 13:25:15,528 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-04 13:25:15,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 13:25:15,555 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 13:25:15,556 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-09-04 13:25:15,556 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-09-04 13:25:15,556 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 13:25:15,556 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 13:25:15,556 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-09-04 13:25:15,556 INFO L268 CegarLoopResult]: For program point L126(line 126) no Hoare annotation was computed. [2020-09-04 13:25:15,556 INFO L264 CegarLoopResult]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2020-09-04 13:25:15,556 INFO L268 CegarLoopResult]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2020-09-04 13:25:15,557 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2020-09-04 13:25:15,557 INFO L268 CegarLoopResult]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2020-09-04 13:25:15,557 INFO L268 CegarLoopResult]: For program point L111(line 111) no Hoare annotation was computed. [2020-09-04 13:25:15,557 INFO L268 CegarLoopResult]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2020-09-04 13:25:15,557 INFO L268 CegarLoopResult]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2020-09-04 13:25:15,557 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2020-09-04 13:25:15,557 INFO L268 CegarLoopResult]: For program point L96(line 96) no Hoare annotation was computed. [2020-09-04 13:25:15,558 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2020-09-04 13:25:15,558 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2020-09-04 13:25:15,558 INFO L268 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2020-09-04 13:25:15,558 INFO L268 CegarLoopResult]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2020-09-04 13:25:15,558 INFO L268 CegarLoopResult]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2020-09-04 13:25:15,558 INFO L268 CegarLoopResult]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2020-09-04 13:25:15,558 INFO L268 CegarLoopResult]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2020-09-04 13:25:15,559 INFO L268 CegarLoopResult]: For program point L56(lines 56 58) no Hoare annotation was computed. [2020-09-04 13:25:15,559 INFO L268 CegarLoopResult]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2020-09-04 13:25:15,559 INFO L268 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2020-09-04 13:25:15,559 INFO L271 CegarLoopResult]: At program point L131(lines 5 135) the Hoare annotation is: true [2020-09-04 13:25:15,559 INFO L268 CegarLoopResult]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2020-09-04 13:25:15,559 INFO L268 CegarLoopResult]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2020-09-04 13:25:15,559 INFO L268 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2020-09-04 13:25:15,559 INFO L268 CegarLoopResult]: For program point L116(line 116) no Hoare annotation was computed. [2020-09-04 13:25:15,560 INFO L268 CegarLoopResult]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2020-09-04 13:25:15,560 INFO L271 CegarLoopResult]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2020-09-04 13:25:15,560 INFO L268 CegarLoopResult]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2020-09-04 13:25:15,560 INFO L268 CegarLoopResult]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2020-09-04 13:25:15,560 INFO L268 CegarLoopResult]: For program point L101(line 101) no Hoare annotation was computed. [2020-09-04 13:25:15,560 INFO L268 CegarLoopResult]: For program point L35(lines 35 37) no Hoare annotation was computed. [2020-09-04 13:25:15,560 INFO L268 CegarLoopResult]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2020-09-04 13:25:15,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:25:15 BoogieIcfgContainer [2020-09-04 13:25:15,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:25:15,578 INFO L168 Benchmark]: Toolchain (without parser) took 4323.24 ms. Allocated memory was 140.0 MB in the beginning and 295.7 MB in the end (delta: 155.7 MB). Free memory was 102.7 MB in the beginning and 182.4 MB in the end (delta: -79.7 MB). Peak memory consumption was 76.0 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:15,578 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 13:25:15,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.31 ms. Allocated memory is still 140.0 MB. Free memory was 102.5 MB in the beginning and 92.0 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:15,580 INFO L168 Benchmark]: Boogie Preprocessor took 137.36 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 92.0 MB in the beginning and 181.0 MB in the end (delta: -89.0 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:15,580 INFO L168 Benchmark]: RCFGBuilder took 389.38 ms. Allocated memory is still 203.4 MB. Free memory was 181.0 MB in the beginning and 163.3 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:15,581 INFO L168 Benchmark]: TraceAbstraction took 3458.57 ms. Allocated memory was 203.4 MB in the beginning and 295.7 MB in the end (delta: 92.3 MB). Free memory was 163.3 MB in the beginning and 182.4 MB in the end (delta: -19.1 MB). Peak memory consumption was 73.2 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:15,583 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 332.31 ms. Allocated memory is still 140.0 MB. Free memory was 102.5 MB in the beginning and 92.0 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 137.36 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 92.0 MB in the beginning and 181.0 MB in the end (delta: -89.0 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 389.38 ms. Allocated memory is still 203.4 MB. Free memory was 181.0 MB in the beginning and 163.3 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3458.57 ms. Allocated memory was 203.4 MB in the beginning and 295.7 MB in the end (delta: 92.3 MB). Free memory was 163.3 MB in the beginning and 182.4 MB in the end (delta: -19.1 MB). Peak memory consumption was 73.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.3s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1573 SDtfs, 755 SDslu, 1056 SDs, 0 SdLazy, 121 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3016occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 790 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 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 correct! Received shutdown request...