/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:31:07,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:31:07,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:31:07,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:31:07,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:31:07,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:31:07,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:31:07,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:31:07,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:31:07,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:31:07,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:31:07,901 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:31:07,901 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:31:07,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:31:07,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:31:07,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:31:07,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:31:07,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:31:07,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:31:07,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:31:07,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:31:07,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:31:07,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:31:07,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:31:07,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:31:07,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:31:07,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:31:07,915 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:31:07,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:31:07,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:31:07,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:31:07,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:31:07,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:31:07,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:31:07,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:31:07,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:31:07,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:31:07,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:31:07,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:31:07,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:31:07,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:31:07,932 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-11-23 22:31:07,964 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:31:07,964 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:31:07,966 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:31:07,966 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:31:07,966 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:31:07,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:31:07,967 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:31:07,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:31:07,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:31:07,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:31:07,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:31:07,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:31:07,971 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:31:07,971 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:31:07,971 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:31:07,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:31:07,972 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:31:07,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:31:07,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:31:07,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:31:07,972 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:31:07,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:31:07,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:31:07,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:31:07,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:31:07,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:31:07,976 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:31:07,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:31:07,977 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:31:07,977 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:31:08,253 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:31:08,269 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:31:08,273 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:31:08,274 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:31:08,275 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:31:08,276 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-23 22:31:08,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc74939e6/abf4a09a336b4f45a91464fa65baa8e5/FLAG1d571f050 [2019-11-23 22:31:08,871 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:31:08,872 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-23 22:31:08,889 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc74939e6/abf4a09a336b4f45a91464fa65baa8e5/FLAG1d571f050 [2019-11-23 22:31:09,169 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc74939e6/abf4a09a336b4f45a91464fa65baa8e5 [2019-11-23 22:31:09,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:31:09,179 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:31:09,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:31:09,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:31:09,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:31:09,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:31:09" (1/1) ... [2019-11-23 22:31:09,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@692c01ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:09, skipping insertion in model container [2019-11-23 22:31:09,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:31:09" (1/1) ... [2019-11-23 22:31:09,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:31:09,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:31:09,805 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:31:09,816 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:31:09,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:31:09,996 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:31:09,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:09 WrapperNode [2019-11-23 22:31:09,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:31:09,997 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:31:09,997 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:31:09,997 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:31:10,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:09" (1/1) ... [2019-11-23 22:31:10,022 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:09" (1/1) ... [2019-11-23 22:31:10,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:31:10,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:31:10,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:31:10,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:31:10,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:09" (1/1) ... [2019-11-23 22:31:10,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:09" (1/1) ... [2019-11-23 22:31:10,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:09" (1/1) ... [2019-11-23 22:31:10,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:09" (1/1) ... [2019-11-23 22:31:10,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:09" (1/1) ... [2019-11-23 22:31:10,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:09" (1/1) ... [2019-11-23 22:31:10,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:09" (1/1) ... [2019-11-23 22:31:10,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:31:10,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:31:10,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:31:10,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:31:10,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:09" (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-11-23 22:31:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:31:10,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:31:11,622 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:31:11,622 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:31:11,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:31:11 BoogieIcfgContainer [2019-11-23 22:31:11,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:31:11,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:31:11,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:31:11,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:31:11,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:31:09" (1/3) ... [2019-11-23 22:31:11,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c262bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:31:11, skipping insertion in model container [2019-11-23 22:31:11,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:09" (2/3) ... [2019-11-23 22:31:11,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c262bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:31:11, skipping insertion in model container [2019-11-23 22:31:11,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:31:11" (3/3) ... [2019-11-23 22:31:11,633 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-23 22:31:11,643 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:31:11,652 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:31:11,666 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:31:11,697 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:31:11,698 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:31:11,698 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:31:11,698 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:31:11,698 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:31:11,699 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:31:11,699 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:31:11,699 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:31:11,723 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states. [2019-11-23 22:31:11,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-23 22:31:11,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:11,739 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:11,740 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:11,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:11,747 INFO L82 PathProgramCache]: Analyzing trace with hash 574427721, now seen corresponding path program 1 times [2019-11-23 22:31:11,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:11,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457794422] [2019-11-23 22:31:11,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:12,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:12,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457794422] [2019-11-23 22:31:12,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:12,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:12,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696051287] [2019-11-23 22:31:12,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:12,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:12,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:12,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:12,359 INFO L87 Difference]: Start difference. First operand 305 states. Second operand 3 states. [2019-11-23 22:31:12,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:12,648 INFO L93 Difference]: Finished difference Result 612 states and 1078 transitions. [2019-11-23 22:31:12,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:12,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-11-23 22:31:12,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:12,671 INFO L225 Difference]: With dead ends: 612 [2019-11-23 22:31:12,671 INFO L226 Difference]: Without dead ends: 495 [2019-11-23 22:31:12,676 INFO L630 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-11-23 22:31:12,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-11-23 22:31:12,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2019-11-23 22:31:12,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-11-23 22:31:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 736 transitions. [2019-11-23 22:31:12,829 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 736 transitions. Word has length 144 [2019-11-23 22:31:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:12,832 INFO L462 AbstractCegarLoop]: Abstraction has 493 states and 736 transitions. [2019-11-23 22:31:12,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 736 transitions. [2019-11-23 22:31:12,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-23 22:31:12,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:12,845 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:12,846 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:12,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:12,846 INFO L82 PathProgramCache]: Analyzing trace with hash 505056235, now seen corresponding path program 1 times [2019-11-23 22:31:12,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:12,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214919976] [2019-11-23 22:31:12,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:13,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:13,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214919976] [2019-11-23 22:31:13,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:13,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:13,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483797879] [2019-11-23 22:31:13,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:13,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:13,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:13,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:13,147 INFO L87 Difference]: Start difference. First operand 493 states and 736 transitions. Second operand 3 states. [2019-11-23 22:31:13,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:13,273 INFO L93 Difference]: Finished difference Result 1063 states and 1633 transitions. [2019-11-23 22:31:13,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:13,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-11-23 22:31:13,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:13,283 INFO L225 Difference]: With dead ends: 1063 [2019-11-23 22:31:13,283 INFO L226 Difference]: Without dead ends: 865 [2019-11-23 22:31:13,289 INFO L630 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-11-23 22:31:13,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-11-23 22:31:13,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 863. [2019-11-23 22:31:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-11-23 22:31:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1300 transitions. [2019-11-23 22:31:13,342 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1300 transitions. Word has length 144 [2019-11-23 22:31:13,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:13,343 INFO L462 AbstractCegarLoop]: Abstraction has 863 states and 1300 transitions. [2019-11-23 22:31:13,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1300 transitions. [2019-11-23 22:31:13,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-23 22:31:13,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:13,346 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:13,346 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:13,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:13,347 INFO L82 PathProgramCache]: Analyzing trace with hash 459957428, now seen corresponding path program 1 times [2019-11-23 22:31:13,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:13,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736981417] [2019-11-23 22:31:13,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:13,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736981417] [2019-11-23 22:31:13,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:13,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:13,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970050198] [2019-11-23 22:31:13,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:13,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:13,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:13,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:13,729 INFO L87 Difference]: Start difference. First operand 863 states and 1300 transitions. Second operand 4 states. [2019-11-23 22:31:13,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:13,881 INFO L93 Difference]: Finished difference Result 2524 states and 3793 transitions. [2019-11-23 22:31:13,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:13,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-11-23 22:31:13,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:13,891 INFO L225 Difference]: With dead ends: 2524 [2019-11-23 22:31:13,891 INFO L226 Difference]: Without dead ends: 1670 [2019-11-23 22:31:13,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:13,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2019-11-23 22:31:13,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1668. [2019-11-23 22:31:13,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2019-11-23 22:31:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2486 transitions. [2019-11-23 22:31:13,969 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2486 transitions. Word has length 144 [2019-11-23 22:31:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:13,970 INFO L462 AbstractCegarLoop]: Abstraction has 1668 states and 2486 transitions. [2019-11-23 22:31:13,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:13,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2486 transitions. [2019-11-23 22:31:13,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-23 22:31:13,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:13,973 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:13,974 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:13,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:13,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1789583768, now seen corresponding path program 1 times [2019-11-23 22:31:13,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:13,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692979127] [2019-11-23 22:31:13,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:14,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692979127] [2019-11-23 22:31:14,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:14,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:14,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324143097] [2019-11-23 22:31:14,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:14,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:14,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:14,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:14,039 INFO L87 Difference]: Start difference. First operand 1668 states and 2486 transitions. Second operand 3 states. [2019-11-23 22:31:14,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:14,200 INFO L93 Difference]: Finished difference Result 4966 states and 7396 transitions. [2019-11-23 22:31:14,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:14,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-11-23 22:31:14,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:14,219 INFO L225 Difference]: With dead ends: 4966 [2019-11-23 22:31:14,219 INFO L226 Difference]: Without dead ends: 3326 [2019-11-23 22:31:14,222 INFO L630 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-11-23 22:31:14,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2019-11-23 22:31:14,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 1670. [2019-11-23 22:31:14,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1670 states. [2019-11-23 22:31:14,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2488 transitions. [2019-11-23 22:31:14,327 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2488 transitions. Word has length 145 [2019-11-23 22:31:14,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:14,327 INFO L462 AbstractCegarLoop]: Abstraction has 1670 states and 2488 transitions. [2019-11-23 22:31:14,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:14,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2488 transitions. [2019-11-23 22:31:14,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-23 22:31:14,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:14,331 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:14,332 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:14,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:14,332 INFO L82 PathProgramCache]: Analyzing trace with hash 338353525, now seen corresponding path program 1 times [2019-11-23 22:31:14,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:14,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871258864] [2019-11-23 22:31:14,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:14,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:14,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871258864] [2019-11-23 22:31:14,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:14,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:14,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116053455] [2019-11-23 22:31:14,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:14,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:14,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:14,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:14,489 INFO L87 Difference]: Start difference. First operand 1670 states and 2488 transitions. Second operand 4 states. [2019-11-23 22:31:14,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:14,588 INFO L93 Difference]: Finished difference Result 3330 states and 4962 transitions. [2019-11-23 22:31:14,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:14,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-11-23 22:31:14,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:14,598 INFO L225 Difference]: With dead ends: 3330 [2019-11-23 22:31:14,598 INFO L226 Difference]: Without dead ends: 1668 [2019-11-23 22:31:14,601 INFO L630 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-11-23 22:31:14,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2019-11-23 22:31:14,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1668. [2019-11-23 22:31:14,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2019-11-23 22:31:14,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2484 transitions. [2019-11-23 22:31:14,695 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2484 transitions. Word has length 146 [2019-11-23 22:31:14,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:14,695 INFO L462 AbstractCegarLoop]: Abstraction has 1668 states and 2484 transitions. [2019-11-23 22:31:14,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:14,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2484 transitions. [2019-11-23 22:31:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-23 22:31:14,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:14,702 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:14,703 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:14,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:14,704 INFO L82 PathProgramCache]: Analyzing trace with hash -2057553317, now seen corresponding path program 1 times [2019-11-23 22:31:14,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:14,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575226975] [2019-11-23 22:31:14,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:14,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:14,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575226975] [2019-11-23 22:31:14,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:14,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:14,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65100436] [2019-11-23 22:31:14,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:14,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:14,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:14,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:14,882 INFO L87 Difference]: Start difference. First operand 1668 states and 2484 transitions. Second operand 3 states. [2019-11-23 22:31:15,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:15,081 INFO L93 Difference]: Finished difference Result 3967 states and 5920 transitions. [2019-11-23 22:31:15,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:15,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-11-23 22:31:15,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:15,096 INFO L225 Difference]: With dead ends: 3967 [2019-11-23 22:31:15,096 INFO L226 Difference]: Without dead ends: 2475 [2019-11-23 22:31:15,100 INFO L630 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-11-23 22:31:15,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2019-11-23 22:31:15,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2473. [2019-11-23 22:31:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2473 states. [2019-11-23 22:31:15,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3632 transitions. [2019-11-23 22:31:15,248 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3632 transitions. Word has length 146 [2019-11-23 22:31:15,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:15,248 INFO L462 AbstractCegarLoop]: Abstraction has 2473 states and 3632 transitions. [2019-11-23 22:31:15,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:15,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3632 transitions. [2019-11-23 22:31:15,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 22:31:15,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:15,254 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:15,254 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:15,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:15,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2082628409, now seen corresponding path program 1 times [2019-11-23 22:31:15,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:15,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454741222] [2019-11-23 22:31:15,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:15,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:15,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454741222] [2019-11-23 22:31:15,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:15,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:15,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621310059] [2019-11-23 22:31:15,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:15,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:15,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:15,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:15,403 INFO L87 Difference]: Start difference. First operand 2473 states and 3632 transitions. Second operand 3 states. [2019-11-23 22:31:16,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:16,043 INFO L93 Difference]: Finished difference Result 6622 states and 9828 transitions. [2019-11-23 22:31:16,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:16,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-23 22:31:16,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:16,067 INFO L225 Difference]: With dead ends: 6622 [2019-11-23 22:31:16,068 INFO L226 Difference]: Without dead ends: 4572 [2019-11-23 22:31:16,072 INFO L630 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-11-23 22:31:16,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4572 states. [2019-11-23 22:31:16,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4572 to 4570. [2019-11-23 22:31:16,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4570 states. [2019-11-23 22:31:16,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4570 states to 4570 states and 6715 transitions. [2019-11-23 22:31:16,315 INFO L78 Accepts]: Start accepts. Automaton has 4570 states and 6715 transitions. Word has length 152 [2019-11-23 22:31:16,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:16,315 INFO L462 AbstractCegarLoop]: Abstraction has 4570 states and 6715 transitions. [2019-11-23 22:31:16,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:16,316 INFO L276 IsEmpty]: Start isEmpty. Operand 4570 states and 6715 transitions. [2019-11-23 22:31:16,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 22:31:16,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:16,326 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:16,327 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:16,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:16,327 INFO L82 PathProgramCache]: Analyzing trace with hash 243591764, now seen corresponding path program 1 times [2019-11-23 22:31:16,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:16,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420358846] [2019-11-23 22:31:16,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:16,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:16,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420358846] [2019-11-23 22:31:16,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:16,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:31:16,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285109306] [2019-11-23 22:31:16,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:31:16,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:16,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:31:16,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:16,588 INFO L87 Difference]: Start difference. First operand 4570 states and 6715 transitions. Second operand 5 states. [2019-11-23 22:31:17,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:17,092 INFO L93 Difference]: Finished difference Result 9906 states and 15527 transitions. [2019-11-23 22:31:17,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:31:17,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2019-11-23 22:31:17,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:17,134 INFO L225 Difference]: With dead ends: 9906 [2019-11-23 22:31:17,134 INFO L226 Difference]: Without dead ends: 8150 [2019-11-23 22:31:17,139 INFO L630 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-11-23 22:31:17,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8150 states. [2019-11-23 22:31:17,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8150 to 6396. [2019-11-23 22:31:17,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6396 states. [2019-11-23 22:31:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6396 states to 6396 states and 9715 transitions. [2019-11-23 22:31:17,551 INFO L78 Accepts]: Start accepts. Automaton has 6396 states and 9715 transitions. Word has length 152 [2019-11-23 22:31:17,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:17,551 INFO L462 AbstractCegarLoop]: Abstraction has 6396 states and 9715 transitions. [2019-11-23 22:31:17,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:31:17,551 INFO L276 IsEmpty]: Start isEmpty. Operand 6396 states and 9715 transitions. [2019-11-23 22:31:17,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 22:31:17,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:17,558 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:17,558 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:17,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:17,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1237221404, now seen corresponding path program 1 times [2019-11-23 22:31:17,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:17,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228237864] [2019-11-23 22:31:17,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:17,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228237864] [2019-11-23 22:31:17,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:17,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:17,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201448194] [2019-11-23 22:31:17,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:17,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:17,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:17,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:17,664 INFO L87 Difference]: Start difference. First operand 6396 states and 9715 transitions. Second operand 3 states. [2019-11-23 22:31:18,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:18,497 INFO L93 Difference]: Finished difference Result 14984 states and 23199 transitions. [2019-11-23 22:31:18,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:18,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-23 22:31:18,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:18,535 INFO L225 Difference]: With dead ends: 14984 [2019-11-23 22:31:18,536 INFO L226 Difference]: Without dead ends: 11174 [2019-11-23 22:31:18,544 INFO L630 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-11-23 22:31:18,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11174 states. [2019-11-23 22:31:19,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11174 to 11172. [2019-11-23 22:31:19,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11172 states. [2019-11-23 22:31:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11172 states to 11172 states and 16897 transitions. [2019-11-23 22:31:19,534 INFO L78 Accepts]: Start accepts. Automaton has 11172 states and 16897 transitions. Word has length 152 [2019-11-23 22:31:19,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:19,534 INFO L462 AbstractCegarLoop]: Abstraction has 11172 states and 16897 transitions. [2019-11-23 22:31:19,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:19,535 INFO L276 IsEmpty]: Start isEmpty. Operand 11172 states and 16897 transitions. [2019-11-23 22:31:19,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 22:31:19,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:19,551 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:19,551 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:19,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:19,552 INFO L82 PathProgramCache]: Analyzing trace with hash 198492957, now seen corresponding path program 1 times [2019-11-23 22:31:19,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:19,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206087745] [2019-11-23 22:31:19,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:19,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:19,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206087745] [2019-11-23 22:31:19,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:19,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:19,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121925467] [2019-11-23 22:31:19,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:19,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:19,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:19,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:19,778 INFO L87 Difference]: Start difference. First operand 11172 states and 16897 transitions. Second operand 4 states. [2019-11-23 22:31:20,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:20,472 INFO L93 Difference]: Finished difference Result 15176 states and 23415 transitions. [2019-11-23 22:31:20,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:20,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-23 22:31:20,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:20,499 INFO L225 Difference]: With dead ends: 15176 [2019-11-23 22:31:20,499 INFO L226 Difference]: Without dead ends: 11174 [2019-11-23 22:31:20,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-11-23 22:31:20,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11174 states. [2019-11-23 22:31:21,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11174 to 11172. [2019-11-23 22:31:21,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11172 states. [2019-11-23 22:31:21,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11172 states to 11172 states and 16813 transitions. [2019-11-23 22:31:21,186 INFO L78 Accepts]: Start accepts. Automaton has 11172 states and 16813 transitions. Word has length 152 [2019-11-23 22:31:21,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:21,189 INFO L462 AbstractCegarLoop]: Abstraction has 11172 states and 16813 transitions. [2019-11-23 22:31:21,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 11172 states and 16813 transitions. [2019-11-23 22:31:21,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 22:31:21,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:21,203 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:21,203 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:21,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:21,205 INFO L82 PathProgramCache]: Analyzing trace with hash -708900510, now seen corresponding path program 1 times [2019-11-23 22:31:21,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:21,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272591011] [2019-11-23 22:31:21,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:21,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:21,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272591011] [2019-11-23 22:31:21,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:21,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:21,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513094656] [2019-11-23 22:31:21,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:21,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:21,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:21,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:21,450 INFO L87 Difference]: Start difference. First operand 11172 states and 16813 transitions. Second operand 4 states. [2019-11-23 22:31:22,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:22,783 INFO L93 Difference]: Finished difference Result 29268 states and 44027 transitions. [2019-11-23 22:31:22,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:22,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-23 22:31:22,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:22,821 INFO L225 Difference]: With dead ends: 29268 [2019-11-23 22:31:22,822 INFO L226 Difference]: Without dead ends: 18115 [2019-11-23 22:31:22,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:22,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18115 states. [2019-11-23 22:31:23,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18115 to 18113. [2019-11-23 22:31:23,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18113 states. [2019-11-23 22:31:23,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18113 states to 18113 states and 26956 transitions. [2019-11-23 22:31:23,905 INFO L78 Accepts]: Start accepts. Automaton has 18113 states and 26956 transitions. Word has length 152 [2019-11-23 22:31:23,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:23,905 INFO L462 AbstractCegarLoop]: Abstraction has 18113 states and 26956 transitions. [2019-11-23 22:31:23,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:23,905 INFO L276 IsEmpty]: Start isEmpty. Operand 18113 states and 26956 transitions. [2019-11-23 22:31:23,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-23 22:31:23,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:23,922 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:23,922 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:23,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:23,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1734446853, now seen corresponding path program 1 times [2019-11-23 22:31:23,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:23,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716664620] [2019-11-23 22:31:23,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:24,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:24,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716664620] [2019-11-23 22:31:24,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:24,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:24,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138751735] [2019-11-23 22:31:24,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:24,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:24,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:24,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:24,010 INFO L87 Difference]: Start difference. First operand 18113 states and 26956 transitions. Second operand 3 states. [2019-11-23 22:31:25,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:25,176 INFO L93 Difference]: Finished difference Result 49143 states and 72994 transitions. [2019-11-23 22:31:25,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:25,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-23 22:31:25,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:25,249 INFO L225 Difference]: With dead ends: 49143 [2019-11-23 22:31:25,249 INFO L226 Difference]: Without dead ends: 31515 [2019-11-23 22:31:25,278 INFO L630 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-11-23 22:31:25,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31515 states. [2019-11-23 22:31:27,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31515 to 31513. [2019-11-23 22:31:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31513 states. [2019-11-23 22:31:27,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31513 states to 31513 states and 46190 transitions. [2019-11-23 22:31:27,374 INFO L78 Accepts]: Start accepts. Automaton has 31513 states and 46190 transitions. Word has length 154 [2019-11-23 22:31:27,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:27,374 INFO L462 AbstractCegarLoop]: Abstraction has 31513 states and 46190 transitions. [2019-11-23 22:31:27,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:27,374 INFO L276 IsEmpty]: Start isEmpty. Operand 31513 states and 46190 transitions. [2019-11-23 22:31:27,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-23 22:31:27,402 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:27,402 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:27,403 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:27,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:27,403 INFO L82 PathProgramCache]: Analyzing trace with hash -2131418088, now seen corresponding path program 1 times [2019-11-23 22:31:27,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:27,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079545258] [2019-11-23 22:31:27,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:27,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:27,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079545258] [2019-11-23 22:31:27,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:27,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:27,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974107516] [2019-11-23 22:31:27,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:27,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:27,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:27,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:27,537 INFO L87 Difference]: Start difference. First operand 31513 states and 46190 transitions. Second operand 4 states. [2019-11-23 22:31:28,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:28,446 INFO L93 Difference]: Finished difference Result 52633 states and 77128 transitions. [2019-11-23 22:31:28,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:28,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-23 22:31:28,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:28,511 INFO L225 Difference]: With dead ends: 52633 [2019-11-23 22:31:28,511 INFO L226 Difference]: Without dead ends: 28386 [2019-11-23 22:31:28,543 INFO L630 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-11-23 22:31:28,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28386 states. [2019-11-23 22:31:29,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28386 to 28386. [2019-11-23 22:31:29,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28386 states. [2019-11-23 22:31:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28386 states to 28386 states and 41593 transitions. [2019-11-23 22:31:29,577 INFO L78 Accepts]: Start accepts. Automaton has 28386 states and 41593 transitions. Word has length 154 [2019-11-23 22:31:29,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:29,577 INFO L462 AbstractCegarLoop]: Abstraction has 28386 states and 41593 transitions. [2019-11-23 22:31:29,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:29,577 INFO L276 IsEmpty]: Start isEmpty. Operand 28386 states and 41593 transitions. [2019-11-23 22:31:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-23 22:31:29,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:29,595 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:29,595 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:29,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:29,596 INFO L82 PathProgramCache]: Analyzing trace with hash 145948848, now seen corresponding path program 1 times [2019-11-23 22:31:29,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:29,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075493332] [2019-11-23 22:31:29,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:29,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075493332] [2019-11-23 22:31:29,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:29,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:29,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30788472] [2019-11-23 22:31:29,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:29,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:29,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:29,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:29,701 INFO L87 Difference]: Start difference. First operand 28386 states and 41593 transitions. Second operand 3 states. [2019-11-23 22:31:31,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:31,319 INFO L93 Difference]: Finished difference Result 51830 states and 78451 transitions. [2019-11-23 22:31:31,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:31,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-11-23 22:31:31,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:31,404 INFO L225 Difference]: With dead ends: 51830 [2019-11-23 22:31:31,404 INFO L226 Difference]: Without dead ends: 36132 [2019-11-23 22:31:31,427 INFO L630 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-11-23 22:31:31,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36132 states. [2019-11-23 22:31:32,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36132 to 33666. [2019-11-23 22:31:32,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33666 states. [2019-11-23 22:31:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33666 states to 33666 states and 49361 transitions. [2019-11-23 22:31:32,846 INFO L78 Accepts]: Start accepts. Automaton has 33666 states and 49361 transitions. Word has length 160 [2019-11-23 22:31:32,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:32,847 INFO L462 AbstractCegarLoop]: Abstraction has 33666 states and 49361 transitions. [2019-11-23 22:31:32,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:32,847 INFO L276 IsEmpty]: Start isEmpty. Operand 33666 states and 49361 transitions. [2019-11-23 22:31:32,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-23 22:31:32,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:32,861 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:32,861 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:32,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:32,862 INFO L82 PathProgramCache]: Analyzing trace with hash -823031726, now seen corresponding path program 1 times [2019-11-23 22:31:32,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:32,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667713002] [2019-11-23 22:31:32,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:33,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667713002] [2019-11-23 22:31:33,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:33,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:31:33,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008722425] [2019-11-23 22:31:33,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:31:33,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:33,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:31:33,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:31:33,123 INFO L87 Difference]: Start difference. First operand 33666 states and 49361 transitions. Second operand 9 states. [2019-11-23 22:31:35,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:35,086 INFO L93 Difference]: Finished difference Result 55414 states and 83395 transitions. [2019-11-23 22:31:35,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:35,087 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 160 [2019-11-23 22:31:35,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:35,122 INFO L225 Difference]: With dead ends: 55414 [2019-11-23 22:31:35,122 INFO L226 Difference]: Without dead ends: 33668 [2019-11-23 22:31:35,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:31:35,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33668 states. [2019-11-23 22:31:36,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33668 to 31426. [2019-11-23 22:31:36,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31426 states. [2019-11-23 22:31:36,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31426 states to 31426 states and 45593 transitions. [2019-11-23 22:31:36,504 INFO L78 Accepts]: Start accepts. Automaton has 31426 states and 45593 transitions. Word has length 160 [2019-11-23 22:31:36,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:36,504 INFO L462 AbstractCegarLoop]: Abstraction has 31426 states and 45593 transitions. [2019-11-23 22:31:36,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:31:36,504 INFO L276 IsEmpty]: Start isEmpty. Operand 31426 states and 45593 transitions. [2019-11-23 22:31:36,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-23 22:31:36,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:36,514 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:36,514 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:36,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:36,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1991122402, now seen corresponding path program 1 times [2019-11-23 22:31:36,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:36,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879735772] [2019-11-23 22:31:36,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:36,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879735772] [2019-11-23 22:31:36,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:36,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:31:36,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992383800] [2019-11-23 22:31:36,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:31:36,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:36,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:31:36,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:36,672 INFO L87 Difference]: Start difference. First operand 31426 states and 45593 transitions. Second operand 5 states. [2019-11-23 22:31:39,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:39,148 INFO L93 Difference]: Finished difference Result 63430 states and 95573 transitions. [2019-11-23 22:31:39,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:31:39,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-11-23 22:31:39,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:39,215 INFO L225 Difference]: With dead ends: 63430 [2019-11-23 22:31:39,215 INFO L226 Difference]: Without dead ends: 55188 [2019-11-23 22:31:39,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:31:39,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55188 states. [2019-11-23 22:31:41,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55188 to 33650. [2019-11-23 22:31:41,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33650 states. [2019-11-23 22:31:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33650 states to 33650 states and 49105 transitions. [2019-11-23 22:31:41,680 INFO L78 Accepts]: Start accepts. Automaton has 33650 states and 49105 transitions. Word has length 160 [2019-11-23 22:31:41,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:41,681 INFO L462 AbstractCegarLoop]: Abstraction has 33650 states and 49105 transitions. [2019-11-23 22:31:41,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:31:41,681 INFO L276 IsEmpty]: Start isEmpty. Operand 33650 states and 49105 transitions. [2019-11-23 22:31:41,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-23 22:31:41,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:41,691 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:41,691 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:41,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:41,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1752131473, now seen corresponding path program 1 times [2019-11-23 22:31:41,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:41,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967026549] [2019-11-23 22:31:41,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:41,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:41,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967026549] [2019-11-23 22:31:41,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:41,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:41,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708762173] [2019-11-23 22:31:41,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:41,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:41,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:41,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:41,914 INFO L87 Difference]: Start difference. First operand 33650 states and 49105 transitions. Second operand 4 states. [2019-11-23 22:31:44,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:44,973 INFO L93 Difference]: Finished difference Result 98524 states and 143453 transitions. [2019-11-23 22:31:44,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:44,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-11-23 22:31:44,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:45,042 INFO L225 Difference]: With dead ends: 98524 [2019-11-23 22:31:45,042 INFO L226 Difference]: Without dead ends: 64913 [2019-11-23 22:31:45,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:45,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64913 states. [2019-11-23 22:31:49,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64913 to 64911. [2019-11-23 22:31:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64911 states. [2019-11-23 22:31:49,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64911 states to 64911 states and 93478 transitions. [2019-11-23 22:31:49,632 INFO L78 Accepts]: Start accepts. Automaton has 64911 states and 93478 transitions. Word has length 160 [2019-11-23 22:31:49,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:49,632 INFO L462 AbstractCegarLoop]: Abstraction has 64911 states and 93478 transitions. [2019-11-23 22:31:49,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:49,632 INFO L276 IsEmpty]: Start isEmpty. Operand 64911 states and 93478 transitions. [2019-11-23 22:31:49,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-23 22:31:49,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:49,652 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:49,652 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:49,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:49,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1927797241, now seen corresponding path program 1 times [2019-11-23 22:31:49,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:49,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400367162] [2019-11-23 22:31:49,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:49,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400367162] [2019-11-23 22:31:49,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:49,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:49,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790192511] [2019-11-23 22:31:49,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:49,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:49,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:49,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:49,696 INFO L87 Difference]: Start difference. First operand 64911 states and 93478 transitions. Second operand 3 states. [2019-11-23 22:31:55,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:55,052 INFO L93 Difference]: Finished difference Result 194541 states and 280185 transitions. [2019-11-23 22:31:55,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:55,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-11-23 22:31:55,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:55,184 INFO L225 Difference]: With dead ends: 194541 [2019-11-23 22:31:55,184 INFO L226 Difference]: Without dead ends: 129735 [2019-11-23 22:31:55,219 INFO L630 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-11-23 22:31:55,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129735 states. [2019-11-23 22:32:00,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129735 to 64917. [2019-11-23 22:32:00,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64917 states. [2019-11-23 22:32:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64917 states to 64917 states and 93484 transitions. [2019-11-23 22:32:00,785 INFO L78 Accepts]: Start accepts. Automaton has 64917 states and 93484 transitions. Word has length 161 [2019-11-23 22:32:00,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:00,785 INFO L462 AbstractCegarLoop]: Abstraction has 64917 states and 93484 transitions. [2019-11-23 22:32:00,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:00,785 INFO L276 IsEmpty]: Start isEmpty. Operand 64917 states and 93484 transitions. [2019-11-23 22:32:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-23 22:32:00,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:00,807 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:32:00,807 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:00,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:00,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1605463580, now seen corresponding path program 1 times [2019-11-23 22:32:00,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:00,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235593635] [2019-11-23 22:32:00,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:00,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:00,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235593635] [2019-11-23 22:32:00,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:00,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:00,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888054799] [2019-11-23 22:32:00,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:00,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:00,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:00,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:00,892 INFO L87 Difference]: Start difference. First operand 64917 states and 93484 transitions. Second operand 3 states. [2019-11-23 22:32:06,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:06,909 INFO L93 Difference]: Finished difference Result 175326 states and 251627 transitions. [2019-11-23 22:32:06,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:06,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-11-23 22:32:06,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:07,029 INFO L225 Difference]: With dead ends: 175326 [2019-11-23 22:32:07,029 INFO L226 Difference]: Without dead ends: 111352 [2019-11-23 22:32:07,066 INFO L630 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-11-23 22:32:07,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111352 states. [2019-11-23 22:32:14,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111352 to 111350. [2019-11-23 22:32:14,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111350 states. [2019-11-23 22:32:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111350 states to 111350 states and 157473 transitions. [2019-11-23 22:32:14,593 INFO L78 Accepts]: Start accepts. Automaton has 111350 states and 157473 transitions. Word has length 162 [2019-11-23 22:32:14,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:14,593 INFO L462 AbstractCegarLoop]: Abstraction has 111350 states and 157473 transitions. [2019-11-23 22:32:14,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:14,593 INFO L276 IsEmpty]: Start isEmpty. Operand 111350 states and 157473 transitions. [2019-11-23 22:32:14,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-23 22:32:14,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:14,623 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:32:14,624 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:14,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:14,624 INFO L82 PathProgramCache]: Analyzing trace with hash 688559993, now seen corresponding path program 1 times [2019-11-23 22:32:14,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:14,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942547376] [2019-11-23 22:32:14,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:14,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942547376] [2019-11-23 22:32:14,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:14,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:32:14,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433636544] [2019-11-23 22:32:14,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:32:14,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:14,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:32:14,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:32:14,769 INFO L87 Difference]: Start difference. First operand 111350 states and 157473 transitions. Second operand 4 states. [2019-11-23 22:32:19,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:19,747 INFO L93 Difference]: Finished difference Result 206732 states and 292515 transitions. [2019-11-23 22:32:19,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:32:19,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-23 22:32:19,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:19,859 INFO L225 Difference]: With dead ends: 206732 [2019-11-23 22:32:19,859 INFO L226 Difference]: Without dead ends: 96207 [2019-11-23 22:32:19,914 INFO L630 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-11-23 22:32:19,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96207 states.