/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.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:31:25,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:31:25,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:31:25,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:31:25,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:31:25,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:31:25,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:31:25,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:31:25,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:31:25,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:31:25,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:31:25,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:31:25,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:31:25,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:31:25,960 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:31:25,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:31:25,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:31:25,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:31:25,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:31:25,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:31:25,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:31:25,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:31:25,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:31:25,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:31:25,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:31:25,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:31:25,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:31:25,984 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:31:25,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:31:25,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:31:25,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:31:25,990 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:31:25,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:31:25,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:31:25,992 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:31:25,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:31:25,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:31:25,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:31:25,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:31:25,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:31:25,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:31:26,002 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:26,023 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:31:26,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:31:26,025 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:31:26,025 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:31:26,025 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:31:26,026 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:31:26,026 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:31:26,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:31:26,026 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:31:26,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:31:26,028 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:31:26,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:31:26,028 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:31:26,028 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:31:26,029 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:31:26,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:31:26,029 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:31:26,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:31:26,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:31:26,030 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:31:26,030 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:31:26,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:31:26,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:31:26,031 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:31:26,031 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:31:26,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:31:26,031 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:31:26,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:31:26,031 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:31:26,032 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:31:26,312 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:31:26,324 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:31:26,328 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:31:26,329 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:31:26,330 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:31:26,330 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-23 22:31:26,415 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2603e2693/5fe1097429284252985537cda8918c91/FLAGa3a094526 [2019-11-23 22:31:26,985 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:31:26,986 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-23 22:31:27,003 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2603e2693/5fe1097429284252985537cda8918c91/FLAGa3a094526 [2019-11-23 22:31:27,245 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2603e2693/5fe1097429284252985537cda8918c91 [2019-11-23 22:31:27,253 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:31:27,254 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:31:27,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:31:27,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:31:27,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:31:27,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:31:27" (1/1) ... [2019-11-23 22:31:27,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16a17e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:27, skipping insertion in model container [2019-11-23 22:31:27,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:31:27" (1/1) ... [2019-11-23 22:31:27,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:31:27,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:31:27,862 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:31:27,874 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:31:28,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:31:28,033 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:31:28,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:28 WrapperNode [2019-11-23 22:31:28,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:31:28,034 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:31:28,034 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:31:28,035 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:31:28,043 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:28" (1/1) ... [2019-11-23 22:31:28,059 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:28" (1/1) ... [2019-11-23 22:31:28,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:31:28,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:31:28,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:31:28,127 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:31:28,135 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:28" (1/1) ... [2019-11-23 22:31:28,136 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:28" (1/1) ... [2019-11-23 22:31:28,140 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:28" (1/1) ... [2019-11-23 22:31:28,140 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:28" (1/1) ... [2019-11-23 22:31:28,155 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:28" (1/1) ... [2019-11-23 22:31:28,167 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:28" (1/1) ... [2019-11-23 22:31:28,171 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:28" (1/1) ... [2019-11-23 22:31:28,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:31:28,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:31:28,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:31:28,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:31:28,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:28" (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:28,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:31:28,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:31:29,730 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:31:29,730 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:31:29,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:31:29 BoogieIcfgContainer [2019-11-23 22:31:29,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:31:29,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:31:29,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:31:29,738 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:31:29,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:31:27" (1/3) ... [2019-11-23 22:31:29,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448d4080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:31:29, skipping insertion in model container [2019-11-23 22:31:29,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:28" (2/3) ... [2019-11-23 22:31:29,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448d4080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:31:29, skipping insertion in model container [2019-11-23 22:31:29,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:31:29" (3/3) ... [2019-11-23 22:31:29,743 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-23 22:31:29,752 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:31:29,760 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:31:29,772 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:31:29,801 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:31:29,801 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:31:29,801 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:31:29,802 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:31:29,802 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:31:29,802 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:31:29,802 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:31:29,803 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:31:29,824 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states. [2019-11-23 22:31:29,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-23 22:31:29,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:29,840 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] [2019-11-23 22:31:29,840 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:29,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:29,845 INFO L82 PathProgramCache]: Analyzing trace with hash -37487086, now seen corresponding path program 1 times [2019-11-23 22:31:29,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:29,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672978884] [2019-11-23 22:31:29,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:30,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:30,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672978884] [2019-11-23 22:31:30,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:30,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:30,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986151004] [2019-11-23 22:31:30,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:30,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:30,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:30,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:30,448 INFO L87 Difference]: Start difference. First operand 294 states. Second operand 3 states. [2019-11-23 22:31:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:30,716 INFO L93 Difference]: Finished difference Result 590 states and 1044 transitions. [2019-11-23 22:31:30,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:30,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-11-23 22:31:30,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:30,754 INFO L225 Difference]: With dead ends: 590 [2019-11-23 22:31:30,754 INFO L226 Difference]: Without dead ends: 473 [2019-11-23 22:31:30,761 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:30,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-11-23 22:31:30,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 471. [2019-11-23 22:31:30,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-11-23 22:31:30,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 702 transitions. [2019-11-23 22:31:30,907 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 702 transitions. Word has length 141 [2019-11-23 22:31:30,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:30,910 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 702 transitions. [2019-11-23 22:31:30,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:30,911 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 702 transitions. [2019-11-23 22:31:30,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-23 22:31:30,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:30,921 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] [2019-11-23 22:31:30,922 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:30,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:30,923 INFO L82 PathProgramCache]: Analyzing trace with hash -106858572, now seen corresponding path program 1 times [2019-11-23 22:31:30,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:30,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481152451] [2019-11-23 22:31:30,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:31,376 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:31,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481152451] [2019-11-23 22:31:31,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:31,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:31,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071909154] [2019-11-23 22:31:31,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:31,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:31,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:31,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:31,382 INFO L87 Difference]: Start difference. First operand 471 states and 702 transitions. Second operand 4 states. [2019-11-23 22:31:31,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:31,502 INFO L93 Difference]: Finished difference Result 1380 states and 2051 transitions. [2019-11-23 22:31:31,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:31,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-11-23 22:31:31,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:31,509 INFO L225 Difference]: With dead ends: 1380 [2019-11-23 22:31:31,509 INFO L226 Difference]: Without dead ends: 918 [2019-11-23 22:31:31,514 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:31,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-11-23 22:31:31,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 916. [2019-11-23 22:31:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-11-23 22:31:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1352 transitions. [2019-11-23 22:31:31,574 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1352 transitions. Word has length 141 [2019-11-23 22:31:31,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:31,575 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1352 transitions. [2019-11-23 22:31:31,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:31,575 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1352 transitions. [2019-11-23 22:31:31,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-23 22:31:31,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:31,578 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] [2019-11-23 22:31:31,578 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:31,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:31,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1746789024, now seen corresponding path program 1 times [2019-11-23 22:31:31,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:31,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819161630] [2019-11-23 22:31:31,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:31,673 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:31,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819161630] [2019-11-23 22:31:31,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:31,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:31,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039206229] [2019-11-23 22:31:31,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:31,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:31,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:31,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:31,679 INFO L87 Difference]: Start difference. First operand 916 states and 1352 transitions. Second operand 3 states. [2019-11-23 22:31:31,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:31,764 INFO L93 Difference]: Finished difference Result 2710 states and 3994 transitions. [2019-11-23 22:31:31,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:31,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-11-23 22:31:31,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:31,776 INFO L225 Difference]: With dead ends: 2710 [2019-11-23 22:31:31,776 INFO L226 Difference]: Without dead ends: 1822 [2019-11-23 22:31:31,779 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,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-11-23 22:31:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 918. [2019-11-23 22:31:31,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2019-11-23 22:31:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1354 transitions. [2019-11-23 22:31:31,842 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1354 transitions. Word has length 142 [2019-11-23 22:31:31,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:31,843 INFO L462 AbstractCegarLoop]: Abstraction has 918 states and 1354 transitions. [2019-11-23 22:31:31,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:31,849 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1354 transitions. [2019-11-23 22:31:31,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 22:31:31,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:31,853 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] [2019-11-23 22:31:31,853 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:31,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:31,854 INFO L82 PathProgramCache]: Analyzing trace with hash 463094692, now seen corresponding path program 1 times [2019-11-23 22:31:31,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:31,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994673205] [2019-11-23 22:31:31,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:31,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:31,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994673205] [2019-11-23 22:31:31,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:31,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:31,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231750653] [2019-11-23 22:31:31,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:31,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:31,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:31,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:31,985 INFO L87 Difference]: Start difference. First operand 918 states and 1354 transitions. Second operand 3 states. [2019-11-23 22:31:32,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:32,106 INFO L93 Difference]: Finished difference Result 2514 states and 3723 transitions. [2019-11-23 22:31:32,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:32,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-11-23 22:31:32,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:32,116 INFO L225 Difference]: With dead ends: 2514 [2019-11-23 22:31:32,117 INFO L226 Difference]: Without dead ends: 1774 [2019-11-23 22:31:32,118 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:32,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2019-11-23 22:31:32,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1772. [2019-11-23 22:31:32,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2019-11-23 22:31:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2587 transitions. [2019-11-23 22:31:32,226 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2587 transitions. Word has length 143 [2019-11-23 22:31:32,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:32,227 INFO L462 AbstractCegarLoop]: Abstraction has 1772 states and 2587 transitions. [2019-11-23 22:31:32,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:32,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2587 transitions. [2019-11-23 22:31:32,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 22:31:32,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:32,230 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] [2019-11-23 22:31:32,231 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:32,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:32,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2076257255, now seen corresponding path program 1 times [2019-11-23 22:31:32,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:32,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799242859] [2019-11-23 22:31:32,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:32,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799242859] [2019-11-23 22:31:32,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:32,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:32,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919411656] [2019-11-23 22:31:32,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:32,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:32,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:32,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:32,393 INFO L87 Difference]: Start difference. First operand 1772 states and 2587 transitions. Second operand 4 states. [2019-11-23 22:31:32,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:32,497 INFO L93 Difference]: Finished difference Result 2955 states and 4328 transitions. [2019-11-23 22:31:32,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:32,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-23 22:31:32,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:32,505 INFO L225 Difference]: With dead ends: 2955 [2019-11-23 22:31:32,506 INFO L226 Difference]: Without dead ends: 1351 [2019-11-23 22:31:32,508 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:32,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2019-11-23 22:31:32,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1351. [2019-11-23 22:31:32,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1351 states. [2019-11-23 22:31:32,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1964 transitions. [2019-11-23 22:31:32,580 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1964 transitions. Word has length 143 [2019-11-23 22:31:32,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:32,581 INFO L462 AbstractCegarLoop]: Abstraction has 1351 states and 1964 transitions. [2019-11-23 22:31:32,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:32,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1964 transitions. [2019-11-23 22:31:32,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-23 22:31:32,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:32,585 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:32,586 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:32,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:32,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1549951936, now seen corresponding path program 1 times [2019-11-23 22:31:32,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:32,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260601658] [2019-11-23 22:31:32,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:32,962 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:32,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260601658] [2019-11-23 22:31:32,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:32,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:31:32,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937605848] [2019-11-23 22:31:32,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:31:32,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:32,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:31:32,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:31:32,964 INFO L87 Difference]: Start difference. First operand 1351 states and 1964 transitions. Second operand 9 states. [2019-11-23 22:31:33,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:33,850 INFO L93 Difference]: Finished difference Result 2845 states and 4211 transitions. [2019-11-23 22:31:33,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:31:33,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 146 [2019-11-23 22:31:33,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:33,859 INFO L225 Difference]: With dead ends: 2845 [2019-11-23 22:31:33,859 INFO L226 Difference]: Without dead ends: 1661 [2019-11-23 22:31:33,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:31:33,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2019-11-23 22:31:33,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1351. [2019-11-23 22:31:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1351 states. [2019-11-23 22:31:33,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1954 transitions. [2019-11-23 22:31:33,985 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1954 transitions. Word has length 146 [2019-11-23 22:31:33,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:33,985 INFO L462 AbstractCegarLoop]: Abstraction has 1351 states and 1954 transitions. [2019-11-23 22:31:33,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:31:33,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1954 transitions. [2019-11-23 22:31:33,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-23 22:31:33,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:33,990 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:33,991 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:33,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:33,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1026467579, now seen corresponding path program 1 times [2019-11-23 22:31:33,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:33,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064921030] [2019-11-23 22:31:33,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:34,194 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:34,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064921030] [2019-11-23 22:31:34,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:34,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:34,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706278185] [2019-11-23 22:31:34,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:34,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:34,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:34,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:34,196 INFO L87 Difference]: Start difference. First operand 1351 states and 1954 transitions. Second operand 4 states. [2019-11-23 22:31:34,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:34,446 INFO L93 Difference]: Finished difference Result 2929 states and 4387 transitions. [2019-11-23 22:31:34,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:34,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-11-23 22:31:34,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:34,459 INFO L225 Difference]: With dead ends: 2929 [2019-11-23 22:31:34,459 INFO L226 Difference]: Without dead ends: 2359 [2019-11-23 22:31:34,461 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:34,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2019-11-23 22:31:34,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2357. [2019-11-23 22:31:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2357 states. [2019-11-23 22:31:34,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 3445 transitions. [2019-11-23 22:31:34,622 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 3445 transitions. Word has length 146 [2019-11-23 22:31:34,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:34,622 INFO L462 AbstractCegarLoop]: Abstraction has 2357 states and 3445 transitions. [2019-11-23 22:31:34,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:34,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 3445 transitions. [2019-11-23 22:31:34,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-23 22:31:34,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:34,626 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:34,627 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:34,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:34,627 INFO L82 PathProgramCache]: Analyzing trace with hash -981368772, now seen corresponding path program 1 times [2019-11-23 22:31:34,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:34,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479956115] [2019-11-23 22:31:34,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:34,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479956115] [2019-11-23 22:31:34,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:34,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:34,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030334552] [2019-11-23 22:31:34,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:34,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:34,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:34,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:34,875 INFO L87 Difference]: Start difference. First operand 2357 states and 3445 transitions. Second operand 4 states. [2019-11-23 22:31:35,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:35,139 INFO L93 Difference]: Finished difference Result 6107 states and 8920 transitions. [2019-11-23 22:31:35,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:35,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-11-23 22:31:35,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:35,159 INFO L225 Difference]: With dead ends: 6107 [2019-11-23 22:31:35,159 INFO L226 Difference]: Without dead ends: 3769 [2019-11-23 22:31:35,163 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:35,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3769 states. [2019-11-23 22:31:35,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3769 to 3767. [2019-11-23 22:31:35,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3767 states. [2019-11-23 22:31:35,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3767 states to 3767 states and 5449 transitions. [2019-11-23 22:31:35,388 INFO L78 Accepts]: Start accepts. Automaton has 3767 states and 5449 transitions. Word has length 146 [2019-11-23 22:31:35,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:35,389 INFO L462 AbstractCegarLoop]: Abstraction has 3767 states and 5449 transitions. [2019-11-23 22:31:35,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:35,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3767 states and 5449 transitions. [2019-11-23 22:31:35,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:31:35,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:35,395 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] [2019-11-23 22:31:35,395 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:35,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:35,396 INFO L82 PathProgramCache]: Analyzing trace with hash -850172162, now seen corresponding path program 1 times [2019-11-23 22:31:35,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:35,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510970162] [2019-11-23 22:31:35,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:35,502 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:35,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510970162] [2019-11-23 22:31:35,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:35,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:35,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976951642] [2019-11-23 22:31:35,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:35,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:35,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:35,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:35,505 INFO L87 Difference]: Start difference. First operand 3767 states and 5449 transitions. Second operand 3 states. [2019-11-23 22:31:35,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:35,879 INFO L93 Difference]: Finished difference Result 10585 states and 15355 transitions. [2019-11-23 22:31:35,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:35,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-23 22:31:35,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:35,912 INFO L225 Difference]: With dead ends: 10585 [2019-11-23 22:31:35,913 INFO L226 Difference]: Without dead ends: 7165 [2019-11-23 22:31:35,919 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:35,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7165 states. [2019-11-23 22:31:36,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7165 to 7163. [2019-11-23 22:31:36,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7163 states. [2019-11-23 22:31:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7163 states to 7163 states and 10247 transitions. [2019-11-23 22:31:36,364 INFO L78 Accepts]: Start accepts. Automaton has 7163 states and 10247 transitions. Word has length 148 [2019-11-23 22:31:36,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:36,364 INFO L462 AbstractCegarLoop]: Abstraction has 7163 states and 10247 transitions. [2019-11-23 22:31:36,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:36,364 INFO L276 IsEmpty]: Start isEmpty. Operand 7163 states and 10247 transitions. [2019-11-23 22:31:36,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:31:36,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:36,374 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] [2019-11-23 22:31:36,374 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:36,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:36,374 INFO L82 PathProgramCache]: Analyzing trace with hash 486667227, now seen corresponding path program 1 times [2019-11-23 22:31:36,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:36,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738883108] [2019-11-23 22:31:36,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:36,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738883108] [2019-11-23 22:31:36,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:36,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:36,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386724432] [2019-11-23 22:31:36,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:36,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:36,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:36,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:36,520 INFO L87 Difference]: Start difference. First operand 7163 states and 10247 transitions. Second operand 4 states. [2019-11-23 22:31:36,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:36,887 INFO L93 Difference]: Finished difference Result 11339 states and 16235 transitions. [2019-11-23 22:31:36,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:36,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-23 22:31:36,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:36,922 INFO L225 Difference]: With dead ends: 11339 [2019-11-23 22:31:36,922 INFO L226 Difference]: Without dead ends: 5827 [2019-11-23 22:31:36,933 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:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5827 states. [2019-11-23 22:31:37,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5827 to 5827. [2019-11-23 22:31:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5827 states. [2019-11-23 22:31:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5827 states to 5827 states and 8307 transitions. [2019-11-23 22:31:37,432 INFO L78 Accepts]: Start accepts. Automaton has 5827 states and 8307 transitions. Word has length 148 [2019-11-23 22:31:37,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:37,433 INFO L462 AbstractCegarLoop]: Abstraction has 5827 states and 8307 transitions. [2019-11-23 22:31:37,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 5827 states and 8307 transitions. [2019-11-23 22:31:37,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 22:31:37,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:37,441 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] [2019-11-23 22:31:37,441 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:37,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:37,442 INFO L82 PathProgramCache]: Analyzing trace with hash -236565050, now seen corresponding path program 1 times [2019-11-23 22:31:37,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:37,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430820374] [2019-11-23 22:31:37,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:37,617 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:37,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430820374] [2019-11-23 22:31:37,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:37,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:31:37,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90457025] [2019-11-23 22:31:37,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:31:37,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:37,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:31:37,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:31:37,619 INFO L87 Difference]: Start difference. First operand 5827 states and 8307 transitions. Second operand 8 states. [2019-11-23 22:31:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:39,094 INFO L93 Difference]: Finished difference Result 19404 states and 28969 transitions. [2019-11-23 22:31:39,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 22:31:39,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 151 [2019-11-23 22:31:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:39,209 INFO L225 Difference]: With dead ends: 19404 [2019-11-23 22:31:39,210 INFO L226 Difference]: Without dead ends: 13949 [2019-11-23 22:31:39,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-11-23 22:31:39,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13949 states. [2019-11-23 22:31:39,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13949 to 8567. [2019-11-23 22:31:39,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8567 states. [2019-11-23 22:31:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8567 states to 8567 states and 12451 transitions. [2019-11-23 22:31:39,832 INFO L78 Accepts]: Start accepts. Automaton has 8567 states and 12451 transitions. Word has length 151 [2019-11-23 22:31:39,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:39,832 INFO L462 AbstractCegarLoop]: Abstraction has 8567 states and 12451 transitions. [2019-11-23 22:31:39,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:31:39,833 INFO L276 IsEmpty]: Start isEmpty. Operand 8567 states and 12451 transitions. [2019-11-23 22:31:39,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 22:31:39,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:39,842 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] [2019-11-23 22:31:39,843 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:39,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:39,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1560885536, now seen corresponding path program 1 times [2019-11-23 22:31:39,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:39,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627218139] [2019-11-23 22:31:39,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:40,068 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:40,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627218139] [2019-11-23 22:31:40,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:40,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:40,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164324561] [2019-11-23 22:31:40,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:40,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:40,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:40,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:40,072 INFO L87 Difference]: Start difference. First operand 8567 states and 12451 transitions. Second operand 4 states. [2019-11-23 22:31:41,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:41,053 INFO L93 Difference]: Finished difference Result 24914 states and 36133 transitions. [2019-11-23 22:31:41,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:41,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-23 22:31:41,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:41,086 INFO L225 Difference]: With dead ends: 24914 [2019-11-23 22:31:41,086 INFO L226 Difference]: Without dead ends: 16386 [2019-11-23 22:31:41,100 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:41,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16386 states. [2019-11-23 22:31:42,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16386 to 16384. [2019-11-23 22:31:42,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16384 states. [2019-11-23 22:31:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16384 states to 16384 states and 23497 transitions. [2019-11-23 22:31:42,858 INFO L78 Accepts]: Start accepts. Automaton has 16384 states and 23497 transitions. Word has length 151 [2019-11-23 22:31:42,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:42,858 INFO L462 AbstractCegarLoop]: Abstraction has 16384 states and 23497 transitions. [2019-11-23 22:31:42,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:42,859 INFO L276 IsEmpty]: Start isEmpty. Operand 16384 states and 23497 transitions. [2019-11-23 22:31:42,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 22:31:42,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:42,875 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:42,876 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:42,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:42,876 INFO L82 PathProgramCache]: Analyzing trace with hash 633734794, now seen corresponding path program 1 times [2019-11-23 22:31:42,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:42,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648342959] [2019-11-23 22:31:42,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:42,923 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:42,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648342959] [2019-11-23 22:31:42,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:42,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:42,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580753401] [2019-11-23 22:31:42,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:42,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:42,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:42,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:42,926 INFO L87 Difference]: Start difference. First operand 16384 states and 23497 transitions. Second operand 3 states. [2019-11-23 22:31:44,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:44,234 INFO L93 Difference]: Finished difference Result 48966 states and 70250 transitions. [2019-11-23 22:31:44,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:44,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-23 22:31:44,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:44,293 INFO L225 Difference]: With dead ends: 48966 [2019-11-23 22:31:44,293 INFO L226 Difference]: Without dead ends: 32684 [2019-11-23 22:31:44,315 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:44,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32684 states. [2019-11-23 22:31:45,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32684 to 16390. [2019-11-23 22:31:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16390 states. [2019-11-23 22:31:45,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16390 states to 16390 states and 23503 transitions. [2019-11-23 22:31:45,552 INFO L78 Accepts]: Start accepts. Automaton has 16390 states and 23503 transitions. Word has length 152 [2019-11-23 22:31:45,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:45,552 INFO L462 AbstractCegarLoop]: Abstraction has 16390 states and 23503 transitions. [2019-11-23 22:31:45,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:45,552 INFO L276 IsEmpty]: Start isEmpty. Operand 16390 states and 23503 transitions. [2019-11-23 22:31:45,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:31:45,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:45,564 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] [2019-11-23 22:31:45,564 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:45,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:45,565 INFO L82 PathProgramCache]: Analyzing trace with hash 76406335, now seen corresponding path program 1 times [2019-11-23 22:31:45,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:45,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39422314] [2019-11-23 22:31:45,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:45,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:45,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39422314] [2019-11-23 22:31:45,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:45,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:45,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506181829] [2019-11-23 22:31:45,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:45,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:45,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:45,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:45,696 INFO L87 Difference]: Start difference. First operand 16390 states and 23503 transitions. Second operand 4 states. [2019-11-23 22:31:46,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:46,500 INFO L93 Difference]: Finished difference Result 32742 states and 46954 transitions. [2019-11-23 22:31:46,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:46,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-23 22:31:46,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:46,527 INFO L225 Difference]: With dead ends: 32742 [2019-11-23 22:31:46,527 INFO L226 Difference]: Without dead ends: 16384 [2019-11-23 22:31:46,546 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:46,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16384 states. [2019-11-23 22:31:47,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16384 to 16384. [2019-11-23 22:31:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16384 states. [2019-11-23 22:31:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16384 states to 16384 states and 23491 transitions. [2019-11-23 22:31:47,617 INFO L78 Accepts]: Start accepts. Automaton has 16384 states and 23491 transitions. Word has length 153 [2019-11-23 22:31:47,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:47,617 INFO L462 AbstractCegarLoop]: Abstraction has 16384 states and 23491 transitions. [2019-11-23 22:31:47,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 16384 states and 23491 transitions. [2019-11-23 22:31:47,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 22:31:47,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:47,628 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] [2019-11-23 22:31:47,628 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:47,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:47,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1107932436, now seen corresponding path program 1 times [2019-11-23 22:31:47,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:47,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454005874] [2019-11-23 22:31:47,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:47,707 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:47,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454005874] [2019-11-23 22:31:47,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:47,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:47,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775861352] [2019-11-23 22:31:47,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:47,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:47,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:47,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:47,710 INFO L87 Difference]: Start difference. First operand 16384 states and 23491 transitions. Second operand 3 states. [2019-11-23 22:31:49,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:49,708 INFO L93 Difference]: Finished difference Result 40139 states and 57648 transitions. [2019-11-23 22:31:49,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:49,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-23 22:31:49,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:49,736 INFO L225 Difference]: With dead ends: 40139 [2019-11-23 22:31:49,737 INFO L226 Difference]: Without dead ends: 24435 [2019-11-23 22:31:49,754 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:49,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24435 states. [2019-11-23 22:31:51,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24435 to 24433. [2019-11-23 22:31:51,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24433 states. [2019-11-23 22:31:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24433 states to 24433 states and 34578 transitions. [2019-11-23 22:31:51,093 INFO L78 Accepts]: Start accepts. Automaton has 24433 states and 34578 transitions. Word has length 153 [2019-11-23 22:31:51,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:51,094 INFO L462 AbstractCegarLoop]: Abstraction has 24433 states and 34578 transitions. [2019-11-23 22:31:51,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:51,094 INFO L276 IsEmpty]: Start isEmpty. Operand 24433 states and 34578 transitions. [2019-11-23 22:31:51,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-23 22:31:51,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:51,107 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] [2019-11-23 22:31:51,107 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:51,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:51,107 INFO L82 PathProgramCache]: Analyzing trace with hash -95330796, now seen corresponding path program 1 times [2019-11-23 22:31:51,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:51,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362918744] [2019-11-23 22:31:51,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:51,481 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:51,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362918744] [2019-11-23 22:31:51,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:51,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:51,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318457011] [2019-11-23 22:31:51,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:51,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:51,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:51,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:51,486 INFO L87 Difference]: Start difference. First operand 24433 states and 34578 transitions. Second operand 4 states. [2019-11-23 22:31:53,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:53,192 INFO L93 Difference]: Finished difference Result 45631 states and 64526 transitions. [2019-11-23 22:31:53,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:53,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-11-23 22:31:53,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:53,213 INFO L225 Difference]: With dead ends: 45631 [2019-11-23 22:31:53,214 INFO L226 Difference]: Without dead ends: 21472 [2019-11-23 22:31:53,230 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:53,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21472 states. [2019-11-23 22:31:54,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21472 to 21435. [2019-11-23 22:31:54,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21435 states. [2019-11-23 22:31:54,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21435 states to 21435 states and 30218 transitions. [2019-11-23 22:31:54,458 INFO L78 Accepts]: Start accepts. Automaton has 21435 states and 30218 transitions. Word has length 159 [2019-11-23 22:31:54,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:54,459 INFO L462 AbstractCegarLoop]: Abstraction has 21435 states and 30218 transitions. [2019-11-23 22:31:54,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:54,459 INFO L276 IsEmpty]: Start isEmpty. Operand 21435 states and 30218 transitions. [2019-11-23 22:31:54,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-23 22:31:54,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:54,468 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:54,468 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:54,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:54,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1413355346, now seen corresponding path program 1 times [2019-11-23 22:31:54,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:54,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984225069] [2019-11-23 22:31:54,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:54,651 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:54,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984225069] [2019-11-23 22:31:54,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:54,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:54,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188069556] [2019-11-23 22:31:54,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:54,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:54,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:54,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:54,654 INFO L87 Difference]: Start difference. First operand 21435 states and 30218 transitions. Second operand 4 states. [2019-11-23 22:31:56,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:56,217 INFO L93 Difference]: Finished difference Result 42865 states and 60433 transitions. [2019-11-23 22:31:56,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:56,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-23 22:31:56,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:56,235 INFO L225 Difference]: With dead ends: 42865 [2019-11-23 22:31:56,235 INFO L226 Difference]: Without dead ends: 21581 [2019-11-23 22:31:56,249 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:56,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21581 states. [2019-11-23 22:31:57,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21581 to 21527. [2019-11-23 22:31:57,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21527 states. [2019-11-23 22:31:57,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21527 states to 21527 states and 30311 transitions. [2019-11-23 22:31:57,385 INFO L78 Accepts]: Start accepts. Automaton has 21527 states and 30311 transitions. Word has length 161 [2019-11-23 22:31:57,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:57,385 INFO L462 AbstractCegarLoop]: Abstraction has 21527 states and 30311 transitions. [2019-11-23 22:31:57,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:57,385 INFO L276 IsEmpty]: Start isEmpty. Operand 21527 states and 30311 transitions. [2019-11-23 22:31:57,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-23 22:31:57,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:57,395 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:31:57,396 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:57,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:57,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1608117858, now seen corresponding path program 1 times [2019-11-23 22:31:57,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:57,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231951956] [2019-11-23 22:31:57,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:57,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231951956] [2019-11-23 22:31:57,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:57,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:57,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049720835] [2019-11-23 22:31:57,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:57,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:57,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:57,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:57,444 INFO L87 Difference]: Start difference. First operand 21527 states and 30311 transitions. Second operand 3 states. [2019-11-23 22:31:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:59,729 INFO L93 Difference]: Finished difference Result 59108 states and 83439 transitions. [2019-11-23 22:31:59,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:59,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-11-23 22:31:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:59,777 INFO L225 Difference]: With dead ends: 59108 [2019-11-23 22:31:59,777 INFO L226 Difference]: Without dead ends: 42853 [2019-11-23 22:31:59,796 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:59,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42853 states. [2019-11-23 22:32:01,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42853 to 21537. [2019-11-23 22:32:01,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21537 states. [2019-11-23 22:32:01,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21537 states to 21537 states and 30321 transitions. [2019-11-23 22:32:01,873 INFO L78 Accepts]: Start accepts. Automaton has 21537 states and 30321 transitions. Word has length 162 [2019-11-23 22:32:01,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:01,873 INFO L462 AbstractCegarLoop]: Abstraction has 21537 states and 30321 transitions. [2019-11-23 22:32:01,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:01,873 INFO L276 IsEmpty]: Start isEmpty. Operand 21537 states and 30321 transitions. [2019-11-23 22:32:01,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 22:32:01,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:01,880 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, 1] [2019-11-23 22:32:01,880 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:01,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:01,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1976932778, now seen corresponding path program 1 times [2019-11-23 22:32:01,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:01,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908152745] [2019-11-23 22:32:01,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:02,040 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:02,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908152745] [2019-11-23 22:32:02,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:02,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:32:02,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404474894] [2019-11-23 22:32:02,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:32:02,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:02,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:32:02,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:32:02,043 INFO L87 Difference]: Start difference. First operand 21537 states and 30321 transitions. Second operand 5 states. [2019-11-23 22:32:03,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:03,496 INFO L93 Difference]: Finished difference Result 43184 states and 60757 transitions. [2019-11-23 22:32:03,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:32:03,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 163 [2019-11-23 22:32:03,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:03,515 INFO L225 Difference]: With dead ends: 43184 [2019-11-23 22:32:03,515 INFO L226 Difference]: Without dead ends: 21900 [2019-11-23 22:32:03,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:32:03,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21900 states. [2019-11-23 22:32:04,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21900 to 21763. [2019-11-23 22:32:04,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21763 states. [2019-11-23 22:32:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21763 states to 21763 states and 30552 transitions. [2019-11-23 22:32:04,740 INFO L78 Accepts]: Start accepts. Automaton has 21763 states and 30552 transitions. Word has length 163 [2019-11-23 22:32:04,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:04,741 INFO L462 AbstractCegarLoop]: Abstraction has 21763 states and 30552 transitions. [2019-11-23 22:32:04,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:32:04,741 INFO L276 IsEmpty]: Start isEmpty. Operand 21763 states and 30552 transitions. [2019-11-23 22:32:04,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 22:32:04,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:04,748 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, 1] [2019-11-23 22:32:04,748 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:04,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:04,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1801353677, now seen corresponding path program 1 times [2019-11-23 22:32:04,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:04,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262863201] [2019-11-23 22:32:04,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:04,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:04,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262863201] [2019-11-23 22:32:04,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:04,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:32:04,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426043714] [2019-11-23 22:32:04,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:32:04,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:04,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:32:04,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:32:04,865 INFO L87 Difference]: Start difference. First operand 21763 states and 30552 transitions. Second operand 4 states. [2019-11-23 22:32:06,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:06,151 INFO L93 Difference]: Finished difference Result 30606 states and 43033 transitions. [2019-11-23 22:32:06,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:32:06,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-23 22:32:06,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:06,168 INFO L225 Difference]: With dead ends: 30606 [2019-11-23 22:32:06,169 INFO L226 Difference]: Without dead ends: 18893 [2019-11-23 22:32:06,176 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:06,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18893 states. [2019-11-23 22:32:07,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18893 to 18890. [2019-11-23 22:32:07,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18890 states. [2019-11-23 22:32:07,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18890 states to 18890 states and 26444 transitions. [2019-11-23 22:32:07,236 INFO L78 Accepts]: Start accepts. Automaton has 18890 states and 26444 transitions. Word has length 163 [2019-11-23 22:32:07,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:07,237 INFO L462 AbstractCegarLoop]: Abstraction has 18890 states and 26444 transitions. [2019-11-23 22:32:07,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:32:07,237 INFO L276 IsEmpty]: Start isEmpty. Operand 18890 states and 26444 transitions. [2019-11-23 22:32:07,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-23 22:32:07,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:07,242 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, 1, 1, 1, 1, 1, 1] [2019-11-23 22:32:07,243 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:07,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:07,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1487758919, now seen corresponding path program 1 times [2019-11-23 22:32:07,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:07,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310374] [2019-11-23 22:32:07,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:08,442 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:08,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310374] [2019-11-23 22:32:08,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:08,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-11-23 22:32:08,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223236774] [2019-11-23 22:32:08,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 22:32:08,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:08,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 22:32:08,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2019-11-23 22:32:08,444 INFO L87 Difference]: Start difference. First operand 18890 states and 26444 transitions. Second operand 22 states. [2019-11-23 22:32:09,399 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-11-23 22:32:09,586 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-23 22:32:09,817 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-11-23 22:32:10,167 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-11-23 22:32:10,404 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-11-23 22:32:11,112 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-11-23 22:32:11,335 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-11-23 22:32:11,825 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-11-23 22:32:12,145 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-11-23 22:32:12,290 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2019-11-23 22:32:12,549 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-11-23 22:32:13,044 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 44 [2019-11-23 22:32:13,255 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2019-11-23 22:32:15,920 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2019-11-23 22:32:17,844 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 46 [2019-11-23 22:32:18,062 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2019-11-23 22:32:18,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:18,499 INFO L93 Difference]: Finished difference Result 53670 states and 76921 transitions. [2019-11-23 22:32:18,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-23 22:32:18,499 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 168 [2019-11-23 22:32:18,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:18,546 INFO L225 Difference]: With dead ends: 53670 [2019-11-23 22:32:18,546 INFO L226 Difference]: Without dead ends: 42208 [2019-11-23 22:32:18,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=535, Invalid=1627, Unknown=0, NotChecked=0, Total=2162 [2019-11-23 22:32:18,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42208 states. [2019-11-23 22:32:21,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42208 to 28298. [2019-11-23 22:32:21,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28298 states. [2019-11-23 22:32:21,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28298 states to 28298 states and 39420 transitions. [2019-11-23 22:32:21,411 INFO L78 Accepts]: Start accepts. Automaton has 28298 states and 39420 transitions. Word has length 168 [2019-11-23 22:32:21,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:21,411 INFO L462 AbstractCegarLoop]: Abstraction has 28298 states and 39420 transitions. [2019-11-23 22:32:21,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 22:32:21,412 INFO L276 IsEmpty]: Start isEmpty. Operand 28298 states and 39420 transitions. [2019-11-23 22:32:21,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-23 22:32:21,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:21,419 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, 1, 1, 1, 1, 1, 1] [2019-11-23 22:32:21,420 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:21,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:21,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1422081639, now seen corresponding path program 1 times [2019-11-23 22:32:21,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:21,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983703012] [2019-11-23 22:32:21,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:21,549 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:21,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983703012] [2019-11-23 22:32:21,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:21,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:32:21,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558878279] [2019-11-23 22:32:21,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:32:21,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:21,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:32:21,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:32:21,551 INFO L87 Difference]: Start difference. First operand 28298 states and 39420 transitions. Second operand 5 states. [2019-11-23 22:32:26,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:26,255 INFO L93 Difference]: Finished difference Result 76814 states and 113550 transitions. [2019-11-23 22:32:26,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:32:26,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 168 [2019-11-23 22:32:26,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:26,365 INFO L225 Difference]: With dead ends: 76814 [2019-11-23 22:32:26,365 INFO L226 Difference]: Without dead ends: 60708 [2019-11-23 22:32:26,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:32:26,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60708 states. [2019-11-23 22:32:32,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60708 to 60394. [2019-11-23 22:32:32,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60394 states. [2019-11-23 22:32:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60394 states to 60394 states and 88426 transitions. [2019-11-23 22:32:32,604 INFO L78 Accepts]: Start accepts. Automaton has 60394 states and 88426 transitions. Word has length 168 [2019-11-23 22:32:32,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:32,604 INFO L462 AbstractCegarLoop]: Abstraction has 60394 states and 88426 transitions. [2019-11-23 22:32:32,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:32:32,604 INFO L276 IsEmpty]: Start isEmpty. Operand 60394 states and 88426 transitions. [2019-11-23 22:32:32,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-23 22:32:32,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:32,615 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, 1, 1, 1, 1, 1, 1] [2019-11-23 22:32:32,616 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:32,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:32,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1392072489, now seen corresponding path program 1 times [2019-11-23 22:32:32,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:32,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549914655] [2019-11-23 22:32:32,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:32,720 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:32,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549914655] [2019-11-23 22:32:32,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:32,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:32,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57624257] [2019-11-23 22:32:32,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:32,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:32,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:32,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:32,722 INFO L87 Difference]: Start difference. First operand 60394 states and 88426 transitions. Second operand 3 states. [2019-11-23 22:32:40,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:40,824 INFO L93 Difference]: Finished difference Result 129226 states and 193010 transitions. [2019-11-23 22:32:40,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:40,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-11-23 22:32:40,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:40,935 INFO L225 Difference]: With dead ends: 129226 [2019-11-23 22:32:40,935 INFO L226 Difference]: Without dead ends: 96240 [2019-11-23 22:32:40,963 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:41,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96240 states.