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.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:49:41,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:49:41,473 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:49:41,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:49:41,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:49:41,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:49:41,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:49:41,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:49:41,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:49:41,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:49:41,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:49:41,495 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:49:41,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:49:41,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:49:41,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:49:41,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:49:41,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:49:41,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:49:41,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:49:41,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:49:41,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:49:41,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:49:41,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:49:41,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:49:41,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:49:41,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:49:41,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:49:41,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:49:41,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:49:41,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:49:41,514 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:49:41,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:49:41,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:49:41,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:49:41,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:49:41,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:49:41,518 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:49:41,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:49:41,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:49:41,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:49:41,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:49:41,521 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:49:41,535 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:49:41,535 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:49:41,537 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:49:41,537 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:49:41,537 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:49:41,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:49:41,537 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:49:41,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:49:41,538 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:49:41,538 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:49:41,538 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:49:41,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:49:41,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:49:41,539 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:49:41,539 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:49:41,539 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:49:41,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:49:41,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:49:41,540 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:49:41,540 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:49:41,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:49:41,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:49:41,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:49:41,541 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:49:41,541 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:49:41,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:49:41,541 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:49:41,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:49:41,542 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:49:41,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:49:41,583 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:49:41,586 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:49:41,587 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:49:41,588 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:49:41,589 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.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 10:49:41,649 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecb6fe82a/6c889c6afb1a419986b2835bf20818c1/FLAG84595a7aa [2019-09-08 10:49:42,140 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:49:42,141 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 10:49:42,170 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecb6fe82a/6c889c6afb1a419986b2835bf20818c1/FLAG84595a7aa [2019-09-08 10:49:42,429 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecb6fe82a/6c889c6afb1a419986b2835bf20818c1 [2019-09-08 10:49:42,442 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:49:42,444 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:49:42,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:49:42,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:49:42,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:49:42,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:49:42" (1/1) ... [2019-09-08 10:49:42,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fb79357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:49:42, skipping insertion in model container [2019-09-08 10:49:42,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:49:42" (1/1) ... [2019-09-08 10:49:42,461 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:49:42,520 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:49:42,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:49:42,940 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:49:43,056 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:49:43,079 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:49:43,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:49:43 WrapperNode [2019-09-08 10:49:43,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:49:43,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:49:43,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:49:43,080 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:49:43,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:49:43" (1/1) ... [2019-09-08 10:49:43,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:49:43" (1/1) ... [2019-09-08 10:49:43,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:49:43" (1/1) ... [2019-09-08 10:49:43,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:49:43" (1/1) ... [2019-09-08 10:49:43,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:49:43" (1/1) ... [2019-09-08 10:49:43,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:49:43" (1/1) ... [2019-09-08 10:49:43,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:49:43" (1/1) ... [2019-09-08 10:49:43,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:49:43,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:49:43,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:49:43,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:49:43,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:49:43" (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:49:43,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:49:43,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:49:43,202 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:49:43,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:49:43,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:49:43,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:49:43,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 10:49:43,203 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:49:43,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:49:43,203 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:49:43,203 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:49:43,204 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:49:43,204 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:49:43,204 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:49:43,204 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:49:43,204 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:49:43,205 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:49:43,205 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:49:43,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:49:43,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:49:44,124 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:49:44,125 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:49:44,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:49:44 BoogieIcfgContainer [2019-09-08 10:49:44,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:49:44,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:49:44,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:49:44,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:49:44,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:49:42" (1/3) ... [2019-09-08 10:49:44,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c02230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:49:44, skipping insertion in model container [2019-09-08 10:49:44,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:49:43" (2/3) ... [2019-09-08 10:49:44,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c02230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:49:44, skipping insertion in model container [2019-09-08 10:49:44,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:49:44" (3/3) ... [2019-09-08 10:49:44,142 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 10:49:44,152 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:49:44,176 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:49:44,196 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:49:44,230 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:49:44,231 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:49:44,231 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:49:44,231 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:49:44,232 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:49:44,232 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:49:44,232 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:49:44,232 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:49:44,232 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:49:44,256 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states. [2019-09-08 10:49:44,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:49:44,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:44,265 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] [2019-09-08 10:49:44,267 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:44,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:44,272 INFO L82 PathProgramCache]: Analyzing trace with hash 988898761, now seen corresponding path program 1 times [2019-09-08 10:49:44,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:44,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:44,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:44,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:44,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:44,831 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:49:44,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:44,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:49:44,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:49:44,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:49:44,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:49:44,856 INFO L87 Difference]: Start difference. First operand 175 states. Second operand 7 states. [2019-09-08 10:49:45,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:45,463 INFO L93 Difference]: Finished difference Result 1065 states and 1709 transitions. [2019-09-08 10:49:45,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:49:45,466 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-09-08 10:49:45,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:45,504 INFO L225 Difference]: With dead ends: 1065 [2019-09-08 10:49:45,505 INFO L226 Difference]: Without dead ends: 965 [2019-09-08 10:49:45,513 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:49:45,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-09-08 10:49:45,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 485. [2019-09-08 10:49:45,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-09-08 10:49:45,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 748 transitions. [2019-09-08 10:49:45,656 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 748 transitions. Word has length 67 [2019-09-08 10:49:45,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:45,657 INFO L475 AbstractCegarLoop]: Abstraction has 485 states and 748 transitions. [2019-09-08 10:49:45,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:49:45,657 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 748 transitions. [2019-09-08 10:49:45,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:49:45,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:45,660 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:49:45,660 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:45,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:45,661 INFO L82 PathProgramCache]: Analyzing trace with hash 329671807, now seen corresponding path program 1 times [2019-09-08 10:49:45,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:45,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:45,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:45,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:45,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:45,924 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:49:45,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:45,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:49:45,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:49:45,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:49:45,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:49:45,929 INFO L87 Difference]: Start difference. First operand 485 states and 748 transitions. Second operand 6 states. [2019-09-08 10:49:46,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:46,218 INFO L93 Difference]: Finished difference Result 1745 states and 2728 transitions. [2019-09-08 10:49:46,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:49:46,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-09-08 10:49:46,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:46,228 INFO L225 Difference]: With dead ends: 1745 [2019-09-08 10:49:46,229 INFO L226 Difference]: Without dead ends: 1322 [2019-09-08 10:49:46,235 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:49:46,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-09-08 10:49:46,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1316. [2019-09-08 10:49:46,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2019-09-08 10:49:46,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 2038 transitions. [2019-09-08 10:49:46,326 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 2038 transitions. Word has length 68 [2019-09-08 10:49:46,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:46,327 INFO L475 AbstractCegarLoop]: Abstraction has 1316 states and 2038 transitions. [2019-09-08 10:49:46,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:49:46,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 2038 transitions. [2019-09-08 10:49:46,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:49:46,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:46,338 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:49:46,339 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:46,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:46,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1962630653, now seen corresponding path program 1 times [2019-09-08 10:49:46,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:46,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:46,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:46,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:46,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:46,487 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:49:46,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:46,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:49:46,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:49:46,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:49:46,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:49:46,489 INFO L87 Difference]: Start difference. First operand 1316 states and 2038 transitions. Second operand 6 states. [2019-09-08 10:49:47,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:47,061 INFO L93 Difference]: Finished difference Result 4711 states and 7363 transitions. [2019-09-08 10:49:47,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:49:47,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-08 10:49:47,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:47,088 INFO L225 Difference]: With dead ends: 4711 [2019-09-08 10:49:47,089 INFO L226 Difference]: Without dead ends: 3445 [2019-09-08 10:49:47,100 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:49:47,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3445 states. [2019-09-08 10:49:47,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3445 to 3441. [2019-09-08 10:49:47,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3441 states. [2019-09-08 10:49:47,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3441 states to 3441 states and 5353 transitions. [2019-09-08 10:49:47,317 INFO L78 Accepts]: Start accepts. Automaton has 3441 states and 5353 transitions. Word has length 69 [2019-09-08 10:49:47,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:47,318 INFO L475 AbstractCegarLoop]: Abstraction has 3441 states and 5353 transitions. [2019-09-08 10:49:47,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:49:47,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3441 states and 5353 transitions. [2019-09-08 10:49:47,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:49:47,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:47,323 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:49:47,323 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:47,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:47,324 INFO L82 PathProgramCache]: Analyzing trace with hash -209027553, now seen corresponding path program 1 times [2019-09-08 10:49:47,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:47,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:47,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:47,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:47,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:47,497 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:49:47,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:47,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:49:47,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:49:47,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:49:47,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:49:47,500 INFO L87 Difference]: Start difference. First operand 3441 states and 5353 transitions. Second operand 6 states. [2019-09-08 10:49:48,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:48,367 INFO L93 Difference]: Finished difference Result 12660 states and 19784 transitions. [2019-09-08 10:49:48,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:49:48,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-08 10:49:48,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:48,487 INFO L225 Difference]: With dead ends: 12660 [2019-09-08 10:49:48,488 INFO L226 Difference]: Without dead ends: 9319 [2019-09-08 10:49:48,502 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:49:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9319 states. [2019-09-08 10:49:48,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9319 to 8300. [2019-09-08 10:49:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8300 states. [2019-09-08 10:49:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8300 states to 8300 states and 12908 transitions. [2019-09-08 10:49:49,138 INFO L78 Accepts]: Start accepts. Automaton has 8300 states and 12908 transitions. Word has length 69 [2019-09-08 10:49:49,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:49,139 INFO L475 AbstractCegarLoop]: Abstraction has 8300 states and 12908 transitions. [2019-09-08 10:49:49,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:49:49,141 INFO L276 IsEmpty]: Start isEmpty. Operand 8300 states and 12908 transitions. [2019-09-08 10:49:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:49:49,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:49,143 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:49:49,143 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:49,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:49,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1468610574, now seen corresponding path program 1 times [2019-09-08 10:49:49,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:49,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:49,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:49,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:49,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:49,288 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:49:49,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:49,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:49:49,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:49:49,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:49:49,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:49:49,291 INFO L87 Difference]: Start difference. First operand 8300 states and 12908 transitions. Second operand 6 states. [2019-09-08 10:49:50,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:50,778 INFO L93 Difference]: Finished difference Result 31817 states and 49507 transitions. [2019-09-08 10:49:50,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:49:50,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-08 10:49:50,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:50,866 INFO L225 Difference]: With dead ends: 31817 [2019-09-08 10:49:50,866 INFO L226 Difference]: Without dead ends: 23590 [2019-09-08 10:49:50,883 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:49:50,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23590 states. [2019-09-08 10:49:52,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23590 to 23586. [2019-09-08 10:49:52,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23586 states. [2019-09-08 10:49:52,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23586 states to 23586 states and 36514 transitions. [2019-09-08 10:49:52,220 INFO L78 Accepts]: Start accepts. Automaton has 23586 states and 36514 transitions. Word has length 69 [2019-09-08 10:49:52,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:52,221 INFO L475 AbstractCegarLoop]: Abstraction has 23586 states and 36514 transitions. [2019-09-08 10:49:52,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:49:52,221 INFO L276 IsEmpty]: Start isEmpty. Operand 23586 states and 36514 transitions. [2019-09-08 10:49:52,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:49:52,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:52,225 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:49:52,225 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:52,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:52,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1910586809, now seen corresponding path program 1 times [2019-09-08 10:49:52,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:52,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:52,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:52,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:52,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:52,295 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:49:52,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:52,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:49:52,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:49:52,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:49:52,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:49:52,297 INFO L87 Difference]: Start difference. First operand 23586 states and 36514 transitions. Second operand 5 states. [2019-09-08 10:49:54,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:54,446 INFO L93 Difference]: Finished difference Result 64970 states and 100621 transitions. [2019-09-08 10:49:54,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:49:54,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-08 10:49:54,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:54,573 INFO L225 Difference]: With dead ends: 64970 [2019-09-08 10:49:54,573 INFO L226 Difference]: Without dead ends: 41436 [2019-09-08 10:49:54,632 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:49:54,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41436 states. [2019-09-08 10:49:56,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41436 to 41434. [2019-09-08 10:49:56,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41434 states. [2019-09-08 10:49:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41434 states to 41434 states and 63749 transitions. [2019-09-08 10:49:56,426 INFO L78 Accepts]: Start accepts. Automaton has 41434 states and 63749 transitions. Word has length 70 [2019-09-08 10:49:56,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:56,426 INFO L475 AbstractCegarLoop]: Abstraction has 41434 states and 63749 transitions. [2019-09-08 10:49:56,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:49:56,426 INFO L276 IsEmpty]: Start isEmpty. Operand 41434 states and 63749 transitions. [2019-09-08 10:49:56,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:49:56,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:56,431 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:49:56,431 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:56,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:56,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1298147562, now seen corresponding path program 1 times [2019-09-08 10:49:56,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:56,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:56,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:56,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:56,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:56,517 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:49:56,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:56,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:49:56,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:49:56,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:49:56,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:49:56,519 INFO L87 Difference]: Start difference. First operand 41434 states and 63749 transitions. Second operand 5 states. [2019-09-08 10:49:59,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:59,253 INFO L93 Difference]: Finished difference Result 69039 states and 105582 transitions. [2019-09-08 10:49:59,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:49:59,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-08 10:49:59,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:59,507 INFO L225 Difference]: With dead ends: 69039 [2019-09-08 10:49:59,508 INFO L226 Difference]: Without dead ends: 69037 [2019-09-08 10:49:59,536 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:49:59,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69037 states. [2019-09-08 10:50:01,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69037 to 42118. [2019-09-08 10:50:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42118 states. [2019-09-08 10:50:01,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42118 states to 42118 states and 64226 transitions. [2019-09-08 10:50:01,836 INFO L78 Accepts]: Start accepts. Automaton has 42118 states and 64226 transitions. Word has length 70 [2019-09-08 10:50:01,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:50:01,837 INFO L475 AbstractCegarLoop]: Abstraction has 42118 states and 64226 transitions. [2019-09-08 10:50:01,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:50:01,837 INFO L276 IsEmpty]: Start isEmpty. Operand 42118 states and 64226 transitions. [2019-09-08 10:50:01,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:50:01,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:01,842 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:50:01,843 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:01,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:01,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1848209620, now seen corresponding path program 1 times [2019-09-08 10:50:01,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:01,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:01,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:01,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:01,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:02,086 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:50:02,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:02,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:50:02,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:50:02,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:50:02,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:50:02,088 INFO L87 Difference]: Start difference. First operand 42118 states and 64226 transitions. Second operand 10 states. [2019-09-08 10:50:19,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:50:19,259 INFO L93 Difference]: Finished difference Result 365723 states and 557981 transitions. [2019-09-08 10:50:19,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 10:50:19,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2019-09-08 10:50:19,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:50:20,180 INFO L225 Difference]: With dead ends: 365723 [2019-09-08 10:50:20,181 INFO L226 Difference]: Without dead ends: 333655 [2019-09-08 10:50:20,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=380, Invalid=1180, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 10:50:20,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333655 states. [2019-09-08 10:50:24,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333655 to 42278. [2019-09-08 10:50:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42278 states. [2019-09-08 10:50:24,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42278 states to 42278 states and 64428 transitions. [2019-09-08 10:50:24,828 INFO L78 Accepts]: Start accepts. Automaton has 42278 states and 64428 transitions. Word has length 71 [2019-09-08 10:50:24,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:50:24,828 INFO L475 AbstractCegarLoop]: Abstraction has 42278 states and 64428 transitions. [2019-09-08 10:50:24,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:50:24,829 INFO L276 IsEmpty]: Start isEmpty. Operand 42278 states and 64428 transitions. [2019-09-08 10:50:24,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:50:24,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:24,834 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:50:24,835 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:24,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:24,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1085831572, now seen corresponding path program 1 times [2019-09-08 10:50:24,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:24,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:24,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:24,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:24,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:25,051 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:50:25,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:25,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:50:25,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:50:25,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:50:25,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:50:25,053 INFO L87 Difference]: Start difference. First operand 42278 states and 64428 transitions. Second operand 10 states. [2019-09-08 10:50:43,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:50:43,049 INFO L93 Difference]: Finished difference Result 264321 states and 401899 transitions. [2019-09-08 10:50:43,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 10:50:43,050 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2019-09-08 10:50:43,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:50:43,464 INFO L225 Difference]: With dead ends: 264321 [2019-09-08 10:50:43,464 INFO L226 Difference]: Without dead ends: 252588 [2019-09-08 10:50:43,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=845, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 10:50:43,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252588 states. [2019-09-08 10:50:50,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252588 to 42278. [2019-09-08 10:50:50,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42278 states. [2019-09-08 10:50:50,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42278 states to 42278 states and 64426 transitions. [2019-09-08 10:50:50,568 INFO L78 Accepts]: Start accepts. Automaton has 42278 states and 64426 transitions. Word has length 71 [2019-09-08 10:50:50,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:50:50,568 INFO L475 AbstractCegarLoop]: Abstraction has 42278 states and 64426 transitions. [2019-09-08 10:50:50,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:50:50,568 INFO L276 IsEmpty]: Start isEmpty. Operand 42278 states and 64426 transitions. [2019-09-08 10:50:50,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:50:50,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:50,573 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:50:50,574 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:50,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:50,574 INFO L82 PathProgramCache]: Analyzing trace with hash -218819276, now seen corresponding path program 1 times [2019-09-08 10:50:50,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:50,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:50,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:50,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:50,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:50,773 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:50:50,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:50,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:50:50,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:50:50,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:50:50,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:50:50,774 INFO L87 Difference]: Start difference. First operand 42278 states and 64426 transitions. Second operand 10 states. [2019-09-08 10:51:17,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:17,295 INFO L93 Difference]: Finished difference Result 303035 states and 461515 transitions. [2019-09-08 10:51:17,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 10:51:17,296 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2019-09-08 10:51:17,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:17,716 INFO L225 Difference]: With dead ends: 303035 [2019-09-08 10:51:17,716 INFO L226 Difference]: Without dead ends: 282969 [2019-09-08 10:51:17,780 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:51:17,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282969 states. [2019-09-08 10:51:22,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282969 to 42627. [2019-09-08 10:51:22,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42627 states. [2019-09-08 10:51:22,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42627 states to 42627 states and 64869 transitions. [2019-09-08 10:51:22,881 INFO L78 Accepts]: Start accepts. Automaton has 42627 states and 64869 transitions. Word has length 71 [2019-09-08 10:51:22,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:22,882 INFO L475 AbstractCegarLoop]: Abstraction has 42627 states and 64869 transitions. [2019-09-08 10:51:22,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:51:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 42627 states and 64869 transitions. [2019-09-08 10:51:22,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:51:22,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:22,887 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:51:22,887 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:22,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:22,887 INFO L82 PathProgramCache]: Analyzing trace with hash 114291727, now seen corresponding path program 1 times [2019-09-08 10:51:22,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:22,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:22,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:22,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:22,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:23,113 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:51:23,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:23,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:51:23,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:51:23,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:51:23,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:51:23,115 INFO L87 Difference]: Start difference. First operand 42627 states and 64869 transitions. Second operand 10 states. [2019-09-08 10:51:47,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:47,141 INFO L93 Difference]: Finished difference Result 259857 states and 393841 transitions. [2019-09-08 10:51:47,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 10:51:47,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-08 10:51:47,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:47,800 INFO L225 Difference]: With dead ends: 259857 [2019-09-08 10:51:47,801 INFO L226 Difference]: Without dead ends: 218310 [2019-09-08 10:51:47,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 10:51:47,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218310 states. [2019-09-08 10:51:55,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218310 to 42777. [2019-09-08 10:51:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42777 states. [2019-09-08 10:51:55,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42777 states to 42777 states and 65036 transitions. [2019-09-08 10:51:55,792 INFO L78 Accepts]: Start accepts. Automaton has 42777 states and 65036 transitions. Word has length 72 [2019-09-08 10:51:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:55,792 INFO L475 AbstractCegarLoop]: Abstraction has 42777 states and 65036 transitions. [2019-09-08 10:51:55,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:51:55,792 INFO L276 IsEmpty]: Start isEmpty. Operand 42777 states and 65036 transitions. [2019-09-08 10:51:55,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:51:55,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:55,797 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:51:55,797 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:55,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:55,797 INFO L82 PathProgramCache]: Analyzing trace with hash 621370372, now seen corresponding path program 1 times [2019-09-08 10:51:55,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:55,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:55,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:55,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:55,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:55,843 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:51:55,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:55,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:51:55,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:51:55,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:51:55,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:51:55,844 INFO L87 Difference]: Start difference. First operand 42777 states and 65036 transitions. Second operand 3 states. [2019-09-08 10:52:01,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:01,917 INFO L93 Difference]: Finished difference Result 80685 states and 122842 transitions. [2019-09-08 10:52:01,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:52:01,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-08 10:52:01,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:02,002 INFO L225 Difference]: With dead ends: 80685 [2019-09-08 10:52:02,002 INFO L226 Difference]: Without dead ends: 56125 [2019-09-08 10:52:02,030 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:52:02,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56125 states. [2019-09-08 10:52:08,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56125 to 55343. [2019-09-08 10:52:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55343 states. [2019-09-08 10:52:08,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55343 states to 55343 states and 83176 transitions. [2019-09-08 10:52:08,443 INFO L78 Accepts]: Start accepts. Automaton has 55343 states and 83176 transitions. Word has length 72 [2019-09-08 10:52:08,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:08,444 INFO L475 AbstractCegarLoop]: Abstraction has 55343 states and 83176 transitions. [2019-09-08 10:52:08,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:52:08,444 INFO L276 IsEmpty]: Start isEmpty. Operand 55343 states and 83176 transitions. [2019-09-08 10:52:08,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:52:08,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:08,448 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:52:08,448 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:08,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:08,449 INFO L82 PathProgramCache]: Analyzing trace with hash 584174741, now seen corresponding path program 1 times [2019-09-08 10:52:08,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:08,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:08,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:08,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:08,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:08,552 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:52:08,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:08,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:52:08,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:52:08,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:52:08,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:52:08,554 INFO L87 Difference]: Start difference. First operand 55343 states and 83176 transitions. Second operand 4 states. [2019-09-08 10:52:19,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:19,254 INFO L93 Difference]: Finished difference Result 144216 states and 216294 transitions. [2019-09-08 10:52:19,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:52:19,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-09-08 10:52:19,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:19,375 INFO L225 Difference]: With dead ends: 144216 [2019-09-08 10:52:19,375 INFO L226 Difference]: Without dead ends: 90326 [2019-09-08 10:52:19,418 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 10:52:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90326 states. [2019-09-08 10:52:31,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90326 to 89598. [2019-09-08 10:52:31,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89598 states. [2019-09-08 10:52:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89598 states to 89598 states and 133050 transitions. [2019-09-08 10:52:31,444 INFO L78 Accepts]: Start accepts. Automaton has 89598 states and 133050 transitions. Word has length 72 [2019-09-08 10:52:31,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:31,444 INFO L475 AbstractCegarLoop]: Abstraction has 89598 states and 133050 transitions. [2019-09-08 10:52:31,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:52:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 89598 states and 133050 transitions. [2019-09-08 10:52:31,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:52:31,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:31,447 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:52:31,448 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:31,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:31,448 INFO L82 PathProgramCache]: Analyzing trace with hash 984491908, now seen corresponding path program 1 times [2019-09-08 10:52:31,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:31,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:31,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:31,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:31,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:31,492 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:52:31,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:31,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:52:31,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:52:31,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:52:31,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:52:31,494 INFO L87 Difference]: Start difference. First operand 89598 states and 133050 transitions. Second operand 3 states. [2019-09-08 10:52:48,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:48,659 INFO L93 Difference]: Finished difference Result 201950 states and 299823 transitions. [2019-09-08 10:52:48,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:52:48,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-08 10:52:48,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:48,816 INFO L225 Difference]: With dead ends: 201950 [2019-09-08 10:52:48,816 INFO L226 Difference]: Without dead ends: 122145 [2019-09-08 10:52:48,875 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:52:48,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122145 states. [2019-09-08 10:53:00,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122145 to 86767. [2019-09-08 10:53:00,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86767 states. [2019-09-08 10:53:01,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86767 states to 86767 states and 127106 transitions. [2019-09-08 10:53:01,072 INFO L78 Accepts]: Start accepts. Automaton has 86767 states and 127106 transitions. Word has length 72 [2019-09-08 10:53:01,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:01,072 INFO L475 AbstractCegarLoop]: Abstraction has 86767 states and 127106 transitions. [2019-09-08 10:53:01,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:53:01,072 INFO L276 IsEmpty]: Start isEmpty. Operand 86767 states and 127106 transitions. [2019-09-08 10:53:01,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:53:01,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:01,075 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:53:01,075 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:01,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:01,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1058462361, now seen corresponding path program 1 times [2019-09-08 10:53:01,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:01,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:01,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:01,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:01,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:01,121 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:53:01,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:01,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:53:01,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:53:01,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:53:01,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:53:01,122 INFO L87 Difference]: Start difference. First operand 86767 states and 127106 transitions. Second operand 3 states. [2019-09-08 10:53:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:20,609 INFO L93 Difference]: Finished difference Result 185158 states and 270533 transitions. [2019-09-08 10:53:20,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:53:20,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 10:53:20,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:20,749 INFO L225 Difference]: With dead ends: 185158 [2019-09-08 10:53:20,749 INFO L226 Difference]: Without dead ends: 108106 [2019-09-08 10:53:20,799 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:53:20,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108106 states. [2019-09-08 10:53:36,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108106 to 106820. [2019-09-08 10:53:36,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106820 states. [2019-09-08 10:53:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106820 states to 106820 states and 153090 transitions. [2019-09-08 10:53:36,337 INFO L78 Accepts]: Start accepts. Automaton has 106820 states and 153090 transitions. Word has length 73 [2019-09-08 10:53:36,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:36,337 INFO L475 AbstractCegarLoop]: Abstraction has 106820 states and 153090 transitions. [2019-09-08 10:53:36,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:53:36,338 INFO L276 IsEmpty]: Start isEmpty. Operand 106820 states and 153090 transitions. [2019-09-08 10:53:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:53:36,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:36,340 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:53:36,340 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:36,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:36,341 INFO L82 PathProgramCache]: Analyzing trace with hash 219811643, now seen corresponding path program 1 times [2019-09-08 10:53:36,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:36,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:36,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:36,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:36,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:36,424 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:53:36,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:36,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:53:36,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:53:36,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:53:36,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:53:36,425 INFO L87 Difference]: Start difference. First operand 106820 states and 153090 transitions. Second operand 7 states. [2019-09-08 10:54:22,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:54:22,002 INFO L93 Difference]: Finished difference Result 308694 states and 441744 transitions. [2019-09-08 10:54:22,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:54:22,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-09-08 10:54:22,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:54:22,387 INFO L225 Difference]: With dead ends: 308694 [2019-09-08 10:54:22,388 INFO L226 Difference]: Without dead ends: 266036 [2019-09-08 10:54:22,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:54:22,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266036 states. [2019-09-08 10:54:44,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266036 to 106832. [2019-09-08 10:54:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106832 states. [2019-09-08 10:54:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106832 states to 106832 states and 153106 transitions. [2019-09-08 10:54:44,681 INFO L78 Accepts]: Start accepts. Automaton has 106832 states and 153106 transitions. Word has length 73 [2019-09-08 10:54:44,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:54:44,681 INFO L475 AbstractCegarLoop]: Abstraction has 106832 states and 153106 transitions. [2019-09-08 10:54:44,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:54:44,681 INFO L276 IsEmpty]: Start isEmpty. Operand 106832 states and 153106 transitions. [2019-09-08 10:54:44,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:54:44,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:54:44,684 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:54:44,684 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:54:44,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:54:44,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1241611993, now seen corresponding path program 1 times [2019-09-08 10:54:44,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:54:44,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:54:44,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:44,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:54:44,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:54:44,757 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:54:44,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:54:44,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:54:44,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:54:44,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:54:44,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:54:44,759 INFO L87 Difference]: Start difference. First operand 106832 states and 153106 transitions. Second operand 7 states. [2019-09-08 10:55:58,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:58,019 INFO L93 Difference]: Finished difference Result 426107 states and 605011 transitions. [2019-09-08 10:55:58,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:55:58,019 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-09-08 10:55:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:58,613 INFO L225 Difference]: With dead ends: 426107 [2019-09-08 10:55:58,613 INFO L226 Difference]: Without dead ends: 388631 [2019-09-08 10:55:58,696 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 10:55:58,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388631 states. [2019-09-08 10:56:20,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388631 to 106978. [2019-09-08 10:56:20,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106978 states. [2019-09-08 10:56:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106978 states to 106978 states and 153284 transitions. [2019-09-08 10:56:20,229 INFO L78 Accepts]: Start accepts. Automaton has 106978 states and 153284 transitions. Word has length 73 [2019-09-08 10:56:20,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:56:20,230 INFO L475 AbstractCegarLoop]: Abstraction has 106978 states and 153284 transitions. [2019-09-08 10:56:20,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:56:20,230 INFO L276 IsEmpty]: Start isEmpty. Operand 106978 states and 153284 transitions. [2019-09-08 10:56:20,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:56:20,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:56:20,233 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 10:56:20,233 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:56:20,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:56:20,234 INFO L82 PathProgramCache]: Analyzing trace with hash -258690378, now seen corresponding path program 1 times [2019-09-08 10:56:20,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:56:20,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:56:20,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:20,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:56:20,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:56:20,308 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:56:20,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:56:20,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:56:20,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:56:20,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:56:20,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:56:20,310 INFO L87 Difference]: Start difference. First operand 106978 states and 153284 transitions. Second operand 7 states. [2019-09-08 10:57:34,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:57:34,627 INFO L93 Difference]: Finished difference Result 487617 states and 692866 transitions. [2019-09-08 10:57:34,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:57:34,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-08 10:57:34,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:57:35,195 INFO L225 Difference]: With dead ends: 487617 [2019-09-08 10:57:35,195 INFO L226 Difference]: Without dead ends: 381700 [2019-09-08 10:57:35,300 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 10:57:35,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381700 states. [2019-09-08 10:58:02,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381700 to 107028. [2019-09-08 10:58:02,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107028 states. [2019-09-08 10:58:02,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107028 states to 107028 states and 153344 transitions. [2019-09-08 10:58:02,766 INFO L78 Accepts]: Start accepts. Automaton has 107028 states and 153344 transitions. Word has length 74 [2019-09-08 10:58:02,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:58:02,766 INFO L475 AbstractCegarLoop]: Abstraction has 107028 states and 153344 transitions. [2019-09-08 10:58:02,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:58:02,766 INFO L276 IsEmpty]: Start isEmpty. Operand 107028 states and 153344 transitions. [2019-09-08 10:58:02,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:58:02,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:58:02,769 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] [2019-09-08 10:58:02,769 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:58:02,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:58:02,770 INFO L82 PathProgramCache]: Analyzing trace with hash -732575844, now seen corresponding path program 1 times [2019-09-08 10:58:02,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:58:02,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:58:02,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:02,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:58:02,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:58:02,852 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:02,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:58:02,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:58:02,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:58:02,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:58:02,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:58:02,854 INFO L87 Difference]: Start difference. First operand 107028 states and 153344 transitions. Second operand 6 states. [2019-09-08 10:58:45,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:58:45,497 INFO L93 Difference]: Finished difference Result 259044 states and 372499 transitions. [2019-09-08 10:58:45,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:58:45,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-09-08 10:58:45,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:58:45,832 INFO L225 Difference]: With dead ends: 259044 [2019-09-08 10:58:45,832 INFO L226 Difference]: Without dead ends: 220482 [2019-09-08 10:58:45,884 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 10:58:46,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220482 states. [2019-09-08 10:59:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220482 to 124265. [2019-09-08 10:59:14,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124265 states. [2019-09-08 10:59:14,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124265 states to 124265 states and 178433 transitions. [2019-09-08 10:59:14,756 INFO L78 Accepts]: Start accepts. Automaton has 124265 states and 178433 transitions. Word has length 75 [2019-09-08 10:59:14,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:14,756 INFO L475 AbstractCegarLoop]: Abstraction has 124265 states and 178433 transitions. [2019-09-08 10:59:14,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:59:14,756 INFO L276 IsEmpty]: Start isEmpty. Operand 124265 states and 178433 transitions. [2019-09-08 10:59:14,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:59:14,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:14,760 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 10:59:14,760 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:14,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:14,760 INFO L82 PathProgramCache]: Analyzing trace with hash 979223403, now seen corresponding path program 1 times [2019-09-08 10:59:14,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:14,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:14,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:14,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:14,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:14,825 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:14,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:14,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:59:14,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:59:14,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:59:14,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:59:14,826 INFO L87 Difference]: Start difference. First operand 124265 states and 178433 transitions. Second operand 6 states. [2019-09-08 11:00:01,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:01,492 INFO L93 Difference]: Finished difference Result 287762 states and 414123 transitions. [2019-09-08 11:00:01,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:00:01,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-08 11:00:01,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:01,831 INFO L225 Difference]: With dead ends: 287762 [2019-09-08 11:00:01,831 INFO L226 Difference]: Without dead ends: 230540 [2019-09-08 11:00:01,905 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:00:02,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230540 states. [2019-09-08 11:00:35,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230540 to 140621. [2019-09-08 11:00:35,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140621 states. [2019-09-08 11:00:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140621 states to 140621 states and 202225 transitions. [2019-09-08 11:00:35,573 INFO L78 Accepts]: Start accepts. Automaton has 140621 states and 202225 transitions. Word has length 76 [2019-09-08 11:00:35,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:00:35,573 INFO L475 AbstractCegarLoop]: Abstraction has 140621 states and 202225 transitions. [2019-09-08 11:00:35,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:00:35,573 INFO L276 IsEmpty]: Start isEmpty. Operand 140621 states and 202225 transitions. [2019-09-08 11:00:35,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:00:35,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:00:35,577 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:00:35,577 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:00:35,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:00:35,577 INFO L82 PathProgramCache]: Analyzing trace with hash 2142609195, now seen corresponding path program 1 times [2019-09-08 11:00:35,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:00:35,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:00:35,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:35,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:00:35,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:00:35,656 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:35,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:00:35,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:00:35,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:00:35,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:00:35,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:00:35,658 INFO L87 Difference]: Start difference. First operand 140621 states and 202225 transitions. Second operand 6 states. [2019-09-08 11:01:27,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:01:27,351 INFO L93 Difference]: Finished difference Result 309955 states and 446177 transitions. [2019-09-08 11:01:27,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:01:27,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-08 11:01:27,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:01:27,698 INFO L225 Difference]: With dead ends: 309955 [2019-09-08 11:01:27,698 INFO L226 Difference]: Without dead ends: 241690 [2019-09-08 11:01:27,762 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:01:27,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241690 states. [2019-09-08 11:02:05,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241690 to 156113. [2019-09-08 11:02:05,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156113 states. [2019-09-08 11:02:05,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156113 states to 156113 states and 224683 transitions. [2019-09-08 11:02:05,580 INFO L78 Accepts]: Start accepts. Automaton has 156113 states and 224683 transitions. Word has length 76 [2019-09-08 11:02:05,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:05,581 INFO L475 AbstractCegarLoop]: Abstraction has 156113 states and 224683 transitions. [2019-09-08 11:02:05,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:02:05,581 INFO L276 IsEmpty]: Start isEmpty. Operand 156113 states and 224683 transitions. [2019-09-08 11:02:05,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 11:02:05,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:05,585 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, 1] [2019-09-08 11:02:05,585 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:05,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:05,586 INFO L82 PathProgramCache]: Analyzing trace with hash 279588177, now seen corresponding path program 1 times [2019-09-08 11:02:05,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:05,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:05,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:05,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:05,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:05,633 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:02:05,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:05,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:02:05,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:02:05,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:02:05,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:05,634 INFO L87 Difference]: Start difference. First operand 156113 states and 224683 transitions. Second operand 3 states.