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_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:34:56,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:34:56,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:34:57,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:34:57,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:34:57,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:34:57,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:34:57,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:34:57,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:34:57,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:34:57,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:34:57,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:34:57,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:34:57,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:34:57,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:34:57,041 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:34:57,043 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:34:57,045 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:34:57,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:34:57,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:34:57,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:34:57,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:34:57,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:34:57,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:34:57,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:34:57,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:34:57,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:34:57,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:34:57,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:34:57,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:34:57,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:34:57,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:34:57,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:34:57,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:34:57,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:34:57,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:34:57,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:34:57,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:34:57,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:34:57,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:34:57,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:34:57,077 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 09:34:57,108 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:34:57,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:34:57,110 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:34:57,110 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:34:57,110 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:34:57,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:34:57,111 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:34:57,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:34:57,111 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:34:57,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:34:57,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:34:57,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:34:57,112 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:34:57,112 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:34:57,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:34:57,112 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:34:57,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:34:57,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:34:57,113 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:34:57,113 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:34:57,113 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:34:57,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:34:57,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:34:57,114 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:34:57,114 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:34:57,114 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:34:57,114 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:34:57,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:34:57,115 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:34:57,149 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:34:57,160 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:34:57,167 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:34:57,169 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:34:57,169 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:34:57,170 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:34:57,229 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a28eb8382/68f35d09b3de4d88a0056108447e503a/FLAG0536132e9 [2019-09-08 09:34:57,753 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:34:57,754 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:34:57,770 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a28eb8382/68f35d09b3de4d88a0056108447e503a/FLAG0536132e9 [2019-09-08 09:34:58,044 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a28eb8382/68f35d09b3de4d88a0056108447e503a [2019-09-08 09:34:58,054 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:34:58,056 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:34:58,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:34:58,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:34:58,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:34:58,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:34:58" (1/1) ... [2019-09-08 09:34:58,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13acec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:34:58, skipping insertion in model container [2019-09-08 09:34:58,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:34:58" (1/1) ... [2019-09-08 09:34:58,071 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:34:58,121 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:34:58,477 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:34:58,494 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:34:58,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:34:58,599 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:34:58,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:34:58 WrapperNode [2019-09-08 09:34:58,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:34:58,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:34:58,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:34:58,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:34:58,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:34:58" (1/1) ... [2019-09-08 09:34:58,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:34:58" (1/1) ... [2019-09-08 09:34:58,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:34:58" (1/1) ... [2019-09-08 09:34:58,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:34:58" (1/1) ... [2019-09-08 09:34:58,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:34:58" (1/1) ... [2019-09-08 09:34:58,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:34:58" (1/1) ... [2019-09-08 09:34:58,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:34:58" (1/1) ... [2019-09-08 09:34:58,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:34:58,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:34:58,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:34:58,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:34:58,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:34:58" (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 09:34:58,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:34:58,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:34:58,742 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:34:58,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:34:58,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:34:58,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 09:34:58,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:34:58,743 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:34:58,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:34:58,743 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:34:58,743 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:34:58,743 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:34:58,744 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:34:58,744 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:34:58,744 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:34:58,744 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:34:58,744 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:34:58,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:34:58,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:34:59,531 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:34:59,531 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:34:59,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:34:59 BoogieIcfgContainer [2019-09-08 09:34:59,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:34:59,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:34:59,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:34:59,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:34:59,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:34:58" (1/3) ... [2019-09-08 09:34:59,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81743d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:34:59, skipping insertion in model container [2019-09-08 09:34:59,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:34:58" (2/3) ... [2019-09-08 09:34:59,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81743d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:34:59, skipping insertion in model container [2019-09-08 09:34:59,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:34:59" (3/3) ... [2019-09-08 09:34:59,544 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:34:59,553 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:34:59,560 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:34:59,576 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:34:59,610 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:34:59,610 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:34:59,611 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:34:59,611 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:34:59,611 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:34:59,611 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:34:59,611 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:34:59,612 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:34:59,612 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:34:59,634 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-09-08 09:34:59,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 09:34:59,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:34:59,646 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] [2019-09-08 09:34:59,648 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:34:59,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:34:59,654 INFO L82 PathProgramCache]: Analyzing trace with hash -940649787, now seen corresponding path program 1 times [2019-09-08 09:34:59,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:34:59,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:34:59,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:34:59,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:34:59,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:34:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:00,111 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 09:35:00,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:00,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:35:00,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:35:00,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:35:00,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:35:00,139 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 3 states. [2019-09-08 09:35:00,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:35:00,309 INFO L93 Difference]: Finished difference Result 300 states and 503 transitions. [2019-09-08 09:35:00,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:35:00,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 09:35:00,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:35:00,343 INFO L225 Difference]: With dead ends: 300 [2019-09-08 09:35:00,343 INFO L226 Difference]: Without dead ends: 205 [2019-09-08 09:35:00,352 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 09:35:00,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-08 09:35:00,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2019-09-08 09:35:00,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-08 09:35:00,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 315 transitions. [2019-09-08 09:35:00,476 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 315 transitions. Word has length 60 [2019-09-08 09:35:00,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:00,477 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 315 transitions. [2019-09-08 09:35:00,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:35:00,478 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 315 transitions. [2019-09-08 09:35:00,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 09:35:00,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:00,485 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] [2019-09-08 09:35:00,485 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:00,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:00,486 INFO L82 PathProgramCache]: Analyzing trace with hash -662873070, now seen corresponding path program 1 times [2019-09-08 09:35:00,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:00,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:00,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:00,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:00,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:00,677 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 09:35:00,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:00,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:35:00,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:35:00,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:35:00,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:35:00,680 INFO L87 Difference]: Start difference. First operand 202 states and 315 transitions. Second operand 3 states. [2019-09-08 09:35:00,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:35:00,767 INFO L93 Difference]: Finished difference Result 476 states and 767 transitions. [2019-09-08 09:35:00,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:35:00,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-08 09:35:00,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:35:00,772 INFO L225 Difference]: With dead ends: 476 [2019-09-08 09:35:00,772 INFO L226 Difference]: Without dead ends: 332 [2019-09-08 09:35:00,774 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 09:35:00,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-08 09:35:00,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 328. [2019-09-08 09:35:00,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-08 09:35:00,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 521 transitions. [2019-09-08 09:35:00,814 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 521 transitions. Word has length 62 [2019-09-08 09:35:00,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:00,814 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 521 transitions. [2019-09-08 09:35:00,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:35:00,815 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 521 transitions. [2019-09-08 09:35:00,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 09:35:00,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:00,817 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] [2019-09-08 09:35:00,818 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:00,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:00,818 INFO L82 PathProgramCache]: Analyzing trace with hash 443916901, now seen corresponding path program 1 times [2019-09-08 09:35:00,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:00,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:00,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:00,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:00,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:00,982 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 09:35:00,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:00,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:35:00,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:35:00,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:35:00,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:35:00,984 INFO L87 Difference]: Start difference. First operand 328 states and 521 transitions. Second operand 3 states. [2019-09-08 09:35:01,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:35:01,066 INFO L93 Difference]: Finished difference Result 840 states and 1359 transitions. [2019-09-08 09:35:01,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:35:01,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-08 09:35:01,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:35:01,083 INFO L225 Difference]: With dead ends: 840 [2019-09-08 09:35:01,083 INFO L226 Difference]: Without dead ends: 570 [2019-09-08 09:35:01,086 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 09:35:01,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-09-08 09:35:01,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 564. [2019-09-08 09:35:01,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-09-08 09:35:01,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 901 transitions. [2019-09-08 09:35:01,123 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 901 transitions. Word has length 64 [2019-09-08 09:35:01,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:01,123 INFO L475 AbstractCegarLoop]: Abstraction has 564 states and 901 transitions. [2019-09-08 09:35:01,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:35:01,124 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 901 transitions. [2019-09-08 09:35:01,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 09:35:01,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:01,127 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] [2019-09-08 09:35:01,127 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:01,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:01,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1638426254, now seen corresponding path program 1 times [2019-09-08 09:35:01,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:01,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:01,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:01,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:01,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:01,312 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 09:35:01,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:01,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:35:01,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:35:01,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:35:01,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:35:01,315 INFO L87 Difference]: Start difference. First operand 564 states and 901 transitions. Second operand 5 states. [2019-09-08 09:35:01,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:35:01,585 INFO L93 Difference]: Finished difference Result 2370 states and 3866 transitions. [2019-09-08 09:35:01,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:35:01,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-08 09:35:01,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:35:01,599 INFO L225 Difference]: With dead ends: 2370 [2019-09-08 09:35:01,599 INFO L226 Difference]: Without dead ends: 1864 [2019-09-08 09:35:01,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:35:01,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2019-09-08 09:35:01,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1450. [2019-09-08 09:35:01,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2019-09-08 09:35:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 2348 transitions. [2019-09-08 09:35:01,691 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 2348 transitions. Word has length 66 [2019-09-08 09:35:01,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:01,691 INFO L475 AbstractCegarLoop]: Abstraction has 1450 states and 2348 transitions. [2019-09-08 09:35:01,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:35:01,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2348 transitions. [2019-09-08 09:35:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 09:35:01,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:01,695 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 09:35:01,695 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:01,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:01,695 INFO L82 PathProgramCache]: Analyzing trace with hash 686783218, now seen corresponding path program 1 times [2019-09-08 09:35:01,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:01,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:01,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:01,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:01,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:01,816 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 09:35:01,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:01,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:35:01,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:35:01,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:35:01,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:35:01,819 INFO L87 Difference]: Start difference. First operand 1450 states and 2348 transitions. Second operand 6 states. [2019-09-08 09:35:02,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:35:02,348 INFO L93 Difference]: Finished difference Result 7180 states and 11651 transitions. [2019-09-08 09:35:02,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 09:35:02,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-09-08 09:35:02,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:35:02,385 INFO L225 Difference]: With dead ends: 7180 [2019-09-08 09:35:02,385 INFO L226 Difference]: Without dead ends: 5788 [2019-09-08 09:35:02,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:35:02,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5788 states. [2019-09-08 09:35:02,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5788 to 5689. [2019-09-08 09:35:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5689 states. [2019-09-08 09:35:02,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5689 states to 5689 states and 9188 transitions. [2019-09-08 09:35:02,802 INFO L78 Accepts]: Start accepts. Automaton has 5689 states and 9188 transitions. Word has length 67 [2019-09-08 09:35:02,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:02,804 INFO L475 AbstractCegarLoop]: Abstraction has 5689 states and 9188 transitions. [2019-09-08 09:35:02,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:35:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 5689 states and 9188 transitions. [2019-09-08 09:35:02,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 09:35:02,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:02,807 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 09:35:02,807 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:02,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:02,807 INFO L82 PathProgramCache]: Analyzing trace with hash -241609159, now seen corresponding path program 1 times [2019-09-08 09:35:02,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:02,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:02,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:02,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:02,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:02,932 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 09:35:02,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:02,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:35:02,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:35:02,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:35:02,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:35:02,935 INFO L87 Difference]: Start difference. First operand 5689 states and 9188 transitions. Second operand 4 states. [2019-09-08 09:35:03,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:35:03,395 INFO L93 Difference]: Finished difference Result 13400 states and 21699 transitions. [2019-09-08 09:35:03,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:35:03,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-08 09:35:03,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:35:03,444 INFO L225 Difference]: With dead ends: 13400 [2019-09-08 09:35:03,444 INFO L226 Difference]: Without dead ends: 7870 [2019-09-08 09:35:03,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:35:03,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7870 states. [2019-09-08 09:35:03,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7870 to 7832. [2019-09-08 09:35:03,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7832 states. [2019-09-08 09:35:03,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7832 states to 7832 states and 12644 transitions. [2019-09-08 09:35:03,963 INFO L78 Accepts]: Start accepts. Automaton has 7832 states and 12644 transitions. Word has length 68 [2019-09-08 09:35:03,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:03,963 INFO L475 AbstractCegarLoop]: Abstraction has 7832 states and 12644 transitions. [2019-09-08 09:35:03,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:35:03,963 INFO L276 IsEmpty]: Start isEmpty. Operand 7832 states and 12644 transitions. [2019-09-08 09:35:03,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 09:35:03,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:03,966 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 09:35:03,967 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:03,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:03,968 INFO L82 PathProgramCache]: Analyzing trace with hash 464144953, now seen corresponding path program 1 times [2019-09-08 09:35:03,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:03,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:03,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:03,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:03,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:04,057 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 09:35:04,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:04,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:35:04,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:35:04,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:35:04,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:35:04,059 INFO L87 Difference]: Start difference. First operand 7832 states and 12644 transitions. Second operand 3 states. [2019-09-08 09:35:04,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:35:04,568 INFO L93 Difference]: Finished difference Result 17477 states and 28304 transitions. [2019-09-08 09:35:04,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:35:04,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-08 09:35:04,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:35:04,639 INFO L225 Difference]: With dead ends: 17477 [2019-09-08 09:35:04,640 INFO L226 Difference]: Without dead ends: 11651 [2019-09-08 09:35:04,656 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 09:35:04,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11651 states. [2019-09-08 09:35:05,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11651 to 11649. [2019-09-08 09:35:05,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11649 states. [2019-09-08 09:35:05,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11649 states to 11649 states and 18708 transitions. [2019-09-08 09:35:05,277 INFO L78 Accepts]: Start accepts. Automaton has 11649 states and 18708 transitions. Word has length 69 [2019-09-08 09:35:05,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:05,277 INFO L475 AbstractCegarLoop]: Abstraction has 11649 states and 18708 transitions. [2019-09-08 09:35:05,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:35:05,277 INFO L276 IsEmpty]: Start isEmpty. Operand 11649 states and 18708 transitions. [2019-09-08 09:35:05,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 09:35:05,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:05,282 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 09:35:05,282 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:05,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:05,283 INFO L82 PathProgramCache]: Analyzing trace with hash -2123298740, now seen corresponding path program 1 times [2019-09-08 09:35:05,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:05,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:05,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:05,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:05,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:05,353 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 09:35:05,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:05,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:35:05,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:35:05,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:35:05,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:35:05,355 INFO L87 Difference]: Start difference. First operand 11649 states and 18708 transitions. Second operand 3 states. [2019-09-08 09:35:06,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:35:06,029 INFO L93 Difference]: Finished difference Result 23037 states and 37216 transitions. [2019-09-08 09:35:06,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:35:06,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-08 09:35:06,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:35:06,075 INFO L225 Difference]: With dead ends: 23037 [2019-09-08 09:35:06,076 INFO L226 Difference]: Without dead ends: 16037 [2019-09-08 09:35:06,097 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 09:35:06,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16037 states. [2019-09-08 09:35:07,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16037 to 16035. [2019-09-08 09:35:07,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16035 states. [2019-09-08 09:35:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16035 states to 16035 states and 25654 transitions. [2019-09-08 09:35:07,320 INFO L78 Accepts]: Start accepts. Automaton has 16035 states and 25654 transitions. Word has length 69 [2019-09-08 09:35:07,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:07,320 INFO L475 AbstractCegarLoop]: Abstraction has 16035 states and 25654 transitions. [2019-09-08 09:35:07,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:35:07,320 INFO L276 IsEmpty]: Start isEmpty. Operand 16035 states and 25654 transitions. [2019-09-08 09:35:07,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 09:35:07,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:07,322 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 09:35:07,322 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:07,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:07,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1047556249, now seen corresponding path program 1 times [2019-09-08 09:35:07,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:07,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:07,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:07,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:07,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:07,389 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 09:35:07,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:07,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:35:07,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:35:07,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:35:07,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:35:07,390 INFO L87 Difference]: Start difference. First operand 16035 states and 25654 transitions. Second operand 4 states. [2019-09-08 09:35:08,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:35:08,465 INFO L93 Difference]: Finished difference Result 49152 states and 78845 transitions. [2019-09-08 09:35:08,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:35:08,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-08 09:35:08,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:35:08,597 INFO L225 Difference]: With dead ends: 49152 [2019-09-08 09:35:08,598 INFO L226 Difference]: Without dead ends: 33255 [2019-09-08 09:35:08,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 09:35:08,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33255 states. [2019-09-08 09:35:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33255 to 24549. [2019-09-08 09:35:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24549 states. [2019-09-08 09:35:09,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24549 states to 24549 states and 39174 transitions. [2019-09-08 09:35:09,896 INFO L78 Accepts]: Start accepts. Automaton has 24549 states and 39174 transitions. Word has length 69 [2019-09-08 09:35:09,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:09,896 INFO L475 AbstractCegarLoop]: Abstraction has 24549 states and 39174 transitions. [2019-09-08 09:35:09,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:35:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 24549 states and 39174 transitions. [2019-09-08 09:35:09,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 09:35:09,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:09,898 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 09:35:09,898 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:09,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:09,898 INFO L82 PathProgramCache]: Analyzing trace with hash 795480594, now seen corresponding path program 1 times [2019-09-08 09:35:09,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:09,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:09,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:09,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:09,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:09,970 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 09:35:09,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:09,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:35:09,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:35:09,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:35:09,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:35:09,972 INFO L87 Difference]: Start difference. First operand 24549 states and 39174 transitions. Second operand 3 states. [2019-09-08 09:35:11,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:35:11,670 INFO L93 Difference]: Finished difference Result 58254 states and 93371 transitions. [2019-09-08 09:35:11,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:35:11,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-08 09:35:11,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:35:11,738 INFO L225 Difference]: With dead ends: 58254 [2019-09-08 09:35:11,739 INFO L226 Difference]: Without dead ends: 33790 [2019-09-08 09:35:11,791 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 09:35:11,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33790 states. [2019-09-08 09:35:12,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33790 to 33788. [2019-09-08 09:35:12,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33788 states. [2019-09-08 09:35:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33788 states to 33788 states and 54046 transitions. [2019-09-08 09:35:13,005 INFO L78 Accepts]: Start accepts. Automaton has 33788 states and 54046 transitions. Word has length 69 [2019-09-08 09:35:13,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:13,005 INFO L475 AbstractCegarLoop]: Abstraction has 33788 states and 54046 transitions. [2019-09-08 09:35:13,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:35:13,005 INFO L276 IsEmpty]: Start isEmpty. Operand 33788 states and 54046 transitions. [2019-09-08 09:35:13,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 09:35:13,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:13,007 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 09:35:13,007 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:13,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:13,007 INFO L82 PathProgramCache]: Analyzing trace with hash 189572521, now seen corresponding path program 1 times [2019-09-08 09:35:13,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:13,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:13,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:13,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:13,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:13,144 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 09:35:13,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:13,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:35:13,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:35:13,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:35:13,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:35:13,146 INFO L87 Difference]: Start difference. First operand 33788 states and 54046 transitions. Second operand 5 states. [2019-09-08 09:35:14,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:35:14,358 INFO L93 Difference]: Finished difference Result 67497 states and 107980 transitions. [2019-09-08 09:35:14,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:35:14,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 09:35:14,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:35:14,425 INFO L225 Difference]: With dead ends: 67497 [2019-09-08 09:35:14,426 INFO L226 Difference]: Without dead ends: 33794 [2019-09-08 09:35:14,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:35:14,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33794 states. [2019-09-08 09:35:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33794 to 33788. [2019-09-08 09:35:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33788 states. [2019-09-08 09:35:15,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33788 states to 33788 states and 53896 transitions. [2019-09-08 09:35:15,675 INFO L78 Accepts]: Start accepts. Automaton has 33788 states and 53896 transitions. Word has length 71 [2019-09-08 09:35:15,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:15,675 INFO L475 AbstractCegarLoop]: Abstraction has 33788 states and 53896 transitions. [2019-09-08 09:35:15,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:35:15,675 INFO L276 IsEmpty]: Start isEmpty. Operand 33788 states and 53896 transitions. [2019-09-08 09:35:15,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 09:35:15,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:15,676 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 09:35:15,676 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:15,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:15,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1918442634, now seen corresponding path program 1 times [2019-09-08 09:35:15,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:15,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:15,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:15,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:15,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:15,864 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 09:35:15,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:15,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:35:15,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:35:15,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:35:15,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:35:15,866 INFO L87 Difference]: Start difference. First operand 33788 states and 53896 transitions. Second operand 5 states. [2019-09-08 09:35:18,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:35:18,901 INFO L93 Difference]: Finished difference Result 93683 states and 149663 transitions. [2019-09-08 09:35:18,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:35:18,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-09-08 09:35:18,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:35:18,977 INFO L225 Difference]: With dead ends: 93683 [2019-09-08 09:35:18,977 INFO L226 Difference]: Without dead ends: 59980 [2019-09-08 09:35:19,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:35:19,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59980 states. [2019-09-08 09:35:20,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59980 to 59978. [2019-09-08 09:35:20,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59978 states. [2019-09-08 09:35:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59978 states to 59978 states and 95161 transitions. [2019-09-08 09:35:20,921 INFO L78 Accepts]: Start accepts. Automaton has 59978 states and 95161 transitions. Word has length 74 [2019-09-08 09:35:20,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:20,922 INFO L475 AbstractCegarLoop]: Abstraction has 59978 states and 95161 transitions. [2019-09-08 09:35:20,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:35:20,922 INFO L276 IsEmpty]: Start isEmpty. Operand 59978 states and 95161 transitions. [2019-09-08 09:35:20,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 09:35:20,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:20,923 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 09:35:20,923 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:20,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:20,923 INFO L82 PathProgramCache]: Analyzing trace with hash -659729786, now seen corresponding path program 1 times [2019-09-08 09:35:20,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:20,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:20,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:20,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:20,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:21,022 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 09:35:21,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:21,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:35:21,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:35:21,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:35:21,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:35:21,024 INFO L87 Difference]: Start difference. First operand 59978 states and 95161 transitions. Second operand 5 states. [2019-09-08 09:35:26,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:35:26,309 INFO L93 Difference]: Finished difference Result 106053 states and 167261 transitions. [2019-09-08 09:35:26,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:35:26,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-08 09:35:26,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:35:26,479 INFO L225 Difference]: With dead ends: 106053 [2019-09-08 09:35:26,480 INFO L226 Difference]: Without dead ends: 106051 [2019-09-08 09:35:26,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 09:35:26,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106051 states. [2019-09-08 09:35:29,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106051 to 61346. [2019-09-08 09:35:29,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61346 states. [2019-09-08 09:35:29,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61346 states to 61346 states and 96511 transitions. [2019-09-08 09:35:29,204 INFO L78 Accepts]: Start accepts. Automaton has 61346 states and 96511 transitions. Word has length 75 [2019-09-08 09:35:29,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:29,204 INFO L475 AbstractCegarLoop]: Abstraction has 61346 states and 96511 transitions. [2019-09-08 09:35:29,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:35:29,204 INFO L276 IsEmpty]: Start isEmpty. Operand 61346 states and 96511 transitions. [2019-09-08 09:35:29,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 09:35:29,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:29,207 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:35:29,208 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:29,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:29,208 INFO L82 PathProgramCache]: Analyzing trace with hash -242897637, now seen corresponding path program 1 times [2019-09-08 09:35:29,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:29,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:29,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:29,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:29,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:29,270 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:35:29,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:29,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:35:29,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:35:29,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:35:29,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:35:29,272 INFO L87 Difference]: Start difference. First operand 61346 states and 96511 transitions. Second operand 3 states. [2019-09-08 09:35:32,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:35:32,159 INFO L93 Difference]: Finished difference Result 122143 states and 192442 transitions. [2019-09-08 09:35:32,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:35:32,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 09:35:32,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:35:32,261 INFO L225 Difference]: With dead ends: 122143 [2019-09-08 09:35:32,261 INFO L226 Difference]: Without dead ends: 60882 [2019-09-08 09:35:32,313 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 09:35:32,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60882 states. [2019-09-08 09:35:36,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60882 to 60880. [2019-09-08 09:35:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60880 states. [2019-09-08 09:35:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60880 states to 60880 states and 95113 transitions. [2019-09-08 09:35:36,790 INFO L78 Accepts]: Start accepts. Automaton has 60880 states and 95113 transitions. Word has length 97 [2019-09-08 09:35:36,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:36,791 INFO L475 AbstractCegarLoop]: Abstraction has 60880 states and 95113 transitions. [2019-09-08 09:35:36,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:35:36,791 INFO L276 IsEmpty]: Start isEmpty. Operand 60880 states and 95113 transitions. [2019-09-08 09:35:36,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 09:35:36,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:36,794 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:35:36,794 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:36,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:36,794 INFO L82 PathProgramCache]: Analyzing trace with hash 88438004, now seen corresponding path program 1 times [2019-09-08 09:35:36,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:36,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:36,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:36,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:36,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:36,880 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:35:36,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:36,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:35:36,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:35:36,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:35:36,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:35:36,882 INFO L87 Difference]: Start difference. First operand 60880 states and 95113 transitions. Second operand 3 states. [2019-09-08 09:35:38,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:35:38,001 INFO L93 Difference]: Finished difference Result 86146 states and 134567 transitions. [2019-09-08 09:35:38,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:35:38,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 09:35:38,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:35:38,040 INFO L225 Difference]: With dead ends: 86146 [2019-09-08 09:35:38,040 INFO L226 Difference]: Without dead ends: 25351 [2019-09-08 09:35:38,098 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 09:35:38,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25351 states. [2019-09-08 09:35:39,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25351 to 25349. [2019-09-08 09:35:39,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25349 states. [2019-09-08 09:35:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25349 states to 25349 states and 39364 transitions. [2019-09-08 09:35:39,047 INFO L78 Accepts]: Start accepts. Automaton has 25349 states and 39364 transitions. Word has length 97 [2019-09-08 09:35:39,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:39,048 INFO L475 AbstractCegarLoop]: Abstraction has 25349 states and 39364 transitions. [2019-09-08 09:35:39,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:35:39,048 INFO L276 IsEmpty]: Start isEmpty. Operand 25349 states and 39364 transitions. [2019-09-08 09:35:39,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 09:35:39,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:39,050 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:35:39,050 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:39,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:39,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1027309389, now seen corresponding path program 1 times [2019-09-08 09:35:39,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:39,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:39,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:39,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:39,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 09:35:39,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:39,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:35:39,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:35:39,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:35:39,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:35:39,170 INFO L87 Difference]: Start difference. First operand 25349 states and 39364 transitions. Second operand 5 states. [2019-09-08 09:35:40,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:35:40,896 INFO L93 Difference]: Finished difference Result 39867 states and 62055 transitions. [2019-09-08 09:35:40,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:35:40,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 09:35:40,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:35:40,930 INFO L225 Difference]: With dead ends: 39867 [2019-09-08 09:35:40,930 INFO L226 Difference]: Without dead ends: 25355 [2019-09-08 09:35:40,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:35:40,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25355 states. [2019-09-08 09:35:41,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25355 to 25329. [2019-09-08 09:35:41,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25329 states. [2019-09-08 09:35:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25329 states to 25329 states and 39169 transitions. [2019-09-08 09:35:41,905 INFO L78 Accepts]: Start accepts. Automaton has 25329 states and 39169 transitions. Word has length 99 [2019-09-08 09:35:41,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:41,905 INFO L475 AbstractCegarLoop]: Abstraction has 25329 states and 39169 transitions. [2019-09-08 09:35:41,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:35:41,905 INFO L276 IsEmpty]: Start isEmpty. Operand 25329 states and 39169 transitions. [2019-09-08 09:35:41,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 09:35:41,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:41,907 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:35:41,907 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:41,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:41,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1219679097, now seen corresponding path program 1 times [2019-09-08 09:35:41,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:41,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:41,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:41,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:41,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 09:35:42,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:42,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:35:42,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:35:42,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:35:42,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:35:42,013 INFO L87 Difference]: Start difference. First operand 25329 states and 39169 transitions. Second operand 5 states. [2019-09-08 09:35:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:35:43,424 INFO L93 Difference]: Finished difference Result 40941 states and 63657 transitions. [2019-09-08 09:35:43,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:35:43,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 09:35:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:35:43,461 INFO L225 Difference]: With dead ends: 40941 [2019-09-08 09:35:43,462 INFO L226 Difference]: Without dead ends: 28759 [2019-09-08 09:35:43,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:35:43,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28759 states. [2019-09-08 09:35:44,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28759 to 28693. [2019-09-08 09:35:44,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28693 states. [2019-09-08 09:35:44,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28693 states to 28693 states and 44313 transitions. [2019-09-08 09:35:44,550 INFO L78 Accepts]: Start accepts. Automaton has 28693 states and 44313 transitions. Word has length 99 [2019-09-08 09:35:44,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:44,550 INFO L475 AbstractCegarLoop]: Abstraction has 28693 states and 44313 transitions. [2019-09-08 09:35:44,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:35:44,550 INFO L276 IsEmpty]: Start isEmpty. Operand 28693 states and 44313 transitions. [2019-09-08 09:35:44,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 09:35:44,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:44,552 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:35:44,552 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:44,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:44,553 INFO L82 PathProgramCache]: Analyzing trace with hash 636454422, now seen corresponding path program 1 times [2019-09-08 09:35:44,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:44,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:44,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:44,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:44,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:44,608 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 09:35:44,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:44,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:35:44,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:35:44,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:35:44,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:35:44,609 INFO L87 Difference]: Start difference. First operand 28693 states and 44313 transitions. Second operand 3 states. [2019-09-08 09:35:46,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:35:46,662 INFO L93 Difference]: Finished difference Result 77406 states and 119760 transitions. [2019-09-08 09:35:46,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:35:46,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-08 09:35:46,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:35:46,736 INFO L225 Difference]: With dead ends: 77406 [2019-09-08 09:35:46,736 INFO L226 Difference]: Without dead ends: 51351 [2019-09-08 09:35:46,766 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 09:35:46,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51351 states. [2019-09-08 09:35:48,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51351 to 51296. [2019-09-08 09:35:48,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51296 states. [2019-09-08 09:35:49,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51296 states to 51296 states and 79207 transitions. [2019-09-08 09:35:49,061 INFO L78 Accepts]: Start accepts. Automaton has 51296 states and 79207 transitions. Word has length 100 [2019-09-08 09:35:49,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:49,062 INFO L475 AbstractCegarLoop]: Abstraction has 51296 states and 79207 transitions. [2019-09-08 09:35:49,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:35:49,062 INFO L276 IsEmpty]: Start isEmpty. Operand 51296 states and 79207 transitions. [2019-09-08 09:35:49,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 09:35:49,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:49,063 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:35:49,064 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:49,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:49,064 INFO L82 PathProgramCache]: Analyzing trace with hash 2066507146, now seen corresponding path program 1 times [2019-09-08 09:35:49,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:49,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:49,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:49,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:49,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:35:49,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:49,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:35:49,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:35:49,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:35:49,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:35:49,155 INFO L87 Difference]: Start difference. First operand 51296 states and 79207 transitions. Second operand 3 states. [2019-09-08 09:35:50,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:35:50,168 INFO L93 Difference]: Finished difference Result 72768 states and 112372 transitions. [2019-09-08 09:35:50,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:35:50,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-08 09:35:50,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:35:50,200 INFO L225 Difference]: With dead ends: 72768 [2019-09-08 09:35:50,201 INFO L226 Difference]: Without dead ends: 21671 [2019-09-08 09:35:50,249 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 09:35:50,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21671 states. [2019-09-08 09:35:51,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21671 to 21669. [2019-09-08 09:35:51,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21669 states. [2019-09-08 09:35:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21669 states to 21669 states and 33264 transitions. [2019-09-08 09:35:51,069 INFO L78 Accepts]: Start accepts. Automaton has 21669 states and 33264 transitions. Word has length 100 [2019-09-08 09:35:51,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:51,069 INFO L475 AbstractCegarLoop]: Abstraction has 21669 states and 33264 transitions. [2019-09-08 09:35:51,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:35:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 21669 states and 33264 transitions. [2019-09-08 09:35:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 09:35:51,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:51,071 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:35:51,071 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:51,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:51,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1160085683, now seen corresponding path program 1 times [2019-09-08 09:35:51,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:51,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:51,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:51,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:51,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:35:51,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:35:51,168 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 09:35:51,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:51,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 09:35:51,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:35:51,415 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 09:35:51,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:35:51,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 09:35:51,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:35:51,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:35:51,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:35:51,434 INFO L87 Difference]: Start difference. First operand 21669 states and 33264 transitions. Second operand 8 states. [2019-09-08 09:35:54,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:35:54,687 INFO L93 Difference]: Finished difference Result 39341 states and 60735 transitions. [2019-09-08 09:35:54,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 09:35:54,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-09-08 09:35:54,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:35:54,848 INFO L225 Difference]: With dead ends: 39341 [2019-09-08 09:35:54,848 INFO L226 Difference]: Without dead ends: 34565 [2019-09-08 09:35:54,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-09-08 09:35:54,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34565 states. [2019-09-08 09:35:57,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34565 to 32436. [2019-09-08 09:35:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32436 states. [2019-09-08 09:35:57,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32436 states to 32436 states and 49982 transitions. [2019-09-08 09:35:57,571 INFO L78 Accepts]: Start accepts. Automaton has 32436 states and 49982 transitions. Word has length 101 [2019-09-08 09:35:57,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:57,571 INFO L475 AbstractCegarLoop]: Abstraction has 32436 states and 49982 transitions. [2019-09-08 09:35:57,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:35:57,571 INFO L276 IsEmpty]: Start isEmpty. Operand 32436 states and 49982 transitions. [2019-09-08 09:35:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 09:35:57,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:57,575 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:35:57,575 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:57,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:57,575 INFO L82 PathProgramCache]: Analyzing trace with hash -381064316, now seen corresponding path program 1 times [2019-09-08 09:35:57,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:57,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:57,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:57,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:57,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 09:35:57,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:57,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:35:57,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:35:57,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:35:57,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:35:57,758 INFO L87 Difference]: Start difference. First operand 32436 states and 49982 transitions. Second operand 4 states. [2019-09-08 09:36:00,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:36:00,853 INFO L93 Difference]: Finished difference Result 96074 states and 147971 transitions. [2019-09-08 09:36:00,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:36:00,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-08 09:36:00,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:36:00,986 INFO L225 Difference]: With dead ends: 96074 [2019-09-08 09:36:00,986 INFO L226 Difference]: Without dead ends: 63651 [2019-09-08 09:36:01,035 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 09:36:01,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63651 states. [2019-09-08 09:36:04,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63651 to 63649. [2019-09-08 09:36:04,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63649 states. [2019-09-08 09:36:04,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63649 states to 63649 states and 97514 transitions. [2019-09-08 09:36:04,402 INFO L78 Accepts]: Start accepts. Automaton has 63649 states and 97514 transitions. Word has length 102 [2019-09-08 09:36:04,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:36:04,403 INFO L475 AbstractCegarLoop]: Abstraction has 63649 states and 97514 transitions. [2019-09-08 09:36:04,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:36:04,403 INFO L276 IsEmpty]: Start isEmpty. Operand 63649 states and 97514 transitions. [2019-09-08 09:36:04,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 09:36:04,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:36:04,405 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:36:04,405 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:36:04,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:36:04,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1735669958, now seen corresponding path program 1 times [2019-09-08 09:36:04,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:36:04,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:36:04,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:36:04,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:36:04,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:36:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:36:04,440 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 09:36:04,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:36:04,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:36:04,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:36:04,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:36:04,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:36:04,442 INFO L87 Difference]: Start difference. First operand 63649 states and 97514 transitions. Second operand 3 states. [2019-09-08 09:36:12,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:36:12,258 INFO L93 Difference]: Finished difference Result 190901 states and 292472 transitions. [2019-09-08 09:36:12,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:36:12,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-08 09:36:12,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:36:12,562 INFO L225 Difference]: With dead ends: 190901 [2019-09-08 09:36:12,562 INFO L226 Difference]: Without dead ends: 127284 [2019-09-08 09:36:12,669 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 09:36:12,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127284 states. [2019-09-08 09:36:16,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127284 to 63651. [2019-09-08 09:36:16,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63651 states. [2019-09-08 09:36:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63651 states to 63651 states and 97516 transitions. [2019-09-08 09:36:16,955 INFO L78 Accepts]: Start accepts. Automaton has 63651 states and 97516 transitions. Word has length 103 [2019-09-08 09:36:16,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:36:16,955 INFO L475 AbstractCegarLoop]: Abstraction has 63651 states and 97516 transitions. [2019-09-08 09:36:16,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:36:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 63651 states and 97516 transitions. [2019-09-08 09:36:16,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 09:36:16,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:36:16,959 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:36:16,959 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:36:16,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:36:16,959 INFO L82 PathProgramCache]: Analyzing trace with hash -854773197, now seen corresponding path program 1 times [2019-09-08 09:36:16,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:36:16,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:36:16,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:36:16,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:36:16,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:36:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:36:17,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 09:36:17,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:36:17,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:36:17,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:36:17,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:36:17,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:36:17,030 INFO L87 Difference]: Start difference. First operand 63651 states and 97516 transitions. Second operand 3 states. [2019-09-08 09:36:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:36:25,585 INFO L93 Difference]: Finished difference Result 186425 states and 285535 transitions. [2019-09-08 09:36:25,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:36:25,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-08 09:36:25,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:36:25,783 INFO L225 Difference]: With dead ends: 186425 [2019-09-08 09:36:25,783 INFO L226 Difference]: Without dead ends: 122954 [2019-09-08 09:36:25,855 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 09:36:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122954 states. [2019-09-08 09:36:32,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122954 to 122952. [2019-09-08 09:36:32,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122952 states. [2019-09-08 09:36:33,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122952 states to 122952 states and 186801 transitions. [2019-09-08 09:36:33,035 INFO L78 Accepts]: Start accepts. Automaton has 122952 states and 186801 transitions. Word has length 104 [2019-09-08 09:36:33,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:36:33,036 INFO L475 AbstractCegarLoop]: Abstraction has 122952 states and 186801 transitions. [2019-09-08 09:36:33,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:36:33,036 INFO L276 IsEmpty]: Start isEmpty. Operand 122952 states and 186801 transitions. [2019-09-08 09:36:33,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 09:36:33,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:36:33,041 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:36:33,042 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:36:33,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:36:33,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1855097296, now seen corresponding path program 1 times [2019-09-08 09:36:33,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:36:33,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:36:33,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:36:33,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:36:33,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:36:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:36:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 09:36:33,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:36:33,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:36:33,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:36:33,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:36:33,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:36:33,165 INFO L87 Difference]: Start difference. First operand 122952 states and 186801 transitions. Second operand 4 states. [2019-09-08 09:36:40,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:36:40,581 INFO L93 Difference]: Finished difference Result 216686 states and 328724 transitions. [2019-09-08 09:36:40,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:36:40,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-08 09:36:40,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:36:40,719 INFO L225 Difference]: With dead ends: 216686 [2019-09-08 09:36:40,720 INFO L226 Difference]: Without dead ends: 93904 [2019-09-08 09:36:40,809 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 09:36:40,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93904 states. [2019-09-08 09:36:46,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93904 to 93904. [2019-09-08 09:36:46,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93904 states. [2019-09-08 09:36:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93904 states to 93904 states and 142148 transitions. [2019-09-08 09:36:46,608 INFO L78 Accepts]: Start accepts. Automaton has 93904 states and 142148 transitions. Word has length 104 [2019-09-08 09:36:46,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:36:46,608 INFO L475 AbstractCegarLoop]: Abstraction has 93904 states and 142148 transitions. [2019-09-08 09:36:46,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:36:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 93904 states and 142148 transitions. [2019-09-08 09:36:46,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 09:36:46,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:36:46,612 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:36:46,612 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:36:46,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:36:46,613 INFO L82 PathProgramCache]: Analyzing trace with hash -836909356, now seen corresponding path program 1 times [2019-09-08 09:36:46,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:36:46,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:36:46,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:36:46,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:36:46,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:36:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:36:46,791 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:36:46,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:36:46,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 09:36:46,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:36:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:36:46,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 09:36:46,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:36:46,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 09:36:46,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:36:46,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2019-09-08 09:36:46,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 09:36:46,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 09:36:46,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:36:46,996 INFO L87 Difference]: Start difference. First operand 93904 states and 142148 transitions. Second operand 9 states. [2019-09-08 09:36:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:36:57,434 INFO L93 Difference]: Finished difference Result 175072 states and 265364 transitions. [2019-09-08 09:36:57,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:36:57,434 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 106 [2019-09-08 09:36:57,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:36:57,708 INFO L225 Difference]: With dead ends: 175072 [2019-09-08 09:36:57,708 INFO L226 Difference]: Without dead ends: 151378 [2019-09-08 09:36:57,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:36:57,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151378 states. [2019-09-08 09:37:06,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151378 to 125968. [2019-09-08 09:37:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125968 states. [2019-09-08 09:37:06,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125968 states to 125968 states and 190012 transitions. [2019-09-08 09:37:06,401 INFO L78 Accepts]: Start accepts. Automaton has 125968 states and 190012 transitions. Word has length 106 [2019-09-08 09:37:06,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:37:06,401 INFO L475 AbstractCegarLoop]: Abstraction has 125968 states and 190012 transitions. [2019-09-08 09:37:06,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 09:37:06,401 INFO L276 IsEmpty]: Start isEmpty. Operand 125968 states and 190012 transitions. [2019-09-08 09:37:06,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 09:37:06,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:37:06,405 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:37:06,405 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:37:06,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:37:06,405 INFO L82 PathProgramCache]: Analyzing trace with hash 998727188, now seen corresponding path program 1 times [2019-09-08 09:37:06,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:37:06,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:37:06,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:37:06,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:37:06,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:37:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:37:06,510 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 09:37:06,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:37:06,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:37:06,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:37:06,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:37:06,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:37:06,512 INFO L87 Difference]: Start difference. First operand 125968 states and 190012 transitions. Second operand 4 states. [2019-09-08 09:37:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:37:22,244 INFO L93 Difference]: Finished difference Result 332654 states and 501430 transitions. [2019-09-08 09:37:22,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:37:22,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-08 09:37:22,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:37:22,580 INFO L225 Difference]: With dead ends: 332654 [2019-09-08 09:37:22,580 INFO L226 Difference]: Without dead ends: 206709 [2019-09-08 09:37:22,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 09:37:22,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206709 states. [2019-09-08 09:37:40,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206709 to 206707. [2019-09-08 09:37:40,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206707 states. [2019-09-08 09:37:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206707 states to 206707 states and 309476 transitions. [2019-09-08 09:37:40,747 INFO L78 Accepts]: Start accepts. Automaton has 206707 states and 309476 transitions. Word has length 106 [2019-09-08 09:37:40,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:37:40,747 INFO L475 AbstractCegarLoop]: Abstraction has 206707 states and 309476 transitions. [2019-09-08 09:37:40,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:37:40,747 INFO L276 IsEmpty]: Start isEmpty. Operand 206707 states and 309476 transitions. [2019-09-08 09:37:40,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 09:37:40,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:37:40,752 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:37:40,752 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:37:40,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:37:40,753 INFO L82 PathProgramCache]: Analyzing trace with hash -229277515, now seen corresponding path program 1 times [2019-09-08 09:37:40,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:37:40,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:37:40,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:37:40,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:37:40,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:37:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:37:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 09:37:40,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:37:40,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:37:40,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:37:40,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:37:40,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:37:40,817 INFO L87 Difference]: Start difference. First operand 206707 states and 309476 transitions. Second operand 3 states. [2019-09-08 09:38:12,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:12,712 INFO L93 Difference]: Finished difference Result 605008 states and 905053 transitions. [2019-09-08 09:38:12,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:38:12,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-08 09:38:12,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:13,471 INFO L225 Difference]: With dead ends: 605008 [2019-09-08 09:38:13,471 INFO L226 Difference]: Without dead ends: 398713 [2019-09-08 09:38:13,663 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 09:38:13,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398713 states. [2019-09-08 09:38:48,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398713 to 398711. [2019-09-08 09:38:48,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398711 states. [2019-09-08 09:38:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398711 states to 398711 states and 591206 transitions. [2019-09-08 09:38:49,200 INFO L78 Accepts]: Start accepts. Automaton has 398711 states and 591206 transitions. Word has length 108 [2019-09-08 09:38:49,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:49,200 INFO L475 AbstractCegarLoop]: Abstraction has 398711 states and 591206 transitions. [2019-09-08 09:38:49,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:38:49,200 INFO L276 IsEmpty]: Start isEmpty. Operand 398711 states and 591206 transitions. [2019-09-08 09:38:49,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 09:38:49,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:49,208 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:38:49,209 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:49,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:49,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1206084882, now seen corresponding path program 1 times [2019-09-08 09:38:49,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:49,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:49,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:49,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:49,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:49,300 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 09:38:49,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:49,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:38:49,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:38:49,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:38:49,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:38:49,301 INFO L87 Difference]: Start difference. First operand 398711 states and 591206 transitions. Second operand 4 states. [2019-09-08 09:39:17,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:17,866 INFO L93 Difference]: Finished difference Result 641520 states and 950239 transitions. [2019-09-08 09:39:17,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:39:17,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-08 09:39:17,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:18,454 INFO L225 Difference]: With dead ends: 641520 [2019-09-08 09:39:18,454 INFO L226 Difference]: Without dead ends: 323778 [2019-09-08 09:39:18,683 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 09:39:18,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323778 states. [2019-09-08 09:39:56,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323778 to 323778. [2019-09-08 09:39:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323778 states. [2019-09-08 09:39:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323778 states to 323778 states and 478806 transitions. [2019-09-08 09:39:56,820 INFO L78 Accepts]: Start accepts. Automaton has 323778 states and 478806 transitions. Word has length 108 [2019-09-08 09:39:56,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:56,821 INFO L475 AbstractCegarLoop]: Abstraction has 323778 states and 478806 transitions. [2019-09-08 09:39:56,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:39:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 323778 states and 478806 transitions. [2019-09-08 09:39:56,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 09:39:56,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:56,828 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:56,828 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:56,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:56,828 INFO L82 PathProgramCache]: Analyzing trace with hash 2089837102, now seen corresponding path program 1 times [2019-09-08 09:39:56,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:56,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:56,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:56,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:56,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 09:39:56,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:56,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:39:56,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:39:56,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:39:56,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:39:56,873 INFO L87 Difference]: Start difference. First operand 323778 states and 478806 transitions. Second operand 3 states. [2019-09-08 09:40:52,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:52,422 INFO L93 Difference]: Finished difference Result 965982 states and 1426817 transitions. [2019-09-08 09:40:52,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:52,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-08 09:40:52,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:53,700 INFO L225 Difference]: With dead ends: 965982 [2019-09-08 09:40:53,701 INFO L226 Difference]: Without dead ends: 643023 [2019-09-08 09:40:54,038 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 09:40:54,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643023 states. [2019-09-08 09:42:02,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643023 to 643021. [2019-09-08 09:42:02,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643021 states. [2019-09-08 09:42:04,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643021 states to 643021 states and 945170 transitions. [2019-09-08 09:42:04,789 INFO L78 Accepts]: Start accepts. Automaton has 643021 states and 945170 transitions. Word has length 110 [2019-09-08 09:42:04,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:04,789 INFO L475 AbstractCegarLoop]: Abstraction has 643021 states and 945170 transitions. [2019-09-08 09:42:04,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:42:04,789 INFO L276 IsEmpty]: Start isEmpty. Operand 643021 states and 945170 transitions. [2019-09-08 09:42:04,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 09:42:04,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:04,800 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:04,800 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:04,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:04,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1973856727, now seen corresponding path program 1 times [2019-09-08 09:42:04,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:04,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:04,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:04,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:04,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:04,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 09:42:04,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:04,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:42:04,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:42:04,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:42:04,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:42:04,915 INFO L87 Difference]: Start difference. First operand 643021 states and 945170 transitions. Second operand 4 states. [2019-09-08 09:44:06,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:06,577 INFO L93 Difference]: Finished difference Result 1882502 states and 2763097 transitions. [2019-09-08 09:44:06,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:44:06,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-08 09:44:06,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:09,057 INFO L225 Difference]: With dead ends: 1882502 [2019-09-08 09:44:09,058 INFO L226 Difference]: Without dead ends: 1239524 [2019-09-08 09:44:09,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 09:44:10,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239524 states.