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_15-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:13:49,187 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:13:49,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:13:49,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:13:49,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:13:49,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:13:49,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:13:49,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:13:49,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:13:49,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:13:49,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:13:49,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:13:49,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:13:49,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:13:49,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:13:49,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:13:49,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:13:49,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:13:49,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:13:49,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:13:49,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:13:49,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:13:49,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:13:49,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:13:49,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:13:49,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:13:49,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:13:49,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:13:49,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:13:49,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:13:49,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:13:49,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:13:49,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:13:49,234 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:13:49,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:13:49,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:13:49,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:13:49,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:13:49,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:13:49,238 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:13:49,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:13:49,240 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:13:49,254 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:13:49,254 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:13:49,256 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:13:49,256 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:13:49,256 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:13:49,257 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:13:49,257 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:13:49,257 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:13:49,257 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:13:49,257 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:13:49,258 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:13:49,258 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:13:49,258 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:13:49,258 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:13:49,258 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:13:49,259 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:13:49,259 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:13:49,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:13:49,259 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:13:49,260 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:13:49,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:13:49,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:13:49,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:13:49,260 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:13:49,261 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:13:49,261 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:13:49,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:13:49,261 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:13:49,261 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:13:49,534 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:13:49,551 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:13:49,556 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:13:49,558 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:13:49,559 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:13:49,559 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_15-2.c [2019-10-14 23:13:49,637 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2602aa0da/eeda5558b1d2413a91979339e70b0695/FLAGcf4892dc5 [2019-10-14 23:13:50,165 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:13:50,166 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c [2019-10-14 23:13:50,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2602aa0da/eeda5558b1d2413a91979339e70b0695/FLAGcf4892dc5 [2019-10-14 23:13:50,514 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2602aa0da/eeda5558b1d2413a91979339e70b0695 [2019-10-14 23:13:50,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:13:50,527 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:13:50,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:13:50,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:13:50,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:13:50,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:50" (1/1) ... [2019-10-14 23:13:50,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@316c1eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:50, skipping insertion in model container [2019-10-14 23:13:50,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:50" (1/1) ... [2019-10-14 23:13:50,544 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:13:50,585 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:13:50,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:13:50,807 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:13:50,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:13:50,954 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:13:50,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:50 WrapperNode [2019-10-14 23:13:50,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:13:50,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:13:50,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:13:50,956 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:13:50,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:50" (1/1) ... [2019-10-14 23:13:50,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:50" (1/1) ... [2019-10-14 23:13:50,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:50" (1/1) ... [2019-10-14 23:13:50,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:50" (1/1) ... [2019-10-14 23:13:50,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:50" (1/1) ... [2019-10-14 23:13:50,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:50" (1/1) ... [2019-10-14 23:13:50,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:50" (1/1) ... [2019-10-14 23:13:50,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:13:51,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:13:51,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:13:51,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:13:51,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:13:51,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:13:51,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:13:51,056 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:13:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:13:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:13:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:13:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:13:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:13:51,472 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:13:51,473 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:13:51,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:13:51 BoogieIcfgContainer [2019-10-14 23:13:51,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:13:51,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:13:51,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:13:51,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:13:51,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:13:50" (1/3) ... [2019-10-14 23:13:51,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c5f8e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:13:51, skipping insertion in model container [2019-10-14 23:13:51,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:50" (2/3) ... [2019-10-14 23:13:51,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c5f8e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:13:51, skipping insertion in model container [2019-10-14 23:13:51,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:13:51" (3/3) ... [2019-10-14 23:13:51,483 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2019-10-14 23:13:51,494 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:13:51,503 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:13:51,515 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:13:51,542 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:13:51,542 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:13:51,542 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:13:51,542 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:13:51,543 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:13:51,543 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:13:51,543 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:13:51,543 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:13:51,564 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2019-10-14 23:13:51,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:13:51,571 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:51,573 INFO L380 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] [2019-10-14 23:13:51,575 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:51,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:51,581 INFO L82 PathProgramCache]: Analyzing trace with hash -563360106, now seen corresponding path program 1 times [2019-10-14 23:13:51,589 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:51,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547122858] [2019-10-14 23:13:51,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:51,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:51,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:51,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547122858] [2019-10-14 23:13:51,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:51,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:51,803 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923676044] [2019-10-14 23:13:51,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:51,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:51,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:51,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:51,827 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2019-10-14 23:13:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:51,910 INFO L93 Difference]: Finished difference Result 117 states and 210 transitions. [2019-10-14 23:13:51,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:51,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-14 23:13:51,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:51,926 INFO L225 Difference]: With dead ends: 117 [2019-10-14 23:13:51,926 INFO L226 Difference]: Without dead ends: 102 [2019-10-14 23:13:51,929 INFO L600 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 [2019-10-14 23:13:51,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-14 23:13:51,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2019-10-14 23:13:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-14 23:13:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 129 transitions. [2019-10-14 23:13:51,978 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 129 transitions. Word has length 25 [2019-10-14 23:13:51,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:51,979 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 129 transitions. [2019-10-14 23:13:51,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:51,979 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 129 transitions. [2019-10-14 23:13:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:13:51,981 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:51,981 INFO L380 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] [2019-10-14 23:13:51,981 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:51,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:51,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1737462484, now seen corresponding path program 1 times [2019-10-14 23:13:51,982 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:51,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837134202] [2019-10-14 23:13:51,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:51,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:51,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:52,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837134202] [2019-10-14 23:13:52,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:52,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:52,055 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456738474] [2019-10-14 23:13:52,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:52,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:52,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:52,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:52,059 INFO L87 Difference]: Start difference. First operand 70 states and 129 transitions. Second operand 3 states. [2019-10-14 23:13:52,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:52,116 INFO L93 Difference]: Finished difference Result 167 states and 312 transitions. [2019-10-14 23:13:52,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:52,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-14 23:13:52,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:52,119 INFO L225 Difference]: With dead ends: 167 [2019-10-14 23:13:52,119 INFO L226 Difference]: Without dead ends: 102 [2019-10-14 23:13:52,121 INFO L600 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 [2019-10-14 23:13:52,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-14 23:13:52,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-10-14 23:13:52,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-14 23:13:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 185 transitions. [2019-10-14 23:13:52,138 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 185 transitions. Word has length 25 [2019-10-14 23:13:52,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:52,138 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 185 transitions. [2019-10-14 23:13:52,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:52,139 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 185 transitions. [2019-10-14 23:13:52,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:13:52,140 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:52,140 INFO L380 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, 1] [2019-10-14 23:13:52,140 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:52,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:52,141 INFO L82 PathProgramCache]: Analyzing trace with hash -284082342, now seen corresponding path program 1 times [2019-10-14 23:13:52,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:52,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536832629] [2019-10-14 23:13:52,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:52,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:52,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:52,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536832629] [2019-10-14 23:13:52,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:52,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:52,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190580356] [2019-10-14 23:13:52,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:52,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:52,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:52,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:52,206 INFO L87 Difference]: Start difference. First operand 100 states and 185 transitions. Second operand 3 states. [2019-10-14 23:13:52,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:52,247 INFO L93 Difference]: Finished difference Result 153 states and 279 transitions. [2019-10-14 23:13:52,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:52,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:13:52,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:52,249 INFO L225 Difference]: With dead ends: 153 [2019-10-14 23:13:52,249 INFO L226 Difference]: Without dead ends: 105 [2019-10-14 23:13:52,250 INFO L600 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 [2019-10-14 23:13:52,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-14 23:13:52,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-10-14 23:13:52,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-14 23:13:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 187 transitions. [2019-10-14 23:13:52,262 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 187 transitions. Word has length 26 [2019-10-14 23:13:52,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:52,264 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 187 transitions. [2019-10-14 23:13:52,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:52,264 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2019-10-14 23:13:52,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:13:52,265 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:52,266 INFO L380 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, 1] [2019-10-14 23:13:52,266 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:52,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:52,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1973026084, now seen corresponding path program 1 times [2019-10-14 23:13:52,268 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:52,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357481010] [2019-10-14 23:13:52,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:52,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:52,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:52,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357481010] [2019-10-14 23:13:52,375 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:52,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:52,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056256099] [2019-10-14 23:13:52,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:52,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:52,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:52,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:52,377 INFO L87 Difference]: Start difference. First operand 103 states and 187 transitions. Second operand 3 states. [2019-10-14 23:13:52,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:52,407 INFO L93 Difference]: Finished difference Result 196 states and 360 transitions. [2019-10-14 23:13:52,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:52,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:13:52,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:52,410 INFO L225 Difference]: With dead ends: 196 [2019-10-14 23:13:52,411 INFO L226 Difference]: Without dead ends: 194 [2019-10-14 23:13:52,411 INFO L600 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 [2019-10-14 23:13:52,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-10-14 23:13:52,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 136. [2019-10-14 23:13:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-14 23:13:52,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 248 transitions. [2019-10-14 23:13:52,426 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 248 transitions. Word has length 26 [2019-10-14 23:13:52,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:52,426 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 248 transitions. [2019-10-14 23:13:52,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:52,427 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 248 transitions. [2019-10-14 23:13:52,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:13:52,428 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:52,429 INFO L380 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, 1] [2019-10-14 23:13:52,429 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:52,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:52,429 INFO L82 PathProgramCache]: Analyzing trace with hash 327796506, now seen corresponding path program 1 times [2019-10-14 23:13:52,430 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:52,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025330789] [2019-10-14 23:13:52,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:52,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:52,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:52,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025330789] [2019-10-14 23:13:52,483 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:52,484 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:52,484 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153989860] [2019-10-14 23:13:52,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:52,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:52,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:52,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:52,486 INFO L87 Difference]: Start difference. First operand 136 states and 248 transitions. Second operand 3 states. [2019-10-14 23:13:52,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:52,524 INFO L93 Difference]: Finished difference Result 324 states and 598 transitions. [2019-10-14 23:13:52,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:52,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:13:52,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:52,529 INFO L225 Difference]: With dead ends: 324 [2019-10-14 23:13:52,529 INFO L226 Difference]: Without dead ends: 196 [2019-10-14 23:13:52,534 INFO L600 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 [2019-10-14 23:13:52,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-14 23:13:52,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2019-10-14 23:13:52,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-10-14 23:13:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 354 transitions. [2019-10-14 23:13:52,571 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 354 transitions. Word has length 26 [2019-10-14 23:13:52,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:52,572 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 354 transitions. [2019-10-14 23:13:52,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:52,572 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 354 transitions. [2019-10-14 23:13:52,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:13:52,574 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:52,574 INFO L380 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, 1, 1] [2019-10-14 23:13:52,574 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:52,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:52,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1034054359, now seen corresponding path program 1 times [2019-10-14 23:13:52,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:52,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650504499] [2019-10-14 23:13:52,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:52,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:52,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:52,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650504499] [2019-10-14 23:13:52,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:52,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:52,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566515045] [2019-10-14 23:13:52,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:52,651 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:52,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:52,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:52,652 INFO L87 Difference]: Start difference. First operand 194 states and 354 transitions. Second operand 3 states. [2019-10-14 23:13:52,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:52,673 INFO L93 Difference]: Finished difference Result 291 states and 529 transitions. [2019-10-14 23:13:52,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:52,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-14 23:13:52,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:52,676 INFO L225 Difference]: With dead ends: 291 [2019-10-14 23:13:52,676 INFO L226 Difference]: Without dead ends: 198 [2019-10-14 23:13:52,677 INFO L600 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 [2019-10-14 23:13:52,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-10-14 23:13:52,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2019-10-14 23:13:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-14 23:13:52,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 354 transitions. [2019-10-14 23:13:52,693 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 354 transitions. Word has length 27 [2019-10-14 23:13:52,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:52,694 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 354 transitions. [2019-10-14 23:13:52,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:52,694 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 354 transitions. [2019-10-14 23:13:52,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:13:52,700 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:52,700 INFO L380 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, 1, 1] [2019-10-14 23:13:52,700 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:52,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:52,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1571969195, now seen corresponding path program 1 times [2019-10-14 23:13:52,701 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:52,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937980247] [2019-10-14 23:13:52,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:52,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:52,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:52,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937980247] [2019-10-14 23:13:52,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:52,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:52,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10606111] [2019-10-14 23:13:52,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:52,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:52,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:52,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:52,752 INFO L87 Difference]: Start difference. First operand 196 states and 354 transitions. Second operand 3 states. [2019-10-14 23:13:52,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:52,775 INFO L93 Difference]: Finished difference Result 372 states and 680 transitions. [2019-10-14 23:13:52,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:52,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-14 23:13:52,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:52,778 INFO L225 Difference]: With dead ends: 372 [2019-10-14 23:13:52,778 INFO L226 Difference]: Without dead ends: 370 [2019-10-14 23:13:52,779 INFO L600 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 [2019-10-14 23:13:52,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-10-14 23:13:52,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 264. [2019-10-14 23:13:52,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-10-14 23:13:52,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 474 transitions. [2019-10-14 23:13:52,795 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 474 transitions. Word has length 27 [2019-10-14 23:13:52,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:52,796 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 474 transitions. [2019-10-14 23:13:52,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:52,796 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 474 transitions. [2019-10-14 23:13:52,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:13:52,803 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:52,803 INFO L380 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, 1, 1] [2019-10-14 23:13:52,803 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:52,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:52,806 INFO L82 PathProgramCache]: Analyzing trace with hash -422175511, now seen corresponding path program 1 times [2019-10-14 23:13:52,806 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:52,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287863502] [2019-10-14 23:13:52,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:52,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:52,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:52,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287863502] [2019-10-14 23:13:52,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:52,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:52,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344716900] [2019-10-14 23:13:52,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:52,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:52,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:52,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:52,878 INFO L87 Difference]: Start difference. First operand 264 states and 474 transitions. Second operand 3 states. [2019-10-14 23:13:52,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:52,907 INFO L93 Difference]: Finished difference Result 632 states and 1144 transitions. [2019-10-14 23:13:52,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:52,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-14 23:13:52,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:52,910 INFO L225 Difference]: With dead ends: 632 [2019-10-14 23:13:52,910 INFO L226 Difference]: Without dead ends: 378 [2019-10-14 23:13:52,912 INFO L600 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 [2019-10-14 23:13:52,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-14 23:13:52,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 376. [2019-10-14 23:13:52,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-10-14 23:13:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 674 transitions. [2019-10-14 23:13:52,926 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 674 transitions. Word has length 27 [2019-10-14 23:13:52,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:52,927 INFO L462 AbstractCegarLoop]: Abstraction has 376 states and 674 transitions. [2019-10-14 23:13:52,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:52,927 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 674 transitions. [2019-10-14 23:13:52,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:13:52,928 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:52,928 INFO L380 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, 1, 1, 1] [2019-10-14 23:13:52,929 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:52,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:52,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1486617231, now seen corresponding path program 1 times [2019-10-14 23:13:52,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:52,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698942538] [2019-10-14 23:13:52,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:52,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:52,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:52,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698942538] [2019-10-14 23:13:52,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:52,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:52,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668893851] [2019-10-14 23:13:52,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:52,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:52,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:52,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:52,964 INFO L87 Difference]: Start difference. First operand 376 states and 674 transitions. Second operand 3 states. [2019-10-14 23:13:52,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:52,983 INFO L93 Difference]: Finished difference Result 564 states and 1008 transitions. [2019-10-14 23:13:52,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:52,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-14 23:13:52,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:52,986 INFO L225 Difference]: With dead ends: 564 [2019-10-14 23:13:52,986 INFO L226 Difference]: Without dead ends: 382 [2019-10-14 23:13:52,987 INFO L600 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 [2019-10-14 23:13:52,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-10-14 23:13:52,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2019-10-14 23:13:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-10-14 23:13:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 674 transitions. [2019-10-14 23:13:53,000 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 674 transitions. Word has length 28 [2019-10-14 23:13:53,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:53,000 INFO L462 AbstractCegarLoop]: Abstraction has 380 states and 674 transitions. [2019-10-14 23:13:53,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:53,001 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 674 transitions. [2019-10-14 23:13:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:13:53,002 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:53,002 INFO L380 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, 1, 1, 1] [2019-10-14 23:13:53,002 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:53,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:53,003 INFO L82 PathProgramCache]: Analyzing trace with hash -202326511, now seen corresponding path program 1 times [2019-10-14 23:13:53,003 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:53,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946255507] [2019-10-14 23:13:53,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:53,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946255507] [2019-10-14 23:13:53,032 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:53,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:53,033 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184431180] [2019-10-14 23:13:53,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:53,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:53,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:53,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:53,034 INFO L87 Difference]: Start difference. First operand 380 states and 674 transitions. Second operand 3 states. [2019-10-14 23:13:53,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:53,055 INFO L93 Difference]: Finished difference Result 716 states and 1288 transitions. [2019-10-14 23:13:53,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:53,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-14 23:13:53,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:53,059 INFO L225 Difference]: With dead ends: 716 [2019-10-14 23:13:53,060 INFO L226 Difference]: Without dead ends: 714 [2019-10-14 23:13:53,060 INFO L600 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 [2019-10-14 23:13:53,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-10-14 23:13:53,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 520. [2019-10-14 23:13:53,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-10-14 23:13:53,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 910 transitions. [2019-10-14 23:13:53,078 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 910 transitions. Word has length 28 [2019-10-14 23:13:53,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:53,079 INFO L462 AbstractCegarLoop]: Abstraction has 520 states and 910 transitions. [2019-10-14 23:13:53,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:53,079 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 910 transitions. [2019-10-14 23:13:53,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:13:53,080 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:53,080 INFO L380 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, 1, 1, 1] [2019-10-14 23:13:53,081 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:53,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:53,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2098496079, now seen corresponding path program 1 times [2019-10-14 23:13:53,081 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:53,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512239599] [2019-10-14 23:13:53,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:53,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512239599] [2019-10-14 23:13:53,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:53,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:53,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088623477] [2019-10-14 23:13:53,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:53,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:53,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:53,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:53,107 INFO L87 Difference]: Start difference. First operand 520 states and 910 transitions. Second operand 3 states. [2019-10-14 23:13:53,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:53,134 INFO L93 Difference]: Finished difference Result 1244 states and 2192 transitions. [2019-10-14 23:13:53,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:53,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-14 23:13:53,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:53,138 INFO L225 Difference]: With dead ends: 1244 [2019-10-14 23:13:53,138 INFO L226 Difference]: Without dead ends: 738 [2019-10-14 23:13:53,140 INFO L600 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 [2019-10-14 23:13:53,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-10-14 23:13:53,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 736. [2019-10-14 23:13:53,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-10-14 23:13:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1286 transitions. [2019-10-14 23:13:53,162 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1286 transitions. Word has length 28 [2019-10-14 23:13:53,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:53,162 INFO L462 AbstractCegarLoop]: Abstraction has 736 states and 1286 transitions. [2019-10-14 23:13:53,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:53,162 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1286 transitions. [2019-10-14 23:13:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:13:53,163 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:53,164 INFO L380 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, 1, 1, 1, 1] [2019-10-14 23:13:53,164 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:53,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:53,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1976941762, now seen corresponding path program 1 times [2019-10-14 23:13:53,164 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:53,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334673579] [2019-10-14 23:13:53,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:53,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334673579] [2019-10-14 23:13:53,191 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:53,191 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:53,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212389436] [2019-10-14 23:13:53,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:53,192 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:53,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:53,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:53,193 INFO L87 Difference]: Start difference. First operand 736 states and 1286 transitions. Second operand 3 states. [2019-10-14 23:13:53,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:53,217 INFO L93 Difference]: Finished difference Result 1104 states and 1924 transitions. [2019-10-14 23:13:53,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:53,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-14 23:13:53,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:53,222 INFO L225 Difference]: With dead ends: 1104 [2019-10-14 23:13:53,222 INFO L226 Difference]: Without dead ends: 746 [2019-10-14 23:13:53,224 INFO L600 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 [2019-10-14 23:13:53,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2019-10-14 23:13:53,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2019-10-14 23:13:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2019-10-14 23:13:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1286 transitions. [2019-10-14 23:13:53,246 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1286 transitions. Word has length 29 [2019-10-14 23:13:53,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:53,246 INFO L462 AbstractCegarLoop]: Abstraction has 744 states and 1286 transitions. [2019-10-14 23:13:53,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:53,247 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1286 transitions. [2019-10-14 23:13:53,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:13:53,248 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:53,248 INFO L380 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, 1, 1, 1, 1] [2019-10-14 23:13:53,249 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:53,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:53,249 INFO L82 PathProgramCache]: Analyzing trace with hash 629081792, now seen corresponding path program 1 times [2019-10-14 23:13:53,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:53,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160859193] [2019-10-14 23:13:53,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:53,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160859193] [2019-10-14 23:13:53,277 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:53,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:53,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685726023] [2019-10-14 23:13:53,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:53,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:53,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:53,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:53,279 INFO L87 Difference]: Start difference. First operand 744 states and 1286 transitions. Second operand 3 states. [2019-10-14 23:13:53,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:53,308 INFO L93 Difference]: Finished difference Result 1388 states and 2440 transitions. [2019-10-14 23:13:53,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:53,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-14 23:13:53,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:53,317 INFO L225 Difference]: With dead ends: 1388 [2019-10-14 23:13:53,317 INFO L226 Difference]: Without dead ends: 1386 [2019-10-14 23:13:53,318 INFO L600 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 [2019-10-14 23:13:53,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2019-10-14 23:13:53,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1032. [2019-10-14 23:13:53,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2019-10-14 23:13:53,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1750 transitions. [2019-10-14 23:13:53,354 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1750 transitions. Word has length 29 [2019-10-14 23:13:53,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:53,354 INFO L462 AbstractCegarLoop]: Abstraction has 1032 states and 1750 transitions. [2019-10-14 23:13:53,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:53,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1750 transitions. [2019-10-14 23:13:53,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:13:53,357 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:53,357 INFO L380 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, 1, 1, 1, 1] [2019-10-14 23:13:53,357 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:53,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:53,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1365062914, now seen corresponding path program 1 times [2019-10-14 23:13:53,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:53,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655328899] [2019-10-14 23:13:53,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:53,384 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655328899] [2019-10-14 23:13:53,384 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:53,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:53,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761977406] [2019-10-14 23:13:53,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:53,385 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:53,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:53,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:53,386 INFO L87 Difference]: Start difference. First operand 1032 states and 1750 transitions. Second operand 3 states. [2019-10-14 23:13:53,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:53,444 INFO L93 Difference]: Finished difference Result 2460 states and 4200 transitions. [2019-10-14 23:13:53,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:53,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-14 23:13:53,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:53,452 INFO L225 Difference]: With dead ends: 2460 [2019-10-14 23:13:53,453 INFO L226 Difference]: Without dead ends: 1450 [2019-10-14 23:13:53,455 INFO L600 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 [2019-10-14 23:13:53,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-10-14 23:13:53,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1448. [2019-10-14 23:13:53,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1448 states. [2019-10-14 23:13:53,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 2454 transitions. [2019-10-14 23:13:53,496 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 2454 transitions. Word has length 29 [2019-10-14 23:13:53,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:53,497 INFO L462 AbstractCegarLoop]: Abstraction has 1448 states and 2454 transitions. [2019-10-14 23:13:53,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:53,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 2454 transitions. [2019-10-14 23:13:53,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:13:53,499 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:53,499 INFO L380 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, 1, 1, 1, 1, 1] [2019-10-14 23:13:53,499 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:53,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:53,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1973087804, now seen corresponding path program 1 times [2019-10-14 23:13:53,500 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:53,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656055810] [2019-10-14 23:13:53,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:53,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656055810] [2019-10-14 23:13:53,527 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:53,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:53,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393013144] [2019-10-14 23:13:53,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:53,528 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:53,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:53,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:53,529 INFO L87 Difference]: Start difference. First operand 1448 states and 2454 transitions. Second operand 3 states. [2019-10-14 23:13:53,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:53,569 INFO L93 Difference]: Finished difference Result 2172 states and 3672 transitions. [2019-10-14 23:13:53,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:53,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-14 23:13:53,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:53,580 INFO L225 Difference]: With dead ends: 2172 [2019-10-14 23:13:53,580 INFO L226 Difference]: Without dead ends: 1466 [2019-10-14 23:13:53,583 INFO L600 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 [2019-10-14 23:13:53,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2019-10-14 23:13:53,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1464. [2019-10-14 23:13:53,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2019-10-14 23:13:53,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2454 transitions. [2019-10-14 23:13:53,635 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2454 transitions. Word has length 30 [2019-10-14 23:13:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:53,635 INFO L462 AbstractCegarLoop]: Abstraction has 1464 states and 2454 transitions. [2019-10-14 23:13:53,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2454 transitions. [2019-10-14 23:13:53,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:13:53,638 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:53,639 INFO L380 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, 1, 1, 1, 1, 1] [2019-10-14 23:13:53,639 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:53,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:53,639 INFO L82 PathProgramCache]: Analyzing trace with hash 632935750, now seen corresponding path program 1 times [2019-10-14 23:13:53,640 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:53,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199959724] [2019-10-14 23:13:53,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:53,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199959724] [2019-10-14 23:13:53,664 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:53,664 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:53,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220961006] [2019-10-14 23:13:53,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:53,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:53,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:53,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:53,666 INFO L87 Difference]: Start difference. First operand 1464 states and 2454 transitions. Second operand 3 states. [2019-10-14 23:13:53,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:53,719 INFO L93 Difference]: Finished difference Result 2700 states and 4616 transitions. [2019-10-14 23:13:53,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:53,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-14 23:13:53,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:53,736 INFO L225 Difference]: With dead ends: 2700 [2019-10-14 23:13:53,737 INFO L226 Difference]: Without dead ends: 2698 [2019-10-14 23:13:53,739 INFO L600 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 [2019-10-14 23:13:53,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2019-10-14 23:13:53,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2056. [2019-10-14 23:13:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-10-14 23:13:53,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 3366 transitions. [2019-10-14 23:13:53,818 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 3366 transitions. Word has length 30 [2019-10-14 23:13:53,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:53,818 INFO L462 AbstractCegarLoop]: Abstraction has 2056 states and 3366 transitions. [2019-10-14 23:13:53,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:53,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 3366 transitions. [2019-10-14 23:13:53,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:13:53,821 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:53,822 INFO L380 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, 1, 1, 1, 1, 1] [2019-10-14 23:13:53,822 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:53,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:53,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1361208956, now seen corresponding path program 1 times [2019-10-14 23:13:53,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:53,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640914405] [2019-10-14 23:13:53,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:53,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640914405] [2019-10-14 23:13:53,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:53,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:53,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110034034] [2019-10-14 23:13:53,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:53,854 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:53,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:53,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:53,855 INFO L87 Difference]: Start difference. First operand 2056 states and 3366 transitions. Second operand 3 states. [2019-10-14 23:13:53,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:53,925 INFO L93 Difference]: Finished difference Result 4876 states and 8040 transitions. [2019-10-14 23:13:53,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:53,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-14 23:13:53,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:53,941 INFO L225 Difference]: With dead ends: 4876 [2019-10-14 23:13:53,941 INFO L226 Difference]: Without dead ends: 2858 [2019-10-14 23:13:53,946 INFO L600 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 [2019-10-14 23:13:53,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2019-10-14 23:13:54,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2856. [2019-10-14 23:13:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2856 states. [2019-10-14 23:13:54,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 4678 transitions. [2019-10-14 23:13:54,075 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 4678 transitions. Word has length 30 [2019-10-14 23:13:54,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,076 INFO L462 AbstractCegarLoop]: Abstraction has 2856 states and 4678 transitions. [2019-10-14 23:13:54,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 4678 transitions. [2019-10-14 23:13:54,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:13:54,079 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,079 INFO L380 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, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:54,079 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1853614765, now seen corresponding path program 1 times [2019-10-14 23:13:54,080 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985166096] [2019-10-14 23:13:54,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:54,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985166096] [2019-10-14 23:13:54,101 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992496495] [2019-10-14 23:13:54,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,103 INFO L87 Difference]: Start difference. First operand 2856 states and 4678 transitions. Second operand 3 states. [2019-10-14 23:13:54,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,147 INFO L93 Difference]: Finished difference Result 4284 states and 7000 transitions. [2019-10-14 23:13:54,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-14 23:13:54,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,163 INFO L225 Difference]: With dead ends: 4284 [2019-10-14 23:13:54,163 INFO L226 Difference]: Without dead ends: 2890 [2019-10-14 23:13:54,167 INFO L600 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 [2019-10-14 23:13:54,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2019-10-14 23:13:54,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2888. [2019-10-14 23:13:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2888 states. [2019-10-14 23:13:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4678 transitions. [2019-10-14 23:13:54,241 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4678 transitions. Word has length 31 [2019-10-14 23:13:54,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,241 INFO L462 AbstractCegarLoop]: Abstraction has 2888 states and 4678 transitions. [2019-10-14 23:13:54,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4678 transitions. [2019-10-14 23:13:54,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:13:54,245 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,245 INFO L380 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, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:54,245 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,245 INFO L82 PathProgramCache]: Analyzing trace with hash 752408789, now seen corresponding path program 1 times [2019-10-14 23:13:54,246 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632827994] [2019-10-14 23:13:54,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:54,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632827994] [2019-10-14 23:13:54,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319702468] [2019-10-14 23:13:54,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,269 INFO L87 Difference]: Start difference. First operand 2888 states and 4678 transitions. Second operand 3 states. [2019-10-14 23:13:54,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,332 INFO L93 Difference]: Finished difference Result 5260 states and 8712 transitions. [2019-10-14 23:13:54,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-14 23:13:54,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,358 INFO L225 Difference]: With dead ends: 5260 [2019-10-14 23:13:54,359 INFO L226 Difference]: Without dead ends: 5258 [2019-10-14 23:13:54,361 INFO L600 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 [2019-10-14 23:13:54,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2019-10-14 23:13:54,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 4104. [2019-10-14 23:13:54,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2019-10-14 23:13:54,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 6470 transitions. [2019-10-14 23:13:54,477 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 6470 transitions. Word has length 31 [2019-10-14 23:13:54,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,478 INFO L462 AbstractCegarLoop]: Abstraction has 4104 states and 6470 transitions. [2019-10-14 23:13:54,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,478 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 6470 transitions. [2019-10-14 23:13:54,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:13:54,488 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,488 INFO L380 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, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:54,488 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1241735917, now seen corresponding path program 1 times [2019-10-14 23:13:54,489 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362878372] [2019-10-14 23:13:54,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:54,524 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362878372] [2019-10-14 23:13:54,524 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267280528] [2019-10-14 23:13:54,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,526 INFO L87 Difference]: Start difference. First operand 4104 states and 6470 transitions. Second operand 3 states. [2019-10-14 23:13:54,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,648 INFO L93 Difference]: Finished difference Result 9676 states and 15368 transitions. [2019-10-14 23:13:54,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-14 23:13:54,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,689 INFO L225 Difference]: With dead ends: 9676 [2019-10-14 23:13:54,690 INFO L226 Difference]: Without dead ends: 5642 [2019-10-14 23:13:54,698 INFO L600 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 [2019-10-14 23:13:54,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2019-10-14 23:13:54,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5640. [2019-10-14 23:13:54,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5640 states. [2019-10-14 23:13:54,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5640 states to 5640 states and 8902 transitions. [2019-10-14 23:13:54,852 INFO L78 Accepts]: Start accepts. Automaton has 5640 states and 8902 transitions. Word has length 31 [2019-10-14 23:13:54,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,852 INFO L462 AbstractCegarLoop]: Abstraction has 5640 states and 8902 transitions. [2019-10-14 23:13:54,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,852 INFO L276 IsEmpty]: Start isEmpty. Operand 5640 states and 8902 transitions. [2019-10-14 23:13:54,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 23:13:54,858 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,859 INFO L380 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:54,859 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1850049785, now seen corresponding path program 1 times [2019-10-14 23:13:54,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623911632] [2019-10-14 23:13:54,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:54,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623911632] [2019-10-14 23:13:54,885 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186761078] [2019-10-14 23:13:54,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,889 INFO L87 Difference]: Start difference. First operand 5640 states and 8902 transitions. Second operand 3 states. [2019-10-14 23:13:54,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,968 INFO L93 Difference]: Finished difference Result 8460 states and 13320 transitions. [2019-10-14 23:13:54,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-14 23:13:54,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,983 INFO L225 Difference]: With dead ends: 8460 [2019-10-14 23:13:54,983 INFO L226 Difference]: Without dead ends: 5706 [2019-10-14 23:13:54,993 INFO L600 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 [2019-10-14 23:13:55,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5706 states. [2019-10-14 23:13:55,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5706 to 5704. [2019-10-14 23:13:55,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5704 states. [2019-10-14 23:13:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 8902 transitions. [2019-10-14 23:13:55,136 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 8902 transitions. Word has length 32 [2019-10-14 23:13:55,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,137 INFO L462 AbstractCegarLoop]: Abstraction has 5704 states and 8902 transitions. [2019-10-14 23:13:55,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,137 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 8902 transitions. [2019-10-14 23:13:55,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 23:13:55,144 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,144 INFO L380 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:55,145 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,145 INFO L82 PathProgramCache]: Analyzing trace with hash 161106043, now seen corresponding path program 1 times [2019-10-14 23:13:55,145 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194085076] [2019-10-14 23:13:55,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:55,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194085076] [2019-10-14 23:13:55,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,174 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838370546] [2019-10-14 23:13:55,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,176 INFO L87 Difference]: Start difference. First operand 5704 states and 8902 transitions. Second operand 3 states. [2019-10-14 23:13:55,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:55,395 INFO L93 Difference]: Finished difference Result 16716 states and 25928 transitions. [2019-10-14 23:13:55,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:55,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-14 23:13:55,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,429 INFO L225 Difference]: With dead ends: 16716 [2019-10-14 23:13:55,430 INFO L226 Difference]: Without dead ends: 11146 [2019-10-14 23:13:55,447 INFO L600 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 [2019-10-14 23:13:55,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2019-10-14 23:13:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 11144. [2019-10-14 23:13:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2019-10-14 23:13:55,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 17030 transitions. [2019-10-14 23:13:55,822 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 17030 transitions. Word has length 32 [2019-10-14 23:13:55,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,823 INFO L462 AbstractCegarLoop]: Abstraction has 11144 states and 17030 transitions. [2019-10-14 23:13:55,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,823 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 17030 transitions. [2019-10-14 23:13:55,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 23:13:55,840 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,840 INFO L380 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:55,841 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,841 INFO L82 PathProgramCache]: Analyzing trace with hash -2139716547, now seen corresponding path program 1 times [2019-10-14 23:13:55,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36701113] [2019-10-14 23:13:55,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:55,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36701113] [2019-10-14 23:13:55,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933462315] [2019-10-14 23:13:55,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,872 INFO L87 Difference]: Start difference. First operand 11144 states and 17030 transitions. Second operand 3 states. [2019-10-14 23:13:56,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:56,023 INFO L93 Difference]: Finished difference Result 13196 states and 20872 transitions. [2019-10-14 23:13:56,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:56,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-14 23:13:56,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:56,123 INFO L225 Difference]: With dead ends: 13196 [2019-10-14 23:13:56,123 INFO L226 Difference]: Without dead ends: 13194 [2019-10-14 23:13:56,126 INFO L600 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 [2019-10-14 23:13:56,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13194 states. [2019-10-14 23:13:56,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13194 to 11144. [2019-10-14 23:13:56,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2019-10-14 23:13:56,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 16902 transitions. [2019-10-14 23:13:56,405 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 16902 transitions. Word has length 32 [2019-10-14 23:13:56,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:56,406 INFO L462 AbstractCegarLoop]: Abstraction has 11144 states and 16902 transitions. [2019-10-14 23:13:56,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:56,406 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 16902 transitions. [2019-10-14 23:13:56,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 23:13:56,419 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:56,420 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:56,420 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:56,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:56,420 INFO L82 PathProgramCache]: Analyzing trace with hash 699534184, now seen corresponding path program 1 times [2019-10-14 23:13:56,421 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:56,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314087668] [2019-10-14 23:13:56,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:56,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314087668] [2019-10-14 23:13:56,448 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:56,448 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:56,448 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84726679] [2019-10-14 23:13:56,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:56,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:56,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:56,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:56,450 INFO L87 Difference]: Start difference. First operand 11144 states and 16902 transitions. Second operand 3 states. [2019-10-14 23:13:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:56,646 INFO L93 Difference]: Finished difference Result 19852 states and 30856 transitions. [2019-10-14 23:13:56,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:56,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-14 23:13:56,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:56,695 INFO L225 Difference]: With dead ends: 19852 [2019-10-14 23:13:56,695 INFO L226 Difference]: Without dead ends: 19850 [2019-10-14 23:13:56,707 INFO L600 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 [2019-10-14 23:13:56,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19850 states. [2019-10-14 23:13:57,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19850 to 16264. [2019-10-14 23:13:57,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16264 states. [2019-10-14 23:13:57,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16264 states to 16264 states and 23942 transitions. [2019-10-14 23:13:57,159 INFO L78 Accepts]: Start accepts. Automaton has 16264 states and 23942 transitions. Word has length 33 [2019-10-14 23:13:57,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:57,159 INFO L462 AbstractCegarLoop]: Abstraction has 16264 states and 23942 transitions. [2019-10-14 23:13:57,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:57,159 INFO L276 IsEmpty]: Start isEmpty. Operand 16264 states and 23942 transitions. [2019-10-14 23:13:57,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 23:13:57,181 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:57,181 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:57,181 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:57,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:57,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1294610522, now seen corresponding path program 1 times [2019-10-14 23:13:57,182 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:57,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695600731] [2019-10-14 23:13:57,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:57,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:57,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:57,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:57,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695600731] [2019-10-14 23:13:57,208 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:57,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:57,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878620901] [2019-10-14 23:13:57,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:57,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:57,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:57,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:57,209 INFO L87 Difference]: Start difference. First operand 16264 states and 23942 transitions. Second operand 3 states. [2019-10-14 23:13:57,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:57,440 INFO L93 Difference]: Finished difference Result 38028 states and 56456 transitions. [2019-10-14 23:13:57,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:57,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-14 23:13:57,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:57,490 INFO L225 Difference]: With dead ends: 38028 [2019-10-14 23:13:57,490 INFO L226 Difference]: Without dead ends: 21898 [2019-10-14 23:13:57,524 INFO L600 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 [2019-10-14 23:13:57,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21898 states. [2019-10-14 23:13:58,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21898 to 21896. [2019-10-14 23:13:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21896 states. [2019-10-14 23:13:58,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21896 states to 21896 states and 32262 transitions. [2019-10-14 23:13:58,511 INFO L78 Accepts]: Start accepts. Automaton has 21896 states and 32262 transitions. Word has length 33 [2019-10-14 23:13:58,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:58,512 INFO L462 AbstractCegarLoop]: Abstraction has 21896 states and 32262 transitions. [2019-10-14 23:13:58,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:58,512 INFO L276 IsEmpty]: Start isEmpty. Operand 21896 states and 32262 transitions. [2019-10-14 23:13:58,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 23:13:58,536 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:58,536 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:58,536 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:58,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:58,537 INFO L82 PathProgramCache]: Analyzing trace with hash 210937712, now seen corresponding path program 1 times [2019-10-14 23:13:58,537 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:58,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982869698] [2019-10-14 23:13:58,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:58,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:58,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:58,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:58,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982869698] [2019-10-14 23:13:58,558 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:58,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:58,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979077895] [2019-10-14 23:13:58,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:58,558 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:58,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:58,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:58,559 INFO L87 Difference]: Start difference. First operand 21896 states and 32262 transitions. Second operand 3 states. [2019-10-14 23:13:58,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:58,760 INFO L93 Difference]: Finished difference Result 33036 states and 48648 transitions. [2019-10-14 23:13:58,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:58,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-14 23:13:58,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:58,809 INFO L225 Difference]: With dead ends: 33036 [2019-10-14 23:13:58,809 INFO L226 Difference]: Without dead ends: 22282 [2019-10-14 23:13:58,837 INFO L600 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 [2019-10-14 23:13:58,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22282 states. [2019-10-14 23:13:59,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22282 to 22280. [2019-10-14 23:13:59,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22280 states. [2019-10-14 23:13:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22280 states to 22280 states and 32518 transitions. [2019-10-14 23:13:59,390 INFO L78 Accepts]: Start accepts. Automaton has 22280 states and 32518 transitions. Word has length 34 [2019-10-14 23:13:59,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:59,390 INFO L462 AbstractCegarLoop]: Abstraction has 22280 states and 32518 transitions. [2019-10-14 23:13:59,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:59,390 INFO L276 IsEmpty]: Start isEmpty. Operand 22280 states and 32518 transitions. [2019-10-14 23:13:59,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 23:13:59,413 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:59,413 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:59,413 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:59,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:59,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1478006030, now seen corresponding path program 1 times [2019-10-14 23:13:59,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:59,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644532462] [2019-10-14 23:13:59,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:59,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:59,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:59,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644532462] [2019-10-14 23:13:59,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:59,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:59,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974122054] [2019-10-14 23:13:59,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:59,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:59,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:59,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:59,462 INFO L87 Difference]: Start difference. First operand 22280 states and 32518 transitions. Second operand 3 states. [2019-10-14 23:13:59,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:59,980 INFO L93 Difference]: Finished difference Result 38924 states and 58120 transitions. [2019-10-14 23:13:59,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:59,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-14 23:13:59,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:14:00,036 INFO L225 Difference]: With dead ends: 38924 [2019-10-14 23:14:00,036 INFO L226 Difference]: Without dead ends: 38922 [2019-10-14 23:14:00,044 INFO L600 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 [2019-10-14 23:14:00,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38922 states. [2019-10-14 23:14:00,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38922 to 32776. [2019-10-14 23:14:00,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32776 states. [2019-10-14 23:14:00,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32776 states to 32776 states and 46342 transitions. [2019-10-14 23:14:00,691 INFO L78 Accepts]: Start accepts. Automaton has 32776 states and 46342 transitions. Word has length 34 [2019-10-14 23:14:00,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:14:00,692 INFO L462 AbstractCegarLoop]: Abstraction has 32776 states and 46342 transitions. [2019-10-14 23:14:00,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:14:00,692 INFO L276 IsEmpty]: Start isEmpty. Operand 32776 states and 46342 transitions. [2019-10-14 23:14:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 23:14:00,732 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:14:00,732 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:14:00,732 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:14:00,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:14:00,733 INFO L82 PathProgramCache]: Analyzing trace with hash 822816560, now seen corresponding path program 1 times [2019-10-14 23:14:00,733 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:14:00,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397128944] [2019-10-14 23:14:00,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:00,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:00,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:14:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:00,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:14:00,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397128944] [2019-10-14 23:14:00,761 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:14:00,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:14:00,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072430737] [2019-10-14 23:14:00,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:14:00,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:14:00,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:14:00,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:00,764 INFO L87 Difference]: Start difference. First operand 32776 states and 46342 transitions. Second operand 3 states. [2019-10-14 23:14:02,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:14:02,121 INFO L93 Difference]: Finished difference Result 75788 states and 107784 transitions. [2019-10-14 23:14:02,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:14:02,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-14 23:14:02,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:14:02,187 INFO L225 Difference]: With dead ends: 75788 [2019-10-14 23:14:02,187 INFO L226 Difference]: Without dead ends: 43530 [2019-10-14 23:14:02,238 INFO L600 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 [2019-10-14 23:14:02,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43530 states. [2019-10-14 23:14:02,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43530 to 43528. [2019-10-14 23:14:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43528 states. [2019-10-14 23:14:03,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43528 states to 43528 states and 61446 transitions. [2019-10-14 23:14:03,049 INFO L78 Accepts]: Start accepts. Automaton has 43528 states and 61446 transitions. Word has length 34 [2019-10-14 23:14:03,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:14:03,049 INFO L462 AbstractCegarLoop]: Abstraction has 43528 states and 61446 transitions. [2019-10-14 23:14:03,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:14:03,050 INFO L276 IsEmpty]: Start isEmpty. Operand 43528 states and 61446 transitions. [2019-10-14 23:14:03,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-14 23:14:03,108 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:14:03,108 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:14:03,109 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:14:03,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:14:03,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1426668155, now seen corresponding path program 1 times [2019-10-14 23:14:03,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:14:03,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802444831] [2019-10-14 23:14:03,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:03,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:03,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:14:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:14:03,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802444831] [2019-10-14 23:14:03,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:14:03,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:14:03,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853763849] [2019-10-14 23:14:03,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:14:03,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:14:03,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:14:03,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:03,153 INFO L87 Difference]: Start difference. First operand 43528 states and 61446 transitions. Second operand 3 states. [2019-10-14 23:14:03,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:14:03,516 INFO L93 Difference]: Finished difference Result 65292 states and 91912 transitions. [2019-10-14 23:14:03,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:14:03,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-14 23:14:03,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:14:03,578 INFO L225 Difference]: With dead ends: 65292 [2019-10-14 23:14:03,578 INFO L226 Difference]: Without dead ends: 44042 [2019-10-14 23:14:03,618 INFO L600 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 [2019-10-14 23:14:03,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44042 states. [2019-10-14 23:14:04,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44042 to 44040. [2019-10-14 23:14:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44040 states. [2019-10-14 23:14:04,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44040 states to 44040 states and 61446 transitions. [2019-10-14 23:14:04,621 INFO L78 Accepts]: Start accepts. Automaton has 44040 states and 61446 transitions. Word has length 35 [2019-10-14 23:14:04,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:14:04,621 INFO L462 AbstractCegarLoop]: Abstraction has 44040 states and 61446 transitions. [2019-10-14 23:14:04,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:14:04,621 INFO L276 IsEmpty]: Start isEmpty. Operand 44040 states and 61446 transitions. [2019-10-14 23:14:04,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-14 23:14:04,646 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:14:04,646 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:14:04,646 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:14:04,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:14:04,647 INFO L82 PathProgramCache]: Analyzing trace with hash -262275587, now seen corresponding path program 1 times [2019-10-14 23:14:04,647 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:14:04,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108685169] [2019-10-14 23:14:04,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:04,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:04,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:14:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:14:04,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108685169] [2019-10-14 23:14:04,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:14:04,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:14:04,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287154520] [2019-10-14 23:14:04,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:14:04,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:14:04,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:14:04,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:04,672 INFO L87 Difference]: Start difference. First operand 44040 states and 61446 transitions. Second operand 3 states. [2019-10-14 23:14:05,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:14:05,191 INFO L93 Difference]: Finished difference Result 75788 states and 108040 transitions. [2019-10-14 23:14:05,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:14:05,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-14 23:14:05,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:14:05,286 INFO L225 Difference]: With dead ends: 75788 [2019-10-14 23:14:05,286 INFO L226 Difference]: Without dead ends: 75786 [2019-10-14 23:14:05,313 INFO L600 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 [2019-10-14 23:14:05,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75786 states. [2019-10-14 23:14:07,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75786 to 65544. [2019-10-14 23:14:07,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65544 states. [2019-10-14 23:14:07,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65544 states to 65544 states and 88582 transitions. [2019-10-14 23:14:07,089 INFO L78 Accepts]: Start accepts. Automaton has 65544 states and 88582 transitions. Word has length 35 [2019-10-14 23:14:07,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:14:07,089 INFO L462 AbstractCegarLoop]: Abstraction has 65544 states and 88582 transitions. [2019-10-14 23:14:07,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:14:07,089 INFO L276 IsEmpty]: Start isEmpty. Operand 65544 states and 88582 transitions. [2019-10-14 23:14:07,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-14 23:14:07,139 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:14:07,139 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:14:07,139 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:14:07,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:14:07,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2038547003, now seen corresponding path program 1 times [2019-10-14 23:14:07,140 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:14:07,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625344754] [2019-10-14 23:14:07,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:07,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:07,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:14:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:14:07,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625344754] [2019-10-14 23:14:07,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:14:07,161 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:14:07,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137700648] [2019-10-14 23:14:07,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:14:07,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:14:07,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:14:07,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:07,162 INFO L87 Difference]: Start difference. First operand 65544 states and 88582 transitions. Second operand 3 states. [2019-10-14 23:14:08,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:14:08,019 INFO L93 Difference]: Finished difference Result 150540 states and 204296 transitions. [2019-10-14 23:14:08,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:14:08,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-14 23:14:08,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:14:08,096 INFO L225 Difference]: With dead ends: 150540 [2019-10-14 23:14:08,096 INFO L226 Difference]: Without dead ends: 86026 [2019-10-14 23:14:08,159 INFO L600 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 [2019-10-14 23:14:08,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86026 states. [2019-10-14 23:14:10,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86026 to 86024. [2019-10-14 23:14:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86024 states. [2019-10-14 23:14:10,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86024 states to 86024 states and 115718 transitions. [2019-10-14 23:14:10,952 INFO L78 Accepts]: Start accepts. Automaton has 86024 states and 115718 transitions. Word has length 35 [2019-10-14 23:14:10,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:14:10,953 INFO L462 AbstractCegarLoop]: Abstraction has 86024 states and 115718 transitions. [2019-10-14 23:14:10,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:14:10,953 INFO L276 IsEmpty]: Start isEmpty. Operand 86024 states and 115718 transitions. [2019-10-14 23:14:10,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-14 23:14:10,988 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:14:10,988 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:14:10,988 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:14:10,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:14:10,988 INFO L82 PathProgramCache]: Analyzing trace with hash 459606565, now seen corresponding path program 1 times [2019-10-14 23:14:10,988 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:14:10,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649035508] [2019-10-14 23:14:10,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:10,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:10,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:14:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:14:11,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649035508] [2019-10-14 23:14:11,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:14:11,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:14:11,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213378081] [2019-10-14 23:14:11,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:14:11,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:14:11,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:14:11,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:11,012 INFO L87 Difference]: Start difference. First operand 86024 states and 115718 transitions. Second operand 3 states. [2019-10-14 23:14:11,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:14:11,567 INFO L93 Difference]: Finished difference Result 129036 states and 173064 transitions. [2019-10-14 23:14:11,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:14:11,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-14 23:14:11,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:14:11,674 INFO L225 Difference]: With dead ends: 129036 [2019-10-14 23:14:11,674 INFO L226 Difference]: Without dead ends: 87050 [2019-10-14 23:14:11,726 INFO L600 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 [2019-10-14 23:14:11,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87050 states. [2019-10-14 23:14:12,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87050 to 87048. [2019-10-14 23:14:12,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87048 states. [2019-10-14 23:14:13,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87048 states to 87048 states and 115718 transitions. [2019-10-14 23:14:13,035 INFO L78 Accepts]: Start accepts. Automaton has 87048 states and 115718 transitions. Word has length 36 [2019-10-14 23:14:13,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:14:13,035 INFO L462 AbstractCegarLoop]: Abstraction has 87048 states and 115718 transitions. [2019-10-14 23:14:13,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:14:13,035 INFO L276 IsEmpty]: Start isEmpty. Operand 87048 states and 115718 transitions. [2019-10-14 23:14:13,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-14 23:14:13,071 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:14:13,071 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:14:13,072 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:14:13,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:14:13,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1229337177, now seen corresponding path program 1 times [2019-10-14 23:14:13,072 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:14:13,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98798313] [2019-10-14 23:14:13,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:13,073 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:13,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:14:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:13,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:14:13,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98798313] [2019-10-14 23:14:13,099 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:14:13,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:14:13,099 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376141155] [2019-10-14 23:14:13,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:14:13,099 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:14:13,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:14:13,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:13,100 INFO L87 Difference]: Start difference. First operand 87048 states and 115718 transitions. Second operand 3 states. [2019-10-14 23:14:14,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:14:14,293 INFO L93 Difference]: Finished difference Result 147468 states and 199688 transitions. [2019-10-14 23:14:14,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:14:14,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-14 23:14:14,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:14:14,435 INFO L225 Difference]: With dead ends: 147468 [2019-10-14 23:14:14,436 INFO L226 Difference]: Without dead ends: 147466 [2019-10-14 23:14:14,453 INFO L600 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 [2019-10-14 23:14:14,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2019-10-14 23:14:17,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 131080. [2019-10-14 23:14:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131080 states. [2019-10-14 23:14:17,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131080 states to 131080 states and 168966 transitions. [2019-10-14 23:14:17,892 INFO L78 Accepts]: Start accepts. Automaton has 131080 states and 168966 transitions. Word has length 36 [2019-10-14 23:14:17,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:14:17,893 INFO L462 AbstractCegarLoop]: Abstraction has 131080 states and 168966 transitions. [2019-10-14 23:14:17,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:14:17,893 INFO L276 IsEmpty]: Start isEmpty. Operand 131080 states and 168966 transitions. [2019-10-14 23:14:17,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-14 23:14:17,978 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:14:17,978 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:14:17,978 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:14:17,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:14:17,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1071485413, now seen corresponding path program 1 times [2019-10-14 23:14:17,979 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:14:17,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368046867] [2019-10-14 23:14:17,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:17,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:17,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:14:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:18,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:14:18,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368046867] [2019-10-14 23:14:18,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:14:18,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:14:18,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619532903] [2019-10-14 23:14:18,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:14:18,004 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:14:18,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:14:18,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:18,004 INFO L87 Difference]: Start difference. First operand 131080 states and 168966 transitions. Second operand 3 states. [2019-10-14 23:14:19,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:14:19,928 INFO L93 Difference]: Finished difference Result 299020 states and 386056 transitions. [2019-10-14 23:14:19,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:14:19,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-14 23:14:19,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:14:20,150 INFO L225 Difference]: With dead ends: 299020 [2019-10-14 23:14:20,150 INFO L226 Difference]: Without dead ends: 169994 [2019-10-14 23:14:20,222 INFO L600 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 [2019-10-14 23:14:20,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169994 states.