/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:32:54,458 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:32:54,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:32:54,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:32:54,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:32:54,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:32:54,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:32:54,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:32:54,498 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:32:54,501 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:32:54,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:32:54,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:32:54,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:32:54,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:32:54,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:32:54,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:32:54,512 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:32:54,513 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:32:54,514 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:32:54,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:32:54,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:32:54,529 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:32:54,530 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:32:54,531 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:32:54,533 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:32:54,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:32:54,534 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:32:54,535 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:32:54,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:32:54,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:32:54,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:32:54,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:32:54,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:32:54,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:32:54,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:32:54,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:32:54,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:32:54,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:32:54,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:32:54,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:32:54,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:32:54,547 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:32:54,579 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:32:54,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:32:54,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:32:54,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:32:54,585 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:32:54,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:32:54,587 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:32:54,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:32:54,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:32:54,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:32:54,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:32:54,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:32:54,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:32:54,588 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:32:54,588 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:32:54,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:32:54,589 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:32:54,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:32:54,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:32:54,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:32:54,590 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:32:54,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:32:54,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:32:54,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:32:54,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:32:54,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:32:54,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:32:54,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:32:54,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:32:54,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:32:54,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:32:54,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:32:54,899 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:32:54,901 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:32:54,902 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:32:54,903 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-23 22:32:54,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85705d177/00e9b3602fec4a66ab92977da86f8a0e/FLAG6fbe7bfe5 [2019-11-23 22:32:55,480 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:32:55,481 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-23 22:32:55,492 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85705d177/00e9b3602fec4a66ab92977da86f8a0e/FLAG6fbe7bfe5 [2019-11-23 22:32:55,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85705d177/00e9b3602fec4a66ab92977da86f8a0e [2019-11-23 22:32:55,821 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:32:55,823 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:32:55,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:32:55,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:32:55,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:32:55,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:32:55" (1/1) ... [2019-11-23 22:32:55,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f837a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:55, skipping insertion in model container [2019-11-23 22:32:55,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:32:55" (1/1) ... [2019-11-23 22:32:55,843 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:32:55,900 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:32:56,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:32:56,327 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:32:56,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:32:56,439 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:32:56,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:56 WrapperNode [2019-11-23 22:32:56,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:32:56,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:32:56,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:32:56,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:32:56,450 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:32:56" (1/1) ... [2019-11-23 22:32:56,463 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:32:56" (1/1) ... [2019-11-23 22:32:56,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:32:56,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:32:56,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:32:56,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:32:56,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:56" (1/1) ... [2019-11-23 22:32:56,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:56" (1/1) ... [2019-11-23 22:32:56,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:56" (1/1) ... [2019-11-23 22:32:56,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:56" (1/1) ... [2019-11-23 22:32:56,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:56" (1/1) ... [2019-11-23 22:32:56,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:56" (1/1) ... [2019-11-23 22:32:56,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:56" (1/1) ... [2019-11-23 22:32:56,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:32:56,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:32:56,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:32:56,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:32:56,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:32:56,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:32:56,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:32:57,397 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:32:57,398 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:32:57,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:32:57 BoogieIcfgContainer [2019-11-23 22:32:57,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:32:57,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:32:57,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:32:57,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:32:57,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:32:55" (1/3) ... [2019-11-23 22:32:57,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa9329f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:32:57, skipping insertion in model container [2019-11-23 22:32:57,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:56" (2/3) ... [2019-11-23 22:32:57,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa9329f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:32:57, skipping insertion in model container [2019-11-23 22:32:57,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:32:57" (3/3) ... [2019-11-23 22:32:57,408 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-23 22:32:57,420 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:32:57,429 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:32:57,442 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:32:57,469 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:32:57,469 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:32:57,469 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:32:57,470 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:32:57,470 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:32:57,470 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:32:57,470 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:32:57,470 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:32:57,490 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2019-11-23 22:32:57,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-23 22:32:57,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:57,501 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:32:57,501 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:57,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:57,508 INFO L82 PathProgramCache]: Analyzing trace with hash -235222256, now seen corresponding path program 1 times [2019-11-23 22:32:57,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:57,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240094106] [2019-11-23 22:32:57,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:57,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:57,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240094106] [2019-11-23 22:32:57,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:57,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:57,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694612696] [2019-11-23 22:32:57,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:57,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:57,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:57,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:57,852 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 3 states. [2019-11-23 22:32:58,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:58,013 INFO L93 Difference]: Finished difference Result 284 states and 462 transitions. [2019-11-23 22:32:58,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:58,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-23 22:32:58,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:58,034 INFO L225 Difference]: With dead ends: 284 [2019-11-23 22:32:58,034 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 22:32:58,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:58,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 22:32:58,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2019-11-23 22:32:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-11-23 22:32:58,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 320 transitions. [2019-11-23 22:32:58,103 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 320 transitions. Word has length 48 [2019-11-23 22:32:58,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:58,104 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 320 transitions. [2019-11-23 22:32:58,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:58,104 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 320 transitions. [2019-11-23 22:32:58,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:32:58,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:58,106 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] [2019-11-23 22:32:58,107 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:58,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:58,107 INFO L82 PathProgramCache]: Analyzing trace with hash 407331856, now seen corresponding path program 1 times [2019-11-23 22:32:58,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:58,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8464504] [2019-11-23 22:32:58,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:58,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:58,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8464504] [2019-11-23 22:32:58,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:58,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:58,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90710090] [2019-11-23 22:32:58,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:58,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:58,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:58,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:58,223 INFO L87 Difference]: Start difference. First operand 214 states and 320 transitions. Second operand 3 states. [2019-11-23 22:32:58,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:58,304 INFO L93 Difference]: Finished difference Result 518 states and 794 transitions. [2019-11-23 22:32:58,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:58,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-23 22:32:58,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:58,310 INFO L225 Difference]: With dead ends: 518 [2019-11-23 22:32:58,310 INFO L226 Difference]: Without dead ends: 367 [2019-11-23 22:32:58,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:58,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-11-23 22:32:58,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2019-11-23 22:32:58,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-11-23 22:32:58,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 548 transitions. [2019-11-23 22:32:58,361 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 548 transitions. Word has length 51 [2019-11-23 22:32:58,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:58,362 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 548 transitions. [2019-11-23 22:32:58,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:58,362 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 548 transitions. [2019-11-23 22:32:58,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:32:58,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:58,366 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] [2019-11-23 22:32:58,366 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:58,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:58,368 INFO L82 PathProgramCache]: Analyzing trace with hash 738781713, now seen corresponding path program 1 times [2019-11-23 22:32:58,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:58,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467761016] [2019-11-23 22:32:58,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:58,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467761016] [2019-11-23 22:32:58,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:58,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:58,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461163971] [2019-11-23 22:32:58,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:58,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:58,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:58,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:58,479 INFO L87 Difference]: Start difference. First operand 365 states and 548 transitions. Second operand 3 states. [2019-11-23 22:32:58,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:58,550 INFO L93 Difference]: Finished difference Result 877 states and 1336 transitions. [2019-11-23 22:32:58,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:58,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-23 22:32:58,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:58,555 INFO L225 Difference]: With dead ends: 877 [2019-11-23 22:32:58,555 INFO L226 Difference]: Without dead ends: 623 [2019-11-23 22:32:58,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:58,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-11-23 22:32:58,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 621. [2019-11-23 22:32:58,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-11-23 22:32:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 926 transitions. [2019-11-23 22:32:58,608 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 926 transitions. Word has length 51 [2019-11-23 22:32:58,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:58,609 INFO L462 AbstractCegarLoop]: Abstraction has 621 states and 926 transitions. [2019-11-23 22:32:58,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:58,610 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 926 transitions. [2019-11-23 22:32:58,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:32:58,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:58,614 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] [2019-11-23 22:32:58,614 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:58,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:58,615 INFO L82 PathProgramCache]: Analyzing trace with hash -865520847, now seen corresponding path program 1 times [2019-11-23 22:32:58,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:58,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623485946] [2019-11-23 22:32:58,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:58,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:58,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623485946] [2019-11-23 22:32:58,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:58,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:58,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897351607] [2019-11-23 22:32:58,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:58,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:58,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:58,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:58,695 INFO L87 Difference]: Start difference. First operand 621 states and 926 transitions. Second operand 3 states. [2019-11-23 22:32:58,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:58,789 INFO L93 Difference]: Finished difference Result 1635 states and 2454 transitions. [2019-11-23 22:32:58,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:58,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-23 22:32:58,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:58,798 INFO L225 Difference]: With dead ends: 1635 [2019-11-23 22:32:58,798 INFO L226 Difference]: Without dead ends: 1101 [2019-11-23 22:32:58,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:58,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2019-11-23 22:32:58,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1099. [2019-11-23 22:32:58,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1099 states. [2019-11-23 22:32:58,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1608 transitions. [2019-11-23 22:32:58,882 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1608 transitions. Word has length 51 [2019-11-23 22:32:58,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:58,883 INFO L462 AbstractCegarLoop]: Abstraction has 1099 states and 1608 transitions. [2019-11-23 22:32:58,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1608 transitions. [2019-11-23 22:32:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:32:58,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:58,891 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:32:58,892 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:58,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:58,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1376619607, now seen corresponding path program 1 times [2019-11-23 22:32:58,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:58,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921477068] [2019-11-23 22:32:58,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:59,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:59,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921477068] [2019-11-23 22:32:59,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:59,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:32:59,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012108887] [2019-11-23 22:32:59,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:32:59,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:59,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:32:59,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:32:59,128 INFO L87 Difference]: Start difference. First operand 1099 states and 1608 transitions. Second operand 9 states. [2019-11-23 22:33:00,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:00,771 INFO L93 Difference]: Finished difference Result 4882 states and 7078 transitions. [2019-11-23 22:33:00,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 22:33:00,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-11-23 22:33:00,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:00,793 INFO L225 Difference]: With dead ends: 4882 [2019-11-23 22:33:00,794 INFO L226 Difference]: Without dead ends: 4520 [2019-11-23 22:33:00,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=307, Unknown=0, NotChecked=0, Total=462 [2019-11-23 22:33:00,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4520 states. [2019-11-23 22:33:00,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4520 to 1138. [2019-11-23 22:33:00,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2019-11-23 22:33:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1657 transitions. [2019-11-23 22:33:00,913 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1657 transitions. Word has length 52 [2019-11-23 22:33:00,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:00,914 INFO L462 AbstractCegarLoop]: Abstraction has 1138 states and 1657 transitions. [2019-11-23 22:33:00,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:33:00,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1657 transitions. [2019-11-23 22:33:00,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:33:00,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:00,919 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:33:00,919 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:00,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:00,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1542318405, now seen corresponding path program 1 times [2019-11-23 22:33:00,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:00,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007234825] [2019-11-23 22:33:00,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:01,119 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:33:01,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007234825] [2019-11-23 22:33:01,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:01,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:33:01,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566615099] [2019-11-23 22:33:01,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:33:01,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:01,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:33:01,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:33:01,122 INFO L87 Difference]: Start difference. First operand 1138 states and 1657 transitions. Second operand 10 states. [2019-11-23 22:33:03,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:03,080 INFO L93 Difference]: Finished difference Result 5248 states and 7550 transitions. [2019-11-23 22:33:03,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 22:33:03,080 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-23 22:33:03,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:03,103 INFO L225 Difference]: With dead ends: 5248 [2019-11-23 22:33:03,103 INFO L226 Difference]: Without dead ends: 4879 [2019-11-23 22:33:03,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2019-11-23 22:33:03,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4879 states. [2019-11-23 22:33:03,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 1196. [2019-11-23 22:33:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1196 states. [2019-11-23 22:33:03,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1733 transitions. [2019-11-23 22:33:03,258 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1733 transitions. Word has length 52 [2019-11-23 22:33:03,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:03,259 INFO L462 AbstractCegarLoop]: Abstraction has 1196 states and 1733 transitions. [2019-11-23 22:33:03,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:33:03,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1733 transitions. [2019-11-23 22:33:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 22:33:03,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:03,261 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:33:03,261 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:03,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:03,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1268142435, now seen corresponding path program 1 times [2019-11-23 22:33:03,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:03,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439942076] [2019-11-23 22:33:03,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:33:03,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439942076] [2019-11-23 22:33:03,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:03,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:33:03,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817953066] [2019-11-23 22:33:03,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:33:03,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:03,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:33:03,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:33:03,392 INFO L87 Difference]: Start difference. First operand 1196 states and 1733 transitions. Second operand 10 states. [2019-11-23 22:33:05,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:05,576 INFO L93 Difference]: Finished difference Result 5441 states and 7896 transitions. [2019-11-23 22:33:05,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 22:33:05,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-11-23 22:33:05,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:05,600 INFO L225 Difference]: With dead ends: 5441 [2019-11-23 22:33:05,600 INFO L226 Difference]: Without dead ends: 5025 [2019-11-23 22:33:05,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2019-11-23 22:33:05,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2019-11-23 22:33:05,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 1238. [2019-11-23 22:33:05,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1238 states. [2019-11-23 22:33:05,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1788 transitions. [2019-11-23 22:33:05,901 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1788 transitions. Word has length 53 [2019-11-23 22:33:05,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:05,902 INFO L462 AbstractCegarLoop]: Abstraction has 1238 states and 1788 transitions. [2019-11-23 22:33:05,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:33:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1788 transitions. [2019-11-23 22:33:05,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 22:33:05,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:05,904 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:33:05,904 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:05,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:05,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1010238910, now seen corresponding path program 1 times [2019-11-23 22:33:05,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:05,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248310819] [2019-11-23 22:33:05,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:06,085 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:33:06,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248310819] [2019-11-23 22:33:06,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:06,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:33:06,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089323482] [2019-11-23 22:33:06,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:33:06,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:06,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:33:06,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:33:06,089 INFO L87 Difference]: Start difference. First operand 1238 states and 1788 transitions. Second operand 9 states. [2019-11-23 22:33:07,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:07,498 INFO L93 Difference]: Finished difference Result 5587 states and 8191 transitions. [2019-11-23 22:33:07,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:33:07,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-11-23 22:33:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:07,519 INFO L225 Difference]: With dead ends: 5587 [2019-11-23 22:33:07,519 INFO L226 Difference]: Without dead ends: 4553 [2019-11-23 22:33:07,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-11-23 22:33:07,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4553 states. [2019-11-23 22:33:08,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4553 to 3812. [2019-11-23 22:33:08,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3812 states. [2019-11-23 22:33:08,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3812 states to 3812 states and 5592 transitions. [2019-11-23 22:33:08,020 INFO L78 Accepts]: Start accepts. Automaton has 3812 states and 5592 transitions. Word has length 53 [2019-11-23 22:33:08,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:08,021 INFO L462 AbstractCegarLoop]: Abstraction has 3812 states and 5592 transitions. [2019-11-23 22:33:08,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:33:08,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3812 states and 5592 transitions. [2019-11-23 22:33:08,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 22:33:08,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:08,024 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:33:08,024 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:08,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:08,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1344313564, now seen corresponding path program 1 times [2019-11-23 22:33:08,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:08,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192846654] [2019-11-23 22:33:08,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:08,115 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:33:08,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192846654] [2019-11-23 22:33:08,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:08,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:33:08,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535260685] [2019-11-23 22:33:08,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:33:08,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:08,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:33:08,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:33:08,119 INFO L87 Difference]: Start difference. First operand 3812 states and 5592 transitions. Second operand 7 states. [2019-11-23 22:33:09,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:09,966 INFO L93 Difference]: Finished difference Result 15048 states and 22238 transitions. [2019-11-23 22:33:09,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:33:09,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-23 22:33:09,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:10,011 INFO L225 Difference]: With dead ends: 15048 [2019-11-23 22:33:10,011 INFO L226 Difference]: Without dead ends: 13722 [2019-11-23 22:33:10,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:33:10,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13722 states. [2019-11-23 22:33:10,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13722 to 3804. [2019-11-23 22:33:10,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3804 states. [2019-11-23 22:33:10,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3804 states to 3804 states and 5586 transitions. [2019-11-23 22:33:10,550 INFO L78 Accepts]: Start accepts. Automaton has 3804 states and 5586 transitions. Word has length 53 [2019-11-23 22:33:10,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:10,550 INFO L462 AbstractCegarLoop]: Abstraction has 3804 states and 5586 transitions. [2019-11-23 22:33:10,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:33:10,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3804 states and 5586 transitions. [2019-11-23 22:33:10,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 22:33:10,553 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:10,553 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:33:10,553 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:10,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:10,554 INFO L82 PathProgramCache]: Analyzing trace with hash 109147901, now seen corresponding path program 1 times [2019-11-23 22:33:10,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:10,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858376676] [2019-11-23 22:33:10,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:10,652 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:33:10,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858376676] [2019-11-23 22:33:10,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:10,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:33:10,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915030985] [2019-11-23 22:33:10,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:33:10,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:10,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:33:10,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:33:10,655 INFO L87 Difference]: Start difference. First operand 3804 states and 5586 transitions. Second operand 7 states. [2019-11-23 22:33:12,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:12,568 INFO L93 Difference]: Finished difference Result 15411 states and 22544 transitions. [2019-11-23 22:33:12,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:33:12,569 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-23 22:33:12,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:12,598 INFO L225 Difference]: With dead ends: 15411 [2019-11-23 22:33:12,598 INFO L226 Difference]: Without dead ends: 14241 [2019-11-23 22:33:12,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:33:12,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14241 states. [2019-11-23 22:33:13,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14241 to 3856. [2019-11-23 22:33:13,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3856 states. [2019-11-23 22:33:13,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3856 states to 3856 states and 5652 transitions. [2019-11-23 22:33:13,161 INFO L78 Accepts]: Start accepts. Automaton has 3856 states and 5652 transitions. Word has length 53 [2019-11-23 22:33:13,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:13,162 INFO L462 AbstractCegarLoop]: Abstraction has 3856 states and 5652 transitions. [2019-11-23 22:33:13,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:33:13,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3856 states and 5652 transitions. [2019-11-23 22:33:13,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:33:13,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:13,166 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] [2019-11-23 22:33:13,166 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:13,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:13,167 INFO L82 PathProgramCache]: Analyzing trace with hash -442062535, now seen corresponding path program 1 times [2019-11-23 22:33:13,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:13,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855743640] [2019-11-23 22:33:13,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:13,238 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:33:13,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855743640] [2019-11-23 22:33:13,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:13,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:33:13,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086007854] [2019-11-23 22:33:13,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:33:13,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:13,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:33:13,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:33:13,240 INFO L87 Difference]: Start difference. First operand 3856 states and 5652 transitions. Second operand 7 states. [2019-11-23 22:33:15,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:15,061 INFO L93 Difference]: Finished difference Result 13274 states and 19477 transitions. [2019-11-23 22:33:15,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:33:15,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-23 22:33:15,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:15,084 INFO L225 Difference]: With dead ends: 13274 [2019-11-23 22:33:15,084 INFO L226 Difference]: Without dead ends: 11806 [2019-11-23 22:33:15,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:33:15,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11806 states. [2019-11-23 22:33:15,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11806 to 3824. [2019-11-23 22:33:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3824 states. [2019-11-23 22:33:15,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 5607 transitions. [2019-11-23 22:33:15,573 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 5607 transitions. Word has length 54 [2019-11-23 22:33:15,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:15,573 INFO L462 AbstractCegarLoop]: Abstraction has 3824 states and 5607 transitions. [2019-11-23 22:33:15,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:33:15,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 5607 transitions. [2019-11-23 22:33:15,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:33:15,575 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:15,575 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] [2019-11-23 22:33:15,576 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:15,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:15,576 INFO L82 PathProgramCache]: Analyzing trace with hash -972986947, now seen corresponding path program 1 times [2019-11-23 22:33:15,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:15,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841936533] [2019-11-23 22:33:15,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:15,671 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:33:15,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841936533] [2019-11-23 22:33:15,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:15,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:33:15,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695975373] [2019-11-23 22:33:15,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:33:15,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:15,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:33:15,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:33:15,673 INFO L87 Difference]: Start difference. First operand 3824 states and 5607 transitions. Second operand 9 states. [2019-11-23 22:33:19,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:19,476 INFO L93 Difference]: Finished difference Result 24863 states and 36602 transitions. [2019-11-23 22:33:19,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 22:33:19,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-11-23 22:33:19,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:19,510 INFO L225 Difference]: With dead ends: 24863 [2019-11-23 22:33:19,510 INFO L226 Difference]: Without dead ends: 22127 [2019-11-23 22:33:19,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-11-23 22:33:19,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22127 states. [2019-11-23 22:33:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22127 to 9264. [2019-11-23 22:33:20,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9264 states. [2019-11-23 22:33:20,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9264 states to 9264 states and 13700 transitions. [2019-11-23 22:33:20,918 INFO L78 Accepts]: Start accepts. Automaton has 9264 states and 13700 transitions. Word has length 54 [2019-11-23 22:33:20,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:20,918 INFO L462 AbstractCegarLoop]: Abstraction has 9264 states and 13700 transitions. [2019-11-23 22:33:20,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:33:20,919 INFO L276 IsEmpty]: Start isEmpty. Operand 9264 states and 13700 transitions. [2019-11-23 22:33:20,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:33:20,923 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:20,923 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] [2019-11-23 22:33:20,923 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:20,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:20,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1551978991, now seen corresponding path program 1 times [2019-11-23 22:33:20,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:20,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129432112] [2019-11-23 22:33:20,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:20,976 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:33:20,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129432112] [2019-11-23 22:33:20,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:20,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:33:20,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178224047] [2019-11-23 22:33:20,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:33:20,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:20,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:33:20,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:33:20,978 INFO L87 Difference]: Start difference. First operand 9264 states and 13700 transitions. Second operand 6 states. [2019-11-23 22:33:22,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:22,246 INFO L93 Difference]: Finished difference Result 16656 states and 24641 transitions. [2019-11-23 22:33:22,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:33:22,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-23 22:33:22,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:22,256 INFO L225 Difference]: With dead ends: 16656 [2019-11-23 22:33:22,256 INFO L226 Difference]: Without dead ends: 8901 [2019-11-23 22:33:22,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:33:22,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8901 states. [2019-11-23 22:33:22,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8901 to 5589. [2019-11-23 22:33:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5589 states. [2019-11-23 22:33:22,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5589 states to 5589 states and 8231 transitions. [2019-11-23 22:33:22,966 INFO L78 Accepts]: Start accepts. Automaton has 5589 states and 8231 transitions. Word has length 54 [2019-11-23 22:33:22,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:22,966 INFO L462 AbstractCegarLoop]: Abstraction has 5589 states and 8231 transitions. [2019-11-23 22:33:22,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:33:22,967 INFO L276 IsEmpty]: Start isEmpty. Operand 5589 states and 8231 transitions. [2019-11-23 22:33:22,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:33:22,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:22,969 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] [2019-11-23 22:33:22,969 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:22,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:22,970 INFO L82 PathProgramCache]: Analyzing trace with hash -576256938, now seen corresponding path program 1 times [2019-11-23 22:33:22,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:22,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051909828] [2019-11-23 22:33:22,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:23,018 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:33:23,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051909828] [2019-11-23 22:33:23,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:23,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:33:23,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481309050] [2019-11-23 22:33:23,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:33:23,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:23,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:33:23,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:33:23,021 INFO L87 Difference]: Start difference. First operand 5589 states and 8231 transitions. Second operand 5 states. [2019-11-23 22:33:24,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:24,072 INFO L93 Difference]: Finished difference Result 11685 states and 17236 transitions. [2019-11-23 22:33:24,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:33:24,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-11-23 22:33:24,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:24,078 INFO L225 Difference]: With dead ends: 11685 [2019-11-23 22:33:24,078 INFO L226 Difference]: Without dead ends: 7499 [2019-11-23 22:33:24,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:33:24,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7499 states. [2019-11-23 22:33:24,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7499 to 5254. [2019-11-23 22:33:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5254 states. [2019-11-23 22:33:24,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5254 states to 5254 states and 7625 transitions. [2019-11-23 22:33:24,710 INFO L78 Accepts]: Start accepts. Automaton has 5254 states and 7625 transitions. Word has length 54 [2019-11-23 22:33:24,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:24,710 INFO L462 AbstractCegarLoop]: Abstraction has 5254 states and 7625 transitions. [2019-11-23 22:33:24,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:33:24,710 INFO L276 IsEmpty]: Start isEmpty. Operand 5254 states and 7625 transitions. [2019-11-23 22:33:24,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:33:24,713 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:24,713 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] [2019-11-23 22:33:24,714 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:24,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:24,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1734310767, now seen corresponding path program 1 times [2019-11-23 22:33:24,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:24,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350540743] [2019-11-23 22:33:24,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:24,782 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:33:24,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350540743] [2019-11-23 22:33:24,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:24,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:33:24,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468604029] [2019-11-23 22:33:24,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:33:24,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:24,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:33:24,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:33:24,784 INFO L87 Difference]: Start difference. First operand 5254 states and 7625 transitions. Second operand 6 states. [2019-11-23 22:33:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:25,824 INFO L93 Difference]: Finished difference Result 10782 states and 15716 transitions. [2019-11-23 22:33:25,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:33:25,824 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-23 22:33:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:25,831 INFO L225 Difference]: With dead ends: 10782 [2019-11-23 22:33:25,831 INFO L226 Difference]: Without dead ends: 6339 [2019-11-23 22:33:25,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:33:25,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6339 states. [2019-11-23 22:33:26,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6339 to 4783. [2019-11-23 22:33:26,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4783 states. [2019-11-23 22:33:26,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4783 states to 4783 states and 6937 transitions. [2019-11-23 22:33:26,533 INFO L78 Accepts]: Start accepts. Automaton has 4783 states and 6937 transitions. Word has length 54 [2019-11-23 22:33:26,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:26,534 INFO L462 AbstractCegarLoop]: Abstraction has 4783 states and 6937 transitions. [2019-11-23 22:33:26,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:33:26,534 INFO L276 IsEmpty]: Start isEmpty. Operand 4783 states and 6937 transitions. [2019-11-23 22:33:26,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:33:26,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:26,535 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] [2019-11-23 22:33:26,535 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:26,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:26,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1394562871, now seen corresponding path program 1 times [2019-11-23 22:33:26,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:26,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696637003] [2019-11-23 22:33:26,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:26,603 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:33:26,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696637003] [2019-11-23 22:33:26,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:26,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:33:26,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934219384] [2019-11-23 22:33:26,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:33:26,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:26,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:33:26,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:33:26,605 INFO L87 Difference]: Start difference. First operand 4783 states and 6937 transitions. Second operand 5 states. [2019-11-23 22:33:28,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:28,917 INFO L93 Difference]: Finished difference Result 16404 states and 24035 transitions. [2019-11-23 22:33:28,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:33:28,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-11-23 22:33:28,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:28,929 INFO L225 Difference]: With dead ends: 16404 [2019-11-23 22:33:28,929 INFO L226 Difference]: Without dead ends: 12760 [2019-11-23 22:33:28,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:33:28,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12760 states. [2019-11-23 22:33:29,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12760 to 5710. [2019-11-23 22:33:29,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5710 states. [2019-11-23 22:33:29,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5710 states to 5710 states and 8320 transitions. [2019-11-23 22:33:29,888 INFO L78 Accepts]: Start accepts. Automaton has 5710 states and 8320 transitions. Word has length 55 [2019-11-23 22:33:29,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:29,889 INFO L462 AbstractCegarLoop]: Abstraction has 5710 states and 8320 transitions. [2019-11-23 22:33:29,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:33:29,889 INFO L276 IsEmpty]: Start isEmpty. Operand 5710 states and 8320 transitions. [2019-11-23 22:33:29,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:33:29,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:29,891 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] [2019-11-23 22:33:29,891 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:29,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:29,892 INFO L82 PathProgramCache]: Analyzing trace with hash 265858276, now seen corresponding path program 1 times [2019-11-23 22:33:29,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:29,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863664407] [2019-11-23 22:33:29,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:29,954 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:33:29,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863664407] [2019-11-23 22:33:29,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:29,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:33:29,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648481977] [2019-11-23 22:33:29,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:33:29,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:29,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:33:29,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:33:29,956 INFO L87 Difference]: Start difference. First operand 5710 states and 8320 transitions. Second operand 5 states. [2019-11-23 22:33:32,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:32,304 INFO L93 Difference]: Finished difference Result 17381 states and 25487 transitions. [2019-11-23 22:33:32,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:33:32,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-11-23 22:33:32,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:32,316 INFO L225 Difference]: With dead ends: 17381 [2019-11-23 22:33:32,316 INFO L226 Difference]: Without dead ends: 13737 [2019-11-23 22:33:32,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:33:32,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13737 states. [2019-11-23 22:33:33,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13737 to 6755. [2019-11-23 22:33:33,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6755 states. [2019-11-23 22:33:33,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6755 states to 6755 states and 9883 transitions. [2019-11-23 22:33:33,401 INFO L78 Accepts]: Start accepts. Automaton has 6755 states and 9883 transitions. Word has length 56 [2019-11-23 22:33:33,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:33,401 INFO L462 AbstractCegarLoop]: Abstraction has 6755 states and 9883 transitions. [2019-11-23 22:33:33,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:33:33,401 INFO L276 IsEmpty]: Start isEmpty. Operand 6755 states and 9883 transitions. [2019-11-23 22:33:33,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:33:33,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:33,403 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] [2019-11-23 22:33:33,403 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:33,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:33,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1721357349, now seen corresponding path program 1 times [2019-11-23 22:33:33,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:33,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155491867] [2019-11-23 22:33:33,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:33,460 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:33:33,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155491867] [2019-11-23 22:33:33,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:33,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:33:33,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837320406] [2019-11-23 22:33:33,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:33:33,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:33,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:33:33,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:33:33,462 INFO L87 Difference]: Start difference. First operand 6755 states and 9883 transitions. Second operand 5 states. [2019-11-23 22:33:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:36,326 INFO L93 Difference]: Finished difference Result 18735 states and 27458 transitions. [2019-11-23 22:33:36,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:33:36,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-11-23 22:33:36,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:36,339 INFO L225 Difference]: With dead ends: 18735 [2019-11-23 22:33:36,339 INFO L226 Difference]: Without dead ends: 15091 [2019-11-23 22:33:36,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:33:36,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15091 states. [2019-11-23 22:33:37,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15091 to 8909. [2019-11-23 22:33:37,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8909 states. [2019-11-23 22:33:37,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8909 states to 8909 states and 13097 transitions. [2019-11-23 22:33:37,854 INFO L78 Accepts]: Start accepts. Automaton has 8909 states and 13097 transitions. Word has length 56 [2019-11-23 22:33:37,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:37,855 INFO L462 AbstractCegarLoop]: Abstraction has 8909 states and 13097 transitions. [2019-11-23 22:33:37,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:33:37,855 INFO L276 IsEmpty]: Start isEmpty. Operand 8909 states and 13097 transitions. [2019-11-23 22:33:37,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 22:33:37,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:37,858 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:33:37,858 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:37,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:37,858 INFO L82 PathProgramCache]: Analyzing trace with hash 740296785, now seen corresponding path program 1 times [2019-11-23 22:33:37,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:37,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725850123] [2019-11-23 22:33:37,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:38,066 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:33:38,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725850123] [2019-11-23 22:33:38,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:38,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:33:38,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349645426] [2019-11-23 22:33:38,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:33:38,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:38,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:33:38,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:33:38,071 INFO L87 Difference]: Start difference. First operand 8909 states and 13097 transitions. Second operand 10 states. [2019-11-23 22:33:48,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:48,198 INFO L93 Difference]: Finished difference Result 44465 states and 65252 transitions. [2019-11-23 22:33:48,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-23 22:33:48,198 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2019-11-23 22:33:48,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:48,229 INFO L225 Difference]: With dead ends: 44465 [2019-11-23 22:33:48,230 INFO L226 Difference]: Without dead ends: 36692 [2019-11-23 22:33:48,240 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=339, Invalid=993, Unknown=0, NotChecked=0, Total=1332 [2019-11-23 22:33:48,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36692 states. [2019-11-23 22:33:49,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36692 to 8909. [2019-11-23 22:33:49,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8909 states. [2019-11-23 22:33:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8909 states to 8909 states and 13091 transitions. [2019-11-23 22:33:49,984 INFO L78 Accepts]: Start accepts. Automaton has 8909 states and 13091 transitions. Word has length 61 [2019-11-23 22:33:49,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:49,985 INFO L462 AbstractCegarLoop]: Abstraction has 8909 states and 13091 transitions. [2019-11-23 22:33:49,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:33:49,985 INFO L276 IsEmpty]: Start isEmpty. Operand 8909 states and 13091 transitions. [2019-11-23 22:33:49,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 22:33:49,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:49,987 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:33:49,987 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:49,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:49,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1120228239, now seen corresponding path program 1 times [2019-11-23 22:33:49,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:49,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547063920] [2019-11-23 22:33:49,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:50,149 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:33:50,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547063920] [2019-11-23 22:33:50,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:50,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:33:50,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452163228] [2019-11-23 22:33:50,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:33:50,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:50,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:33:50,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:33:50,151 INFO L87 Difference]: Start difference. First operand 8909 states and 13091 transitions. Second operand 10 states. [2019-11-23 22:33:56,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:56,598 INFO L93 Difference]: Finished difference Result 31319 states and 45831 transitions. [2019-11-23 22:33:56,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 22:33:56,599 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2019-11-23 22:33:56,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:56,621 INFO L225 Difference]: With dead ends: 31319 [2019-11-23 22:33:56,621 INFO L226 Difference]: Without dead ends: 23707 [2019-11-23 22:33:56,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2019-11-23 22:33:56,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23707 states. [2019-11-23 22:33:58,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23707 to 8806. [2019-11-23 22:33:58,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8806 states. [2019-11-23 22:33:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8806 states to 8806 states and 12921 transitions. [2019-11-23 22:33:58,574 INFO L78 Accepts]: Start accepts. Automaton has 8806 states and 12921 transitions. Word has length 61 [2019-11-23 22:33:58,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:58,574 INFO L462 AbstractCegarLoop]: Abstraction has 8806 states and 12921 transitions. [2019-11-23 22:33:58,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:33:58,574 INFO L276 IsEmpty]: Start isEmpty. Operand 8806 states and 12921 transitions. [2019-11-23 22:33:58,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 22:33:58,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:58,576 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:33:58,577 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:58,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:58,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1451678096, now seen corresponding path program 1 times [2019-11-23 22:33:58,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:58,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921375749] [2019-11-23 22:33:58,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:58,738 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:33:58,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921375749] [2019-11-23 22:33:58,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:58,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:33:58,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587027348] [2019-11-23 22:33:58,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:33:58,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:58,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:33:58,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:33:58,740 INFO L87 Difference]: Start difference. First operand 8806 states and 12921 transitions. Second operand 10 states. [2019-11-23 22:34:05,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:05,944 INFO L93 Difference]: Finished difference Result 32412 states and 47618 transitions. [2019-11-23 22:34:05,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 22:34:05,944 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2019-11-23 22:34:05,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:05,966 INFO L225 Difference]: With dead ends: 32412 [2019-11-23 22:34:05,966 INFO L226 Difference]: Without dead ends: 24517 [2019-11-23 22:34:05,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2019-11-23 22:34:05,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24517 states. [2019-11-23 22:34:07,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24517 to 8533. [2019-11-23 22:34:07,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8533 states. [2019-11-23 22:34:07,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8533 states to 8533 states and 12507 transitions. [2019-11-23 22:34:07,881 INFO L78 Accepts]: Start accepts. Automaton has 8533 states and 12507 transitions. Word has length 61 [2019-11-23 22:34:07,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:07,882 INFO L462 AbstractCegarLoop]: Abstraction has 8533 states and 12507 transitions. [2019-11-23 22:34:07,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:34:07,882 INFO L276 IsEmpty]: Start isEmpty. Operand 8533 states and 12507 transitions. [2019-11-23 22:34:07,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-23 22:34:07,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:07,884 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:07,885 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:07,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:07,885 INFO L82 PathProgramCache]: Analyzing trace with hash 218587336, now seen corresponding path program 1 times [2019-11-23 22:34:07,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:07,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050232057] [2019-11-23 22:34:07,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:07,922 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:34:07,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050232057] [2019-11-23 22:34:07,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:07,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:07,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744915987] [2019-11-23 22:34:07,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:07,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:07,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:07,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:07,926 INFO L87 Difference]: Start difference. First operand 8533 states and 12507 transitions. Second operand 3 states. [2019-11-23 22:34:10,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:10,274 INFO L93 Difference]: Finished difference Result 12913 states and 18935 transitions. [2019-11-23 22:34:10,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:10,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-23 22:34:10,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:10,283 INFO L225 Difference]: With dead ends: 12913 [2019-11-23 22:34:10,283 INFO L226 Difference]: Without dead ends: 8514 [2019-11-23 22:34:10,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:10,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8514 states. [2019-11-23 22:34:12,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8514 to 8512. [2019-11-23 22:34:12,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8512 states. [2019-11-23 22:34:12,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8512 states to 8512 states and 12330 transitions. [2019-11-23 22:34:12,123 INFO L78 Accepts]: Start accepts. Automaton has 8512 states and 12330 transitions. Word has length 62 [2019-11-23 22:34:12,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:12,123 INFO L462 AbstractCegarLoop]: Abstraction has 8512 states and 12330 transitions. [2019-11-23 22:34:12,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:12,124 INFO L276 IsEmpty]: Start isEmpty. Operand 8512 states and 12330 transitions. [2019-11-23 22:34:12,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-23 22:34:12,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:12,125 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:12,126 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:12,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:12,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1004137309, now seen corresponding path program 1 times [2019-11-23 22:34:12,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:12,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381301641] [2019-11-23 22:34:12,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:12,159 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:34:12,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381301641] [2019-11-23 22:34:12,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:12,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:12,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432651570] [2019-11-23 22:34:12,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:12,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:12,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:12,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:12,162 INFO L87 Difference]: Start difference. First operand 8512 states and 12330 transitions. Second operand 3 states. [2019-11-23 22:34:13,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:13,803 INFO L93 Difference]: Finished difference Result 11032 states and 15950 transitions. [2019-11-23 22:34:13,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:13,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-23 22:34:13,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:13,810 INFO L225 Difference]: With dead ends: 11032 [2019-11-23 22:34:13,810 INFO L226 Difference]: Without dead ends: 7333 [2019-11-23 22:34:13,816 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:34:13,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7333 states. [2019-11-23 22:34:15,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7333 to 7331. [2019-11-23 22:34:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7331 states. [2019-11-23 22:34:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7331 states to 7331 states and 10432 transitions. [2019-11-23 22:34:15,344 INFO L78 Accepts]: Start accepts. Automaton has 7331 states and 10432 transitions. Word has length 62 [2019-11-23 22:34:15,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:15,344 INFO L462 AbstractCegarLoop]: Abstraction has 7331 states and 10432 transitions. [2019-11-23 22:34:15,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:15,344 INFO L276 IsEmpty]: Start isEmpty. Operand 7331 states and 10432 transitions. [2019-11-23 22:34:15,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-23 22:34:15,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:15,346 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:15,346 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:15,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:15,346 INFO L82 PathProgramCache]: Analyzing trace with hash -17959571, now seen corresponding path program 1 times [2019-11-23 22:34:15,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:15,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561932059] [2019-11-23 22:34:15,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:15,383 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:34:15,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561932059] [2019-11-23 22:34:15,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:15,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:15,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209693605] [2019-11-23 22:34:15,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:15,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:15,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:15,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:15,387 INFO L87 Difference]: Start difference. First operand 7331 states and 10432 transitions. Second operand 3 states. [2019-11-23 22:34:17,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:17,094 INFO L93 Difference]: Finished difference Result 8347 states and 11826 transitions. [2019-11-23 22:34:17,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:17,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-23 22:34:17,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:17,104 INFO L225 Difference]: With dead ends: 8347 [2019-11-23 22:34:17,104 INFO L226 Difference]: Without dead ends: 6738 [2019-11-23 22:34:17,108 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:34:17,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6738 states. [2019-11-23 22:34:18,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6738 to 6736. [2019-11-23 22:34:18,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6736 states. [2019-11-23 22:34:18,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6736 states to 6736 states and 9329 transitions. [2019-11-23 22:34:18,531 INFO L78 Accepts]: Start accepts. Automaton has 6736 states and 9329 transitions. Word has length 62 [2019-11-23 22:34:18,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:18,532 INFO L462 AbstractCegarLoop]: Abstraction has 6736 states and 9329 transitions. [2019-11-23 22:34:18,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:18,532 INFO L276 IsEmpty]: Start isEmpty. Operand 6736 states and 9329 transitions. [2019-11-23 22:34:18,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 22:34:18,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:18,534 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:18,534 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:18,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:18,534 INFO L82 PathProgramCache]: Analyzing trace with hash -467159905, now seen corresponding path program 1 times [2019-11-23 22:34:18,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:18,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369276694] [2019-11-23 22:34:18,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:19,431 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:34:19,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369276694] [2019-11-23 22:34:19,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:19,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-11-23 22:34:19,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74800756] [2019-11-23 22:34:19,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 22:34:19,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:19,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 22:34:19,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2019-11-23 22:34:19,432 INFO L87 Difference]: Start difference. First operand 6736 states and 9329 transitions. Second operand 23 states. [2019-11-23 22:34:19,796 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 93 [2019-11-23 22:34:20,516 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-11-23 22:34:20,721 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-23 22:34:21,115 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-23 22:34:21,465 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2019-11-23 22:34:22,060 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 97 [2019-11-23 22:34:22,607 WARN L192 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2019-11-23 22:34:22,810 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-11-23 22:34:23,075 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-11-23 22:34:23,482 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-11-23 22:34:23,813 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-11-23 22:34:24,109 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51