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.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:30:33,079 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:30:33,082 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:30:33,100 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:30:33,101 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:30:33,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:30:33,104 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:30:33,118 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:30:33,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:30:33,121 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:30:33,123 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:30:33,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:30:33,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:30:33,128 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:30:33,129 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:30:33,130 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:30:33,131 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:30:33,132 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:30:33,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:30:33,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:30:33,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:30:33,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:30:33,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:30:33,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:30:33,154 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:30:33,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:30:33,154 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:30:33,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:30:33,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:30:33,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:30:33,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:30:33,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:30:33,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:30:33,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:30:33,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:30:33,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:30:33,165 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:30:33,165 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:30:33,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:30:33,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:30:33,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:30:33,170 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:30:33,193 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:30:33,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:30:33,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:30:33,196 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:30:33,196 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:30:33,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:30:33,196 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:30:33,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:30:33,197 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:30:33,197 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:30:33,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:30:33,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:30:33,198 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:30:33,199 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:30:33,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:30:33,199 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:30:33,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:30:33,199 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:30:33,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:30:33,200 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:30:33,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:30:33,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:30:33,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:30:33,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:30:33,201 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:30:33,201 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:30:33,201 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:30:33,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:30:33,202 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:30:33,252 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:30:33,266 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:30:33,270 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:30:33,273 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:30:33,273 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:30:33,274 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.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:30:33,336 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dc635b1b/82b57d4817db413d9878b1fbf7c9d474/FLAGd3eca5621 [2019-09-08 09:30:33,819 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:30:33,820 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:30:33,834 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dc635b1b/82b57d4817db413d9878b1fbf7c9d474/FLAGd3eca5621 [2019-09-08 09:30:34,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dc635b1b/82b57d4817db413d9878b1fbf7c9d474 [2019-09-08 09:30:34,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:30:34,164 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:30:34,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:30:34,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:30:34,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:30:34,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:30:34" (1/1) ... [2019-09-08 09:30:34,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2cf39a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:30:34, skipping insertion in model container [2019-09-08 09:30:34,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:30:34" (1/1) ... [2019-09-08 09:30:34,180 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:30:34,235 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:30:34,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:30:34,627 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:30:34,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:30:34,726 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:30:34,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:30:34 WrapperNode [2019-09-08 09:30:34,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:30:34,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:30:34,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:30:34,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:30:34,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:30:34" (1/1) ... [2019-09-08 09:30:34,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:30:34" (1/1) ... [2019-09-08 09:30:34,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:30:34" (1/1) ... [2019-09-08 09:30:34,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:30:34" (1/1) ... [2019-09-08 09:30:34,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:30:34" (1/1) ... [2019-09-08 09:30:34,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:30:34" (1/1) ... [2019-09-08 09:30:34,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:30:34" (1/1) ... [2019-09-08 09:30:34,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:30:34,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:30:34,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:30:34,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:30:34,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:30:34" (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:30:34,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:30:34,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:30:34,845 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:30:34,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:30:34,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:30:34,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 09:30:34,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:30:34,846 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:30:34,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:30:34,846 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:30:34,846 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:30:34,846 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:30:34,847 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:30:34,847 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:30:34,847 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:30:34,847 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:30:34,847 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:30:34,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:30:34,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:30:35,697 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:30:35,698 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:30:35,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:30:35 BoogieIcfgContainer [2019-09-08 09:30:35,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:30:35,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:30:35,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:30:35,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:30:35,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:30:34" (1/3) ... [2019-09-08 09:30:35,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156d5654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:30:35, skipping insertion in model container [2019-09-08 09:30:35,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:30:34" (2/3) ... [2019-09-08 09:30:35,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156d5654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:30:35, skipping insertion in model container [2019-09-08 09:30:35,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:30:35" (3/3) ... [2019-09-08 09:30:35,707 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:30:35,716 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:30:35,724 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:30:35,741 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:30:35,768 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:30:35,769 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:30:35,769 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:30:35,769 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:30:35,770 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:30:35,770 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:30:35,770 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:30:35,770 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:30:35,770 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:30:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-09-08 09:30:35,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 09:30:35,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:35,799 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:30:35,801 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:35,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:35,806 INFO L82 PathProgramCache]: Analyzing trace with hash -940649787, now seen corresponding path program 1 times [2019-09-08 09:30:35,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:35,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:35,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:35,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:35,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:36,281 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:30:36,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:36,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:30:36,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:30:36,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:30:36,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:30:36,310 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 3 states. [2019-09-08 09:30:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:36,450 INFO L93 Difference]: Finished difference Result 310 states and 519 transitions. [2019-09-08 09:30:36,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:30:36,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 09:30:36,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:36,464 INFO L225 Difference]: With dead ends: 310 [2019-09-08 09:30:36,464 INFO L226 Difference]: Without dead ends: 215 [2019-09-08 09:30:36,468 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:30:36,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-08 09:30:36,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2019-09-08 09:30:36,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-08 09:30:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 331 transitions. [2019-09-08 09:30:36,531 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 331 transitions. Word has length 60 [2019-09-08 09:30:36,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:36,532 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 331 transitions. [2019-09-08 09:30:36,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:30:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 331 transitions. [2019-09-08 09:30:36,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 09:30:36,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:36,536 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:30:36,536 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:36,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:36,537 INFO L82 PathProgramCache]: Analyzing trace with hash -662873070, now seen corresponding path program 1 times [2019-09-08 09:30:36,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:36,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:36,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:36,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:36,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:36,683 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:30:36,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:36,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:30:36,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:30:36,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:30:36,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:30:36,687 INFO L87 Difference]: Start difference. First operand 212 states and 331 transitions. Second operand 3 states. [2019-09-08 09:30:36,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:36,753 INFO L93 Difference]: Finished difference Result 506 states and 815 transitions. [2019-09-08 09:30:36,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:30:36,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-08 09:30:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:36,763 INFO L225 Difference]: With dead ends: 506 [2019-09-08 09:30:36,763 INFO L226 Difference]: Without dead ends: 352 [2019-09-08 09:30:36,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:30:36,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-08 09:30:36,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 348. [2019-09-08 09:30:36,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-09-08 09:30:36,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 553 transitions. [2019-09-08 09:30:36,831 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 553 transitions. Word has length 62 [2019-09-08 09:30:36,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:36,835 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 553 transitions. [2019-09-08 09:30:36,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:30:36,835 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 553 transitions. [2019-09-08 09:30:36,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 09:30:36,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:36,841 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:30:36,842 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:36,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:36,842 INFO L82 PathProgramCache]: Analyzing trace with hash 443916901, now seen corresponding path program 1 times [2019-09-08 09:30:36,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:36,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:36,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:36,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:36,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:36,984 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:30:36,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:36,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:30:36,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:30:36,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:30:36,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:30:36,987 INFO L87 Difference]: Start difference. First operand 348 states and 553 transitions. Second operand 3 states. [2019-09-08 09:30:37,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:37,064 INFO L93 Difference]: Finished difference Result 900 states and 1455 transitions. [2019-09-08 09:30:37,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:30:37,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-08 09:30:37,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:37,069 INFO L225 Difference]: With dead ends: 900 [2019-09-08 09:30:37,069 INFO L226 Difference]: Without dead ends: 610 [2019-09-08 09:30:37,071 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:30:37,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-09-08 09:30:37,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 604. [2019-09-08 09:30:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-09-08 09:30:37,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 965 transitions. [2019-09-08 09:30:37,109 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 965 transitions. Word has length 64 [2019-09-08 09:30:37,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:37,110 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 965 transitions. [2019-09-08 09:30:37,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:30:37,110 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 965 transitions. [2019-09-08 09:30:37,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 09:30:37,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:37,113 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:30:37,113 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:37,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:37,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1638426254, now seen corresponding path program 1 times [2019-09-08 09:30:37,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:37,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:37,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:37,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:37,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:37,260 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:30:37,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:37,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:30:37,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:30:37,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:30:37,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:30:37,263 INFO L87 Difference]: Start difference. First operand 604 states and 965 transitions. Second operand 5 states. [2019-09-08 09:30:37,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:37,490 INFO L93 Difference]: Finished difference Result 2298 states and 3758 transitions. [2019-09-08 09:30:37,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:30:37,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-08 09:30:37,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:37,500 INFO L225 Difference]: With dead ends: 2298 [2019-09-08 09:30:37,500 INFO L226 Difference]: Without dead ends: 1752 [2019-09-08 09:30:37,502 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:30:37,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2019-09-08 09:30:37,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1308. [2019-09-08 09:30:37,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2019-09-08 09:30:37,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 2128 transitions. [2019-09-08 09:30:37,575 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 2128 transitions. Word has length 66 [2019-09-08 09:30:37,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:37,575 INFO L475 AbstractCegarLoop]: Abstraction has 1308 states and 2128 transitions. [2019-09-08 09:30:37,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:30:37,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 2128 transitions. [2019-09-08 09:30:37,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 09:30:37,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:37,578 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:30:37,578 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:37,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:37,579 INFO L82 PathProgramCache]: Analyzing trace with hash 686783218, now seen corresponding path program 1 times [2019-09-08 09:30:37,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:37,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:37,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:37,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:37,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:37,663 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:30:37,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:37,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:30:37,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:30:37,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:30:37,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:30:37,665 INFO L87 Difference]: Start difference. First operand 1308 states and 2128 transitions. Second operand 4 states. [2019-09-08 09:30:37,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:37,812 INFO L93 Difference]: Finished difference Result 3081 states and 5051 transitions. [2019-09-08 09:30:37,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:30:37,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-08 09:30:37,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:37,822 INFO L225 Difference]: With dead ends: 3081 [2019-09-08 09:30:37,823 INFO L226 Difference]: Without dead ends: 1831 [2019-09-08 09:30:37,826 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:30:37,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2019-09-08 09:30:37,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1820. [2019-09-08 09:30:37,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1820 states. [2019-09-08 09:30:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 2969 transitions. [2019-09-08 09:30:37,942 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 2969 transitions. Word has length 67 [2019-09-08 09:30:37,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:37,943 INFO L475 AbstractCegarLoop]: Abstraction has 1820 states and 2969 transitions. [2019-09-08 09:30:37,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:30:37,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2969 transitions. [2019-09-08 09:30:37,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 09:30:37,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:37,946 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:30:37,946 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:37,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:37,947 INFO L82 PathProgramCache]: Analyzing trace with hash -241609159, now seen corresponding path program 1 times [2019-09-08 09:30:37,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:37,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:37,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:37,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:37,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:38,095 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:30:38,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:38,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 09:30:38,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 09:30:38,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 09:30:38,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:30:38,097 INFO L87 Difference]: Start difference. First operand 1820 states and 2969 transitions. Second operand 7 states. [2019-09-08 09:30:38,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:38,544 INFO L93 Difference]: Finished difference Result 6718 states and 10957 transitions. [2019-09-08 09:30:38,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 09:30:38,545 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-09-08 09:30:38,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:38,569 INFO L225 Difference]: With dead ends: 6718 [2019-09-08 09:30:38,570 INFO L226 Difference]: Without dead ends: 4956 [2019-09-08 09:30:38,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-09-08 09:30:38,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4956 states. [2019-09-08 09:30:38,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4956 to 4821. [2019-09-08 09:30:38,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4821 states. [2019-09-08 09:30:38,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4821 states to 4821 states and 7832 transitions. [2019-09-08 09:30:38,874 INFO L78 Accepts]: Start accepts. Automaton has 4821 states and 7832 transitions. Word has length 68 [2019-09-08 09:30:38,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:38,876 INFO L475 AbstractCegarLoop]: Abstraction has 4821 states and 7832 transitions. [2019-09-08 09:30:38,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 09:30:38,877 INFO L276 IsEmpty]: Start isEmpty. Operand 4821 states and 7832 transitions. [2019-09-08 09:30:38,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 09:30:38,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:38,879 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:30:38,879 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:38,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:38,880 INFO L82 PathProgramCache]: Analyzing trace with hash 464144953, now seen corresponding path program 1 times [2019-09-08 09:30:38,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:38,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:38,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:38,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:38,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:38,952 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:30:38,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:38,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:30:38,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:30:38,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:30:38,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:30:38,955 INFO L87 Difference]: Start difference. First operand 4821 states and 7832 transitions. Second operand 3 states. [2019-09-08 09:30:39,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:39,337 INFO L93 Difference]: Finished difference Result 10226 states and 16648 transitions. [2019-09-08 09:30:39,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:30:39,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-08 09:30:39,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:39,371 INFO L225 Difference]: With dead ends: 10226 [2019-09-08 09:30:39,371 INFO L226 Difference]: Without dead ends: 7000 [2019-09-08 09:30:39,379 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:30:39,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7000 states. [2019-09-08 09:30:39,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7000 to 6998. [2019-09-08 09:30:39,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6998 states. [2019-09-08 09:30:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6998 states to 6998 states and 11318 transitions. [2019-09-08 09:30:39,759 INFO L78 Accepts]: Start accepts. Automaton has 6998 states and 11318 transitions. Word has length 69 [2019-09-08 09:30:39,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:39,759 INFO L475 AbstractCegarLoop]: Abstraction has 6998 states and 11318 transitions. [2019-09-08 09:30:39,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:30:39,760 INFO L276 IsEmpty]: Start isEmpty. Operand 6998 states and 11318 transitions. [2019-09-08 09:30:39,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 09:30:39,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:39,761 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:30:39,761 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:39,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:39,762 INFO L82 PathProgramCache]: Analyzing trace with hash -2123298740, now seen corresponding path program 1 times [2019-09-08 09:30:39,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:39,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:39,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:39,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:39,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:39,833 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:30:39,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:39,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:30:39,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:30:39,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:30:39,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:30:39,836 INFO L87 Difference]: Start difference. First operand 6998 states and 11318 transitions. Second operand 3 states. [2019-09-08 09:30:40,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:40,176 INFO L93 Difference]: Finished difference Result 13444 states and 21859 transitions. [2019-09-08 09:30:40,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:30:40,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-08 09:30:40,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:40,233 INFO L225 Difference]: With dead ends: 13444 [2019-09-08 09:30:40,234 INFO L226 Difference]: Without dead ends: 9390 [2019-09-08 09:30:40,245 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:30:40,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9390 states. [2019-09-08 09:30:40,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9390 to 9388. [2019-09-08 09:30:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9388 states. [2019-09-08 09:30:40,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9388 states to 9388 states and 15146 transitions. [2019-09-08 09:30:40,740 INFO L78 Accepts]: Start accepts. Automaton has 9388 states and 15146 transitions. Word has length 69 [2019-09-08 09:30:40,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:40,740 INFO L475 AbstractCegarLoop]: Abstraction has 9388 states and 15146 transitions. [2019-09-08 09:30:40,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:30:40,741 INFO L276 IsEmpty]: Start isEmpty. Operand 9388 states and 15146 transitions. [2019-09-08 09:30:40,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 09:30:40,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:40,742 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:30:40,742 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:40,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:40,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1047556249, now seen corresponding path program 1 times [2019-09-08 09:30:40,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:40,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:40,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:40,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:40,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:40,810 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:30:40,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:40,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:30:40,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:30:40,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:30:40,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:30:40,812 INFO L87 Difference]: Start difference. First operand 9388 states and 15146 transitions. Second operand 4 states. [2019-09-08 09:30:41,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:41,774 INFO L93 Difference]: Finished difference Result 29249 states and 47406 transitions. [2019-09-08 09:30:41,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:30:41,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-08 09:30:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:41,817 INFO L225 Difference]: With dead ends: 29249 [2019-09-08 09:30:41,818 INFO L226 Difference]: Without dead ends: 20162 [2019-09-08 09:30:41,837 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:30:41,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20162 states. [2019-09-08 09:30:42,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20162 to 14722. [2019-09-08 09:30:42,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14722 states. [2019-09-08 09:30:42,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14722 states to 14722 states and 23738 transitions. [2019-09-08 09:30:42,640 INFO L78 Accepts]: Start accepts. Automaton has 14722 states and 23738 transitions. Word has length 69 [2019-09-08 09:30:42,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:42,640 INFO L475 AbstractCegarLoop]: Abstraction has 14722 states and 23738 transitions. [2019-09-08 09:30:42,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:30:42,640 INFO L276 IsEmpty]: Start isEmpty. Operand 14722 states and 23738 transitions. [2019-09-08 09:30:42,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 09:30:42,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:42,641 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:30:42,642 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:42,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:42,642 INFO L82 PathProgramCache]: Analyzing trace with hash 233645337, now seen corresponding path program 1 times [2019-09-08 09:30:42,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:42,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:42,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:42,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:42,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:42,692 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:30:42,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:42,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:30:42,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:30:42,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:30:42,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:30:42,693 INFO L87 Difference]: Start difference. First operand 14722 states and 23738 transitions. Second operand 3 states. [2019-09-08 09:30:43,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:43,874 INFO L93 Difference]: Finished difference Result 31988 states and 52085 transitions. [2019-09-08 09:30:43,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:30:43,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-08 09:30:43,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:43,921 INFO L225 Difference]: With dead ends: 31988 [2019-09-08 09:30:43,921 INFO L226 Difference]: Without dead ends: 21110 [2019-09-08 09:30:43,943 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:30:43,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21110 states. [2019-09-08 09:30:44,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21110 to 21108. [2019-09-08 09:30:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21108 states. [2019-09-08 09:30:44,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21108 states to 21108 states and 34019 transitions. [2019-09-08 09:30:44,904 INFO L78 Accepts]: Start accepts. Automaton has 21108 states and 34019 transitions. Word has length 69 [2019-09-08 09:30:44,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:44,904 INFO L475 AbstractCegarLoop]: Abstraction has 21108 states and 34019 transitions. [2019-09-08 09:30:44,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:30:44,904 INFO L276 IsEmpty]: Start isEmpty. Operand 21108 states and 34019 transitions. [2019-09-08 09:30:44,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 09:30:44,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:44,905 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:30:44,906 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:44,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:44,906 INFO L82 PathProgramCache]: Analyzing trace with hash 189572521, now seen corresponding path program 1 times [2019-09-08 09:30:44,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:44,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:44,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:44,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:44,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:45,023 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:30:45,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:45,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:30:45,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:30:45,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:30:45,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:30:45,025 INFO L87 Difference]: Start difference. First operand 21108 states and 34019 transitions. Second operand 5 states. [2019-09-08 09:30:46,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:46,461 INFO L93 Difference]: Finished difference Result 53689 states and 86614 transitions. [2019-09-08 09:30:46,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:30:46,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 09:30:46,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:46,534 INFO L225 Difference]: With dead ends: 53689 [2019-09-08 09:30:46,534 INFO L226 Difference]: Without dead ends: 32666 [2019-09-08 09:30:46,575 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:30:46,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32666 states. [2019-09-08 09:30:48,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32666 to 30858. [2019-09-08 09:30:48,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30858 states. [2019-09-08 09:30:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30858 states to 30858 states and 49584 transitions. [2019-09-08 09:30:48,740 INFO L78 Accepts]: Start accepts. Automaton has 30858 states and 49584 transitions. Word has length 71 [2019-09-08 09:30:48,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:48,741 INFO L475 AbstractCegarLoop]: Abstraction has 30858 states and 49584 transitions. [2019-09-08 09:30:48,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:30:48,741 INFO L276 IsEmpty]: Start isEmpty. Operand 30858 states and 49584 transitions. [2019-09-08 09:30:48,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 09:30:48,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:48,742 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:30:48,742 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:48,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:48,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1918442634, now seen corresponding path program 1 times [2019-09-08 09:30:48,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:48,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:48,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:48,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:48,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:48,874 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:30:48,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:48,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:30:48,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:30:48,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:30:48,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:30:48,876 INFO L87 Difference]: Start difference. First operand 30858 states and 49584 transitions. Second operand 5 states. [2019-09-08 09:30:51,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:51,005 INFO L93 Difference]: Finished difference Result 86132 states and 138648 transitions. [2019-09-08 09:30:51,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:30:51,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-09-08 09:30:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:51,096 INFO L225 Difference]: With dead ends: 86132 [2019-09-08 09:30:51,097 INFO L226 Difference]: Without dead ends: 55359 [2019-09-08 09:30:51,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 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:30:51,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55359 states. [2019-09-08 09:30:54,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55359 to 55357. [2019-09-08 09:30:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55357 states. [2019-09-08 09:30:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55357 states to 55357 states and 88439 transitions. [2019-09-08 09:30:54,146 INFO L78 Accepts]: Start accepts. Automaton has 55357 states and 88439 transitions. Word has length 74 [2019-09-08 09:30:54,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:54,146 INFO L475 AbstractCegarLoop]: Abstraction has 55357 states and 88439 transitions. [2019-09-08 09:30:54,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:30:54,146 INFO L276 IsEmpty]: Start isEmpty. Operand 55357 states and 88439 transitions. [2019-09-08 09:30:54,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 09:30:54,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:54,147 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:30:54,147 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:54,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:54,147 INFO L82 PathProgramCache]: Analyzing trace with hash -659729786, now seen corresponding path program 1 times [2019-09-08 09:30:54,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:54,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:54,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:54,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:54,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:54,229 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:30:54,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:54,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:30:54,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:30:54,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:30:54,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:30:54,231 INFO L87 Difference]: Start difference. First operand 55357 states and 88439 transitions. Second operand 5 states. [2019-09-08 09:30:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:58,517 INFO L93 Difference]: Finished difference Result 95256 states and 151358 transitions. [2019-09-08 09:30:58,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:30:58,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-08 09:30:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:58,645 INFO L225 Difference]: With dead ends: 95256 [2019-09-08 09:30:58,645 INFO L226 Difference]: Without dead ends: 95254 [2019-09-08 09:30:58,670 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:30:58,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95254 states. [2019-09-08 09:31:01,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95254 to 56769. [2019-09-08 09:31:01,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56769 states. [2019-09-08 09:31:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56769 states to 56769 states and 89836 transitions. [2019-09-08 09:31:01,169 INFO L78 Accepts]: Start accepts. Automaton has 56769 states and 89836 transitions. Word has length 75 [2019-09-08 09:31:01,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:01,169 INFO L475 AbstractCegarLoop]: Abstraction has 56769 states and 89836 transitions. [2019-09-08 09:31:01,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:31:01,169 INFO L276 IsEmpty]: Start isEmpty. Operand 56769 states and 89836 transitions. [2019-09-08 09:31:01,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 09:31:01,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:01,171 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:31:01,172 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:01,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:01,172 INFO L82 PathProgramCache]: Analyzing trace with hash -242897637, now seen corresponding path program 1 times [2019-09-08 09:31:01,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:01,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:01,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:01,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:01,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:01,239 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:31:01,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:01,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:31:01,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:31:01,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:31:01,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:31:01,241 INFO L87 Difference]: Start difference. First operand 56769 states and 89836 transitions. Second operand 3 states. [2019-09-08 09:31:03,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:31:03,301 INFO L93 Difference]: Finished difference Result 103482 states and 164428 transitions. [2019-09-08 09:31:03,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:31:03,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 09:31:03,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:31:03,365 INFO L225 Difference]: With dead ends: 103482 [2019-09-08 09:31:03,365 INFO L226 Difference]: Without dead ends: 46798 [2019-09-08 09:31:03,426 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:31:03,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46798 states. [2019-09-08 09:31:06,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46798 to 46796. [2019-09-08 09:31:06,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46796 states. [2019-09-08 09:31:06,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46796 states to 46796 states and 74220 transitions. [2019-09-08 09:31:06,872 INFO L78 Accepts]: Start accepts. Automaton has 46796 states and 74220 transitions. Word has length 97 [2019-09-08 09:31:06,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:06,872 INFO L475 AbstractCegarLoop]: Abstraction has 46796 states and 74220 transitions. [2019-09-08 09:31:06,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:31:06,872 INFO L276 IsEmpty]: Start isEmpty. Operand 46796 states and 74220 transitions. [2019-09-08 09:31:06,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 09:31:06,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:06,875 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:31:06,875 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:06,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:06,875 INFO L82 PathProgramCache]: Analyzing trace with hash -473397253, now seen corresponding path program 1 times [2019-09-08 09:31:06,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:06,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:06,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:06,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:06,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:06,931 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 09:31:06,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:06,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:31:06,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:31:06,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:31:06,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:31:06,933 INFO L87 Difference]: Start difference. First operand 46796 states and 74220 transitions. Second operand 3 states. [2019-09-08 09:31:10,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:31:10,433 INFO L93 Difference]: Finished difference Result 98252 states and 155987 transitions. [2019-09-08 09:31:10,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:31:10,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 09:31:10,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:31:10,543 INFO L225 Difference]: With dead ends: 98252 [2019-09-08 09:31:10,543 INFO L226 Difference]: Without dead ends: 93480 [2019-09-08 09:31:10,565 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:31:10,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93480 states. [2019-09-08 09:31:14,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93480 to 93354. [2019-09-08 09:31:14,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93354 states. [2019-09-08 09:31:14,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93354 states to 93354 states and 147895 transitions. [2019-09-08 09:31:14,377 INFO L78 Accepts]: Start accepts. Automaton has 93354 states and 147895 transitions. Word has length 97 [2019-09-08 09:31:14,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:14,377 INFO L475 AbstractCegarLoop]: Abstraction has 93354 states and 147895 transitions. [2019-09-08 09:31:14,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:31:14,377 INFO L276 IsEmpty]: Start isEmpty. Operand 93354 states and 147895 transitions. [2019-09-08 09:31:14,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 09:31:14,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:14,379 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, 1] [2019-09-08 09:31:14,380 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:14,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:14,380 INFO L82 PathProgramCache]: Analyzing trace with hash 390120194, now seen corresponding path program 1 times [2019-09-08 09:31:14,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:14,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:14,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:14,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:14,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:14,435 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:31:14,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:14,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:31:14,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:31:14,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:31:14,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:31:14,439 INFO L87 Difference]: Start difference. First operand 93354 states and 147895 transitions. Second operand 3 states. [2019-09-08 09:31:23,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:31:23,225 INFO L93 Difference]: Finished difference Result 274440 states and 434779 transitions. [2019-09-08 09:31:23,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:31:23,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-08 09:31:23,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:31:23,479 INFO L225 Difference]: With dead ends: 274440 [2019-09-08 09:31:23,480 INFO L226 Difference]: Without dead ends: 181173 [2019-09-08 09:31:23,557 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:31:23,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181173 states. [2019-09-08 09:31:34,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181173 to 181171. [2019-09-08 09:31:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181171 states. [2019-09-08 09:31:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181171 states to 181171 states and 284894 transitions. [2019-09-08 09:31:34,402 INFO L78 Accepts]: Start accepts. Automaton has 181171 states and 284894 transitions. Word has length 98 [2019-09-08 09:31:34,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:34,403 INFO L475 AbstractCegarLoop]: Abstraction has 181171 states and 284894 transitions. [2019-09-08 09:31:34,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:31:34,403 INFO L276 IsEmpty]: Start isEmpty. Operand 181171 states and 284894 transitions. [2019-09-08 09:31:34,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 09:31:34,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:34,405 INFO L399 BasicCegarLoop]: trace histogram [2, 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] [2019-09-08 09:31:34,405 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:34,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:34,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1614999632, now seen corresponding path program 1 times [2019-09-08 09:31:34,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:34,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:34,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:34,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:34,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:34,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:31:34,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:34,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:31:34,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:31:34,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:31:34,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:31:34,919 INFO L87 Difference]: Start difference. First operand 181171 states and 284894 transitions. Second operand 3 states. [2019-09-08 09:31:38,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:31:38,908 INFO L93 Difference]: Finished difference Result 260985 states and 410748 transitions. [2019-09-08 09:31:38,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:31:38,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-08 09:31:38,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:31:39,018 INFO L225 Difference]: With dead ends: 260985 [2019-09-08 09:31:39,019 INFO L226 Difference]: Without dead ends: 80017 [2019-09-08 09:31:39,139 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:31:39,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80017 states. [2019-09-08 09:31:46,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80017 to 80015. [2019-09-08 09:31:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80015 states. [2019-09-08 09:31:46,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80015 states to 80015 states and 125240 transitions. [2019-09-08 09:31:46,126 INFO L78 Accepts]: Start accepts. Automaton has 80015 states and 125240 transitions. Word has length 98 [2019-09-08 09:31:46,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:46,127 INFO L475 AbstractCegarLoop]: Abstraction has 80015 states and 125240 transitions. [2019-09-08 09:31:46,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:31:46,127 INFO L276 IsEmpty]: Start isEmpty. Operand 80015 states and 125240 transitions. [2019-09-08 09:31:46,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 09:31:46,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:46,130 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:31:46,130 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:46,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:46,130 INFO L82 PathProgramCache]: Analyzing trace with hash -680214214, now seen corresponding path program 1 times [2019-09-08 09:31:46,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:46,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:46,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:46,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:46,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:46,232 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 09:31:46,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:46,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:31:46,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:31:46,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:31:46,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:31:46,233 INFO L87 Difference]: Start difference. First operand 80015 states and 125240 transitions. Second operand 5 states. [2019-09-08 09:31:50,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:31:50,879 INFO L93 Difference]: Finished difference Result 155937 states and 244668 transitions. [2019-09-08 09:31:50,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:31:50,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 09:31:50,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:31:51,003 INFO L225 Difference]: With dead ends: 155937 [2019-09-08 09:31:51,004 INFO L226 Difference]: Without dead ends: 101695 [2019-09-08 09:31:51,047 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:31:51,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101695 states. [2019-09-08 09:31:56,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101695 to 100953. [2019-09-08 09:31:56,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100953 states. [2019-09-08 09:31:56,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100953 states to 100953 states and 157862 transitions. [2019-09-08 09:31:56,244 INFO L78 Accepts]: Start accepts. Automaton has 100953 states and 157862 transitions. Word has length 99 [2019-09-08 09:31:56,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:56,245 INFO L475 AbstractCegarLoop]: Abstraction has 100953 states and 157862 transitions. [2019-09-08 09:31:56,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:31:56,245 INFO L276 IsEmpty]: Start isEmpty. Operand 100953 states and 157862 transitions. [2019-09-08 09:31:56,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 09:31:56,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:56,247 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:31:56,247 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:56,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:56,247 INFO L82 PathProgramCache]: Analyzing trace with hash -317647174, now seen corresponding path program 1 times [2019-09-08 09:31:56,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:56,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:56,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:56,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:56,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:56,332 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:31:56,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:31:56,333 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) [2019-09-08 09:31:56,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 09:31:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:56,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 09:31:56,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:31:56,535 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:31:56,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:31:56,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2019-09-08 09:31:56,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 09:31:56,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 09:31:56,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:31:56,547 INFO L87 Difference]: Start difference. First operand 100953 states and 157862 transitions. Second operand 7 states. [2019-09-08 09:32:04,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:04,898 INFO L93 Difference]: Finished difference Result 187011 states and 294056 transitions. [2019-09-08 09:32:04,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 09:32:04,899 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-09-08 09:32:04,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:05,302 INFO L225 Difference]: With dead ends: 187011 [2019-09-08 09:32:05,302 INFO L226 Difference]: Without dead ends: 132303 [2019-09-08 09:32:05,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-08 09:32:05,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132303 states. [2019-09-08 09:32:10,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132303 to 85793. [2019-09-08 09:32:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85793 states. [2019-09-08 09:32:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85793 states to 85793 states and 134438 transitions. [2019-09-08 09:32:10,803 INFO L78 Accepts]: Start accepts. Automaton has 85793 states and 134438 transitions. Word has length 100 [2019-09-08 09:32:10,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:10,803 INFO L475 AbstractCegarLoop]: Abstraction has 85793 states and 134438 transitions. [2019-09-08 09:32:10,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 09:32:10,804 INFO L276 IsEmpty]: Start isEmpty. Operand 85793 states and 134438 transitions. [2019-09-08 09:32:10,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 09:32:10,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:10,807 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:32:10,807 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:10,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:10,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1540255698, now seen corresponding path program 1 times [2019-09-08 09:32:10,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:10,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:10,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:10,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:10,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:10,878 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:32:10,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:10,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:32:10,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:32:10,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:32:10,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:32:10,879 INFO L87 Difference]: Start difference. First operand 85793 states and 134438 transitions. Second operand 3 states. [2019-09-08 09:32:20,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:20,997 INFO L93 Difference]: Finished difference Result 252574 states and 395665 transitions. [2019-09-08 09:32:20,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:32:20,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-08 09:32:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:21,391 INFO L225 Difference]: With dead ends: 252574 [2019-09-08 09:32:21,391 INFO L226 Difference]: Without dead ends: 166912 [2019-09-08 09:32:21,506 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:32:21,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166912 states. [2019-09-08 09:32:30,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166912 to 164376. [2019-09-08 09:32:30,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164376 states. [2019-09-08 09:32:31,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164376 states to 164376 states and 255632 transitions. [2019-09-08 09:32:31,032 INFO L78 Accepts]: Start accepts. Automaton has 164376 states and 255632 transitions. Word has length 100 [2019-09-08 09:32:31,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:31,033 INFO L475 AbstractCegarLoop]: Abstraction has 164376 states and 255632 transitions. [2019-09-08 09:32:31,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:32:31,033 INFO L276 IsEmpty]: Start isEmpty. Operand 164376 states and 255632 transitions. [2019-09-08 09:32:31,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 09:32:31,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:31,037 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:32:31,037 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:31,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:31,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1045071639, now seen corresponding path program 1 times [2019-09-08 09:32:31,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:31,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:31,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:31,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:31,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:31,114 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:32:31,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:32:31,115 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:32:31,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:31,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 09:32:31,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:32:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 09:32:31,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:32:31,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 09:32:31,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:32:31,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:32:31,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:32:31,332 INFO L87 Difference]: Start difference. First operand 164376 states and 255632 transitions. Second operand 8 states. [2019-09-08 09:32:46,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:46,746 INFO L93 Difference]: Finished difference Result 294000 states and 460340 transitions. [2019-09-08 09:32:46,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 09:32:46,746 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-09-08 09:32:46,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:47,167 INFO L225 Difference]: With dead ends: 294000 [2019-09-08 09:32:47,167 INFO L226 Difference]: Without dead ends: 232278 [2019-09-08 09:32:47,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-09-08 09:32:47,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232278 states. [2019-09-08 09:32:59,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232278 to 224808. [2019-09-08 09:32:59,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224808 states. [2019-09-08 09:32:59,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224808 states to 224808 states and 350620 transitions. [2019-09-08 09:32:59,373 INFO L78 Accepts]: Start accepts. Automaton has 224808 states and 350620 transitions. Word has length 101 [2019-09-08 09:32:59,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:59,373 INFO L475 AbstractCegarLoop]: Abstraction has 224808 states and 350620 transitions. [2019-09-08 09:32:59,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:32:59,373 INFO L276 IsEmpty]: Start isEmpty. Operand 224808 states and 350620 transitions. [2019-09-08 09:32:59,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 09:32:59,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:59,378 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:32:59,378 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:59,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:59,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1431539607, now seen corresponding path program 1 times [2019-09-08 09:32:59,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:59,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:59,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:59,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:59,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 09:32:59,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:59,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:32:59,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:32:59,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:32:59,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:32:59,439 INFO L87 Difference]: Start difference. First operand 224808 states and 350620 transitions. Second operand 3 states. [2019-09-08 09:33:23,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:33:23,911 INFO L93 Difference]: Finished difference Result 623739 states and 973957 transitions. [2019-09-08 09:33:23,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:33:23,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-08 09:33:23,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:33:24,649 INFO L225 Difference]: With dead ends: 623739 [2019-09-08 09:33:24,649 INFO L226 Difference]: Without dead ends: 407207 [2019-09-08 09:33:24,816 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:33:25,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407207 states. [2019-09-08 09:33:57,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407207 to 406097. [2019-09-08 09:33:57,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406097 states. [2019-09-08 09:33:57,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406097 states to 406097 states and 632997 transitions. [2019-09-08 09:33:57,865 INFO L78 Accepts]: Start accepts. Automaton has 406097 states and 632997 transitions. Word has length 101 [2019-09-08 09:33:57,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:33:57,865 INFO L475 AbstractCegarLoop]: Abstraction has 406097 states and 632997 transitions. [2019-09-08 09:33:57,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:33:57,865 INFO L276 IsEmpty]: Start isEmpty. Operand 406097 states and 632997 transitions. [2019-09-08 09:33:57,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 09:33:57,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:33:57,870 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:33:57,870 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:33:57,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:33:57,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1040913274, now seen corresponding path program 1 times [2019-09-08 09:33:57,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:33:57,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:33:57,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:33:57,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:33:57,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:33:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:33:57,931 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:33:57,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:33:57,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:33:57,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:33:57,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:33:57,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:33:57,933 INFO L87 Difference]: Start difference. First operand 406097 states and 632997 transitions. Second operand 3 states. [2019-09-08 09:34:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:34:53,003 INFO L93 Difference]: Finished difference Result 1193187 states and 1859173 transitions. [2019-09-08 09:34:53,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:34:53,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-08 09:34:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:34:54,315 INFO L225 Difference]: With dead ends: 1193187 [2019-09-08 09:34:54,315 INFO L226 Difference]: Without dead ends: 787375 [2019-09-08 09:34:54,639 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:34:55,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787375 states. [2019-09-08 09:35:59,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787375 to 787373. [2019-09-08 09:35:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787373 states. [2019-09-08 09:36:01,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787373 states to 787373 states and 1217011 transitions. [2019-09-08 09:36:01,463 INFO L78 Accepts]: Start accepts. Automaton has 787373 states and 1217011 transitions. Word has length 102 [2019-09-08 09:36:01,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:36:01,464 INFO L475 AbstractCegarLoop]: Abstraction has 787373 states and 1217011 transitions. [2019-09-08 09:36:01,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:36:01,464 INFO L276 IsEmpty]: Start isEmpty. Operand 787373 states and 1217011 transitions. [2019-09-08 09:36:01,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 09:36:01,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:36:01,471 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:36:01,471 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:36:01,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:36:01,472 INFO L82 PathProgramCache]: Analyzing trace with hash -381064316, now seen corresponding path program 1 times [2019-09-08 09:36:01,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:36:01,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:36:01,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:36:01,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:36:01,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:36:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:36:01,605 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:36:01,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:36:01,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:36:01,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:36:01,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:36:01,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:36:01,607 INFO L87 Difference]: Start difference. First operand 787373 states and 1217011 transitions. Second operand 4 states. [2019-09-08 09:38:04,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:04,118 INFO L93 Difference]: Finished difference Result 2317600 states and 3579803 transitions. [2019-09-08 09:38:15,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:38:15,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-08 09:38:15,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:18,874 INFO L225 Difference]: With dead ends: 2317600 [2019-09-08 09:38:18,874 INFO L226 Difference]: Without dead ends: 1530280 [2019-09-08 09:38:19,442 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:38:20,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530280 states.