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/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:57:15,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:57:15,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:57:15,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:57:15,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:57:15,472 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:57:15,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:57:15,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:57:15,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:57:15,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:57:15,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:57:15,480 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:57:15,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:57:15,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:57:15,482 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:57:15,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:57:15,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:57:15,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:57:15,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:57:15,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:57:15,490 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:57:15,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:57:15,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:57:15,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:57:15,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:57:15,496 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:57:15,496 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:57:15,497 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:57:15,497 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:57:15,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:57:15,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:57:15,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:57:15,500 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:57:15,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:57:15,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:57:15,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:57:15,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:57:15,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:57:15,503 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:57:15,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:57:15,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:57:15,506 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-09-08 10:57:15,520 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:57:15,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:57:15,522 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:57:15,522 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:57:15,522 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:57:15,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:57:15,522 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:57:15,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:57:15,523 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:57:15,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:57:15,523 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:57:15,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:57:15,524 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:57:15,524 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:57:15,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:57:15,524 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:57:15,524 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:57:15,525 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:57:15,525 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:57:15,525 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:57:15,525 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:57:15,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:57:15,526 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:57:15,526 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:57:15,526 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:57:15,526 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:57:15,526 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:57:15,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:57:15,527 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:57:15,555 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:57:15,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:57:15,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:57:15,575 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:57:15,576 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:57:15,577 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 10:57:15,638 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b4a0caa5/39e4439efdd04babbd15e68f97099c22/FLAG9ef2415ce [2019-09-08 10:57:16,151 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:57:16,151 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 10:57:16,166 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b4a0caa5/39e4439efdd04babbd15e68f97099c22/FLAG9ef2415ce [2019-09-08 10:57:16,472 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b4a0caa5/39e4439efdd04babbd15e68f97099c22 [2019-09-08 10:57:16,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:57:16,484 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:57:16,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:57:16,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:57:16,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:57:16,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:57:16" (1/1) ... [2019-09-08 10:57:16,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5653de79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:57:16, skipping insertion in model container [2019-09-08 10:57:16,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:57:16" (1/1) ... [2019-09-08 10:57:16,499 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:57:16,565 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:57:16,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:57:16,955 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:57:17,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:57:17,102 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:57:17,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:57:17 WrapperNode [2019-09-08 10:57:17,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:57:17,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:57:17,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:57:17,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:57:17,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:57:17" (1/1) ... [2019-09-08 10:57:17,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:57:17" (1/1) ... [2019-09-08 10:57:17,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:57:17" (1/1) ... [2019-09-08 10:57:17,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:57:17" (1/1) ... [2019-09-08 10:57:17,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:57:17" (1/1) ... [2019-09-08 10:57:17,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:57:17" (1/1) ... [2019-09-08 10:57:17,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:57:17" (1/1) ... [2019-09-08 10:57:17,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:57:17,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:57:17,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:57:17,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:57:17,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:57:17" (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-09-08 10:57:17,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:57:17,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:57:17,253 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:57:17,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:57:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:57:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:57:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 10:57:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:57:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:57:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:57:17,255 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:57:17,255 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:57:17,255 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:57:17,255 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:57:17,255 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:57:17,255 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:57:17,256 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:57:17,256 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:57:17,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:57:17,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:57:18,159 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:57:18,159 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:57:18,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:57:18 BoogieIcfgContainer [2019-09-08 10:57:18,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:57:18,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:57:18,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:57:18,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:57:18,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:57:16" (1/3) ... [2019-09-08 10:57:18,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9cc10c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:57:18, skipping insertion in model container [2019-09-08 10:57:18,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:57:17" (2/3) ... [2019-09-08 10:57:18,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9cc10c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:57:18, skipping insertion in model container [2019-09-08 10:57:18,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:57:18" (3/3) ... [2019-09-08 10:57:18,169 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 10:57:18,177 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:57:18,184 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:57:18,201 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:57:18,243 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:57:18,244 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:57:18,244 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:57:18,244 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:57:18,244 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:57:18,245 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:57:18,245 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:57:18,245 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:57:18,245 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:57:18,266 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states. [2019-09-08 10:57:18,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:57:18,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:57:18,278 INFO L399 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, 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-09-08 10:57:18,280 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:57:18,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:57:18,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1726351890, now seen corresponding path program 1 times [2019-09-08 10:57:18,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:57:18,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:57:18,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:18,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:18,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:18,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:57:18,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:57:18,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:57:18,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:57:18,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:57:18,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:57:18,873 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 7 states. [2019-09-08 10:57:19,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:57:19,481 INFO L93 Difference]: Finished difference Result 1129 states and 1812 transitions. [2019-09-08 10:57:19,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:57:19,483 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-09-08 10:57:19,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:57:19,522 INFO L225 Difference]: With dead ends: 1129 [2019-09-08 10:57:19,522 INFO L226 Difference]: Without dead ends: 1024 [2019-09-08 10:57:19,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:57:19,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2019-09-08 10:57:19,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 514. [2019-09-08 10:57:19,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-09-08 10:57:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 794 transitions. [2019-09-08 10:57:19,661 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 794 transitions. Word has length 68 [2019-09-08 10:57:19,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:57:19,662 INFO L475 AbstractCegarLoop]: Abstraction has 514 states and 794 transitions. [2019-09-08 10:57:19,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:57:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 794 transitions. [2019-09-08 10:57:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:57:19,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:57:19,667 INFO L399 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, 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-09-08 10:57:19,667 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:57:19,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:57:19,669 INFO L82 PathProgramCache]: Analyzing trace with hash 2038700647, now seen corresponding path program 1 times [2019-09-08 10:57:19,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:57:19,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:57:19,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:19,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:19,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:57:19,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:57:19,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:57:19,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:57:19,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:57:19,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:57:19,944 INFO L87 Difference]: Start difference. First operand 514 states and 794 transitions. Second operand 6 states. [2019-09-08 10:57:20,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:57:20,236 INFO L93 Difference]: Finished difference Result 1839 states and 2878 transitions. [2019-09-08 10:57:20,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:57:20,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-08 10:57:20,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:57:20,247 INFO L225 Difference]: With dead ends: 1839 [2019-09-08 10:57:20,247 INFO L226 Difference]: Without dead ends: 1391 [2019-09-08 10:57:20,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:57:20,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2019-09-08 10:57:20,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1385. [2019-09-08 10:57:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2019-09-08 10:57:20,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2148 transitions. [2019-09-08 10:57:20,352 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2148 transitions. Word has length 69 [2019-09-08 10:57:20,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:57:20,352 INFO L475 AbstractCegarLoop]: Abstraction has 1385 states and 2148 transitions. [2019-09-08 10:57:20,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:57:20,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2148 transitions. [2019-09-08 10:57:20,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:57:20,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:57:20,362 INFO L399 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, 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-09-08 10:57:20,363 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:57:20,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:57:20,363 INFO L82 PathProgramCache]: Analyzing trace with hash 618782839, now seen corresponding path program 1 times [2019-09-08 10:57:20,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:57:20,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:57:20,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:20,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:20,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:20,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:57:20,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:57:20,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:57:20,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:57:20,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:57:20,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:57:20,497 INFO L87 Difference]: Start difference. First operand 1385 states and 2148 transitions. Second operand 5 states. [2019-09-08 10:57:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:57:20,984 INFO L93 Difference]: Finished difference Result 3703 states and 5788 transitions. [2019-09-08 10:57:20,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:57:20,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-08 10:57:20,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:57:20,998 INFO L225 Difference]: With dead ends: 3703 [2019-09-08 10:57:20,998 INFO L226 Difference]: Without dead ends: 2356 [2019-09-08 10:57:21,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:57:21,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2019-09-08 10:57:21,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 2354. [2019-09-08 10:57:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2354 states. [2019-09-08 10:57:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2354 states and 3649 transitions. [2019-09-08 10:57:21,152 INFO L78 Accepts]: Start accepts. Automaton has 2354 states and 3649 transitions. Word has length 70 [2019-09-08 10:57:21,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:57:21,153 INFO L475 AbstractCegarLoop]: Abstraction has 2354 states and 3649 transitions. [2019-09-08 10:57:21,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:57:21,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 3649 transitions. [2019-09-08 10:57:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:57:21,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:57:21,155 INFO L399 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, 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-09-08 10:57:21,156 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:57:21,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:57:21,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1384706248, now seen corresponding path program 1 times [2019-09-08 10:57:21,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:57:21,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:57:21,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:21,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:21,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:21,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:57:21,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:57:21,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:57:21,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:57:21,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:57:21,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:57:21,294 INFO L87 Difference]: Start difference. First operand 2354 states and 3649 transitions. Second operand 6 states. [2019-09-08 10:57:21,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:57:21,951 INFO L93 Difference]: Finished difference Result 8693 states and 13532 transitions. [2019-09-08 10:57:21,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:57:21,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:57:21,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:57:21,991 INFO L225 Difference]: With dead ends: 8693 [2019-09-08 10:57:21,991 INFO L226 Difference]: Without dead ends: 6393 [2019-09-08 10:57:21,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:57:22,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6393 states. [2019-09-08 10:57:22,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6393 to 6389. [2019-09-08 10:57:22,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6389 states. [2019-09-08 10:57:22,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6389 states to 6389 states and 9893 transitions. [2019-09-08 10:57:22,550 INFO L78 Accepts]: Start accepts. Automaton has 6389 states and 9893 transitions. Word has length 70 [2019-09-08 10:57:22,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:57:22,551 INFO L475 AbstractCegarLoop]: Abstraction has 6389 states and 9893 transitions. [2019-09-08 10:57:22,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:57:22,551 INFO L276 IsEmpty]: Start isEmpty. Operand 6389 states and 9893 transitions. [2019-09-08 10:57:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:57:22,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:57:22,555 INFO L399 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, 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-09-08 10:57:22,555 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:57:22,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:57:22,556 INFO L82 PathProgramCache]: Analyzing trace with hash -554775271, now seen corresponding path program 1 times [2019-09-08 10:57:22,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:57:22,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:57:22,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:22,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:22,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:22,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:57:22,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:57:22,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:57:22,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:57:22,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:57:22,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:57:22,656 INFO L87 Difference]: Start difference. First operand 6389 states and 9893 transitions. Second operand 6 states. [2019-09-08 10:57:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:57:23,782 INFO L93 Difference]: Finished difference Result 24140 states and 37404 transitions. [2019-09-08 10:57:23,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:57:23,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:57:23,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:57:23,889 INFO L225 Difference]: With dead ends: 24140 [2019-09-08 10:57:23,890 INFO L226 Difference]: Without dead ends: 17828 [2019-09-08 10:57:23,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:57:23,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17828 states. [2019-09-08 10:57:25,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17828 to 17824. [2019-09-08 10:57:25,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17824 states. [2019-09-08 10:57:25,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17824 states to 17824 states and 27478 transitions. [2019-09-08 10:57:25,069 INFO L78 Accepts]: Start accepts. Automaton has 17824 states and 27478 transitions. Word has length 70 [2019-09-08 10:57:25,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:57:25,069 INFO L475 AbstractCegarLoop]: Abstraction has 17824 states and 27478 transitions. [2019-09-08 10:57:25,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:57:25,069 INFO L276 IsEmpty]: Start isEmpty. Operand 17824 states and 27478 transitions. [2019-09-08 10:57:25,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:57:25,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:57:25,073 INFO L399 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, 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-09-08 10:57:25,073 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:57:25,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:57:25,074 INFO L82 PathProgramCache]: Analyzing trace with hash -744278678, now seen corresponding path program 1 times [2019-09-08 10:57:25,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:57:25,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:57:25,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:25,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:25,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:25,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:57:25,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:57:25,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:57:25,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:57:25,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:57:25,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:57:25,194 INFO L87 Difference]: Start difference. First operand 17824 states and 27478 transitions. Second operand 6 states. [2019-09-08 10:57:27,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:57:27,682 INFO L93 Difference]: Finished difference Result 68516 states and 105662 transitions. [2019-09-08 10:57:27,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:57:27,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:57:27,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:57:27,826 INFO L225 Difference]: With dead ends: 68516 [2019-09-08 10:57:27,826 INFO L226 Difference]: Without dead ends: 50796 [2019-09-08 10:57:27,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:57:27,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50796 states. [2019-09-08 10:57:30,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50796 to 44498. [2019-09-08 10:57:30,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44498 states. [2019-09-08 10:57:30,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44498 states to 44498 states and 68344 transitions. [2019-09-08 10:57:30,844 INFO L78 Accepts]: Start accepts. Automaton has 44498 states and 68344 transitions. Word has length 70 [2019-09-08 10:57:30,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:57:30,845 INFO L475 AbstractCegarLoop]: Abstraction has 44498 states and 68344 transitions. [2019-09-08 10:57:30,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:57:30,845 INFO L276 IsEmpty]: Start isEmpty. Operand 44498 states and 68344 transitions. [2019-09-08 10:57:30,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:57:30,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:57:30,849 INFO L399 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, 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-09-08 10:57:30,850 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:57:30,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:57:30,850 INFO L82 PathProgramCache]: Analyzing trace with hash 106374034, now seen corresponding path program 1 times [2019-09-08 10:57:30,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:57:30,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:57:30,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:30,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:30,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:57:30,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:57:30,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:57:30,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:57:30,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:57:30,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:57:30,943 INFO L87 Difference]: Start difference. First operand 44498 states and 68344 transitions. Second operand 5 states. [2019-09-08 10:57:33,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:57:33,210 INFO L93 Difference]: Finished difference Result 73543 states and 112337 transitions. [2019-09-08 10:57:33,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:57:33,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 10:57:33,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:57:33,365 INFO L225 Difference]: With dead ends: 73543 [2019-09-08 10:57:33,365 INFO L226 Difference]: Without dead ends: 73541 [2019-09-08 10:57:33,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:57:33,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73541 states. [2019-09-08 10:57:36,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73541 to 45182. [2019-09-08 10:57:36,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45182 states. [2019-09-08 10:57:36,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45182 states to 45182 states and 68821 transitions. [2019-09-08 10:57:36,428 INFO L78 Accepts]: Start accepts. Automaton has 45182 states and 68821 transitions. Word has length 71 [2019-09-08 10:57:36,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:57:36,428 INFO L475 AbstractCegarLoop]: Abstraction has 45182 states and 68821 transitions. [2019-09-08 10:57:36,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:57:36,428 INFO L276 IsEmpty]: Start isEmpty. Operand 45182 states and 68821 transitions. [2019-09-08 10:57:36,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:57:36,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:57:36,433 INFO L399 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, 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-09-08 10:57:36,433 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:57:36,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:57:36,434 INFO L82 PathProgramCache]: Analyzing trace with hash -718918452, now seen corresponding path program 1 times [2019-09-08 10:57:36,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:57:36,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:57:36,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:36,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:36,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:36,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:57:36,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:57:36,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:57:36,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:57:36,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:57:36,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:57:36,664 INFO L87 Difference]: Start difference. First operand 45182 states and 68821 transitions. Second operand 10 states. [2019-09-08 10:57:52,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:57:52,014 INFO L93 Difference]: Finished difference Result 338232 states and 509392 transitions. [2019-09-08 10:57:52,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 10:57:52,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-08 10:57:52,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:57:52,685 INFO L225 Difference]: With dead ends: 338232 [2019-09-08 10:57:52,686 INFO L226 Difference]: Without dead ends: 293718 [2019-09-08 10:57:52,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 10:57:53,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293718 states. [2019-09-08 10:57:59,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293718 to 45237. [2019-09-08 10:57:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45237 states. [2019-09-08 10:57:59,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45237 states to 45237 states and 68880 transitions. [2019-09-08 10:57:59,231 INFO L78 Accepts]: Start accepts. Automaton has 45237 states and 68880 transitions. Word has length 72 [2019-09-08 10:57:59,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:57:59,231 INFO L475 AbstractCegarLoop]: Abstraction has 45237 states and 68880 transitions. [2019-09-08 10:57:59,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:57:59,231 INFO L276 IsEmpty]: Start isEmpty. Operand 45237 states and 68880 transitions. [2019-09-08 10:57:59,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:57:59,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:57:59,244 INFO L399 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, 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-09-08 10:57:59,245 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:57:59,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:57:59,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1903245012, now seen corresponding path program 1 times [2019-09-08 10:57:59,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:57:59,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:57:59,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:59,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:59,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:59,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:57:59,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:57:59,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:57:59,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:57:59,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:57:59,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:57:59,454 INFO L87 Difference]: Start difference. First operand 45237 states and 68880 transitions. Second operand 10 states. [2019-09-08 10:58:24,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:58:24,852 INFO L93 Difference]: Finished difference Result 394633 states and 601305 transitions. [2019-09-08 10:58:24,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 10:58:24,853 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-08 10:58:24,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:58:25,507 INFO L225 Difference]: With dead ends: 394633 [2019-09-08 10:58:25,507 INFO L226 Difference]: Without dead ends: 359865 [2019-09-08 10:58:25,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=380, Invalid=1180, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 10:58:25,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359865 states. [2019-09-08 10:58:31,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359865 to 45448. [2019-09-08 10:58:31,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45448 states. [2019-09-08 10:58:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45448 states to 45448 states and 69142 transitions. [2019-09-08 10:58:31,093 INFO L78 Accepts]: Start accepts. Automaton has 45448 states and 69142 transitions. Word has length 72 [2019-09-08 10:58:31,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:58:31,094 INFO L475 AbstractCegarLoop]: Abstraction has 45448 states and 69142 transitions. [2019-09-08 10:58:31,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:58:31,094 INFO L276 IsEmpty]: Start isEmpty. Operand 45448 states and 69142 transitions. [2019-09-08 10:58:31,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:58:31,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:58:31,099 INFO L399 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, 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-09-08 10:58:31,099 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:58:31,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:58:31,100 INFO L82 PathProgramCache]: Analyzing trace with hash 946021772, now seen corresponding path program 1 times [2019-09-08 10:58:31,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:58:31,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:58:31,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:31,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:58:31,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:58:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:58:31,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:58:31,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:58:31,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:58:31,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:58:31,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:58:31,305 INFO L87 Difference]: Start difference. First operand 45448 states and 69142 transitions. Second operand 10 states. [2019-09-08 10:59:00,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:00,383 INFO L93 Difference]: Finished difference Result 326229 states and 496255 transitions. [2019-09-08 10:59:00,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 10:59:00,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-08 10:59:00,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:01,233 INFO L225 Difference]: With dead ends: 326229 [2019-09-08 10:59:01,233 INFO L226 Difference]: Without dead ends: 304543 [2019-09-08 10:59:01,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=380, Invalid=1180, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 10:59:01,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304543 states. [2019-09-08 10:59:06,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304543 to 45841. [2019-09-08 10:59:06,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45841 states. [2019-09-08 10:59:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45841 states to 45841 states and 69639 transitions. [2019-09-08 10:59:06,789 INFO L78 Accepts]: Start accepts. Automaton has 45841 states and 69639 transitions. Word has length 72 [2019-09-08 10:59:06,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:06,790 INFO L475 AbstractCegarLoop]: Abstraction has 45841 states and 69639 transitions. [2019-09-08 10:59:06,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:59:06,790 INFO L276 IsEmpty]: Start isEmpty. Operand 45841 states and 69639 transitions. [2019-09-08 10:59:06,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:59:06,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:06,794 INFO L399 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, 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-09-08 10:59:06,795 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:06,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:06,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1011565036, now seen corresponding path program 1 times [2019-09-08 10:59:06,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:06,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:06,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:06,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:06,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:07,383 WARN L188 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2019-09-08 10:59:07,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:59:07,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:07,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:59:07,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:59:07,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:59:07,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:59:07,498 INFO L87 Difference]: Start difference. First operand 45841 states and 69639 transitions. Second operand 10 states. [2019-09-08 10:59:37,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:37,185 INFO L93 Difference]: Finished difference Result 284503 states and 431980 transitions. [2019-09-08 10:59:37,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 10:59:37,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-08 10:59:37,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:37,556 INFO L225 Difference]: With dead ends: 284503 [2019-09-08 10:59:37,556 INFO L226 Difference]: Without dead ends: 271768 [2019-09-08 10:59:37,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=277, Invalid=845, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 10:59:37,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271768 states. [2019-09-08 10:59:43,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271768 to 45841. [2019-09-08 10:59:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45841 states. [2019-09-08 10:59:43,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45841 states to 45841 states and 69631 transitions. [2019-09-08 10:59:43,971 INFO L78 Accepts]: Start accepts. Automaton has 45841 states and 69631 transitions. Word has length 72 [2019-09-08 10:59:43,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:43,972 INFO L475 AbstractCegarLoop]: Abstraction has 45841 states and 69631 transitions. [2019-09-08 10:59:43,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:59:43,972 INFO L276 IsEmpty]: Start isEmpty. Operand 45841 states and 69631 transitions. [2019-09-08 10:59:43,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:59:43,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:43,978 INFO L399 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, 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, 1] [2019-09-08 10:59:43,978 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:43,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:43,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1901872630, now seen corresponding path program 1 times [2019-09-08 10:59:43,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:43,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:43,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:43,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:43,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:59:44,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:44,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:59:44,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:59:44,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:59:44,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:59:44,035 INFO L87 Difference]: Start difference. First operand 45841 states and 69631 transitions. Second operand 3 states. [2019-09-08 10:59:53,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:53,316 INFO L93 Difference]: Finished difference Result 106843 states and 162622 transitions. [2019-09-08 10:59:53,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:59:53,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 10:59:53,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:53,403 INFO L225 Difference]: With dead ends: 106843 [2019-09-08 10:59:53,404 INFO L226 Difference]: Without dead ends: 67434 [2019-09-08 10:59:53,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-08 10:59:53,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67434 states. [2019-09-08 11:00:00,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67434 to 66664. [2019-09-08 11:00:00,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66664 states. [2019-09-08 11:00:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66664 states to 66664 states and 100333 transitions. [2019-09-08 11:00:00,683 INFO L78 Accepts]: Start accepts. Automaton has 66664 states and 100333 transitions. Word has length 73 [2019-09-08 11:00:00,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:00:00,684 INFO L475 AbstractCegarLoop]: Abstraction has 66664 states and 100333 transitions. [2019-09-08 11:00:00,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:00:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 66664 states and 100333 transitions. [2019-09-08 11:00:00,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:00:00,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:00:00,689 INFO L399 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, 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, 1] [2019-09-08 11:00:00,689 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:00:00,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:00:00,689 INFO L82 PathProgramCache]: Analyzing trace with hash -244859483, now seen corresponding path program 1 times [2019-09-08 11:00:00,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:00:00,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:00:00,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:00,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:00:00,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:00:00,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:00:00,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:00:00,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:00:00,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:00:00,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:00:00,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:00:00,793 INFO L87 Difference]: Start difference. First operand 66664 states and 100333 transitions. Second operand 4 states. [2019-09-08 11:00:13,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:13,482 INFO L93 Difference]: Finished difference Result 172124 states and 258456 transitions. [2019-09-08 11:00:13,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:00:13,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-08 11:00:13,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:13,623 INFO L225 Difference]: With dead ends: 172124 [2019-09-08 11:00:13,623 INFO L226 Difference]: Without dead ends: 107086 [2019-09-08 11:00:13,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:00:13,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107086 states. [2019-09-08 11:00:28,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107086 to 106304. [2019-09-08 11:00:28,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106304 states. [2019-09-08 11:00:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106304 states to 106304 states and 158154 transitions. [2019-09-08 11:00:28,288 INFO L78 Accepts]: Start accepts. Automaton has 106304 states and 158154 transitions. Word has length 73 [2019-09-08 11:00:28,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:00:28,288 INFO L475 AbstractCegarLoop]: Abstraction has 106304 states and 158154 transitions. [2019-09-08 11:00:28,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:00:28,289 INFO L276 IsEmpty]: Start isEmpty. Operand 106304 states and 158154 transitions. [2019-09-08 11:00:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:00:28,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:00:28,293 INFO L399 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, 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, 1] [2019-09-08 11:00:28,294 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:00:28,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:00:28,294 INFO L82 PathProgramCache]: Analyzing trace with hash 909512172, now seen corresponding path program 1 times [2019-09-08 11:00:28,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:00:28,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:00:28,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:28,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:00:28,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:00:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:00:28,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:00:28,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:00:28,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:00:28,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:00:28,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:00:28,342 INFO L87 Difference]: Start difference. First operand 106304 states and 158154 transitions. Second operand 3 states. [2019-09-08 11:00:47,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:47,145 INFO L93 Difference]: Finished difference Result 198779 states and 294809 transitions. [2019-09-08 11:00:47,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:00:47,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 11:00:47,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:47,312 INFO L225 Difference]: With dead ends: 198779 [2019-09-08 11:00:47,312 INFO L226 Difference]: Without dead ends: 130605 [2019-09-08 11:00:47,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-08 11:00:47,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130605 states. [2019-09-08 11:01:02,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130605 to 128983. [2019-09-08 11:01:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128983 states. [2019-09-08 11:01:02,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128983 states to 128983 states and 188561 transitions. [2019-09-08 11:01:02,665 INFO L78 Accepts]: Start accepts. Automaton has 128983 states and 188561 transitions. Word has length 73 [2019-09-08 11:01:02,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:02,665 INFO L475 AbstractCegarLoop]: Abstraction has 128983 states and 188561 transitions. [2019-09-08 11:01:02,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:01:02,665 INFO L276 IsEmpty]: Start isEmpty. Operand 128983 states and 188561 transitions. [2019-09-08 11:01:02,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:01:02,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:02,669 INFO L399 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, 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, 1] [2019-09-08 11:01:02,669 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:02,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:02,669 INFO L82 PathProgramCache]: Analyzing trace with hash 907139436, now seen corresponding path program 1 times [2019-09-08 11:01:02,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:02,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:02,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:02,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:02,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:03,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:01:03,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:03,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:01:03,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:01:03,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:01:03,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:01:03,064 INFO L87 Difference]: Start difference. First operand 128983 states and 188561 transitions. Second operand 3 states. [2019-09-08 11:01:26,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:01:26,756 INFO L93 Difference]: Finished difference Result 284314 states and 415058 transitions. [2019-09-08 11:01:26,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:01:26,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 11:01:26,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:01:26,982 INFO L225 Difference]: With dead ends: 284314 [2019-09-08 11:01:26,982 INFO L226 Difference]: Without dead ends: 164952 [2019-09-08 11:01:27,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-08 11:01:27,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164952 states. [2019-09-08 11:01:47,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164952 to 164292. [2019-09-08 11:01:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164292 states. [2019-09-08 11:01:47,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164292 states to 164292 states and 235860 transitions. [2019-09-08 11:01:47,961 INFO L78 Accepts]: Start accepts. Automaton has 164292 states and 235860 transitions. Word has length 73 [2019-09-08 11:01:47,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:47,961 INFO L475 AbstractCegarLoop]: Abstraction has 164292 states and 235860 transitions. [2019-09-08 11:01:47,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:01:47,961 INFO L276 IsEmpty]: Start isEmpty. Operand 164292 states and 235860 transitions. [2019-09-08 11:01:47,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 11:01:47,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:47,964 INFO L399 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, 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, 1, 1] [2019-09-08 11:01:47,964 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:47,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:47,965 INFO L82 PathProgramCache]: Analyzing trace with hash -865418125, now seen corresponding path program 1 times [2019-09-08 11:01:47,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:47,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:47,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:47,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:47,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:01:48,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:48,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:01:48,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:01:48,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:01:48,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:01:48,045 INFO L87 Difference]: Start difference. First operand 164292 states and 235860 transitions. Second operand 7 states. [2019-09-08 11:03:18,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:03:18,214 INFO L93 Difference]: Finished difference Result 736806 states and 1049456 transitions. [2019-09-08 11:03:18,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:03:18,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-08 11:03:18,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:03:19,160 INFO L225 Difference]: With dead ends: 736806 [2019-09-08 11:03:19,160 INFO L226 Difference]: Without dead ends: 592992 [2019-09-08 11:03:19,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:03:19,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592992 states. [2019-09-08 11:03:49,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592992 to 164332. [2019-09-08 11:03:49,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164332 states. [2019-09-08 11:03:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164332 states to 164332 states and 235908 transitions. [2019-09-08 11:03:49,881 INFO L78 Accepts]: Start accepts. Automaton has 164332 states and 235908 transitions. Word has length 74 [2019-09-08 11:03:49,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:03:49,881 INFO L475 AbstractCegarLoop]: Abstraction has 164332 states and 235908 transitions. [2019-09-08 11:03:49,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:03:49,881 INFO L276 IsEmpty]: Start isEmpty. Operand 164332 states and 235908 transitions. [2019-09-08 11:03:49,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 11:03:49,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:03:49,884 INFO L399 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, 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, 1, 1] [2019-09-08 11:03:49,884 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:03:49,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:03:49,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1280232077, now seen corresponding path program 1 times [2019-09-08 11:03:49,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:03:49,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:03:49,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:49,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:03:49,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:03:49,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:03:49,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:03:49,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:03:49,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:03:49,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:03:49,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:03:49,974 INFO L87 Difference]: Start difference. First operand 164332 states and 235908 transitions. Second operand 7 states. [2019-09-08 11:05:45,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:05:45,455 INFO L93 Difference]: Finished difference Result 806996 states and 1155779 transitions. [2019-09-08 11:05:45,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:05:45,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-08 11:05:45,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:05:46,751 INFO L225 Difference]: With dead ends: 806996 [2019-09-08 11:05:46,751 INFO L226 Difference]: Without dead ends: 712528 [2019-09-08 11:05:46,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:05:47,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712528 states. [2019-09-08 11:06:23,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712528 to 164436. [2019-09-08 11:06:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164436 states. [2019-09-08 11:06:23,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164436 states to 164436 states and 236033 transitions. [2019-09-08 11:06:23,875 INFO L78 Accepts]: Start accepts. Automaton has 164436 states and 236033 transitions. Word has length 74 [2019-09-08 11:06:23,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:23,875 INFO L475 AbstractCegarLoop]: Abstraction has 164436 states and 236033 transitions. [2019-09-08 11:06:23,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:06:23,875 INFO L276 IsEmpty]: Start isEmpty. Operand 164436 states and 236033 transitions. [2019-09-08 11:06:23,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 11:06:23,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:23,878 INFO L399 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, 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, 1, 1] [2019-09-08 11:06:23,879 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:23,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:23,879 INFO L82 PathProgramCache]: Analyzing trace with hash 109033983, now seen corresponding path program 1 times [2019-09-08 11:06:23,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:23,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:23,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:23,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:23,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:23,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:06:23,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:23,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:06:23,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:06:23,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:06:23,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:06:23,970 INFO L87 Difference]: Start difference. First operand 164436 states and 236033 transitions. Second operand 7 states. [2019-09-08 11:08:09,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:08:09,686 INFO L93 Difference]: Finished difference Result 647293 states and 920408 transitions. [2019-09-08 11:08:09,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:08:09,686 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-08 11:08:09,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:08:10,591 INFO L225 Difference]: With dead ends: 647293 [2019-09-08 11:08:10,591 INFO L226 Difference]: Without dead ends: 588365 [2019-09-08 11:08:10,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:08:11,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588365 states. [2019-09-08 11:08:47,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588365 to 164608. [2019-09-08 11:08:47,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164608 states. [2019-09-08 11:08:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164608 states to 164608 states and 236244 transitions. [2019-09-08 11:08:48,145 INFO L78 Accepts]: Start accepts. Automaton has 164608 states and 236244 transitions. Word has length 74 [2019-09-08 11:08:48,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:08:48,145 INFO L475 AbstractCegarLoop]: Abstraction has 164608 states and 236244 transitions. [2019-09-08 11:08:48,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:08:48,145 INFO L276 IsEmpty]: Start isEmpty. Operand 164608 states and 236244 transitions. [2019-09-08 11:08:48,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:08:48,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:08:48,149 INFO L399 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, 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, 1, 1, 1, 1] [2019-09-08 11:08:48,150 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:08:48,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:08:48,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1884931138, now seen corresponding path program 1 times [2019-09-08 11:08:48,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:08:48,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:08:48,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:48,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:08:48,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:08:48,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:08:48,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:08:48,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:08:48,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:08:48,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:08:48,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:08:48,232 INFO L87 Difference]: Start difference. First operand 164608 states and 236244 transitions. Second operand 6 states. [2019-09-08 11:09:50,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:50,798 INFO L93 Difference]: Finished difference Result 413375 states and 595013 transitions. [2019-09-08 11:09:50,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:09:50,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-08 11:09:50,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:51,290 INFO L225 Difference]: With dead ends: 413375 [2019-09-08 11:09:51,291 INFO L226 Difference]: Without dead ends: 323293 [2019-09-08 11:09:51,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:09:51,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323293 states.