/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/systemc/token_ring.04.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:49:16,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:49:16,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:49:16,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:49:16,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:49:16,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:49:16,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:49:16,870 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:49:16,872 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:49:16,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:49:16,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:49:16,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:49:16,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:49:16,876 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:49:16,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:49:16,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:49:16,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:49:16,879 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:49:16,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:49:16,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:49:16,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:49:16,889 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:49:16,891 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:49:16,891 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:49:16,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:49:16,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:49:16,899 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:49:16,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:49:16,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:49:16,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:49:16,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:49:16,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:49:16,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:49:16,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:49:16,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:49:16,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:49:16,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:49:16,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:49:16,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:49:16,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:49:16,914 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:49:16,916 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:49:16,936 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:49:16,937 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:49:16,939 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:49:16,939 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:49:16,939 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:49:16,939 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:49:16,940 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:49:16,940 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:49:16,940 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:49:16,940 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:49:16,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:49:16,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:49:16,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:49:16,942 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:49:16,942 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:49:16,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:49:16,942 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:49:16,943 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:49:16,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:49:16,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:49:16,943 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:49:16,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:49:16,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:49:16,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:49:16,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:49:16,944 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:49:16,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:49:16,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:49:16,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:49:16,945 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:49:17,240 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:49:17,256 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:49:17,259 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:49:17,260 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:49:17,261 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:49:17,262 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.04.cil-2.c [2019-11-23 22:49:17,335 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4a203b0/e6dbff3accdd4f87aa694be75c4fd149/FLAGbb36727f3 [2019-11-23 22:49:17,849 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:49:17,854 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.04.cil-2.c [2019-11-23 22:49:17,872 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4a203b0/e6dbff3accdd4f87aa694be75c4fd149/FLAGbb36727f3 [2019-11-23 22:49:18,166 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4a203b0/e6dbff3accdd4f87aa694be75c4fd149 [2019-11-23 22:49:18,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:49:18,175 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:49:18,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:49:18,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:49:18,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:49:18,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:49:18" (1/1) ... [2019-11-23 22:49:18,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6945624f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:18, skipping insertion in model container [2019-11-23 22:49:18,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:49:18" (1/1) ... [2019-11-23 22:49:18,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:49:18,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:49:18,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:49:18,508 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:49:18,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:49:18,683 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:49:18,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:18 WrapperNode [2019-11-23 22:49:18,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:49:18,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:49:18,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:49:18,685 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:49:18,692 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:49:18" (1/1) ... [2019-11-23 22:49:18,702 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:49:18" (1/1) ... [2019-11-23 22:49:18,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:49:18,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:49:18,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:49:18,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:49:18,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:18" (1/1) ... [2019-11-23 22:49:18,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:18" (1/1) ... [2019-11-23 22:49:18,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:18" (1/1) ... [2019-11-23 22:49:18,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:18" (1/1) ... [2019-11-23 22:49:18,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:18" (1/1) ... [2019-11-23 22:49:18,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:18" (1/1) ... [2019-11-23 22:49:18,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:18" (1/1) ... [2019-11-23 22:49:18,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:49:18,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:49:18,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:49:18,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:49:18,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:18" (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:49:18,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:49:18,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:49:20,272 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:49:20,273 INFO L284 CfgBuilder]: Removed 163 assume(true) statements. [2019-11-23 22:49:20,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:49:20 BoogieIcfgContainer [2019-11-23 22:49:20,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:49:20,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:49:20,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:49:20,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:49:20,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:49:18" (1/3) ... [2019-11-23 22:49:20,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee4e887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:49:20, skipping insertion in model container [2019-11-23 22:49:20,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:18" (2/3) ... [2019-11-23 22:49:20,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee4e887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:49:20, skipping insertion in model container [2019-11-23 22:49:20,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:49:20" (3/3) ... [2019-11-23 22:49:20,286 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.04.cil-2.c [2019-11-23 22:49:20,295 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:49:20,303 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-23 22:49:20,314 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-23 22:49:20,343 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:49:20,343 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:49:20,344 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:49:20,344 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:49:20,344 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:49:20,344 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:49:20,344 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:49:20,345 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:49:20,371 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states. [2019-11-23 22:49:20,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-23 22:49:20,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:20,383 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] [2019-11-23 22:49:20,383 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:20,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:20,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1090379614, now seen corresponding path program 1 times [2019-11-23 22:49:20,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:20,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940326374] [2019-11-23 22:49:20,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:20,556 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:49:20,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940326374] [2019-11-23 22:49:20,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:20,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:20,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887301712] [2019-11-23 22:49:20,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:20,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:20,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:20,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:20,582 INFO L87 Difference]: Start difference. First operand 421 states. Second operand 3 states. [2019-11-23 22:49:20,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:20,679 INFO L93 Difference]: Finished difference Result 837 states and 1301 transitions. [2019-11-23 22:49:20,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:20,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-23 22:49:20,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:20,700 INFO L225 Difference]: With dead ends: 837 [2019-11-23 22:49:20,700 INFO L226 Difference]: Without dead ends: 417 [2019-11-23 22:49:20,706 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:49:20,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-11-23 22:49:20,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2019-11-23 22:49:20,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-23 22:49:20,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 633 transitions. [2019-11-23 22:49:20,830 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 633 transitions. Word has length 72 [2019-11-23 22:49:20,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:20,830 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 633 transitions. [2019-11-23 22:49:20,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:20,831 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 633 transitions. [2019-11-23 22:49:20,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-23 22:49:20,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:20,835 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] [2019-11-23 22:49:20,836 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:20,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:20,836 INFO L82 PathProgramCache]: Analyzing trace with hash 136439456, now seen corresponding path program 1 times [2019-11-23 22:49:20,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:20,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649622093] [2019-11-23 22:49:20,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:20,905 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:49:20,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649622093] [2019-11-23 22:49:20,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:20,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:20,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89088408] [2019-11-23 22:49:20,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:20,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:20,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:20,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:20,909 INFO L87 Difference]: Start difference. First operand 417 states and 633 transitions. Second operand 3 states. [2019-11-23 22:49:20,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:20,996 INFO L93 Difference]: Finished difference Result 1143 states and 1731 transitions. [2019-11-23 22:49:20,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:20,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-23 22:49:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:21,006 INFO L225 Difference]: With dead ends: 1143 [2019-11-23 22:49:21,006 INFO L226 Difference]: Without dead ends: 735 [2019-11-23 22:49:21,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:49:21,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-11-23 22:49:21,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 731. [2019-11-23 22:49:21,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-11-23 22:49:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1106 transitions. [2019-11-23 22:49:21,052 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1106 transitions. Word has length 72 [2019-11-23 22:49:21,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:21,053 INFO L462 AbstractCegarLoop]: Abstraction has 731 states and 1106 transitions. [2019-11-23 22:49:21,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:21,053 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1106 transitions. [2019-11-23 22:49:21,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-23 22:49:21,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:21,055 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] [2019-11-23 22:49:21,055 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:21,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:21,056 INFO L82 PathProgramCache]: Analyzing trace with hash -51966948, now seen corresponding path program 1 times [2019-11-23 22:49:21,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:21,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633449557] [2019-11-23 22:49:21,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:21,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:21,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633449557] [2019-11-23 22:49:21,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:21,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:21,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645056860] [2019-11-23 22:49:21,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:21,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:21,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:21,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:21,114 INFO L87 Difference]: Start difference. First operand 731 states and 1106 transitions. Second operand 3 states. [2019-11-23 22:49:21,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:21,162 INFO L93 Difference]: Finished difference Result 1452 states and 2197 transitions. [2019-11-23 22:49:21,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:21,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-23 22:49:21,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:21,168 INFO L225 Difference]: With dead ends: 1452 [2019-11-23 22:49:21,168 INFO L226 Difference]: Without dead ends: 731 [2019-11-23 22:49:21,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:49:21,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-11-23 22:49:21,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-11-23 22:49:21,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-11-23 22:49:21,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1098 transitions. [2019-11-23 22:49:21,207 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1098 transitions. Word has length 72 [2019-11-23 22:49:21,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:21,208 INFO L462 AbstractCegarLoop]: Abstraction has 731 states and 1098 transitions. [2019-11-23 22:49:21,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:21,208 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1098 transitions. [2019-11-23 22:49:21,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-23 22:49:21,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:21,210 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] [2019-11-23 22:49:21,210 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:21,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:21,211 INFO L82 PathProgramCache]: Analyzing trace with hash -469363554, now seen corresponding path program 1 times [2019-11-23 22:49:21,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:21,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263287185] [2019-11-23 22:49:21,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:21,282 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:49:21,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263287185] [2019-11-23 22:49:21,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:21,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:21,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459186712] [2019-11-23 22:49:21,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:21,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:21,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:21,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:21,286 INFO L87 Difference]: Start difference. First operand 731 states and 1098 transitions. Second operand 3 states. [2019-11-23 22:49:21,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:21,356 INFO L93 Difference]: Finished difference Result 1451 states and 2180 transitions. [2019-11-23 22:49:21,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:21,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-23 22:49:21,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:21,361 INFO L225 Difference]: With dead ends: 1451 [2019-11-23 22:49:21,361 INFO L226 Difference]: Without dead ends: 731 [2019-11-23 22:49:21,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:49:21,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-11-23 22:49:21,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-11-23 22:49:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-11-23 22:49:21,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1090 transitions. [2019-11-23 22:49:21,393 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1090 transitions. Word has length 72 [2019-11-23 22:49:21,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:21,396 INFO L462 AbstractCegarLoop]: Abstraction has 731 states and 1090 transitions. [2019-11-23 22:49:21,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1090 transitions. [2019-11-23 22:49:21,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-23 22:49:21,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:21,399 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] [2019-11-23 22:49:21,399 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:21,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:21,400 INFO L82 PathProgramCache]: Analyzing trace with hash 428763418, now seen corresponding path program 1 times [2019-11-23 22:49:21,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:21,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448342943] [2019-11-23 22:49:21,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:21,451 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:49:21,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448342943] [2019-11-23 22:49:21,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:21,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:21,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367310985] [2019-11-23 22:49:21,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:21,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:21,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:21,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:21,453 INFO L87 Difference]: Start difference. First operand 731 states and 1090 transitions. Second operand 3 states. [2019-11-23 22:49:21,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:21,501 INFO L93 Difference]: Finished difference Result 1450 states and 2163 transitions. [2019-11-23 22:49:21,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:21,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-23 22:49:21,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:21,505 INFO L225 Difference]: With dead ends: 1450 [2019-11-23 22:49:21,505 INFO L226 Difference]: Without dead ends: 731 [2019-11-23 22:49:21,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:49:21,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-11-23 22:49:21,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-11-23 22:49:21,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-11-23 22:49:21,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1082 transitions. [2019-11-23 22:49:21,537 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1082 transitions. Word has length 72 [2019-11-23 22:49:21,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:21,538 INFO L462 AbstractCegarLoop]: Abstraction has 731 states and 1082 transitions. [2019-11-23 22:49:21,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:21,538 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1082 transitions. [2019-11-23 22:49:21,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-23 22:49:21,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:21,539 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] [2019-11-23 22:49:21,539 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:21,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:21,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1481927394, now seen corresponding path program 1 times [2019-11-23 22:49:21,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:21,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143545952] [2019-11-23 22:49:21,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:21,596 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:49:21,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143545952] [2019-11-23 22:49:21,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:21,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:21,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927941807] [2019-11-23 22:49:21,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:21,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:21,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:21,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:21,599 INFO L87 Difference]: Start difference. First operand 731 states and 1082 transitions. Second operand 3 states. [2019-11-23 22:49:21,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:21,675 INFO L93 Difference]: Finished difference Result 1448 states and 2144 transitions. [2019-11-23 22:49:21,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:21,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-23 22:49:21,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:21,681 INFO L225 Difference]: With dead ends: 1448 [2019-11-23 22:49:21,681 INFO L226 Difference]: Without dead ends: 731 [2019-11-23 22:49:21,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:49:21,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-11-23 22:49:21,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-11-23 22:49:21,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-11-23 22:49:21,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1062 transitions. [2019-11-23 22:49:21,718 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1062 transitions. Word has length 72 [2019-11-23 22:49:21,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:21,718 INFO L462 AbstractCegarLoop]: Abstraction has 731 states and 1062 transitions. [2019-11-23 22:49:21,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:21,719 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1062 transitions. [2019-11-23 22:49:21,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-23 22:49:21,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:21,720 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] [2019-11-23 22:49:21,720 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:21,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:21,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1411017443, now seen corresponding path program 1 times [2019-11-23 22:49:21,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:21,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709071590] [2019-11-23 22:49:21,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:21,762 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:49:21,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709071590] [2019-11-23 22:49:21,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:21,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:21,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395153755] [2019-11-23 22:49:21,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:21,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:21,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:21,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:21,764 INFO L87 Difference]: Start difference. First operand 731 states and 1062 transitions. Second operand 3 states. [2019-11-23 22:49:21,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:21,836 INFO L93 Difference]: Finished difference Result 1447 states and 2103 transitions. [2019-11-23 22:49:21,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:21,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-23 22:49:21,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:21,841 INFO L225 Difference]: With dead ends: 1447 [2019-11-23 22:49:21,841 INFO L226 Difference]: Without dead ends: 731 [2019-11-23 22:49:21,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:49:21,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-11-23 22:49:21,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-11-23 22:49:21,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-11-23 22:49:21,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1042 transitions. [2019-11-23 22:49:21,881 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1042 transitions. Word has length 72 [2019-11-23 22:49:21,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:21,882 INFO L462 AbstractCegarLoop]: Abstraction has 731 states and 1042 transitions. [2019-11-23 22:49:21,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:21,882 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1042 transitions. [2019-11-23 22:49:21,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-23 22:49:21,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:21,883 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] [2019-11-23 22:49:21,883 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:21,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:21,884 INFO L82 PathProgramCache]: Analyzing trace with hash -149398177, now seen corresponding path program 1 times [2019-11-23 22:49:21,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:21,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595989180] [2019-11-23 22:49:21,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:21,945 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:49:21,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595989180] [2019-11-23 22:49:21,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:21,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:21,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130955533] [2019-11-23 22:49:21,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:21,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:21,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:21,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:21,947 INFO L87 Difference]: Start difference. First operand 731 states and 1042 transitions. Second operand 3 states. [2019-11-23 22:49:22,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:22,016 INFO L93 Difference]: Finished difference Result 1446 states and 2062 transitions. [2019-11-23 22:49:22,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:22,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-23 22:49:22,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:22,021 INFO L225 Difference]: With dead ends: 1446 [2019-11-23 22:49:22,021 INFO L226 Difference]: Without dead ends: 731 [2019-11-23 22:49:22,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:49:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-11-23 22:49:22,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-11-23 22:49:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-11-23 22:49:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1022 transitions. [2019-11-23 22:49:22,057 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1022 transitions. Word has length 72 [2019-11-23 22:49:22,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:22,058 INFO L462 AbstractCegarLoop]: Abstraction has 731 states and 1022 transitions. [2019-11-23 22:49:22,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:22,058 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1022 transitions. [2019-11-23 22:49:22,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-23 22:49:22,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:22,059 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] [2019-11-23 22:49:22,059 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:22,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:22,060 INFO L82 PathProgramCache]: Analyzing trace with hash -962003548, now seen corresponding path program 1 times [2019-11-23 22:49:22,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:22,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642238745] [2019-11-23 22:49:22,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:22,113 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:49:22,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642238745] [2019-11-23 22:49:22,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:22,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:22,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199578349] [2019-11-23 22:49:22,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:22,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:22,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:22,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:22,116 INFO L87 Difference]: Start difference. First operand 731 states and 1022 transitions. Second operand 3 states. [2019-11-23 22:49:22,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:22,184 INFO L93 Difference]: Finished difference Result 1445 states and 2021 transitions. [2019-11-23 22:49:22,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:22,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-23 22:49:22,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:22,188 INFO L225 Difference]: With dead ends: 1445 [2019-11-23 22:49:22,188 INFO L226 Difference]: Without dead ends: 731 [2019-11-23 22:49:22,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:49:22,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-11-23 22:49:22,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-11-23 22:49:22,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-11-23 22:49:22,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1002 transitions. [2019-11-23 22:49:22,228 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1002 transitions. Word has length 72 [2019-11-23 22:49:22,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:22,228 INFO L462 AbstractCegarLoop]: Abstraction has 731 states and 1002 transitions. [2019-11-23 22:49:22,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:22,228 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1002 transitions. [2019-11-23 22:49:22,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-23 22:49:22,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:22,229 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] [2019-11-23 22:49:22,229 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:22,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:22,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1942397152, now seen corresponding path program 1 times [2019-11-23 22:49:22,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:22,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830987478] [2019-11-23 22:49:22,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:22,258 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:49:22,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830987478] [2019-11-23 22:49:22,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:22,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:22,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760253648] [2019-11-23 22:49:22,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:22,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:22,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:22,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:22,261 INFO L87 Difference]: Start difference. First operand 731 states and 1002 transitions. Second operand 3 states. [2019-11-23 22:49:22,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:22,325 INFO L93 Difference]: Finished difference Result 1444 states and 1980 transitions. [2019-11-23 22:49:22,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:22,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-23 22:49:22,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:22,330 INFO L225 Difference]: With dead ends: 1444 [2019-11-23 22:49:22,330 INFO L226 Difference]: Without dead ends: 731 [2019-11-23 22:49:22,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:49:22,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-11-23 22:49:22,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-11-23 22:49:22,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-11-23 22:49:22,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 982 transitions. [2019-11-23 22:49:22,368 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 982 transitions. Word has length 72 [2019-11-23 22:49:22,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:22,372 INFO L462 AbstractCegarLoop]: Abstraction has 731 states and 982 transitions. [2019-11-23 22:49:22,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 982 transitions. [2019-11-23 22:49:22,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-23 22:49:22,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:22,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] [2019-11-23 22:49:22,374 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:22,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:22,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1527286429, now seen corresponding path program 1 times [2019-11-23 22:49:22,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:22,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506995768] [2019-11-23 22:49:22,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:22,426 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:49:22,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506995768] [2019-11-23 22:49:22,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:22,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:22,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139769256] [2019-11-23 22:49:22,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:22,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:22,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:22,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:22,446 INFO L87 Difference]: Start difference. First operand 731 states and 982 transitions. Second operand 3 states. [2019-11-23 22:49:22,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:22,491 INFO L93 Difference]: Finished difference Result 1449 states and 1946 transitions. [2019-11-23 22:49:22,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:22,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-23 22:49:22,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:22,495 INFO L225 Difference]: With dead ends: 1449 [2019-11-23 22:49:22,496 INFO L226 Difference]: Without dead ends: 731 [2019-11-23 22:49:22,497 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:49:22,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-11-23 22:49:22,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-11-23 22:49:22,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-11-23 22:49:22,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 974 transitions. [2019-11-23 22:49:22,535 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 974 transitions. Word has length 72 [2019-11-23 22:49:22,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:22,535 INFO L462 AbstractCegarLoop]: Abstraction has 731 states and 974 transitions. [2019-11-23 22:49:22,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:22,535 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 974 transitions. [2019-11-23 22:49:22,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-23 22:49:22,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:22,538 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] [2019-11-23 22:49:22,538 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:22,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:22,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1950032417, now seen corresponding path program 1 times [2019-11-23 22:49:22,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:22,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238381162] [2019-11-23 22:49:22,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:22,595 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:49:22,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238381162] [2019-11-23 22:49:22,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:22,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:22,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492442111] [2019-11-23 22:49:22,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:22,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:22,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:22,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:22,597 INFO L87 Difference]: Start difference. First operand 731 states and 974 transitions. Second operand 3 states. [2019-11-23 22:49:22,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:22,732 INFO L93 Difference]: Finished difference Result 2078 states and 2774 transitions. [2019-11-23 22:49:22,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:22,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-23 22:49:22,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:22,742 INFO L225 Difference]: With dead ends: 2078 [2019-11-23 22:49:22,742 INFO L226 Difference]: Without dead ends: 1367 [2019-11-23 22:49:22,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:49:22,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2019-11-23 22:49:22,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1301. [2019-11-23 22:49:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1301 states. [2019-11-23 22:49:22,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 1723 transitions. [2019-11-23 22:49:22,837 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 1723 transitions. Word has length 72 [2019-11-23 22:49:22,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:22,838 INFO L462 AbstractCegarLoop]: Abstraction has 1301 states and 1723 transitions. [2019-11-23 22:49:22,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:22,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1723 transitions. [2019-11-23 22:49:22,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-23 22:49:22,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:22,843 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:22,844 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:22,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:22,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1262693056, now seen corresponding path program 1 times [2019-11-23 22:49:22,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:22,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345548523] [2019-11-23 22:49:22,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:22,942 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:22,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345548523] [2019-11-23 22:49:22,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:22,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:49:22,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565536067] [2019-11-23 22:49:22,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:49:22,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:22,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:49:22,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:22,945 INFO L87 Difference]: Start difference. First operand 1301 states and 1723 transitions. Second operand 5 states. [2019-11-23 22:49:23,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:23,176 INFO L93 Difference]: Finished difference Result 2968 states and 3967 transitions. [2019-11-23 22:49:23,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:49:23,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-11-23 22:49:23,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:23,189 INFO L225 Difference]: With dead ends: 2968 [2019-11-23 22:49:23,189 INFO L226 Difference]: Without dead ends: 1691 [2019-11-23 22:49:23,193 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:49:23,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2019-11-23 22:49:23,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1307. [2019-11-23 22:49:23,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1307 states. [2019-11-23 22:49:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1706 transitions. [2019-11-23 22:49:23,383 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1706 transitions. Word has length 117 [2019-11-23 22:49:23,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:23,385 INFO L462 AbstractCegarLoop]: Abstraction has 1307 states and 1706 transitions. [2019-11-23 22:49:23,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:49:23,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1706 transitions. [2019-11-23 22:49:23,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-23 22:49:23,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:23,388 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:23,389 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:23,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:23,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1661445820, now seen corresponding path program 1 times [2019-11-23 22:49:23,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:23,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720421637] [2019-11-23 22:49:23,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:23,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720421637] [2019-11-23 22:49:23,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:23,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:23,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795968511] [2019-11-23 22:49:23,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:23,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:23,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:23,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:23,471 INFO L87 Difference]: Start difference. First operand 1307 states and 1706 transitions. Second operand 3 states. [2019-11-23 22:49:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:23,658 INFO L93 Difference]: Finished difference Result 3774 states and 4946 transitions. [2019-11-23 22:49:23,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:23,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-23 22:49:23,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:23,670 INFO L225 Difference]: With dead ends: 3774 [2019-11-23 22:49:23,670 INFO L226 Difference]: Without dead ends: 2493 [2019-11-23 22:49:23,674 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:49:23,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2019-11-23 22:49:23,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2377. [2019-11-23 22:49:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2019-11-23 22:49:23,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3100 transitions. [2019-11-23 22:49:23,824 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3100 transitions. Word has length 117 [2019-11-23 22:49:23,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:23,824 INFO L462 AbstractCegarLoop]: Abstraction has 2377 states and 3100 transitions. [2019-11-23 22:49:23,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:23,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3100 transitions. [2019-11-23 22:49:23,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-23 22:49:23,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:23,827 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:23,828 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:23,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:23,828 INFO L82 PathProgramCache]: Analyzing trace with hash 2061437019, now seen corresponding path program 1 times [2019-11-23 22:49:23,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:23,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889712833] [2019-11-23 22:49:23,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:23,934 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:23,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889712833] [2019-11-23 22:49:23,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:23,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:49:23,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489851280] [2019-11-23 22:49:23,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:49:23,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:23,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:49:23,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:23,937 INFO L87 Difference]: Start difference. First operand 2377 states and 3100 transitions. Second operand 5 states. [2019-11-23 22:49:24,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:24,245 INFO L93 Difference]: Finished difference Result 5178 states and 6787 transitions. [2019-11-23 22:49:24,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:49:24,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-11-23 22:49:24,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:24,258 INFO L225 Difference]: With dead ends: 5178 [2019-11-23 22:49:24,258 INFO L226 Difference]: Without dead ends: 2831 [2019-11-23 22:49:24,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:49:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2831 states. [2019-11-23 22:49:24,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2831 to 2383. [2019-11-23 22:49:24,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2383 states. [2019-11-23 22:49:24,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 3063 transitions. [2019-11-23 22:49:24,423 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 3063 transitions. Word has length 117 [2019-11-23 22:49:24,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:24,423 INFO L462 AbstractCegarLoop]: Abstraction has 2383 states and 3063 transitions. [2019-11-23 22:49:24,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:49:24,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 3063 transitions. [2019-11-23 22:49:24,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-23 22:49:24,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:24,427 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:24,427 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:24,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:24,428 INFO L82 PathProgramCache]: Analyzing trace with hash 672376535, now seen corresponding path program 1 times [2019-11-23 22:49:24,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:24,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195598539] [2019-11-23 22:49:24,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:24,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195598539] [2019-11-23 22:49:24,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:24,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:49:24,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094817197] [2019-11-23 22:49:24,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:49:24,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:24,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:49:24,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:24,488 INFO L87 Difference]: Start difference. First operand 2383 states and 3063 transitions. Second operand 5 states. [2019-11-23 22:49:24,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:24,839 INFO L93 Difference]: Finished difference Result 5747 states and 7403 transitions. [2019-11-23 22:49:24,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:49:24,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-11-23 22:49:24,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:24,854 INFO L225 Difference]: With dead ends: 5747 [2019-11-23 22:49:24,854 INFO L226 Difference]: Without dead ends: 3401 [2019-11-23 22:49:24,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:49:24,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2019-11-23 22:49:25,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 2395. [2019-11-23 22:49:25,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2395 states. [2019-11-23 22:49:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 3034 transitions. [2019-11-23 22:49:25,024 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 3034 transitions. Word has length 117 [2019-11-23 22:49:25,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:25,024 INFO L462 AbstractCegarLoop]: Abstraction has 2395 states and 3034 transitions. [2019-11-23 22:49:25,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:49:25,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3034 transitions. [2019-11-23 22:49:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-23 22:49:25,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:25,029 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:25,029 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:25,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:25,030 INFO L82 PathProgramCache]: Analyzing trace with hash -2033200557, now seen corresponding path program 1 times [2019-11-23 22:49:25,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:25,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025392462] [2019-11-23 22:49:25,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:25,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:25,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025392462] [2019-11-23 22:49:25,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:25,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:49:25,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689440839] [2019-11-23 22:49:25,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:49:25,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:25,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:49:25,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:25,111 INFO L87 Difference]: Start difference. First operand 2395 states and 3034 transitions. Second operand 5 states. [2019-11-23 22:49:25,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:25,669 INFO L93 Difference]: Finished difference Result 6833 states and 8746 transitions. [2019-11-23 22:49:25,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:49:25,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-11-23 22:49:25,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:25,689 INFO L225 Difference]: With dead ends: 6833 [2019-11-23 22:49:25,690 INFO L226 Difference]: Without dead ends: 4489 [2019-11-23 22:49:25,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:49:25,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2019-11-23 22:49:25,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 2419. [2019-11-23 22:49:25,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2419 states. [2019-11-23 22:49:25,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 3021 transitions. [2019-11-23 22:49:25,871 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 3021 transitions. Word has length 117 [2019-11-23 22:49:25,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:25,872 INFO L462 AbstractCegarLoop]: Abstraction has 2419 states and 3021 transitions. [2019-11-23 22:49:25,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:49:25,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 3021 transitions. [2019-11-23 22:49:25,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-23 22:49:25,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:25,875 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:25,875 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:25,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:25,875 INFO L82 PathProgramCache]: Analyzing trace with hash -2118887473, now seen corresponding path program 1 times [2019-11-23 22:49:25,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:25,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506246013] [2019-11-23 22:49:25,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:25,933 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:25,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506246013] [2019-11-23 22:49:25,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:25,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:25,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416618473] [2019-11-23 22:49:25,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:25,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:25,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:25,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:25,935 INFO L87 Difference]: Start difference. First operand 2419 states and 3021 transitions. Second operand 3 states. [2019-11-23 22:49:26,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:26,264 INFO L93 Difference]: Finished difference Result 6877 states and 8545 transitions. [2019-11-23 22:49:26,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:26,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-23 22:49:26,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:26,284 INFO L225 Difference]: With dead ends: 6877 [2019-11-23 22:49:26,284 INFO L226 Difference]: Without dead ends: 4519 [2019-11-23 22:49:26,288 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:49:26,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2019-11-23 22:49:26,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 4515. [2019-11-23 22:49:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4515 states. [2019-11-23 22:49:26,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4515 states to 4515 states and 5559 transitions. [2019-11-23 22:49:26,548 INFO L78 Accepts]: Start accepts. Automaton has 4515 states and 5559 transitions. Word has length 117 [2019-11-23 22:49:26,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:26,548 INFO L462 AbstractCegarLoop]: Abstraction has 4515 states and 5559 transitions. [2019-11-23 22:49:26,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:26,548 INFO L276 IsEmpty]: Start isEmpty. Operand 4515 states and 5559 transitions. [2019-11-23 22:49:26,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-23 22:49:26,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:26,552 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:26,552 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:26,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:26,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1555831778, now seen corresponding path program 1 times [2019-11-23 22:49:26,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:26,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462850455] [2019-11-23 22:49:26,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:26,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:26,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462850455] [2019-11-23 22:49:26,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:26,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:26,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140045531] [2019-11-23 22:49:26,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:26,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:26,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:26,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:26,600 INFO L87 Difference]: Start difference. First operand 4515 states and 5559 transitions. Second operand 3 states. [2019-11-23 22:49:27,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:27,038 INFO L93 Difference]: Finished difference Result 12790 states and 15720 transitions. [2019-11-23 22:49:27,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:27,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-11-23 22:49:27,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:27,075 INFO L225 Difference]: With dead ends: 12790 [2019-11-23 22:49:27,075 INFO L226 Difference]: Without dead ends: 8336 [2019-11-23 22:49:27,082 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:49:27,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8336 states. [2019-11-23 22:49:27,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8336 to 8332. [2019-11-23 22:49:27,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8332 states. [2019-11-23 22:49:27,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8332 states to 8332 states and 10188 transitions. [2019-11-23 22:49:27,618 INFO L78 Accepts]: Start accepts. Automaton has 8332 states and 10188 transitions. Word has length 118 [2019-11-23 22:49:27,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:27,619 INFO L462 AbstractCegarLoop]: Abstraction has 8332 states and 10188 transitions. [2019-11-23 22:49:27,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:27,620 INFO L276 IsEmpty]: Start isEmpty. Operand 8332 states and 10188 transitions. [2019-11-23 22:49:27,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-23 22:49:27,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:27,672 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:27,672 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:27,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:27,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1011990556, now seen corresponding path program 1 times [2019-11-23 22:49:27,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:27,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285096119] [2019-11-23 22:49:27,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-23 22:49:27,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285096119] [2019-11-23 22:49:27,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:27,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:27,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195494863] [2019-11-23 22:49:27,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:27,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:27,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:27,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:27,701 INFO L87 Difference]: Start difference. First operand 8332 states and 10188 transitions. Second operand 3 states. [2019-11-23 22:49:28,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:28,070 INFO L93 Difference]: Finished difference Result 16548 states and 20246 transitions. [2019-11-23 22:49:28,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:28,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-11-23 22:49:28,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:28,087 INFO L225 Difference]: With dead ends: 16548 [2019-11-23 22:49:28,087 INFO L226 Difference]: Without dead ends: 8277 [2019-11-23 22:49:28,098 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:49:28,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8277 states. [2019-11-23 22:49:28,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8277 to 8277. [2019-11-23 22:49:28,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8277 states. [2019-11-23 22:49:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8277 states to 8277 states and 10126 transitions. [2019-11-23 22:49:28,627 INFO L78 Accepts]: Start accepts. Automaton has 8277 states and 10126 transitions. Word has length 118 [2019-11-23 22:49:28,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:28,628 INFO L462 AbstractCegarLoop]: Abstraction has 8277 states and 10126 transitions. [2019-11-23 22:49:28,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:28,628 INFO L276 IsEmpty]: Start isEmpty. Operand 8277 states and 10126 transitions. [2019-11-23 22:49:28,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-23 22:49:28,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:28,633 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:28,633 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:28,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:28,633 INFO L82 PathProgramCache]: Analyzing trace with hash -453804771, now seen corresponding path program 1 times [2019-11-23 22:49:28,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:28,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524437803] [2019-11-23 22:49:28,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:28,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524437803] [2019-11-23 22:49:28,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:28,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:28,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102972557] [2019-11-23 22:49:28,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:28,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:28,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:28,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:28,688 INFO L87 Difference]: Start difference. First operand 8277 states and 10126 transitions. Second operand 3 states. [2019-11-23 22:49:29,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:29,442 INFO L93 Difference]: Finished difference Result 23779 states and 29069 transitions. [2019-11-23 22:49:29,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:29,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-11-23 22:49:29,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:29,458 INFO L225 Difference]: With dead ends: 23779 [2019-11-23 22:49:29,458 INFO L226 Difference]: Without dead ends: 15563 [2019-11-23 22:49:29,469 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:49:29,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15563 states. [2019-11-23 22:49:30,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15563 to 15143. [2019-11-23 22:49:30,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15143 states. [2019-11-23 22:49:30,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15143 states to 15143 states and 18441 transitions. [2019-11-23 22:49:30,169 INFO L78 Accepts]: Start accepts. Automaton has 15143 states and 18441 transitions. Word has length 119 [2019-11-23 22:49:30,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:30,170 INFO L462 AbstractCegarLoop]: Abstraction has 15143 states and 18441 transitions. [2019-11-23 22:49:30,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:30,170 INFO L276 IsEmpty]: Start isEmpty. Operand 15143 states and 18441 transitions. [2019-11-23 22:49:30,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-23 22:49:30,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:30,178 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:30,178 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:30,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:30,179 INFO L82 PathProgramCache]: Analyzing trace with hash 2112373853, now seen corresponding path program 1 times [2019-11-23 22:49:30,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:30,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194403350] [2019-11-23 22:49:30,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:30,209 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-23 22:49:30,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194403350] [2019-11-23 22:49:30,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:30,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:30,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15405187] [2019-11-23 22:49:30,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:30,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:30,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:30,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:30,211 INFO L87 Difference]: Start difference. First operand 15143 states and 18441 transitions. Second operand 3 states. [2019-11-23 22:49:30,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:30,729 INFO L93 Difference]: Finished difference Result 30188 states and 36773 transitions. [2019-11-23 22:49:30,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:30,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-11-23 22:49:30,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:30,744 INFO L225 Difference]: With dead ends: 30188 [2019-11-23 22:49:30,744 INFO L226 Difference]: Without dead ends: 15089 [2019-11-23 22:49:30,758 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:49:30,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15089 states. [2019-11-23 22:49:32,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15089 to 15089. [2019-11-23 22:49:32,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15089 states. [2019-11-23 22:49:32,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15089 states to 15089 states and 18381 transitions. [2019-11-23 22:49:32,055 INFO L78 Accepts]: Start accepts. Automaton has 15089 states and 18381 transitions. Word has length 119 [2019-11-23 22:49:32,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:32,055 INFO L462 AbstractCegarLoop]: Abstraction has 15089 states and 18381 transitions. [2019-11-23 22:49:32,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:32,055 INFO L276 IsEmpty]: Start isEmpty. Operand 15089 states and 18381 transitions. [2019-11-23 22:49:32,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-23 22:49:32,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:32,063 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:32,063 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:32,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:32,064 INFO L82 PathProgramCache]: Analyzing trace with hash 564824724, now seen corresponding path program 1 times [2019-11-23 22:49:32,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:32,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478855707] [2019-11-23 22:49:32,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:32,114 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:32,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478855707] [2019-11-23 22:49:32,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:32,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:32,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131772419] [2019-11-23 22:49:32,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:32,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:32,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:32,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:32,123 INFO L87 Difference]: Start difference. First operand 15089 states and 18381 transitions. Second operand 3 states. [2019-11-23 22:49:33,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:33,276 INFO L93 Difference]: Finished difference Result 42542 states and 51834 transitions. [2019-11-23 22:49:33,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:33,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-23 22:49:33,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:33,301 INFO L225 Difference]: With dead ends: 42542 [2019-11-23 22:49:33,301 INFO L226 Difference]: Without dead ends: 27514 [2019-11-23 22:49:33,316 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:49:33,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27514 states. [2019-11-23 22:49:34,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27514 to 27510. [2019-11-23 22:49:34,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27510 states. [2019-11-23 22:49:34,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27510 states to 27510 states and 33430 transitions. [2019-11-23 22:49:34,497 INFO L78 Accepts]: Start accepts. Automaton has 27510 states and 33430 transitions. Word has length 120 [2019-11-23 22:49:34,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:34,497 INFO L462 AbstractCegarLoop]: Abstraction has 27510 states and 33430 transitions. [2019-11-23 22:49:34,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:34,497 INFO L276 IsEmpty]: Start isEmpty. Operand 27510 states and 33430 transitions. [2019-11-23 22:49:34,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-23 22:49:34,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:34,637 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:34,637 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:34,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:34,638 INFO L82 PathProgramCache]: Analyzing trace with hash -2002997610, now seen corresponding path program 1 times [2019-11-23 22:49:34,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:34,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643636049] [2019-11-23 22:49:34,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-23 22:49:34,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643636049] [2019-11-23 22:49:34,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:34,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:34,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979699006] [2019-11-23 22:49:34,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:34,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:34,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:34,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:34,680 INFO L87 Difference]: Start difference. First operand 27510 states and 33430 transitions. Second operand 3 states. [2019-11-23 22:49:36,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:36,080 INFO L93 Difference]: Finished difference Result 54906 states and 66736 transitions. [2019-11-23 22:49:36,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:36,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-23 22:49:36,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:36,108 INFO L225 Difference]: With dead ends: 54906 [2019-11-23 22:49:36,109 INFO L226 Difference]: Without dead ends: 27457 [2019-11-23 22:49:36,135 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:49:36,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27457 states. [2019-11-23 22:49:37,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27457 to 27457. [2019-11-23 22:49:37,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27457 states. [2019-11-23 22:49:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27457 states to 27457 states and 33372 transitions. [2019-11-23 22:49:37,959 INFO L78 Accepts]: Start accepts. Automaton has 27457 states and 33372 transitions. Word has length 120 [2019-11-23 22:49:37,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:37,959 INFO L462 AbstractCegarLoop]: Abstraction has 27457 states and 33372 transitions. [2019-11-23 22:49:37,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:37,959 INFO L276 IsEmpty]: Start isEmpty. Operand 27457 states and 33372 transitions. [2019-11-23 22:49:37,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-23 22:49:37,968 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:37,968 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:37,968 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:37,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:37,969 INFO L82 PathProgramCache]: Analyzing trace with hash 933474923, now seen corresponding path program 1 times [2019-11-23 22:49:37,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:37,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266389954] [2019-11-23 22:49:37,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:38,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266389954] [2019-11-23 22:49:38,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:38,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:38,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633843836] [2019-11-23 22:49:38,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:38,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:38,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:38,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:38,012 INFO L87 Difference]: Start difference. First operand 27457 states and 33372 transitions. Second operand 3 states. [2019-11-23 22:49:40,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:40,054 INFO L93 Difference]: Finished difference Result 78974 states and 95659 transitions. [2019-11-23 22:49:40,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:40,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-23 22:49:40,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:40,087 INFO L225 Difference]: With dead ends: 78974 [2019-11-23 22:49:40,087 INFO L226 Difference]: Without dead ends: 39641 [2019-11-23 22:49:40,110 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:49:40,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39641 states. [2019-11-23 22:49:42,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39641 to 39641. [2019-11-23 22:49:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39641 states. [2019-11-23 22:49:42,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39641 states to 39641 states and 47863 transitions. [2019-11-23 22:49:42,641 INFO L78 Accepts]: Start accepts. Automaton has 39641 states and 47863 transitions. Word has length 121 [2019-11-23 22:49:42,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:42,641 INFO L462 AbstractCegarLoop]: Abstraction has 39641 states and 47863 transitions. [2019-11-23 22:49:42,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:42,641 INFO L276 IsEmpty]: Start isEmpty. Operand 39641 states and 47863 transitions. [2019-11-23 22:49:42,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-23 22:49:42,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:42,655 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:42,655 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:42,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:42,656 INFO L82 PathProgramCache]: Analyzing trace with hash 334867575, now seen corresponding path program 1 times [2019-11-23 22:49:42,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:42,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209119969] [2019-11-23 22:49:42,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:42,722 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:42,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209119969] [2019-11-23 22:49:42,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:42,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:42,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375928511] [2019-11-23 22:49:42,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:42,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:42,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:42,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:42,724 INFO L87 Difference]: Start difference. First operand 39641 states and 47863 transitions. Second operand 3 states. [2019-11-23 22:49:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:45,161 INFO L93 Difference]: Finished difference Result 91203 states and 109883 transitions. [2019-11-23 22:49:45,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:45,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-23 22:49:45,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:45,207 INFO L225 Difference]: With dead ends: 91203 [2019-11-23 22:49:45,207 INFO L226 Difference]: Without dead ends: 51608 [2019-11-23 22:49:45,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:49:45,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51608 states. [2019-11-23 22:49:47,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51608 to 51416. [2019-11-23 22:49:47,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51416 states. [2019-11-23 22:49:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51416 states to 51416 states and 61605 transitions. [2019-11-23 22:49:47,295 INFO L78 Accepts]: Start accepts. Automaton has 51416 states and 61605 transitions. Word has length 156 [2019-11-23 22:49:47,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:47,295 INFO L462 AbstractCegarLoop]: Abstraction has 51416 states and 61605 transitions. [2019-11-23 22:49:47,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:47,295 INFO L276 IsEmpty]: Start isEmpty. Operand 51416 states and 61605 transitions. [2019-11-23 22:49:47,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-23 22:49:47,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:47,317 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:47,317 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:47,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:47,317 INFO L82 PathProgramCache]: Analyzing trace with hash -67611790, now seen corresponding path program 1 times [2019-11-23 22:49:47,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:47,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471750655] [2019-11-23 22:49:47,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:47,374 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 22:49:47,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471750655] [2019-11-23 22:49:47,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:47,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:47,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772638677] [2019-11-23 22:49:47,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:47,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:47,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:47,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:47,376 INFO L87 Difference]: Start difference. First operand 51416 states and 61605 transitions. Second operand 3 states. [2019-11-23 22:49:50,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:50,322 INFO L93 Difference]: Finished difference Result 101872 states and 121803 transitions. [2019-11-23 22:49:50,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:50,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-11-23 22:49:50,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:50,366 INFO L225 Difference]: With dead ends: 101872 [2019-11-23 22:49:50,366 INFO L226 Difference]: Without dead ends: 50516 [2019-11-23 22:49:50,388 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:49:50,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50516 states. [2019-11-23 22:49:52,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50516 to 50516. [2019-11-23 22:49:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50516 states. [2019-11-23 22:49:52,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50516 states to 50516 states and 59621 transitions. [2019-11-23 22:49:52,391 INFO L78 Accepts]: Start accepts. Automaton has 50516 states and 59621 transitions. Word has length 174 [2019-11-23 22:49:52,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:52,391 INFO L462 AbstractCegarLoop]: Abstraction has 50516 states and 59621 transitions. [2019-11-23 22:49:52,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:52,392 INFO L276 IsEmpty]: Start isEmpty. Operand 50516 states and 59621 transitions. [2019-11-23 22:49:52,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-23 22:49:52,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:52,412 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:52,412 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:52,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:52,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1145557634, now seen corresponding path program 1 times [2019-11-23 22:49:52,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:52,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667762852] [2019-11-23 22:49:52,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:52,471 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:52,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667762852] [2019-11-23 22:49:52,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:52,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:52,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377284639] [2019-11-23 22:49:52,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:52,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:52,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:52,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:52,473 INFO L87 Difference]: Start difference. First operand 50516 states and 59621 transitions. Second operand 3 states. [2019-11-23 22:49:54,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:54,639 INFO L93 Difference]: Finished difference Result 89380 states and 105829 transitions. [2019-11-23 22:49:54,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:54,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-11-23 22:49:54,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:54,684 INFO L225 Difference]: With dead ends: 89380 [2019-11-23 22:49:54,684 INFO L226 Difference]: Without dead ends: 50520 [2019-11-23 22:49:54,702 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:49:54,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50520 states. [2019-11-23 22:49:58,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50520 to 50516. [2019-11-23 22:49:58,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50516 states. [2019-11-23 22:49:58,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50516 states to 50516 states and 59513 transitions. [2019-11-23 22:49:58,135 INFO L78 Accepts]: Start accepts. Automaton has 50516 states and 59513 transitions. Word has length 175 [2019-11-23 22:49:58,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:58,136 INFO L462 AbstractCegarLoop]: Abstraction has 50516 states and 59513 transitions. [2019-11-23 22:49:58,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:58,136 INFO L276 IsEmpty]: Start isEmpty. Operand 50516 states and 59513 transitions. [2019-11-23 22:49:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-23 22:49:58,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:58,156 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:58,156 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:58,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:58,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2011308056, now seen corresponding path program 1 times [2019-11-23 22:49:58,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:58,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181505575] [2019-11-23 22:49:58,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 22:49:58,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181505575] [2019-11-23 22:49:58,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:58,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:58,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420906025] [2019-11-23 22:49:58,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:58,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:58,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:58,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:58,230 INFO L87 Difference]: Start difference. First operand 50516 states and 59513 transitions. Second operand 3 states. [2019-11-23 22:50:00,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:00,911 INFO L93 Difference]: Finished difference Result 111624 states and 131256 transitions. [2019-11-23 22:50:00,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:00,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-11-23 22:50:00,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:00,989 INFO L225 Difference]: With dead ends: 111624 [2019-11-23 22:50:00,990 INFO L226 Difference]: Without dead ends: 61147 [2019-11-23 22:50:01,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:50:01,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61147 states. [2019-11-23 22:50:04,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61147 to 60891. [2019-11-23 22:50:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60891 states. [2019-11-23 22:50:04,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60891 states to 60891 states and 71287 transitions. [2019-11-23 22:50:04,392 INFO L78 Accepts]: Start accepts. Automaton has 60891 states and 71287 transitions. Word has length 210 [2019-11-23 22:50:04,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:04,393 INFO L462 AbstractCegarLoop]: Abstraction has 60891 states and 71287 transitions. [2019-11-23 22:50:04,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:04,393 INFO L276 IsEmpty]: Start isEmpty. Operand 60891 states and 71287 transitions. [2019-11-23 22:50:04,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-23 22:50:04,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:04,424 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:04,424 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:04,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:04,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1782699020, now seen corresponding path program 1 times [2019-11-23 22:50:04,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:04,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531456210] [2019-11-23 22:50:04,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:04,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:04,480 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:04,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531456210] [2019-11-23 22:50:04,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:04,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:04,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913681028] [2019-11-23 22:50:04,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:04,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:04,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:04,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:04,482 INFO L87 Difference]: Start difference. First operand 60891 states and 71287 transitions. Second operand 3 states. [2019-11-23 22:50:08,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:08,110 INFO L93 Difference]: Finished difference Result 111351 states and 130739 transitions. [2019-11-23 22:50:08,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:08,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-11-23 22:50:08,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:08,167 INFO L225 Difference]: With dead ends: 111351 [2019-11-23 22:50:08,167 INFO L226 Difference]: Without dead ends: 60895 [2019-11-23 22:50:08,192 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:50:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60895 states. [2019-11-23 22:50:10,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60895 to 60891. [2019-11-23 22:50:10,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60891 states. [2019-11-23 22:50:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60891 states to 60891 states and 71123 transitions. [2019-11-23 22:50:10,617 INFO L78 Accepts]: Start accepts. Automaton has 60891 states and 71123 transitions. Word has length 213 [2019-11-23 22:50:10,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:10,617 INFO L462 AbstractCegarLoop]: Abstraction has 60891 states and 71123 transitions. [2019-11-23 22:50:10,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:10,617 INFO L276 IsEmpty]: Start isEmpty. Operand 60891 states and 71123 transitions. [2019-11-23 22:50:10,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-23 22:50:10,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:10,644 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:10,644 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:10,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:10,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1923880001, now seen corresponding path program 1 times [2019-11-23 22:50:10,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:10,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124450121] [2019-11-23 22:50:10,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:10,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124450121] [2019-11-23 22:50:10,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:10,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:10,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063887648] [2019-11-23 22:50:10,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:10,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:10,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:10,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:10,708 INFO L87 Difference]: Start difference. First operand 60891 states and 71123 transitions. Second operand 3 states. [2019-11-23 22:50:13,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:13,288 INFO L93 Difference]: Finished difference Result 111475 states and 130537 transitions. [2019-11-23 22:50:13,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:13,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-11-23 22:50:13,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:13,348 INFO L225 Difference]: With dead ends: 111475 [2019-11-23 22:50:13,348 INFO L226 Difference]: Without dead ends: 61019 [2019-11-23 22:50:13,377 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:50:13,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61019 states. [2019-11-23 22:50:17,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61019 to 60891. [2019-11-23 22:50:17,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60891 states. [2019-11-23 22:50:17,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60891 states to 60891 states and 69971 transitions. [2019-11-23 22:50:17,511 INFO L78 Accepts]: Start accepts. Automaton has 60891 states and 69971 transitions. Word has length 213 [2019-11-23 22:50:17,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:17,512 INFO L462 AbstractCegarLoop]: Abstraction has 60891 states and 69971 transitions. [2019-11-23 22:50:17,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:17,512 INFO L276 IsEmpty]: Start isEmpty. Operand 60891 states and 69971 transitions. [2019-11-23 22:50:17,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-23 22:50:17,532 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:17,532 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:17,532 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:17,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:17,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1073074581, now seen corresponding path program 1 times [2019-11-23 22:50:17,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:17,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857753268] [2019-11-23 22:50:17,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:17,599 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 22:50:17,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857753268] [2019-11-23 22:50:17,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:17,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:50:17,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540429662] [2019-11-23 22:50:17,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:50:17,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:17,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:50:17,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:50:17,601 INFO L87 Difference]: Start difference. First operand 60891 states and 69971 transitions. Second operand 5 states. [2019-11-23 22:50:21,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:21,788 INFO L93 Difference]: Finished difference Result 154915 states and 179281 transitions. [2019-11-23 22:50:21,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:50:21,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 216 [2019-11-23 22:50:21,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:21,874 INFO L225 Difference]: With dead ends: 154915 [2019-11-23 22:50:21,874 INFO L226 Difference]: Without dead ends: 94067 [2019-11-23 22:50:21,908 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:50:21,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94067 states. [2019-11-23 22:50:25,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94067 to 61275. [2019-11-23 22:50:25,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61275 states. [2019-11-23 22:50:25,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61275 states to 61275 states and 69410 transitions. [2019-11-23 22:50:25,373 INFO L78 Accepts]: Start accepts. Automaton has 61275 states and 69410 transitions. Word has length 216 [2019-11-23 22:50:25,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:25,373 INFO L462 AbstractCegarLoop]: Abstraction has 61275 states and 69410 transitions. [2019-11-23 22:50:25,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:50:25,373 INFO L276 IsEmpty]: Start isEmpty. Operand 61275 states and 69410 transitions. [2019-11-23 22:50:25,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-11-23 22:50:25,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:25,407 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:25,408 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:25,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:25,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1497272560, now seen corresponding path program 1 times [2019-11-23 22:50:25,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:25,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414989645] [2019-11-23 22:50:25,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 22:50:25,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414989645] [2019-11-23 22:50:25,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:25,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:25,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310660092] [2019-11-23 22:50:25,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:25,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:25,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:25,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:25,499 INFO L87 Difference]: Start difference. First operand 61275 states and 69410 transitions. Second operand 3 states. [2019-11-23 22:50:29,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:29,846 INFO L93 Difference]: Finished difference Result 131965 states and 149290 transitions. [2019-11-23 22:50:29,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:29,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2019-11-23 22:50:29,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:29,912 INFO L225 Difference]: With dead ends: 131965 [2019-11-23 22:50:29,912 INFO L226 Difference]: Without dead ends: 70722 [2019-11-23 22:50:29,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:50:29,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70722 states. [2019-11-23 22:50:33,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70722 to 70402. [2019-11-23 22:50:33,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70402 states. [2019-11-23 22:50:33,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70402 states to 70402 states and 79384 transitions. [2019-11-23 22:50:33,262 INFO L78 Accepts]: Start accepts. Automaton has 70402 states and 79384 transitions. Word has length 250 [2019-11-23 22:50:33,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:33,262 INFO L462 AbstractCegarLoop]: Abstraction has 70402 states and 79384 transitions. [2019-11-23 22:50:33,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:33,262 INFO L276 IsEmpty]: Start isEmpty. Operand 70402 states and 79384 transitions. [2019-11-23 22:50:33,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-11-23 22:50:33,291 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:33,291 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:33,291 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:33,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:33,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1211305274, now seen corresponding path program 1 times [2019-11-23 22:50:33,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:33,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413886551] [2019-11-23 22:50:33,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:33,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413886551] [2019-11-23 22:50:33,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:33,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:33,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071296384] [2019-11-23 22:50:33,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:33,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:33,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:33,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:33,360 INFO L87 Difference]: Start difference. First operand 70402 states and 79384 transitions. Second operand 3 states. [2019-11-23 22:50:36,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:36,622 INFO L93 Difference]: Finished difference Result 131622 states and 148736 transitions. [2019-11-23 22:50:36,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:36,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-11-23 22:50:36,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:36,687 INFO L225 Difference]: With dead ends: 131622 [2019-11-23 22:50:36,688 INFO L226 Difference]: Without dead ends: 70406 [2019-11-23 22:50:36,718 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:50:36,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70406 states.