/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/kundu2.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:48:44,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:48:44,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:48:44,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:48:44,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:48:44,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:48:44,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:48:44,770 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:48:44,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:48:44,776 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:48:44,777 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:48:44,778 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:48:44,779 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:48:44,779 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:48:44,780 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:48:44,781 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:48:44,782 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:48:44,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:48:44,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:48:44,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:48:44,787 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:48:44,788 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:48:44,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:48:44,790 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:48:44,792 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:48:44,792 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:48:44,792 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:48:44,793 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:48:44,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:48:44,794 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:48:44,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:48:44,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:48:44,796 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:48:44,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:48:44,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:48:44,798 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:48:44,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:48:44,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:48:44,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:48:44,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:48:44,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:48:44,802 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:48:44,828 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:48:44,830 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:48:44,831 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:48:44,831 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:48:44,831 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:48:44,832 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:48:44,832 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:48:44,832 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:48:44,832 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:48:44,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:48:44,833 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:48:44,834 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:48:44,834 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:48:44,834 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:48:44,834 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:48:44,834 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:48:44,835 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:48:44,835 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:48:44,835 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:48:44,835 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:48:44,836 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:48:44,836 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:48:44,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:48:44,836 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:48:44,836 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:48:44,836 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:48:44,837 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:48:44,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:48:44,837 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:48:44,837 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:48:45,105 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:48:45,118 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:48:45,121 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:48:45,123 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:48:45,123 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:48:45,124 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/kundu2.cil.c [2019-11-23 22:48:45,188 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14c117973/52bf27ee8287439f97811062ef9d5e04/FLAG4e9505d20 [2019-11-23 22:48:45,658 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:48:45,659 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu2.cil.c [2019-11-23 22:48:45,668 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14c117973/52bf27ee8287439f97811062ef9d5e04/FLAG4e9505d20 [2019-11-23 22:48:46,009 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14c117973/52bf27ee8287439f97811062ef9d5e04 [2019-11-23 22:48:46,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:48:46,019 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:48:46,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:48:46,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:48:46,024 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:48:46,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:48:46" (1/1) ... [2019-11-23 22:48:46,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b93cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:46, skipping insertion in model container [2019-11-23 22:48:46,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:48:46" (1/1) ... [2019-11-23 22:48:46,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:48:46,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:48:46,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:48:46,310 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:48:46,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:48:46,474 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:48:46,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:46 WrapperNode [2019-11-23 22:48:46,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:48:46,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:46,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:48:46,476 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:48:46,484 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:48:46" (1/1) ... [2019-11-23 22:48:46,507 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:48:46" (1/1) ... [2019-11-23 22:48:46,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:46,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:48:46,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:48:46,548 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:48:46,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:46" (1/1) ... [2019-11-23 22:48:46,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:46" (1/1) ... [2019-11-23 22:48:46,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:46" (1/1) ... [2019-11-23 22:48:46,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:46" (1/1) ... [2019-11-23 22:48:46,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:46" (1/1) ... [2019-11-23 22:48:46,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:46" (1/1) ... [2019-11-23 22:48:46,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:46" (1/1) ... [2019-11-23 22:48:46,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:48:46,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:48:46,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:48:46,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:48:46,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:46" (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:48:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:48:46,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:48:47,396 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:48:47,396 INFO L284 CfgBuilder]: Removed 95 assume(true) statements. [2019-11-23 22:48:47,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:47 BoogieIcfgContainer [2019-11-23 22:48:47,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:48:47,399 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:48:47,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:48:47,402 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:48:47,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:48:46" (1/3) ... [2019-11-23 22:48:47,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1cbc29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:47, skipping insertion in model container [2019-11-23 22:48:47,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:46" (2/3) ... [2019-11-23 22:48:47,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1cbc29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:47, skipping insertion in model container [2019-11-23 22:48:47,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:47" (3/3) ... [2019-11-23 22:48:47,406 INFO L109 eAbstractionObserver]: Analyzing ICFG kundu2.cil.c [2019-11-23 22:48:47,415 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:48:47,423 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-23 22:48:47,434 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-23 22:48:47,461 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:48:47,462 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:48:47,462 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:48:47,462 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:48:47,463 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:48:47,463 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:48:47,463 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:48:47,463 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:48:47,487 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states. [2019-11-23 22:48:47,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-23 22:48:47,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:47,497 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] [2019-11-23 22:48:47,498 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:47,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:47,504 INFO L82 PathProgramCache]: Analyzing trace with hash 805260304, now seen corresponding path program 1 times [2019-11-23 22:48:47,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:47,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574729784] [2019-11-23 22:48:47,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:47,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:47,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574729784] [2019-11-23 22:48:47,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:47,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:47,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782466824] [2019-11-23 22:48:47,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:47,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:47,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:47,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:47,694 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 3 states. [2019-11-23 22:48:47,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:47,751 INFO L93 Difference]: Finished difference Result 354 states and 540 transitions. [2019-11-23 22:48:47,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:47,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-23 22:48:47,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:47,766 INFO L225 Difference]: With dead ends: 354 [2019-11-23 22:48:47,766 INFO L226 Difference]: Without dead ends: 175 [2019-11-23 22:48:47,770 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:48:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-23 22:48:47,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-11-23 22:48:47,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-23 22:48:47,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 257 transitions. [2019-11-23 22:48:47,823 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 257 transitions. Word has length 40 [2019-11-23 22:48:47,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:47,823 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 257 transitions. [2019-11-23 22:48:47,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 257 transitions. [2019-11-23 22:48:47,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-23 22:48:47,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:47,826 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] [2019-11-23 22:48:47,826 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:47,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:47,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1199627090, now seen corresponding path program 1 times [2019-11-23 22:48:47,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:47,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823028644] [2019-11-23 22:48:47,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:47,896 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:48:47,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823028644] [2019-11-23 22:48:47,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:47,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:47,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434227291] [2019-11-23 22:48:47,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:47,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:47,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:47,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:47,900 INFO L87 Difference]: Start difference. First operand 175 states and 257 transitions. Second operand 3 states. [2019-11-23 22:48:48,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:48,012 INFO L93 Difference]: Finished difference Result 477 states and 700 transitions. [2019-11-23 22:48:48,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:48,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-23 22:48:48,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:48,016 INFO L225 Difference]: With dead ends: 477 [2019-11-23 22:48:48,016 INFO L226 Difference]: Without dead ends: 317 [2019-11-23 22:48:48,018 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:48:48,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-11-23 22:48:48,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 294. [2019-11-23 22:48:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-23 22:48:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 434 transitions. [2019-11-23 22:48:48,055 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 434 transitions. Word has length 40 [2019-11-23 22:48:48,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:48,059 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 434 transitions. [2019-11-23 22:48:48,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:48,059 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 434 transitions. [2019-11-23 22:48:48,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-23 22:48:48,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:48,061 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] [2019-11-23 22:48:48,061 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:48,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:48,064 INFO L82 PathProgramCache]: Analyzing trace with hash -472890541, now seen corresponding path program 1 times [2019-11-23 22:48:48,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:48,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113050375] [2019-11-23 22:48:48,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:48,122 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:48:48,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113050375] [2019-11-23 22:48:48,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:48,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:48,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217146310] [2019-11-23 22:48:48,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:48,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:48,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:48,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:48,127 INFO L87 Difference]: Start difference. First operand 294 states and 434 transitions. Second operand 3 states. [2019-11-23 22:48:48,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:48,253 INFO L93 Difference]: Finished difference Result 821 states and 1211 transitions. [2019-11-23 22:48:48,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:48,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-23 22:48:48,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:48,257 INFO L225 Difference]: With dead ends: 821 [2019-11-23 22:48:48,257 INFO L226 Difference]: Without dead ends: 548 [2019-11-23 22:48:48,259 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:48:48,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-11-23 22:48:48,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 524. [2019-11-23 22:48:48,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-11-23 22:48:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 761 transitions. [2019-11-23 22:48:48,300 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 761 transitions. Word has length 40 [2019-11-23 22:48:48,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:48,300 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 761 transitions. [2019-11-23 22:48:48,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:48,301 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 761 transitions. [2019-11-23 22:48:48,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 22:48:48,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:48,302 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] [2019-11-23 22:48:48,303 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:48,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:48,303 INFO L82 PathProgramCache]: Analyzing trace with hash -2040159492, now seen corresponding path program 1 times [2019-11-23 22:48:48,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:48,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685822748] [2019-11-23 22:48:48,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:48,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:48:48,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685822748] [2019-11-23 22:48:48,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:48,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:48:48,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816013987] [2019-11-23 22:48:48,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:48:48,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:48,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:48:48,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:48,429 INFO L87 Difference]: Start difference. First operand 524 states and 761 transitions. Second operand 5 states. [2019-11-23 22:48:48,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:48,628 INFO L93 Difference]: Finished difference Result 1952 states and 2826 transitions. [2019-11-23 22:48:48,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:48:48,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-23 22:48:48,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:48,637 INFO L225 Difference]: With dead ends: 1952 [2019-11-23 22:48:48,637 INFO L226 Difference]: Without dead ends: 1441 [2019-11-23 22:48:48,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:48:48,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2019-11-23 22:48:48,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 563. [2019-11-23 22:48:48,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-11-23 22:48:48,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 800 transitions. [2019-11-23 22:48:48,683 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 800 transitions. Word has length 41 [2019-11-23 22:48:48,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:48,684 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 800 transitions. [2019-11-23 22:48:48,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:48:48,684 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 800 transitions. [2019-11-23 22:48:48,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 22:48:48,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:48,686 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] [2019-11-23 22:48:48,686 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:48,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:48,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2017527238, now seen corresponding path program 1 times [2019-11-23 22:48:48,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:48,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806781118] [2019-11-23 22:48:48,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:48,788 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:48:48,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806781118] [2019-11-23 22:48:48,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:48,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:48:48,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5822188] [2019-11-23 22:48:48,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:48:48,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:48,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:48:48,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:48,792 INFO L87 Difference]: Start difference. First operand 563 states and 800 transitions. Second operand 5 states. [2019-11-23 22:48:49,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:49,011 INFO L93 Difference]: Finished difference Result 1778 states and 2558 transitions. [2019-11-23 22:48:49,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:48:49,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-23 22:48:49,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:49,021 INFO L225 Difference]: With dead ends: 1778 [2019-11-23 22:48:49,022 INFO L226 Difference]: Without dead ends: 1237 [2019-11-23 22:48:49,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:48:49,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2019-11-23 22:48:49,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 581. [2019-11-23 22:48:49,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states. [2019-11-23 22:48:49,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 813 transitions. [2019-11-23 22:48:49,093 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 813 transitions. Word has length 41 [2019-11-23 22:48:49,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:49,095 INFO L462 AbstractCegarLoop]: Abstraction has 581 states and 813 transitions. [2019-11-23 22:48:49,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:48:49,096 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 813 transitions. [2019-11-23 22:48:49,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 22:48:49,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:49,101 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] [2019-11-23 22:48:49,101 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:49,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:49,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2143426552, now seen corresponding path program 1 times [2019-11-23 22:48:49,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:49,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913861417] [2019-11-23 22:48:49,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:49,216 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:48:49,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913861417] [2019-11-23 22:48:49,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:49,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:48:49,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367548272] [2019-11-23 22:48:49,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:48:49,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:49,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:48:49,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:49,219 INFO L87 Difference]: Start difference. First operand 581 states and 813 transitions. Second operand 5 states. [2019-11-23 22:48:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:49,454 INFO L93 Difference]: Finished difference Result 1776 states and 2524 transitions. [2019-11-23 22:48:49,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:48:49,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-23 22:48:49,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:49,461 INFO L225 Difference]: With dead ends: 1776 [2019-11-23 22:48:49,461 INFO L226 Difference]: Without dead ends: 1224 [2019-11-23 22:48:49,463 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:48:49,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-11-23 22:48:49,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 596. [2019-11-23 22:48:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-11-23 22:48:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 822 transitions. [2019-11-23 22:48:49,542 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 822 transitions. Word has length 41 [2019-11-23 22:48:49,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:49,543 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 822 transitions. [2019-11-23 22:48:49,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:48:49,544 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 822 transitions. [2019-11-23 22:48:49,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 22:48:49,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:49,548 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] [2019-11-23 22:48:49,548 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:49,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:49,548 INFO L82 PathProgramCache]: Analyzing trace with hash 555078650, now seen corresponding path program 1 times [2019-11-23 22:48:49,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:49,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752300187] [2019-11-23 22:48:49,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:49,640 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:48:49,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752300187] [2019-11-23 22:48:49,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:49,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:48:49,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009110448] [2019-11-23 22:48:49,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:49,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:49,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:49,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:49,643 INFO L87 Difference]: Start difference. First operand 596 states and 822 transitions. Second operand 4 states. [2019-11-23 22:48:49,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:49,874 INFO L93 Difference]: Finished difference Result 2598 states and 3612 transitions. [2019-11-23 22:48:49,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:48:49,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-11-23 22:48:49,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:49,885 INFO L225 Difference]: With dead ends: 2598 [2019-11-23 22:48:49,886 INFO L226 Difference]: Without dead ends: 2031 [2019-11-23 22:48:49,888 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:49,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2019-11-23 22:48:50,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 1038. [2019-11-23 22:48:50,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1038 states. [2019-11-23 22:48:50,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1438 transitions. [2019-11-23 22:48:50,011 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1438 transitions. Word has length 41 [2019-11-23 22:48:50,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:50,011 INFO L462 AbstractCegarLoop]: Abstraction has 1038 states and 1438 transitions. [2019-11-23 22:48:50,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:50,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1438 transitions. [2019-11-23 22:48:50,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-23 22:48:50,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:50,013 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] [2019-11-23 22:48:50,013 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:50,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:50,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2112971018, now seen corresponding path program 1 times [2019-11-23 22:48:50,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:50,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75287206] [2019-11-23 22:48:50,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:50,093 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:48:50,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75287206] [2019-11-23 22:48:50,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:50,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:48:50,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378793673] [2019-11-23 22:48:50,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:48:50,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:50,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:48:50,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:50,095 INFO L87 Difference]: Start difference. First operand 1038 states and 1438 transitions. Second operand 5 states. [2019-11-23 22:48:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:50,610 INFO L93 Difference]: Finished difference Result 5034 states and 7008 transitions. [2019-11-23 22:48:50,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:48:50,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-23 22:48:50,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:50,635 INFO L225 Difference]: With dead ends: 5034 [2019-11-23 22:48:50,635 INFO L226 Difference]: Without dead ends: 4025 [2019-11-23 22:48:50,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:48:50,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4025 states. [2019-11-23 22:48:50,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4025 to 2045. [2019-11-23 22:48:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2045 states. [2019-11-23 22:48:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 2840 transitions. [2019-11-23 22:48:50,832 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 2840 transitions. Word has length 48 [2019-11-23 22:48:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:50,832 INFO L462 AbstractCegarLoop]: Abstraction has 2045 states and 2840 transitions. [2019-11-23 22:48:50,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:48:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 2840 transitions. [2019-11-23 22:48:50,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:48:50,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:50,834 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] [2019-11-23 22:48:50,835 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:50,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:50,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1420212558, now seen corresponding path program 1 times [2019-11-23 22:48:50,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:50,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557726094] [2019-11-23 22:48:50,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:50,896 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:48:50,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557726094] [2019-11-23 22:48:50,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:50,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:50,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235344134] [2019-11-23 22:48:50,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:50,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:50,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:50,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:50,901 INFO L87 Difference]: Start difference. First operand 2045 states and 2840 transitions. Second operand 3 states. [2019-11-23 22:48:51,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:51,257 INFO L93 Difference]: Finished difference Result 5767 states and 7979 transitions. [2019-11-23 22:48:51,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:51,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-23 22:48:51,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:51,281 INFO L225 Difference]: With dead ends: 5767 [2019-11-23 22:48:51,281 INFO L226 Difference]: Without dead ends: 3751 [2019-11-23 22:48:51,286 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:48:51,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3751 states. [2019-11-23 22:48:51,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3751 to 3699. [2019-11-23 22:48:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3699 states. [2019-11-23 22:48:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3699 states to 3699 states and 5050 transitions. [2019-11-23 22:48:51,632 INFO L78 Accepts]: Start accepts. Automaton has 3699 states and 5050 transitions. Word has length 52 [2019-11-23 22:48:51,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:51,633 INFO L462 AbstractCegarLoop]: Abstraction has 3699 states and 5050 transitions. [2019-11-23 22:48:51,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:51,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3699 states and 5050 transitions. [2019-11-23 22:48:51,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 22:48:51,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:51,635 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] [2019-11-23 22:48:51,635 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:51,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:51,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1475283929, now seen corresponding path program 1 times [2019-11-23 22:48:51,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:51,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014491775] [2019-11-23 22:48:51,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:51,758 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:48:51,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014491775] [2019-11-23 22:48:51,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:51,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:48:51,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186109386] [2019-11-23 22:48:51,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:48:51,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:51,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:48:51,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:48:51,761 INFO L87 Difference]: Start difference. First operand 3699 states and 5050 transitions. Second operand 6 states. [2019-11-23 22:48:52,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:52,782 INFO L93 Difference]: Finished difference Result 12040 states and 16437 transitions. [2019-11-23 22:48:52,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:48:52,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-23 22:48:52,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:52,828 INFO L225 Difference]: With dead ends: 12040 [2019-11-23 22:48:52,828 INFO L226 Difference]: Without dead ends: 8370 [2019-11-23 22:48:52,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:48:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8370 states. [2019-11-23 22:48:53,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8370 to 5490. [2019-11-23 22:48:53,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5490 states. [2019-11-23 22:48:53,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5490 states to 5490 states and 7504 transitions. [2019-11-23 22:48:53,350 INFO L78 Accepts]: Start accepts. Automaton has 5490 states and 7504 transitions. Word has length 53 [2019-11-23 22:48:53,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:53,350 INFO L462 AbstractCegarLoop]: Abstraction has 5490 states and 7504 transitions. [2019-11-23 22:48:53,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:48:53,351 INFO L276 IsEmpty]: Start isEmpty. Operand 5490 states and 7504 transitions. [2019-11-23 22:48:53,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 22:48:53,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:53,352 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:48:53,353 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:53,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:53,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1170295472, now seen corresponding path program 1 times [2019-11-23 22:48:53,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:53,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882092097] [2019-11-23 22:48:53,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:53,382 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 22:48:53,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882092097] [2019-11-23 22:48:53,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:53,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:53,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651471652] [2019-11-23 22:48:53,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:53,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:53,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:53,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:53,385 INFO L87 Difference]: Start difference. First operand 5490 states and 7504 transitions. Second operand 3 states. [2019-11-23 22:48:54,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:54,140 INFO L93 Difference]: Finished difference Result 15843 states and 21496 transitions. [2019-11-23 22:48:54,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:54,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-23 22:48:54,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:54,175 INFO L225 Difference]: With dead ends: 15843 [2019-11-23 22:48:54,175 INFO L226 Difference]: Without dead ends: 10382 [2019-11-23 22:48:54,184 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:48:54,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10382 states. [2019-11-23 22:48:55,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10382 to 10376. [2019-11-23 22:48:55,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2019-11-23 22:48:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 13831 transitions. [2019-11-23 22:48:55,061 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 13831 transitions. Word has length 57 [2019-11-23 22:48:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:55,061 INFO L462 AbstractCegarLoop]: Abstraction has 10376 states and 13831 transitions. [2019-11-23 22:48:55,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 13831 transitions. [2019-11-23 22:48:55,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-23 22:48:55,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:55,064 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] [2019-11-23 22:48:55,064 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:55,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:55,064 INFO L82 PathProgramCache]: Analyzing trace with hash 171117839, now seen corresponding path program 1 times [2019-11-23 22:48:55,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:55,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815024127] [2019-11-23 22:48:55,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:55,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:48:55,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815024127] [2019-11-23 22:48:55,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:55,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:48:55,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177860512] [2019-11-23 22:48:55,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:48:55,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:55,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:48:55,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:55,115 INFO L87 Difference]: Start difference. First operand 10376 states and 13831 transitions. Second operand 5 states. [2019-11-23 22:48:56,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:56,123 INFO L93 Difference]: Finished difference Result 24226 states and 32344 transitions. [2019-11-23 22:48:56,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:48:56,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-11-23 22:48:56,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:56,151 INFO L225 Difference]: With dead ends: 24226 [2019-11-23 22:48:56,151 INFO L226 Difference]: Without dead ends: 13904 [2019-11-23 22:48:56,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:56,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13904 states. [2019-11-23 22:48:56,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13904 to 13830. [2019-11-23 22:48:56,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13830 states. [2019-11-23 22:48:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13830 states to 13830 states and 18427 transitions. [2019-11-23 22:48:56,979 INFO L78 Accepts]: Start accepts. Automaton has 13830 states and 18427 transitions. Word has length 58 [2019-11-23 22:48:56,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:56,979 INFO L462 AbstractCegarLoop]: Abstraction has 13830 states and 18427 transitions. [2019-11-23 22:48:56,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:48:56,979 INFO L276 IsEmpty]: Start isEmpty. Operand 13830 states and 18427 transitions. [2019-11-23 22:48:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-23 22:48:56,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:56,982 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:56,982 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:56,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:56,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1927952390, now seen corresponding path program 1 times [2019-11-23 22:48:56,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:56,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698418072] [2019-11-23 22:48:56,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:57,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698418072] [2019-11-23 22:48:57,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:57,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:57,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747812954] [2019-11-23 22:48:57,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:57,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:57,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:57,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:57,011 INFO L87 Difference]: Start difference. First operand 13830 states and 18427 transitions. Second operand 3 states. [2019-11-23 22:48:58,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:58,640 INFO L93 Difference]: Finished difference Result 36085 states and 48046 transitions. [2019-11-23 22:48:58,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:58,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-23 22:48:58,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:58,692 INFO L225 Difference]: With dead ends: 36085 [2019-11-23 22:48:58,692 INFO L226 Difference]: Without dead ends: 22309 [2019-11-23 22:48:58,714 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:48:58,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22309 states. [2019-11-23 22:48:59,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22309 to 19285. [2019-11-23 22:48:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19285 states. [2019-11-23 22:48:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19285 states to 19285 states and 25656 transitions. [2019-11-23 22:48:59,882 INFO L78 Accepts]: Start accepts. Automaton has 19285 states and 25656 transitions. Word has length 59 [2019-11-23 22:48:59,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:59,882 INFO L462 AbstractCegarLoop]: Abstraction has 19285 states and 25656 transitions. [2019-11-23 22:48:59,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 19285 states and 25656 transitions. [2019-11-23 22:48:59,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 22:48:59,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:59,886 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] [2019-11-23 22:48:59,886 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:59,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:59,886 INFO L82 PathProgramCache]: Analyzing trace with hash -348509553, now seen corresponding path program 1 times [2019-11-23 22:48:59,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:59,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216124109] [2019-11-23 22:48:59,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:59,964 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:48:59,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216124109] [2019-11-23 22:48:59,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:59,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:48:59,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149635293] [2019-11-23 22:48:59,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:48:59,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:59,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:48:59,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:48:59,968 INFO L87 Difference]: Start difference. First operand 19285 states and 25656 transitions. Second operand 6 states. [2019-11-23 22:49:02,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:02,539 INFO L93 Difference]: Finished difference Result 64295 states and 85620 transitions. [2019-11-23 22:49:02,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:49:02,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-23 22:49:02,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:02,596 INFO L225 Difference]: With dead ends: 64295 [2019-11-23 22:49:02,596 INFO L226 Difference]: Without dead ends: 47099 [2019-11-23 22:49:02,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:49:02,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47099 states. [2019-11-23 22:49:05,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47099 to 25501. [2019-11-23 22:49:05,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25501 states. [2019-11-23 22:49:05,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25501 states to 25501 states and 34022 transitions. [2019-11-23 22:49:05,060 INFO L78 Accepts]: Start accepts. Automaton has 25501 states and 34022 transitions. Word has length 61 [2019-11-23 22:49:05,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:05,060 INFO L462 AbstractCegarLoop]: Abstraction has 25501 states and 34022 transitions. [2019-11-23 22:49:05,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:49:05,060 INFO L276 IsEmpty]: Start isEmpty. Operand 25501 states and 34022 transitions. [2019-11-23 22:49:05,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-23 22:49:05,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:05,066 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:05,067 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:05,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:05,068 INFO L82 PathProgramCache]: Analyzing trace with hash 807662601, now seen corresponding path program 1 times [2019-11-23 22:49:05,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:05,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233133960] [2019-11-23 22:49:05,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:05,103 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:05,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233133960] [2019-11-23 22:49:05,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:05,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:05,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298762234] [2019-11-23 22:49:05,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:05,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:05,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:05,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:05,105 INFO L87 Difference]: Start difference. First operand 25501 states and 34022 transitions. Second operand 3 states. [2019-11-23 22:49:06,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:06,418 INFO L93 Difference]: Finished difference Result 50906 states and 67931 transitions. [2019-11-23 22:49:06,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:06,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-23 22:49:06,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:06,443 INFO L225 Difference]: With dead ends: 50906 [2019-11-23 22:49:06,444 INFO L226 Difference]: Without dead ends: 25505 [2019-11-23 22:49:06,460 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:06,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25505 states. [2019-11-23 22:49:07,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25505 to 25501. [2019-11-23 22:49:07,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25501 states. [2019-11-23 22:49:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25501 states to 25501 states and 33819 transitions. [2019-11-23 22:49:08,004 INFO L78 Accepts]: Start accepts. Automaton has 25501 states and 33819 transitions. Word has length 65 [2019-11-23 22:49:08,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:08,004 INFO L462 AbstractCegarLoop]: Abstraction has 25501 states and 33819 transitions. [2019-11-23 22:49:08,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 25501 states and 33819 transitions. [2019-11-23 22:49:08,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-23 22:49:08,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:08,010 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:08,010 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:08,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:08,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1009486535, now seen corresponding path program 1 times [2019-11-23 22:49:08,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:08,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110360855] [2019-11-23 22:49:08,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:08,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 22:49:08,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110360855] [2019-11-23 22:49:08,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:08,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:08,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462944429] [2019-11-23 22:49:08,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:08,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:08,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:08,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:08,033 INFO L87 Difference]: Start difference. First operand 25501 states and 33819 transitions. Second operand 3 states. [2019-11-23 22:49:09,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:09,390 INFO L93 Difference]: Finished difference Result 27414 states and 36203 transitions. [2019-11-23 22:49:09,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:09,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-23 22:49:09,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:09,412 INFO L225 Difference]: With dead ends: 27414 [2019-11-23 22:49:09,412 INFO L226 Difference]: Without dead ends: 25455 [2019-11-23 22:49:09,418 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:09,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25455 states. [2019-11-23 22:49:10,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25455 to 25455. [2019-11-23 22:49:10,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25455 states. [2019-11-23 22:49:10,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25455 states to 25455 states and 33765 transitions. [2019-11-23 22:49:10,666 INFO L78 Accepts]: Start accepts. Automaton has 25455 states and 33765 transitions. Word has length 65 [2019-11-23 22:49:10,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:10,666 INFO L462 AbstractCegarLoop]: Abstraction has 25455 states and 33765 transitions. [2019-11-23 22:49:10,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:10,666 INFO L276 IsEmpty]: Start isEmpty. Operand 25455 states and 33765 transitions. [2019-11-23 22:49:10,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-23 22:49:10,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:10,670 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:10,670 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:10,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:10,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1172878516, now seen corresponding path program 1 times [2019-11-23 22:49:10,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:10,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188952432] [2019-11-23 22:49:10,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:10,699 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:10,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188952432] [2019-11-23 22:49:10,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:10,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:10,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824450354] [2019-11-23 22:49:10,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:10,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:10,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:10,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:10,701 INFO L87 Difference]: Start difference. First operand 25455 states and 33765 transitions. Second operand 3 states. [2019-11-23 22:49:12,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:12,548 INFO L93 Difference]: Finished difference Result 50862 states and 67472 transitions. [2019-11-23 22:49:12,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:12,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-23 22:49:12,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:12,575 INFO L225 Difference]: With dead ends: 50862 [2019-11-23 22:49:12,575 INFO L226 Difference]: Without dead ends: 25461 [2019-11-23 22:49:12,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25461 states. [2019-11-23 22:49:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25461 to 25455. [2019-11-23 22:49:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25455 states. [2019-11-23 22:49:13,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25455 states to 25455 states and 33293 transitions. [2019-11-23 22:49:13,941 INFO L78 Accepts]: Start accepts. Automaton has 25455 states and 33293 transitions. Word has length 66 [2019-11-23 22:49:13,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:13,942 INFO L462 AbstractCegarLoop]: Abstraction has 25455 states and 33293 transitions. [2019-11-23 22:49:13,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:13,942 INFO L276 IsEmpty]: Start isEmpty. Operand 25455 states and 33293 transitions. [2019-11-23 22:49:13,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-23 22:49:13,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:13,945 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:49:13,945 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:13,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:13,945 INFO L82 PathProgramCache]: Analyzing trace with hash 2075083770, now seen corresponding path program 1 times [2019-11-23 22:49:13,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:13,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541040064] [2019-11-23 22:49:13,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:13,970 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:13,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541040064] [2019-11-23 22:49:13,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:13,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:13,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051778398] [2019-11-23 22:49:13,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:13,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:13,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:13,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:13,972 INFO L87 Difference]: Start difference. First operand 25455 states and 33293 transitions. Second operand 3 states. [2019-11-23 22:49:15,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:15,547 INFO L93 Difference]: Finished difference Result 50862 states and 66528 transitions. [2019-11-23 22:49:15,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:15,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-11-23 22:49:15,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:15,570 INFO L225 Difference]: With dead ends: 50862 [2019-11-23 22:49:15,570 INFO L226 Difference]: Without dead ends: 25461 [2019-11-23 22:49:15,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25461 states. [2019-11-23 22:49:16,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25461 to 25455. [2019-11-23 22:49:16,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25455 states. [2019-11-23 22:49:16,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25455 states to 25455 states and 32998 transitions. [2019-11-23 22:49:16,848 INFO L78 Accepts]: Start accepts. Automaton has 25455 states and 32998 transitions. Word has length 68 [2019-11-23 22:49:16,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:16,848 INFO L462 AbstractCegarLoop]: Abstraction has 25455 states and 32998 transitions. [2019-11-23 22:49:16,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:16,848 INFO L276 IsEmpty]: Start isEmpty. Operand 25455 states and 32998 transitions. [2019-11-23 22:49:16,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-23 22:49:16,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:16,850 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:49:16,850 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:16,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:16,851 INFO L82 PathProgramCache]: Analyzing trace with hash 556975009, now seen corresponding path program 1 times [2019-11-23 22:49:16,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:16,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223684384] [2019-11-23 22:49:16,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:16,912 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:16,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223684384] [2019-11-23 22:49:16,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:16,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:49:16,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298871264] [2019-11-23 22:49:16,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:49:16,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:16,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:49:16,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:16,915 INFO L87 Difference]: Start difference. First operand 25455 states and 32998 transitions. Second operand 5 states. [2019-11-23 22:49:21,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:21,308 INFO L93 Difference]: Finished difference Result 84936 states and 110351 transitions. [2019-11-23 22:49:21,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:49:21,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-11-23 22:49:21,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:21,367 INFO L225 Difference]: With dead ends: 84936 [2019-11-23 22:49:21,368 INFO L226 Difference]: Without dead ends: 62320 [2019-11-23 22:49:21,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:49:21,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62320 states. [2019-11-23 22:49:23,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62320 to 28711. [2019-11-23 22:49:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28711 states. [2019-11-23 22:49:23,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28711 states to 28711 states and 37166 transitions. [2019-11-23 22:49:23,081 INFO L78 Accepts]: Start accepts. Automaton has 28711 states and 37166 transitions. Word has length 69 [2019-11-23 22:49:23,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:23,081 INFO L462 AbstractCegarLoop]: Abstraction has 28711 states and 37166 transitions. [2019-11-23 22:49:23,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:49:23,081 INFO L276 IsEmpty]: Start isEmpty. Operand 28711 states and 37166 transitions. [2019-11-23 22:49:23,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-23 22:49:23,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:23,085 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:49:23,085 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:23,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:23,086 INFO L82 PathProgramCache]: Analyzing trace with hash -636342002, now seen corresponding path program 1 times [2019-11-23 22:49:23,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:23,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428966548] [2019-11-23 22:49:23,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:23,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428966548] [2019-11-23 22:49:23,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:23,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:23,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781615980] [2019-11-23 22:49:23,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:23,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:23,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:23,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:23,111 INFO L87 Difference]: Start difference. First operand 28711 states and 37166 transitions. Second operand 3 states. [2019-11-23 22:49:26,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:26,332 INFO L93 Difference]: Finished difference Result 75115 states and 97570 transitions. [2019-11-23 22:49:26,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:26,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-23 22:49:26,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:26,381 INFO L225 Difference]: With dead ends: 75115 [2019-11-23 22:49:26,381 INFO L226 Difference]: Without dead ends: 53157 [2019-11-23 22:49:26,395 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,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53157 states. [2019-11-23 22:49:29,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53157 to 47161. [2019-11-23 22:49:29,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47161 states. [2019-11-23 22:49:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47161 states to 47161 states and 61368 transitions. [2019-11-23 22:49:29,234 INFO L78 Accepts]: Start accepts. Automaton has 47161 states and 61368 transitions. Word has length 85 [2019-11-23 22:49:29,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:29,234 INFO L462 AbstractCegarLoop]: Abstraction has 47161 states and 61368 transitions. [2019-11-23 22:49:29,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:29,234 INFO L276 IsEmpty]: Start isEmpty. Operand 47161 states and 61368 transitions. [2019-11-23 22:49:29,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 22:49:29,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:29,240 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:49:29,240 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:29,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:29,241 INFO L82 PathProgramCache]: Analyzing trace with hash 929392569, now seen corresponding path program 1 times [2019-11-23 22:49:29,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:29,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452460228] [2019-11-23 22:49:29,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:29,298 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-23 22:49:29,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452460228] [2019-11-23 22:49:29,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:29,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:29,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682408078] [2019-11-23 22:49:29,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:29,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:29,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:29,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:29,302 INFO L87 Difference]: Start difference. First operand 47161 states and 61368 transitions. Second operand 3 states. [2019-11-23 22:49:34,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:34,024 INFO L93 Difference]: Finished difference Result 112587 states and 145748 transitions. [2019-11-23 22:49:34,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:34,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-23 22:49:34,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:34,124 INFO L225 Difference]: With dead ends: 112587 [2019-11-23 22:49:34,125 INFO L226 Difference]: Without dead ends: 65448 [2019-11-23 22:49:34,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:34,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65448 states. [2019-11-23 22:49:39,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65448 to 65440. [2019-11-23 22:49:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65440 states. [2019-11-23 22:49:39,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65440 states to 65440 states and 84104 transitions. [2019-11-23 22:49:39,468 INFO L78 Accepts]: Start accepts. Automaton has 65440 states and 84104 transitions. Word has length 98 [2019-11-23 22:49:39,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:39,469 INFO L462 AbstractCegarLoop]: Abstraction has 65440 states and 84104 transitions. [2019-11-23 22:49:39,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:39,469 INFO L276 IsEmpty]: Start isEmpty. Operand 65440 states and 84104 transitions. [2019-11-23 22:49:39,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-23 22:49:39,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:39,474 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-23 22:49:39,474 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:39,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:39,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1073423074, now seen corresponding path program 1 times [2019-11-23 22:49:39,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:39,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291955232] [2019-11-23 22:49:39,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:39,512 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 22:49:39,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291955232] [2019-11-23 22:49:39,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:39,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:39,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330645412] [2019-11-23 22:49:39,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:39,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:39,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:39,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:39,515 INFO L87 Difference]: Start difference. First operand 65440 states and 84104 transitions. Second operand 3 states. [2019-11-23 22:49:47,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:47,762 INFO L93 Difference]: Finished difference Result 173122 states and 223241 transitions. [2019-11-23 22:49:47,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:47,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-23 22:49:47,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:47,875 INFO L225 Difference]: With dead ends: 173122 [2019-11-23 22:49:47,875 INFO L226 Difference]: Without dead ends: 111862 [2019-11-23 22:49:47,909 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:47,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111862 states. [2019-11-23 22:49:54,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111862 to 105898. [2019-11-23 22:49:54,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105898 states. [2019-11-23 22:49:54,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105898 states to 105898 states and 136054 transitions. [2019-11-23 22:49:54,499 INFO L78 Accepts]: Start accepts. Automaton has 105898 states and 136054 transitions. Word has length 100 [2019-11-23 22:49:54,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:54,500 INFO L462 AbstractCegarLoop]: Abstraction has 105898 states and 136054 transitions. [2019-11-23 22:49:54,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:54,500 INFO L276 IsEmpty]: Start isEmpty. Operand 105898 states and 136054 transitions. [2019-11-23 22:49:54,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 22:49:54,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:54,506 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-23 22:49:54,506 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:54,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:54,506 INFO L82 PathProgramCache]: Analyzing trace with hash 569307248, now seen corresponding path program 1 times [2019-11-23 22:49:54,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:54,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975524685] [2019-11-23 22:49:54,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:54,541 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:54,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975524685] [2019-11-23 22:49:54,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:54,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:54,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063480371] [2019-11-23 22:49:54,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:54,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:54,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:54,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:54,546 INFO L87 Difference]: Start difference. First operand 105898 states and 136054 transitions. Second operand 3 states. [2019-11-23 22:50:05,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:05,392 INFO L93 Difference]: Finished difference Result 257532 states and 329708 transitions. [2019-11-23 22:50:05,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:05,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-23 22:50:05,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:05,576 INFO L225 Difference]: With dead ends: 257532 [2019-11-23 22:50:05,577 INFO L226 Difference]: Without dead ends: 155814 [2019-11-23 22:50:05,641 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:05,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155814 states.