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.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:26:55,129 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:26:55,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:26:55,143 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:26:55,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:26:55,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:26:55,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:26:55,147 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:26:55,149 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:26:55,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:26:55,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:26:55,154 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:26:55,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:26:55,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:26:55,159 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:26:55,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:26:55,162 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:26:55,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:26:55,170 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:26:55,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:26:55,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:26:55,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:26:55,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:26:55,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:26:55,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:26:55,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:26:55,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:26:55,185 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:26:55,186 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:26:55,187 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:26:55,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:26:55,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:26:55,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:26:55,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:26:55,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:26:55,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:26:55,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:26:55,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:26:55,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:26:55,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:26:55,198 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:26:55,199 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:26:55,222 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:26:55,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:26:55,224 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:26:55,224 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:26:55,224 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:26:55,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:26:55,225 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:26:55,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:26:55,225 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:26:55,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:26:55,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:26:55,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:26:55,227 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:26:55,228 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:26:55,228 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:26:55,228 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:26:55,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:26:55,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:26:55,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:26:55,229 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:26:55,229 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:26:55,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:26:55,230 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:26:55,230 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:26:55,230 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:26:55,231 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:26:55,231 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:26:55,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:26:55,231 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:26:55,280 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:26:55,297 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:26:55,300 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:26:55,302 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:26:55,303 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:26:55,304 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.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 09:26:55,375 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62f8efcc1/58aee7d2a75c45f0b77cd279856203a1/FLAG9fc97255b [2019-09-08 09:26:55,826 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:26:55,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 09:26:55,838 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62f8efcc1/58aee7d2a75c45f0b77cd279856203a1/FLAG9fc97255b [2019-09-08 09:26:56,225 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62f8efcc1/58aee7d2a75c45f0b77cd279856203a1 [2019-09-08 09:26:56,235 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:26:56,236 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:26:56,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:26:56,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:26:56,241 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:26:56,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:26:56" (1/1) ... [2019-09-08 09:26:56,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408566e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:26:56, skipping insertion in model container [2019-09-08 09:26:56,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:26:56" (1/1) ... [2019-09-08 09:26:56,252 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:26:56,305 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:26:56,657 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:26:56,671 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:26:56,776 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:26:56,810 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:26:56,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:26:56 WrapperNode [2019-09-08 09:26:56,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:26:56,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:26:56,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:26:56,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:26:56,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:26:56" (1/1) ... [2019-09-08 09:26:56,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:26:56" (1/1) ... [2019-09-08 09:26:56,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:26:56" (1/1) ... [2019-09-08 09:26:56,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:26:56" (1/1) ... [2019-09-08 09:26:56,845 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:26:56" (1/1) ... [2019-09-08 09:26:56,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:26:56" (1/1) ... [2019-09-08 09:26:56,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:26:56" (1/1) ... [2019-09-08 09:26:56,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:26:56,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:26:56,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:26:56,864 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:26:56,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:26:56" (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:26:56,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:26:56,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:26:56,915 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:26:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:26:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:26:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:26:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:26:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:26:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:26:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:26:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:26:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:26:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:26:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:26:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:26:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:26:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:26:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:26:57,682 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:26:57,683 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:26:57,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:26:57 BoogieIcfgContainer [2019-09-08 09:26:57,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:26:57,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:26:57,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:26:57,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:26:57,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:26:56" (1/3) ... [2019-09-08 09:26:57,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa80762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:26:57, skipping insertion in model container [2019-09-08 09:26:57,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:26:56" (2/3) ... [2019-09-08 09:26:57,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa80762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:26:57, skipping insertion in model container [2019-09-08 09:26:57,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:26:57" (3/3) ... [2019-09-08 09:26:57,695 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 09:26:57,704 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:26:57,712 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:26:57,728 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:26:57,758 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:26:57,759 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:26:57,759 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:26:57,760 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:26:57,760 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:26:57,760 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:26:57,760 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:26:57,760 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:26:57,761 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:26:57,781 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states. [2019-09-08 09:26:57,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 09:26:57,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:26:57,790 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] [2019-09-08 09:26:57,792 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:26:57,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:26:57,797 INFO L82 PathProgramCache]: Analyzing trace with hash -216024821, now seen corresponding path program 1 times [2019-09-08 09:26:57,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:26:57,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:26:57,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:26:57,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:26:57,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:26:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:26:58,240 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:26:58,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:26:58,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:26:58,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:26:58,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:26:58,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:26:58,265 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 3 states. [2019-09-08 09:26:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:26:58,406 INFO L93 Difference]: Finished difference Result 289 states and 486 transitions. [2019-09-08 09:26:58,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:26:58,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-08 09:26:58,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:26:58,432 INFO L225 Difference]: With dead ends: 289 [2019-09-08 09:26:58,432 INFO L226 Difference]: Without dead ends: 199 [2019-09-08 09:26:58,439 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:26:58,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-08 09:26:58,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2019-09-08 09:26:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-08 09:26:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 311 transitions. [2019-09-08 09:26:58,570 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 311 transitions. Word has length 55 [2019-09-08 09:26:58,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:26:58,571 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 311 transitions. [2019-09-08 09:26:58,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:26:58,571 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 311 transitions. [2019-09-08 09:26:58,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 09:26:58,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:26:58,577 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:26:58,578 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:26:58,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:26:58,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1873640104, now seen corresponding path program 1 times [2019-09-08 09:26:58,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:26:58,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:26:58,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:26:58,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:26:58,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:26:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:26:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:26:58,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:26:58,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:26:58,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:26:58,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:26:58,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:26:58,765 INFO L87 Difference]: Start difference. First operand 197 states and 311 transitions. Second operand 3 states. [2019-09-08 09:26:58,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:26:58,819 INFO L93 Difference]: Finished difference Result 473 states and 767 transitions. [2019-09-08 09:26:58,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:26:58,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-09-08 09:26:58,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:26:58,823 INFO L225 Difference]: With dead ends: 473 [2019-09-08 09:26:58,823 INFO L226 Difference]: Without dead ends: 328 [2019-09-08 09:26:58,825 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:26:58,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-08 09:26:58,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2019-09-08 09:26:58,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-08 09:26:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 523 transitions. [2019-09-08 09:26:58,856 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 523 transitions. Word has length 57 [2019-09-08 09:26:58,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:26:58,857 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 523 transitions. [2019-09-08 09:26:58,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:26:58,857 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 523 transitions. [2019-09-08 09:26:58,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 09:26:58,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:26:58,860 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] [2019-09-08 09:26:58,860 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:26:58,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:26:58,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2071269952, now seen corresponding path program 1 times [2019-09-08 09:26:58,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:26:58,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:26:58,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:26:58,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:26:58,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:26:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:26:58,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:26:58,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:26:58,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:26:58,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:26:58,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:26:58,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:26:58,971 INFO L87 Difference]: Start difference. First operand 326 states and 523 transitions. Second operand 3 states. [2019-09-08 09:26:59,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:26:59,011 INFO L93 Difference]: Finished difference Result 601 states and 979 transitions. [2019-09-08 09:26:59,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:26:59,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-08 09:26:59,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:26:59,015 INFO L225 Difference]: With dead ends: 601 [2019-09-08 09:26:59,015 INFO L226 Difference]: Without dead ends: 456 [2019-09-08 09:26:59,017 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:26:59,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-09-08 09:26:59,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 454. [2019-09-08 09:26:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-09-08 09:26:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 733 transitions. [2019-09-08 09:26:59,058 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 733 transitions. Word has length 59 [2019-09-08 09:26:59,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:26:59,059 INFO L475 AbstractCegarLoop]: Abstraction has 454 states and 733 transitions. [2019-09-08 09:26:59,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:26:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 733 transitions. [2019-09-08 09:26:59,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 09:26:59,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:26:59,065 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] [2019-09-08 09:26:59,065 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:26:59,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:26:59,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1286363541, now seen corresponding path program 1 times [2019-09-08 09:26:59,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:26:59,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:26:59,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:26:59,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:26:59,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:26:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:26:59,168 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:26:59,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:26:59,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:26:59,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:26:59,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:26:59,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:26:59,171 INFO L87 Difference]: Start difference. First operand 454 states and 733 transitions. Second operand 3 states. [2019-09-08 09:26:59,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:26:59,228 INFO L93 Difference]: Finished difference Result 1170 states and 1909 transitions. [2019-09-08 09:26:59,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:26:59,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-08 09:26:59,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:26:59,234 INFO L225 Difference]: With dead ends: 1170 [2019-09-08 09:26:59,234 INFO L226 Difference]: Without dead ends: 791 [2019-09-08 09:26:59,236 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:26:59,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-09-08 09:26:59,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 789. [2019-09-08 09:26:59,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-09-08 09:26:59,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1275 transitions. [2019-09-08 09:26:59,277 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1275 transitions. Word has length 59 [2019-09-08 09:26:59,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:26:59,278 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1275 transitions. [2019-09-08 09:26:59,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:26:59,278 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1275 transitions. [2019-09-08 09:26:59,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 09:26:59,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:26:59,280 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] [2019-09-08 09:26:59,280 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:26:59,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:26:59,280 INFO L82 PathProgramCache]: Analyzing trace with hash 177113208, now seen corresponding path program 1 times [2019-09-08 09:26:59,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:26:59,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:26:59,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:26:59,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:26:59,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:26:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:26:59,437 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:26:59,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:26:59,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:26:59,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:26:59,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:26:59,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:26:59,440 INFO L87 Difference]: Start difference. First operand 789 states and 1275 transitions. Second operand 5 states. [2019-09-08 09:26:59,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:26:59,646 INFO L93 Difference]: Finished difference Result 2727 states and 4482 transitions. [2019-09-08 09:26:59,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:26:59,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-08 09:26:59,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:26:59,659 INFO L225 Difference]: With dead ends: 2727 [2019-09-08 09:26:59,659 INFO L226 Difference]: Without dead ends: 2013 [2019-09-08 09:26:59,661 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:26:59,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2019-09-08 09:26:59,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1755. [2019-09-08 09:26:59,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1755 states. [2019-09-08 09:26:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2862 transitions. [2019-09-08 09:26:59,759 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2862 transitions. Word has length 61 [2019-09-08 09:26:59,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:26:59,760 INFO L475 AbstractCegarLoop]: Abstraction has 1755 states and 2862 transitions. [2019-09-08 09:26:59,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:26:59,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2862 transitions. [2019-09-08 09:26:59,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 09:26:59,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:26:59,762 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:26:59,762 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:26:59,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:26:59,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1133931662, now seen corresponding path program 1 times [2019-09-08 09:26:59,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:26:59,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:26:59,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:26:59,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:26:59,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:26:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:26:59,863 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:26:59,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:26:59,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:26:59,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:26:59,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:26:59,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:26:59,865 INFO L87 Difference]: Start difference. First operand 1755 states and 2862 transitions. Second operand 6 states. [2019-09-08 09:27:00,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:00,312 INFO L93 Difference]: Finished difference Result 6672 states and 10952 transitions. [2019-09-08 09:27:00,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 09:27:00,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-09-08 09:27:00,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:00,342 INFO L225 Difference]: With dead ends: 6672 [2019-09-08 09:27:00,343 INFO L226 Difference]: Without dead ends: 4994 [2019-09-08 09:27:00,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:27:00,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4994 states. [2019-09-08 09:27:00,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4994 to 4925. [2019-09-08 09:27:00,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4925 states. [2019-09-08 09:27:00,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4925 states to 4925 states and 8044 transitions. [2019-09-08 09:27:00,629 INFO L78 Accepts]: Start accepts. Automaton has 4925 states and 8044 transitions. Word has length 62 [2019-09-08 09:27:00,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:00,633 INFO L475 AbstractCegarLoop]: Abstraction has 4925 states and 8044 transitions. [2019-09-08 09:27:00,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:27:00,633 INFO L276 IsEmpty]: Start isEmpty. Operand 4925 states and 8044 transitions. [2019-09-08 09:27:00,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 09:27:00,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:00,638 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:27:00,638 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:00,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:00,639 INFO L82 PathProgramCache]: Analyzing trace with hash 34003292, now seen corresponding path program 1 times [2019-09-08 09:27:00,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:00,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:00,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:00,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:00,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:00,747 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:27:00,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:00,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:27:00,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:27:00,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:27:00,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:27:00,749 INFO L87 Difference]: Start difference. First operand 4925 states and 8044 transitions. Second operand 3 states. [2019-09-08 09:27:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:01,114 INFO L93 Difference]: Finished difference Result 9883 states and 16198 transitions. [2019-09-08 09:27:01,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:27:01,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-08 09:27:01,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:01,151 INFO L225 Difference]: With dead ends: 9883 [2019-09-08 09:27:01,151 INFO L226 Difference]: Without dead ends: 6699 [2019-09-08 09:27:01,161 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:27:01,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6699 states. [2019-09-08 09:27:01,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6699 to 6697. [2019-09-08 09:27:01,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6697 states. [2019-09-08 09:27:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6697 states to 6697 states and 10891 transitions. [2019-09-08 09:27:01,578 INFO L78 Accepts]: Start accepts. Automaton has 6697 states and 10891 transitions. Word has length 62 [2019-09-08 09:27:01,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:01,578 INFO L475 AbstractCegarLoop]: Abstraction has 6697 states and 10891 transitions. [2019-09-08 09:27:01,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:27:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 6697 states and 10891 transitions. [2019-09-08 09:27:01,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 09:27:01,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:01,580 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:27:01,580 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:01,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:01,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1402780260, now seen corresponding path program 1 times [2019-09-08 09:27:01,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:01,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:01,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:01,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:01,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:01,632 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:27:01,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:01,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:27:01,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:27:01,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:27:01,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:27:01,634 INFO L87 Difference]: Start difference. First operand 6697 states and 10891 transitions. Second operand 3 states. [2019-09-08 09:27:02,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:02,117 INFO L93 Difference]: Finished difference Result 14959 states and 24533 transitions. [2019-09-08 09:27:02,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:27:02,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-08 09:27:02,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:02,192 INFO L225 Difference]: With dead ends: 14959 [2019-09-08 09:27:02,192 INFO L226 Difference]: Without dead ends: 9913 [2019-09-08 09:27:02,206 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:27:02,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9913 states. [2019-09-08 09:27:02,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9913 to 9911. [2019-09-08 09:27:02,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9911 states. [2019-09-08 09:27:02,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9911 states to 9911 states and 16093 transitions. [2019-09-08 09:27:02,751 INFO L78 Accepts]: Start accepts. Automaton has 9911 states and 16093 transitions. Word has length 62 [2019-09-08 09:27:02,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:02,751 INFO L475 AbstractCegarLoop]: Abstraction has 9911 states and 16093 transitions. [2019-09-08 09:27:02,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:27:02,752 INFO L276 IsEmpty]: Start isEmpty. Operand 9911 states and 16093 transitions. [2019-09-08 09:27:02,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 09:27:02,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:02,753 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] [2019-09-08 09:27:02,753 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:02,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:02,754 INFO L82 PathProgramCache]: Analyzing trace with hash 735090687, now seen corresponding path program 1 times [2019-09-08 09:27:02,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:02,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:02,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:02,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:02,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:02,873 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:27:02,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:02,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:27:02,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:27:02,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:27:02,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:27:02,874 INFO L87 Difference]: Start difference. First operand 9911 states and 16093 transitions. Second operand 4 states. [2019-09-08 09:27:03,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:03,681 INFO L93 Difference]: Finished difference Result 25309 states and 41183 transitions. [2019-09-08 09:27:03,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:27:03,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-08 09:27:03,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:03,733 INFO L225 Difference]: With dead ends: 25309 [2019-09-08 09:27:03,733 INFO L226 Difference]: Without dead ends: 15478 [2019-09-08 09:27:03,764 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:27:03,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15478 states. [2019-09-08 09:27:05,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15478 to 15411. [2019-09-08 09:27:05,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15411 states. [2019-09-08 09:27:05,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15411 states to 15411 states and 24949 transitions. [2019-09-08 09:27:05,091 INFO L78 Accepts]: Start accepts. Automaton has 15411 states and 24949 transitions. Word has length 63 [2019-09-08 09:27:05,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:05,092 INFO L475 AbstractCegarLoop]: Abstraction has 15411 states and 24949 transitions. [2019-09-08 09:27:05,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:27:05,092 INFO L276 IsEmpty]: Start isEmpty. Operand 15411 states and 24949 transitions. [2019-09-08 09:27:05,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 09:27:05,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:05,093 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:27:05,093 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:05,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:05,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1260480373, now seen corresponding path program 1 times [2019-09-08 09:27:05,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:05,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:05,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:05,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:05,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:05,153 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:27:05,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:05,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:27:05,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:27:05,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:27:05,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:27:05,155 INFO L87 Difference]: Start difference. First operand 15411 states and 24949 transitions. Second operand 4 states. [2019-09-08 09:27:06,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:06,507 INFO L93 Difference]: Finished difference Result 45532 states and 73908 transitions. [2019-09-08 09:27:06,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:27:06,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-08 09:27:06,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:06,570 INFO L225 Difference]: With dead ends: 45532 [2019-09-08 09:27:06,570 INFO L226 Difference]: Without dead ends: 30201 [2019-09-08 09:27:06,599 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:27:06,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30201 states. [2019-09-08 09:27:08,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30201 to 22719. [2019-09-08 09:27:08,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22719 states. [2019-09-08 09:27:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22719 states to 22719 states and 36685 transitions. [2019-09-08 09:27:08,266 INFO L78 Accepts]: Start accepts. Automaton has 22719 states and 36685 transitions. Word has length 64 [2019-09-08 09:27:08,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:08,268 INFO L475 AbstractCegarLoop]: Abstraction has 22719 states and 36685 transitions. [2019-09-08 09:27:08,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:27:08,269 INFO L276 IsEmpty]: Start isEmpty. Operand 22719 states and 36685 transitions. [2019-09-08 09:27:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 09:27:08,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:08,270 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:27:08,270 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:08,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:08,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1348775483, now seen corresponding path program 1 times [2019-09-08 09:27:08,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:08,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:08,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:08,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:08,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:08,419 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:27:08,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:08,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:27:08,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:27:08,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:27:08,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:27:08,421 INFO L87 Difference]: Start difference. First operand 22719 states and 36685 transitions. Second operand 5 states. [2019-09-08 09:27:09,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:09,464 INFO L93 Difference]: Finished difference Result 47066 states and 76075 transitions. [2019-09-08 09:27:09,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:27:09,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-08 09:27:09,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:09,516 INFO L225 Difference]: With dead ends: 47066 [2019-09-08 09:27:09,516 INFO L226 Difference]: Without dead ends: 24427 [2019-09-08 09:27:09,555 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:27:09,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24427 states. [2019-09-08 09:27:10,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24427 to 22719. [2019-09-08 09:27:10,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22719 states. [2019-09-08 09:27:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22719 states to 22719 states and 36550 transitions. [2019-09-08 09:27:10,292 INFO L78 Accepts]: Start accepts. Automaton has 22719 states and 36550 transitions. Word has length 66 [2019-09-08 09:27:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:10,292 INFO L475 AbstractCegarLoop]: Abstraction has 22719 states and 36550 transitions. [2019-09-08 09:27:10,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:27:10,293 INFO L276 IsEmpty]: Start isEmpty. Operand 22719 states and 36550 transitions. [2019-09-08 09:27:10,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 09:27:10,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:10,294 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:27:10,294 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:10,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:10,294 INFO L82 PathProgramCache]: Analyzing trace with hash 294074000, now seen corresponding path program 1 times [2019-09-08 09:27:10,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:10,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:10,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:10,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:10,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:10,441 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:27:10,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:10,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:27:10,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:27:10,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:27:10,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:27:10,443 INFO L87 Difference]: Start difference. First operand 22719 states and 36550 transitions. Second operand 5 states. [2019-09-08 09:27:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:11,955 INFO L93 Difference]: Finished difference Result 64021 states and 103190 transitions. [2019-09-08 09:27:11,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:27:11,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-09-08 09:27:11,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:12,029 INFO L225 Difference]: With dead ends: 64021 [2019-09-08 09:27:12,029 INFO L226 Difference]: Without dead ends: 41382 [2019-09-08 09:27:12,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:27:12,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41382 states. [2019-09-08 09:27:14,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41382 to 41380. [2019-09-08 09:27:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41380 states. [2019-09-08 09:27:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41380 states to 41380 states and 66184 transitions. [2019-09-08 09:27:14,305 INFO L78 Accepts]: Start accepts. Automaton has 41380 states and 66184 transitions. Word has length 69 [2019-09-08 09:27:14,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:14,305 INFO L475 AbstractCegarLoop]: Abstraction has 41380 states and 66184 transitions. [2019-09-08 09:27:14,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:27:14,305 INFO L276 IsEmpty]: Start isEmpty. Operand 41380 states and 66184 transitions. [2019-09-08 09:27:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 09:27:14,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:14,306 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:27:14,307 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:14,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:14,307 INFO L82 PathProgramCache]: Analyzing trace with hash 524450082, now seen corresponding path program 1 times [2019-09-08 09:27:14,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:14,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:14,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:14,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:14,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:14,395 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:27:14,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:14,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:27:14,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:27:14,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:27:14,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:27:14,396 INFO L87 Difference]: Start difference. First operand 41380 states and 66184 transitions. Second operand 5 states. [2019-09-08 09:27:16,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:16,502 INFO L93 Difference]: Finished difference Result 72830 states and 115818 transitions. [2019-09-08 09:27:16,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:27:16,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-08 09:27:16,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:16,611 INFO L225 Difference]: With dead ends: 72830 [2019-09-08 09:27:16,611 INFO L226 Difference]: Without dead ends: 72828 [2019-09-08 09:27:16,628 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:27:16,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72828 states. [2019-09-08 09:27:19,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72828 to 42456. [2019-09-08 09:27:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42456 states. [2019-09-08 09:27:19,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42456 states to 42456 states and 67251 transitions. [2019-09-08 09:27:19,422 INFO L78 Accepts]: Start accepts. Automaton has 42456 states and 67251 transitions. Word has length 70 [2019-09-08 09:27:19,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:19,424 INFO L475 AbstractCegarLoop]: Abstraction has 42456 states and 67251 transitions. [2019-09-08 09:27:19,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:27:19,425 INFO L276 IsEmpty]: Start isEmpty. Operand 42456 states and 67251 transitions. [2019-09-08 09:27:19,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 09:27:19,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:19,429 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] [2019-09-08 09:27:19,429 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:19,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:19,429 INFO L82 PathProgramCache]: Analyzing trace with hash -937454614, now seen corresponding path program 1 times [2019-09-08 09:27:19,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:19,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:19,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:19,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:19,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 09:27:19,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:19,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:27:19,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:27:19,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:27:19,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:27:19,610 INFO L87 Difference]: Start difference. First operand 42456 states and 67251 transitions. Second operand 4 states. [2019-09-08 09:27:22,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:22,195 INFO L93 Difference]: Finished difference Result 89609 states and 142833 transitions. [2019-09-08 09:27:22,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:27:22,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-08 09:27:22,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:22,304 INFO L225 Difference]: With dead ends: 89609 [2019-09-08 09:27:22,304 INFO L226 Difference]: Without dead ends: 69541 [2019-09-08 09:27:22,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:27:22,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69541 states. [2019-09-08 09:27:26,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69541 to 61169. [2019-09-08 09:27:26,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61169 states. [2019-09-08 09:27:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61169 states to 61169 states and 97100 transitions. [2019-09-08 09:27:26,333 INFO L78 Accepts]: Start accepts. Automaton has 61169 states and 97100 transitions. Word has length 91 [2019-09-08 09:27:26,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:26,334 INFO L475 AbstractCegarLoop]: Abstraction has 61169 states and 97100 transitions. [2019-09-08 09:27:26,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:27:26,334 INFO L276 IsEmpty]: Start isEmpty. Operand 61169 states and 97100 transitions. [2019-09-08 09:27:26,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 09:27:26,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:26,336 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] [2019-09-08 09:27:26,336 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:26,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:26,336 INFO L82 PathProgramCache]: Analyzing trace with hash -909176725, now seen corresponding path program 1 times [2019-09-08 09:27:26,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:26,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:26,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:26,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:26,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:27:26,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:26,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:27:26,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:27:26,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:27:26,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:27:26,402 INFO L87 Difference]: Start difference. First operand 61169 states and 97100 transitions. Second operand 3 states. [2019-09-08 09:27:28,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:28,972 INFO L93 Difference]: Finished difference Result 113759 states and 181196 transitions. [2019-09-08 09:27:28,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:27:28,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-08 09:27:28,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:29,042 INFO L225 Difference]: With dead ends: 113759 [2019-09-08 09:27:29,042 INFO L226 Difference]: Without dead ends: 52670 [2019-09-08 09:27:29,089 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:27:29,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52670 states. [2019-09-08 09:27:31,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52670 to 52664. [2019-09-08 09:27:31,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52664 states. [2019-09-08 09:27:31,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52664 states to 52664 states and 83614 transitions. [2019-09-08 09:27:31,331 INFO L78 Accepts]: Start accepts. Automaton has 52664 states and 83614 transitions. Word has length 91 [2019-09-08 09:27:31,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:31,331 INFO L475 AbstractCegarLoop]: Abstraction has 52664 states and 83614 transitions. [2019-09-08 09:27:31,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:27:31,331 INFO L276 IsEmpty]: Start isEmpty. Operand 52664 states and 83614 transitions. [2019-09-08 09:27:31,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 09:27:31,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:31,333 INFO L399 BasicCegarLoop]: trace histogram [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:27:31,333 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:31,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:31,333 INFO L82 PathProgramCache]: Analyzing trace with hash -2083337836, now seen corresponding path program 1 times [2019-09-08 09:27:31,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:31,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:31,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:31,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:31,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 09:27:31,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:31,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:27:31,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:27:31,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:27:31,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:27:31,499 INFO L87 Difference]: Start difference. First operand 52664 states and 83614 transitions. Second operand 4 states. [2019-09-08 09:27:36,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:36,274 INFO L93 Difference]: Finished difference Result 113583 states and 181536 transitions. [2019-09-08 09:27:36,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:27:36,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-08 09:27:36,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:36,393 INFO L225 Difference]: With dead ends: 113583 [2019-09-08 09:27:36,393 INFO L226 Difference]: Without dead ends: 88397 [2019-09-08 09:27:36,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:27:36,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88397 states. [2019-09-08 09:27:39,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88397 to 77811. [2019-09-08 09:27:39,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77811 states. [2019-09-08 09:27:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77811 states to 77811 states and 123831 transitions. [2019-09-08 09:27:39,795 INFO L78 Accepts]: Start accepts. Automaton has 77811 states and 123831 transitions. Word has length 91 [2019-09-08 09:27:39,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:39,795 INFO L475 AbstractCegarLoop]: Abstraction has 77811 states and 123831 transitions. [2019-09-08 09:27:39,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:27:39,795 INFO L276 IsEmpty]: Start isEmpty. Operand 77811 states and 123831 transitions. [2019-09-08 09:27:39,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 09:27:39,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:39,796 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] [2019-09-08 09:27:39,796 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:39,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:39,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1348321077, now seen corresponding path program 1 times [2019-09-08 09:27:39,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:39,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:39,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:39,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:39,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 09:27:39,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:39,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:27:39,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:27:39,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:27:39,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:27:39,947 INFO L87 Difference]: Start difference. First operand 77811 states and 123831 transitions. Second operand 4 states. [2019-09-08 09:27:47,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:47,984 INFO L93 Difference]: Finished difference Result 234649 states and 373227 transitions. [2019-09-08 09:27:47,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:27:47,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-08 09:27:47,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:48,195 INFO L225 Difference]: With dead ends: 234649 [2019-09-08 09:27:48,195 INFO L226 Difference]: Without dead ends: 160229 [2019-09-08 09:27:48,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:27:48,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160229 states. [2019-09-08 09:27:57,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160229 to 134950. [2019-09-08 09:27:57,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134950 states. [2019-09-08 09:27:57,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134950 states to 134950 states and 214224 transitions. [2019-09-08 09:27:57,347 INFO L78 Accepts]: Start accepts. Automaton has 134950 states and 214224 transitions. Word has length 91 [2019-09-08 09:27:57,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:57,347 INFO L475 AbstractCegarLoop]: Abstraction has 134950 states and 214224 transitions. [2019-09-08 09:27:57,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:27:57,347 INFO L276 IsEmpty]: Start isEmpty. Operand 134950 states and 214224 transitions. [2019-09-08 09:27:57,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 09:27:57,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:57,348 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] [2019-09-08 09:27:57,348 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:57,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:57,349 INFO L82 PathProgramCache]: Analyzing trace with hash -913631143, now seen corresponding path program 1 times [2019-09-08 09:27:57,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:57,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:57,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:57,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:57,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 09:27:57,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:27:57,450 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:27:57,466 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:27:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:57,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 09:27:57,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:27:57,668 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:27:57,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 09:27:57,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-09-08 09:27:57,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 09:27:57,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 09:27:57,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:27:57,678 INFO L87 Difference]: Start difference. First operand 134950 states and 214224 transitions. Second operand 7 states. [2019-09-08 09:28:04,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:04,007 INFO L93 Difference]: Finished difference Result 216353 states and 342085 transitions. [2019-09-08 09:28:04,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 09:28:04,007 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-09-08 09:28:04,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:04,412 INFO L225 Difference]: With dead ends: 216353 [2019-09-08 09:28:04,412 INFO L226 Difference]: Without dead ends: 81515 [2019-09-08 09:28:04,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-09-08 09:28:04,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81515 states. [2019-09-08 09:28:12,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81515 to 78813. [2019-09-08 09:28:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78813 states. [2019-09-08 09:28:12,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78813 states to 78813 states and 121456 transitions. [2019-09-08 09:28:12,119 INFO L78 Accepts]: Start accepts. Automaton has 78813 states and 121456 transitions. Word has length 96 [2019-09-08 09:28:12,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:12,119 INFO L475 AbstractCegarLoop]: Abstraction has 78813 states and 121456 transitions. [2019-09-08 09:28:12,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 09:28:12,120 INFO L276 IsEmpty]: Start isEmpty. Operand 78813 states and 121456 transitions. [2019-09-08 09:28:12,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 09:28:12,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:12,122 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2019-09-08 09:28:12,123 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:12,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:12,123 INFO L82 PathProgramCache]: Analyzing trace with hash -633829487, now seen corresponding path program 1 times [2019-09-08 09:28:12,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:12,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:12,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:12,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:12,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 13 proven. 36 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 09:28:12,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:28:12,338 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) [2019-09-08 09:28:12,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 09:28:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:12,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 984 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 09:28:12,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:28:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-08 09:28:12,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:28:12,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 09:28:12,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:28:12,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:28:12,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:28:12,737 INFO L87 Difference]: Start difference. First operand 78813 states and 121456 transitions. Second operand 8 states. [2019-09-08 09:28:22,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:22,141 INFO L93 Difference]: Finished difference Result 216837 states and 334469 transitions. [2019-09-08 09:28:22,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 09:28:22,141 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 143 [2019-09-08 09:28:22,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:22,388 INFO L225 Difference]: With dead ends: 216837 [2019-09-08 09:28:22,389 INFO L226 Difference]: Without dead ends: 159698 [2019-09-08 09:28:22,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-09-08 09:28:22,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159698 states. [2019-09-08 09:28:33,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159698 to 127758. [2019-09-08 09:28:33,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127758 states. [2019-09-08 09:28:33,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127758 states to 127758 states and 196370 transitions. [2019-09-08 09:28:33,586 INFO L78 Accepts]: Start accepts. Automaton has 127758 states and 196370 transitions. Word has length 143 [2019-09-08 09:28:33,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:33,586 INFO L475 AbstractCegarLoop]: Abstraction has 127758 states and 196370 transitions. [2019-09-08 09:28:33,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:28:33,586 INFO L276 IsEmpty]: Start isEmpty. Operand 127758 states and 196370 transitions. [2019-09-08 09:28:33,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 09:28:33,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:33,589 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2019-09-08 09:28:33,589 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:33,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:33,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1986046273, now seen corresponding path program 1 times [2019-09-08 09:28:33,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:33,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:33,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:33,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:33,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:33,674 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 09:28:33,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:28:33,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:28:33,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:28:33,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:28:33,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:28:33,675 INFO L87 Difference]: Start difference. First operand 127758 states and 196370 transitions. Second operand 3 states. [2019-09-08 09:28:37,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:37,335 INFO L93 Difference]: Finished difference Result 183393 states and 281224 transitions. [2019-09-08 09:28:37,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:28:37,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-08 09:28:37,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:37,419 INFO L225 Difference]: With dead ends: 183393 [2019-09-08 09:28:37,419 INFO L226 Difference]: Without dead ends: 55768 [2019-09-08 09:28:37,536 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:28:37,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55768 states. [2019-09-08 09:28:43,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55768 to 55766. [2019-09-08 09:28:43,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55766 states. [2019-09-08 09:28:43,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55766 states to 55766 states and 84679 transitions. [2019-09-08 09:28:43,740 INFO L78 Accepts]: Start accepts. Automaton has 55766 states and 84679 transitions. Word has length 143 [2019-09-08 09:28:43,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:43,740 INFO L475 AbstractCegarLoop]: Abstraction has 55766 states and 84679 transitions. [2019-09-08 09:28:43,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:28:43,741 INFO L276 IsEmpty]: Start isEmpty. Operand 55766 states and 84679 transitions. [2019-09-08 09:28:43,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 09:28:43,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:43,742 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 09:28:43,743 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:43,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:43,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1981849913, now seen corresponding path program 1 times [2019-09-08 09:28:43,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:43,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:43,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:43,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:43,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:43,880 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 59 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 09:28:43,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:28:43,880 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 09:28:43,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 09:28:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:44,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 09:28:44,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:28:44,118 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 09:28:44,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:28:44,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2019-09-08 09:28:44,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 09:28:44,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 09:28:44,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:28:44,133 INFO L87 Difference]: Start difference. First operand 55766 states and 84679 transitions. Second operand 7 states. [2019-09-08 09:28:49,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:49,664 INFO L93 Difference]: Finished difference Result 154565 states and 234251 transitions. [2019-09-08 09:28:49,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 09:28:49,664 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-09-08 09:28:49,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:49,795 INFO L225 Difference]: With dead ends: 154565 [2019-09-08 09:28:49,796 INFO L226 Difference]: Without dead ends: 98932 [2019-09-08 09:28:49,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-09-08 09:28:49,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98932 states. [2019-09-08 09:28:54,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98932 to 68474. [2019-09-08 09:28:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68474 states. [2019-09-08 09:28:54,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68474 states to 68474 states and 103791 transitions. [2019-09-08 09:28:54,253 INFO L78 Accepts]: Start accepts. Automaton has 68474 states and 103791 transitions. Word has length 145 [2019-09-08 09:28:54,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:54,253 INFO L475 AbstractCegarLoop]: Abstraction has 68474 states and 103791 transitions. [2019-09-08 09:28:54,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 09:28:54,253 INFO L276 IsEmpty]: Start isEmpty. Operand 68474 states and 103791 transitions. [2019-09-08 09:28:54,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 09:28:54,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:54,255 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 09:28:54,255 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:54,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:54,255 INFO L82 PathProgramCache]: Analyzing trace with hash -600330826, now seen corresponding path program 1 times [2019-09-08 09:28:54,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:54,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:54,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:54,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:54,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:54,396 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-08 09:28:54,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:28:54,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:28:54,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:28:54,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:28:54,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:28:54,399 INFO L87 Difference]: Start difference. First operand 68474 states and 103791 transitions. Second operand 5 states. [2019-09-08 09:28:59,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:59,392 INFO L93 Difference]: Finished difference Result 122480 states and 186291 transitions. [2019-09-08 09:28:59,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:28:59,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-09-08 09:28:59,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:59,505 INFO L225 Difference]: With dead ends: 122480 [2019-09-08 09:28:59,505 INFO L226 Difference]: Without dead ends: 80721 [2019-09-08 09:28:59,550 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:28:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80721 states. [2019-09-08 09:29:04,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80721 to 80715. [2019-09-08 09:29:04,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80715 states. [2019-09-08 09:29:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80715 states to 80715 states and 122111 transitions. [2019-09-08 09:29:05,487 INFO L78 Accepts]: Start accepts. Automaton has 80715 states and 122111 transitions. Word has length 147 [2019-09-08 09:29:05,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:29:05,488 INFO L475 AbstractCegarLoop]: Abstraction has 80715 states and 122111 transitions. [2019-09-08 09:29:05,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:29:05,488 INFO L276 IsEmpty]: Start isEmpty. Operand 80715 states and 122111 transitions. [2019-09-08 09:29:05,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 09:29:05,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:29:05,490 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 09:29:05,490 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:29:05,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:29:05,490 INFO L82 PathProgramCache]: Analyzing trace with hash -92391425, now seen corresponding path program 1 times [2019-09-08 09:29:05,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:29:05,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:29:05,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:05,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:29:05,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 64 proven. 25 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 09:29:05,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:29:05,684 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 09:29:05,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:29:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:05,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 09:29:05,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:29:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-08 09:29:05,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:29:05,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 09:29:05,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:29:05,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:29:05,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:29:05,950 INFO L87 Difference]: Start difference. First operand 80715 states and 122111 transitions. Second operand 6 states. [2019-09-08 09:29:23,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:29:23,278 INFO L93 Difference]: Finished difference Result 310629 states and 467092 transitions. [2019-09-08 09:29:23,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 09:29:23,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-09-08 09:29:23,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:29:23,595 INFO L225 Difference]: With dead ends: 310629 [2019-09-08 09:29:23,596 INFO L226 Difference]: Without dead ends: 229935 [2019-09-08 09:29:23,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-08 09:29:23,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229935 states. [2019-09-08 09:29:34,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229935 to 155330. [2019-09-08 09:29:34,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155330 states. [2019-09-08 09:29:34,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155330 states to 155330 states and 232594 transitions. [2019-09-08 09:29:34,599 INFO L78 Accepts]: Start accepts. Automaton has 155330 states and 232594 transitions. Word has length 148 [2019-09-08 09:29:34,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:29:34,600 INFO L475 AbstractCegarLoop]: Abstraction has 155330 states and 232594 transitions. [2019-09-08 09:29:34,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:29:34,600 INFO L276 IsEmpty]: Start isEmpty. Operand 155330 states and 232594 transitions. [2019-09-08 09:29:34,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 09:29:34,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:29:34,602 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 09:29:34,602 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:29:34,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:29:34,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1242762050, now seen corresponding path program 1 times [2019-09-08 09:29:34,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:29:34,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:29:34,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:34,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:29:34,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-08 09:29:34,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:29:34,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:29:34,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:29:34,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:29:34,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:29:34,663 INFO L87 Difference]: Start difference. First operand 155330 states and 232594 transitions. Second operand 3 states. [2019-09-08 09:29:58,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:29:58,663 INFO L93 Difference]: Finished difference Result 465940 states and 697705 transitions. [2019-09-08 09:29:58,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:29:58,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-09-08 09:29:58,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:29:59,126 INFO L225 Difference]: With dead ends: 465940 [2019-09-08 09:29:59,126 INFO L226 Difference]: Without dead ends: 310638 [2019-09-08 09:29:59,269 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:29:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310638 states. [2019-09-08 09:30:17,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310638 to 155332. [2019-09-08 09:30:17,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155332 states. [2019-09-08 09:30:17,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155332 states to 155332 states and 232596 transitions. [2019-09-08 09:30:17,866 INFO L78 Accepts]: Start accepts. Automaton has 155332 states and 232596 transitions. Word has length 151 [2019-09-08 09:30:17,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:17,867 INFO L475 AbstractCegarLoop]: Abstraction has 155332 states and 232596 transitions. [2019-09-08 09:30:17,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:30:17,867 INFO L276 IsEmpty]: Start isEmpty. Operand 155332 states and 232596 transitions. [2019-09-08 09:30:17,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 09:30:17,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:17,869 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 09:30:17,869 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:17,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:17,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1140884872, now seen corresponding path program 1 times [2019-09-08 09:30:17,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:17,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:17,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:17,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:17,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:18,563 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 09:30:18,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:18,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:30:18,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:30:18,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:30:18,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:30:18,565 INFO L87 Difference]: Start difference. First operand 155332 states and 232596 transitions. Second operand 3 states. [2019-09-08 09:30:40,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:40,309 INFO L93 Difference]: Finished difference Result 453670 states and 678561 transitions. [2019-09-08 09:30:40,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:30:40,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-08 09:30:40,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:40,807 INFO L225 Difference]: With dead ends: 453670 [2019-09-08 09:30:40,807 INFO L226 Difference]: Without dead ends: 298490 [2019-09-08 09:30:40,946 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:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298490 states. [2019-09-08 09:31:09,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298490 to 298488. [2019-09-08 09:31:09,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298488 states. [2019-09-08 09:31:09,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298488 states to 298488 states and 441983 transitions. [2019-09-08 09:31:09,681 INFO L78 Accepts]: Start accepts. Automaton has 298488 states and 441983 transitions. Word has length 152 [2019-09-08 09:31:09,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:09,681 INFO L475 AbstractCegarLoop]: Abstraction has 298488 states and 441983 transitions. [2019-09-08 09:31:09,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:31:09,681 INFO L276 IsEmpty]: Start isEmpty. Operand 298488 states and 441983 transitions. [2019-09-08 09:31:09,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 09:31:09,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:09,684 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 09:31:09,685 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:09,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:09,685 INFO L82 PathProgramCache]: Analyzing trace with hash -390683227, now seen corresponding path program 1 times [2019-09-08 09:31:09,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:09,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:09,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:09,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:09,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-08 09:31:10,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:10,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:31:10,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:31:10,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:31:10,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:31:10,632 INFO L87 Difference]: Start difference. First operand 298488 states and 441983 transitions. Second operand 4 states. [2019-09-08 09:31:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:31:40,074 INFO L93 Difference]: Finished difference Result 597148 states and 884163 transitions. [2019-09-08 09:31:40,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:31:40,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-08 09:31:40,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:31:40,544 INFO L225 Difference]: With dead ends: 597148 [2019-09-08 09:31:40,544 INFO L226 Difference]: Without dead ends: 298600 [2019-09-08 09:31:40,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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:31:40,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298600 states. [2019-09-08 09:32:10,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298600 to 298598. [2019-09-08 09:32:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298598 states. [2019-09-08 09:32:11,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298598 states to 298598 states and 437929 transitions. [2019-09-08 09:32:11,360 INFO L78 Accepts]: Start accepts. Automaton has 298598 states and 437929 transitions. Word has length 152 [2019-09-08 09:32:11,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:11,360 INFO L475 AbstractCegarLoop]: Abstraction has 298598 states and 437929 transitions. [2019-09-08 09:32:11,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:32:11,360 INFO L276 IsEmpty]: Start isEmpty. Operand 298598 states and 437929 transitions. [2019-09-08 09:32:11,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 09:32:11,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:11,363 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 09:32:11,363 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:11,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:11,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1779305651, now seen corresponding path program 1 times [2019-09-08 09:32:11,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:11,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:11,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:11,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:11,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-08 09:32:11,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:11,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:32:11,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:32:11,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:32:11,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:32:11,529 INFO L87 Difference]: Start difference. First operand 298598 states and 437929 transitions. Second operand 4 states. [2019-09-08 09:33:06,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:33:06,212 INFO L93 Difference]: Finished difference Result 881607 states and 1291454 transitions. [2019-09-08 09:33:06,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:33:06,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-08 09:33:06,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:33:07,109 INFO L225 Difference]: With dead ends: 881607 [2019-09-08 09:33:07,109 INFO L226 Difference]: Without dead ends: 583022 [2019-09-08 09:33:07,351 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:33:07,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583022 states. [2019-09-08 09:34:14,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583022 to 583020. [2019-09-08 09:34:14,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583020 states. [2019-09-08 09:34:15,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583020 states to 583020 states and 848416 transitions. [2019-09-08 09:34:15,942 INFO L78 Accepts]: Start accepts. Automaton has 583020 states and 848416 transitions. Word has length 152 [2019-09-08 09:34:15,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:34:15,942 INFO L475 AbstractCegarLoop]: Abstraction has 583020 states and 848416 transitions. [2019-09-08 09:34:15,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:34:15,943 INFO L276 IsEmpty]: Start isEmpty. Operand 583020 states and 848416 transitions. [2019-09-08 09:34:15,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 09:34:15,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:34:15,947 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 09:34:15,947 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:34:15,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:34:15,948 INFO L82 PathProgramCache]: Analyzing trace with hash -787190467, now seen corresponding path program 1 times [2019-09-08 09:34:15,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:34:15,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:34:15,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:34:15,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:34:15,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:34:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:34:15,994 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-08 09:34:15,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:34:15,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:34:15,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:34:15,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:34:15,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:34:15,996 INFO L87 Difference]: Start difference. First operand 583020 states and 848416 transitions. Second operand 3 states. [2019-09-08 09:36:18,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:36:18,067 INFO L93 Difference]: Finished difference Result 1748919 states and 2545069 transitions. [2019-09-08 09:36:18,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:36:18,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-09-08 09:36:18,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:36:20,119 INFO L225 Difference]: With dead ends: 1748919 [2019-09-08 09:36:20,119 INFO L226 Difference]: Without dead ends: 1166026 [2019-09-08 09:36:20,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:36:21,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166026 states. [2019-09-08 09:37:45,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166026 to 583022. [2019-09-08 09:37:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583022 states. [2019-09-08 09:37:46,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583022 states to 583022 states and 848418 transitions. [2019-09-08 09:37:46,306 INFO L78 Accepts]: Start accepts. Automaton has 583022 states and 848418 transitions. Word has length 153 [2019-09-08 09:37:46,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:37:46,307 INFO L475 AbstractCegarLoop]: Abstraction has 583022 states and 848418 transitions. [2019-09-08 09:37:46,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:37:46,307 INFO L276 IsEmpty]: Start isEmpty. Operand 583022 states and 848418 transitions. [2019-09-08 09:37:46,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 09:37:46,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:37:46,311 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 09:37:46,311 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:37:46,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:37:46,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1207995634, now seen corresponding path program 1 times [2019-09-08 09:37:46,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:37:46,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:37:46,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:37:46,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:37:46,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:37:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:37:46,428 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 09:37:46,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:37:46,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:37:46,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:37:46,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:37:46,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:37:46,430 INFO L87 Difference]: Start difference. First operand 583022 states and 848418 transitions. Second operand 4 states.