/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+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:32:50,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:32:50,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:32:50,420 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:32:50,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:32:50,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:32:50,422 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:32:50,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:32:50,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:32:50,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:32:50,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:32:50,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:32:50,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:32:50,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:32:50,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:32:50,432 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:32:50,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:32:50,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:32:50,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:32:50,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:32:50,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:32:50,440 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:32:50,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:32:50,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:32:50,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:32:50,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:32:50,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:32:50,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:32:50,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:32:50,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:32:50,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:32:50,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:32:50,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:32:50,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:32:50,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:32:50,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:32:50,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:32:50,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:32:50,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:32:50,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:32:50,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:32:50,454 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:50,468 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:32:50,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:32:50,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:32:50,470 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:32:50,470 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:32:50,470 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:32:50,471 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:32:50,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:32:50,471 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:32:50,471 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:32:50,471 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:32:50,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:32:50,472 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:32:50,472 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:32:50,472 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:32:50,472 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:32:50,473 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:32:50,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:32:50,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:32:50,473 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:32:50,473 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:32:50,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:32:50,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:32:50,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:32:50,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:32:50,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:32:50,474 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:32:50,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:32:50,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:32:50,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:32:50,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:32:50,750 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:32:50,755 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:32:50,756 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:32:50,756 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:32:50,758 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+lhb-reducer.c [2019-11-23 22:32:50,833 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/738ced906/747c7289592e4737ace8c610fba0b62a/FLAG9b19b50d7 [2019-11-23 22:32:51,446 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:32:51,447 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+lhb-reducer.c [2019-11-23 22:32:51,461 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/738ced906/747c7289592e4737ace8c610fba0b62a/FLAG9b19b50d7 [2019-11-23 22:32:51,633 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/738ced906/747c7289592e4737ace8c610fba0b62a [2019-11-23 22:32:51,642 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:32:51,644 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:32:51,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:32:51,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:32:51,650 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:32:51,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:32:51" (1/1) ... [2019-11-23 22:32:51,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d41d213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:51, skipping insertion in model container [2019-11-23 22:32:51,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:32:51" (1/1) ... [2019-11-23 22:32:51,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:32:51,739 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:32:52,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:32:52,460 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:32:52,769 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:32:52,796 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:32:52,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:52 WrapperNode [2019-11-23 22:32:52,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:32:52,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:32:52,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:32:52,798 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:32:52,807 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:52" (1/1) ... [2019-11-23 22:32:52,842 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:52" (1/1) ... [2019-11-23 22:32:52,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:32:52,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:32:52,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:32:52,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:32:52,930 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:52" (1/1) ... [2019-11-23 22:32:52,931 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:52" (1/1) ... [2019-11-23 22:32:52,942 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:52" (1/1) ... [2019-11-23 22:32:52,942 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:52" (1/1) ... [2019-11-23 22:32:52,993 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:52" (1/1) ... [2019-11-23 22:32:53,029 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:52" (1/1) ... [2019-11-23 22:32:53,049 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:52" (1/1) ... [2019-11-23 22:32:53,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:32:53,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:32:53,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:32:53,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:32:53,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:52" (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:53,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:32:53,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:32:54,985 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:32:54,986 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:32:54,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:32:54 BoogieIcfgContainer [2019-11-23 22:32:54,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:32:54,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:32:54,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:32:54,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:32:54,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:32:51" (1/3) ... [2019-11-23 22:32:54,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d3eb51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:32:54, skipping insertion in model container [2019-11-23 22:32:54,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:52" (2/3) ... [2019-11-23 22:32:54,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d3eb51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:32:54, skipping insertion in model container [2019-11-23 22:32:54,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:32:54" (3/3) ... [2019-11-23 22:32:54,996 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-23 22:32:55,005 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:32:55,013 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-23 22:32:55,025 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-23 22:32:55,054 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:32:55,054 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:32:55,055 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:32:55,055 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:32:55,055 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:32:55,055 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:32:55,055 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:32:55,055 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:32:55,081 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states. [2019-11-23 22:32:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-23 22:32:55,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:55,096 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] [2019-11-23 22:32:55,097 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:55,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:55,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1113444986, now seen corresponding path program 1 times [2019-11-23 22:32:55,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:55,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133654976] [2019-11-23 22:32:55,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:55,435 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:55,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133654976] [2019-11-23 22:32:55,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:55,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:55,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778541596] [2019-11-23 22:32:55,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:55,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:55,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:55,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:55,459 INFO L87 Difference]: Start difference. First operand 441 states. Second operand 3 states. [2019-11-23 22:32:55,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:55,604 INFO L93 Difference]: Finished difference Result 689 states and 1213 transitions. [2019-11-23 22:32:55,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:55,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-23 22:32:55,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:55,640 INFO L225 Difference]: With dead ends: 689 [2019-11-23 22:32:55,640 INFO L226 Difference]: Without dead ends: 545 [2019-11-23 22:32:55,648 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:55,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-11-23 22:32:55,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 539. [2019-11-23 22:32:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-11-23 22:32:55,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 718 transitions. [2019-11-23 22:32:55,776 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 718 transitions. Word has length 49 [2019-11-23 22:32:55,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:55,777 INFO L462 AbstractCegarLoop]: Abstraction has 539 states and 718 transitions. [2019-11-23 22:32:55,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:55,777 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 718 transitions. [2019-11-23 22:32:55,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-23 22:32:55,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:55,785 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] [2019-11-23 22:32:55,786 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:55,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:55,787 INFO L82 PathProgramCache]: Analyzing trace with hash 969247668, now seen corresponding path program 1 times [2019-11-23 22:32:55,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:55,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394083419] [2019-11-23 22:32:55,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:55,947 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:55,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394083419] [2019-11-23 22:32:55,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:55,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:55,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786791017] [2019-11-23 22:32:55,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:55,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:55,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:55,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:55,952 INFO L87 Difference]: Start difference. First operand 539 states and 718 transitions. Second operand 3 states. [2019-11-23 22:32:56,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:56,024 INFO L93 Difference]: Finished difference Result 954 states and 1328 transitions. [2019-11-23 22:32:56,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:56,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-23 22:32:56,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:56,030 INFO L225 Difference]: With dead ends: 954 [2019-11-23 22:32:56,030 INFO L226 Difference]: Without dead ends: 713 [2019-11-23 22:32:56,034 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:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-23 22:32:56,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 707. [2019-11-23 22:32:56,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-11-23 22:32:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 960 transitions. [2019-11-23 22:32:56,084 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 960 transitions. Word has length 49 [2019-11-23 22:32:56,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:56,085 INFO L462 AbstractCegarLoop]: Abstraction has 707 states and 960 transitions. [2019-11-23 22:32:56,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:56,085 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 960 transitions. [2019-11-23 22:32:56,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-23 22:32:56,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:56,088 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] [2019-11-23 22:32:56,088 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:56,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:56,088 INFO L82 PathProgramCache]: Analyzing trace with hash 533282259, now seen corresponding path program 1 times [2019-11-23 22:32:56,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:56,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114455688] [2019-11-23 22:32:56,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:56,147 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:56,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114455688] [2019-11-23 22:32:56,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:56,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:56,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099184007] [2019-11-23 22:32:56,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:56,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:56,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:56,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:56,150 INFO L87 Difference]: Start difference. First operand 707 states and 960 transitions. Second operand 3 states. [2019-11-23 22:32:56,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:56,259 INFO L93 Difference]: Finished difference Result 1363 states and 1911 transitions. [2019-11-23 22:32:56,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:56,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-23 22:32:56,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:56,266 INFO L225 Difference]: With dead ends: 1363 [2019-11-23 22:32:56,266 INFO L226 Difference]: Without dead ends: 1034 [2019-11-23 22:32:56,267 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:56,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2019-11-23 22:32:56,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1027. [2019-11-23 22:32:56,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1027 states. [2019-11-23 22:32:56,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1412 transitions. [2019-11-23 22:32:56,308 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1412 transitions. Word has length 49 [2019-11-23 22:32:56,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:56,310 INFO L462 AbstractCegarLoop]: Abstraction has 1027 states and 1412 transitions. [2019-11-23 22:32:56,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:56,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1412 transitions. [2019-11-23 22:32:56,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-23 22:32:56,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:56,321 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] [2019-11-23 22:32:56,322 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:56,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:56,322 INFO L82 PathProgramCache]: Analyzing trace with hash 388998377, now seen corresponding path program 1 times [2019-11-23 22:32:56,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:56,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544000265] [2019-11-23 22:32:56,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:56,523 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:56,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544000265] [2019-11-23 22:32:56,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:56,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-23 22:32:56,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284983798] [2019-11-23 22:32:56,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 22:32:56,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:56,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 22:32:56,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:32:56,526 INFO L87 Difference]: Start difference. First operand 1027 states and 1412 transitions. Second operand 11 states. [2019-11-23 22:32:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:59,120 INFO L93 Difference]: Finished difference Result 3222 states and 4552 transitions. [2019-11-23 22:32:59,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 22:32:59,121 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2019-11-23 22:32:59,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:59,135 INFO L225 Difference]: With dead ends: 3222 [2019-11-23 22:32:59,136 INFO L226 Difference]: Without dead ends: 3005 [2019-11-23 22:32:59,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2019-11-23 22:32:59,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2019-11-23 22:32:59,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 1038. [2019-11-23 22:32:59,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1038 states. [2019-11-23 22:32:59,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1426 transitions. [2019-11-23 22:32:59,222 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1426 transitions. Word has length 49 [2019-11-23 22:32:59,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:59,223 INFO L462 AbstractCegarLoop]: Abstraction has 1038 states and 1426 transitions. [2019-11-23 22:32:59,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 22:32:59,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1426 transitions. [2019-11-23 22:32:59,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:32:59,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:59,225 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] [2019-11-23 22:32:59,226 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:59,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:59,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1582595724, now seen corresponding path program 1 times [2019-11-23 22:32:59,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:59,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947554407] [2019-11-23 22:32:59,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:59,410 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,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947554407] [2019-11-23 22:32:59,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:59,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-23 22:32:59,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294360189] [2019-11-23 22:32:59,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 22:32:59,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:59,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 22:32:59,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:32:59,413 INFO L87 Difference]: Start difference. First operand 1038 states and 1426 transitions. Second operand 12 states. [2019-11-23 22:33:02,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:02,633 INFO L93 Difference]: Finished difference Result 3239 states and 4601 transitions. [2019-11-23 22:33:02,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 22:33:02,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-11-23 22:33:02,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:02,650 INFO L225 Difference]: With dead ends: 3239 [2019-11-23 22:33:02,654 INFO L226 Difference]: Without dead ends: 3041 [2019-11-23 22:33:02,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=503, Unknown=0, NotChecked=0, Total=702 [2019-11-23 22:33:02,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3041 states. [2019-11-23 22:33:02,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3041 to 1054. [2019-11-23 22:33:02,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-11-23 22:33:02,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1449 transitions. [2019-11-23 22:33:02,765 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1449 transitions. Word has length 50 [2019-11-23 22:33:02,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:02,766 INFO L462 AbstractCegarLoop]: Abstraction has 1054 states and 1449 transitions. [2019-11-23 22:33:02,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 22:33:02,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1449 transitions. [2019-11-23 22:33:02,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:33:02,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:02,769 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] [2019-11-23 22:33:02,769 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:02,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:02,770 INFO L82 PathProgramCache]: Analyzing trace with hash -403904652, now seen corresponding path program 1 times [2019-11-23 22:33:02,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:02,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865991512] [2019-11-23 22:33:02,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:02,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:02,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865991512] [2019-11-23 22:33:02,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:02,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-23 22:33:02,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938609704] [2019-11-23 22:33:02,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 22:33:02,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:02,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 22:33:02,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:33:02,979 INFO L87 Difference]: Start difference. First operand 1054 states and 1449 transitions. Second operand 13 states. [2019-11-23 22:33:07,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:07,853 INFO L93 Difference]: Finished difference Result 5600 states and 7941 transitions. [2019-11-23 22:33:07,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-23 22:33:07,854 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2019-11-23 22:33:07,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:07,878 INFO L225 Difference]: With dead ends: 5600 [2019-11-23 22:33:07,878 INFO L226 Difference]: Without dead ends: 5325 [2019-11-23 22:33:07,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=602, Invalid=1654, Unknown=0, NotChecked=0, Total=2256 [2019-11-23 22:33:07,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5325 states. [2019-11-23 22:33:08,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5325 to 1075. [2019-11-23 22:33:08,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-11-23 22:33:08,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1476 transitions. [2019-11-23 22:33:08,087 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1476 transitions. Word has length 50 [2019-11-23 22:33:08,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:08,088 INFO L462 AbstractCegarLoop]: Abstraction has 1075 states and 1476 transitions. [2019-11-23 22:33:08,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 22:33:08,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1476 transitions. [2019-11-23 22:33:08,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:33:08,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:08,089 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] [2019-11-23 22:33:08,089 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:08,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:08,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1146630315, now seen corresponding path program 1 times [2019-11-23 22:33:08,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:08,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754362744] [2019-11-23 22:33:08,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:08,266 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,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754362744] [2019-11-23 22:33:08,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:08,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-23 22:33:08,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672340727] [2019-11-23 22:33:08,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 22:33:08,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:08,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 22:33:08,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:33:08,269 INFO L87 Difference]: Start difference. First operand 1075 states and 1476 transitions. Second operand 12 states. [2019-11-23 22:33:15,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:15,352 INFO L93 Difference]: Finished difference Result 15875 states and 23315 transitions. [2019-11-23 22:33:15,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-11-23 22:33:15,352 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-11-23 22:33:15,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:15,422 INFO L225 Difference]: With dead ends: 15875 [2019-11-23 22:33:15,422 INFO L226 Difference]: Without dead ends: 15142 [2019-11-23 22:33:15,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2011 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1274, Invalid=4578, Unknown=0, NotChecked=0, Total=5852 [2019-11-23 22:33:15,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15142 states. [2019-11-23 22:33:16,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15142 to 4086. [2019-11-23 22:33:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4086 states. [2019-11-23 22:33:16,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 5915 transitions. [2019-11-23 22:33:16,179 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 5915 transitions. Word has length 50 [2019-11-23 22:33:16,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:16,180 INFO L462 AbstractCegarLoop]: Abstraction has 4086 states and 5915 transitions. [2019-11-23 22:33:16,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 22:33:16,180 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 5915 transitions. [2019-11-23 22:33:16,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:33:16,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:16,184 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] [2019-11-23 22:33:16,184 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:16,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:16,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1245141101, now seen corresponding path program 1 times [2019-11-23 22:33:16,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:16,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613581984] [2019-11-23 22:33:16,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:16,299 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:16,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613581984] [2019-11-23 22:33:16,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:16,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:33:16,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550284925] [2019-11-23 22:33:16,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:33:16,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:16,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:33:16,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:33:16,301 INFO L87 Difference]: Start difference. First operand 4086 states and 5915 transitions. Second operand 9 states. [2019-11-23 22:33:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:18,260 INFO L93 Difference]: Finished difference Result 6530 states and 9500 transitions. [2019-11-23 22:33:18,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:33:18,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-11-23 22:33:18,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:18,273 INFO L225 Difference]: With dead ends: 6530 [2019-11-23 22:33:18,273 INFO L226 Difference]: Without dead ends: 6313 [2019-11-23 22:33:18,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-11-23 22:33:18,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6313 states. [2019-11-23 22:33:18,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6313 to 4086. [2019-11-23 22:33:18,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4086 states. [2019-11-23 22:33:18,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 5915 transitions. [2019-11-23 22:33:18,736 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 5915 transitions. Word has length 50 [2019-11-23 22:33:18,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:18,736 INFO L462 AbstractCegarLoop]: Abstraction has 4086 states and 5915 transitions. [2019-11-23 22:33:18,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:33:18,736 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 5915 transitions. [2019-11-23 22:33:18,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:33:18,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:18,740 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] [2019-11-23 22:33:18,741 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:18,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:18,741 INFO L82 PathProgramCache]: Analyzing trace with hash 2106044655, now seen corresponding path program 1 times [2019-11-23 22:33:18,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:18,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426129956] [2019-11-23 22:33:18,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:18,816 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:18,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426129956] [2019-11-23 22:33:18,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:18,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:33:18,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866335965] [2019-11-23 22:33:18,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:33:18,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:18,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:33:18,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:33:18,818 INFO L87 Difference]: Start difference. First operand 4086 states and 5915 transitions. Second operand 9 states. [2019-11-23 22:33:21,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:21,613 INFO L93 Difference]: Finished difference Result 9600 states and 13953 transitions. [2019-11-23 22:33:21,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 22:33:21,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-11-23 22:33:21,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:21,631 INFO L225 Difference]: With dead ends: 9600 [2019-11-23 22:33:21,631 INFO L226 Difference]: Without dead ends: 9375 [2019-11-23 22:33:21,635 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:21,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9375 states. [2019-11-23 22:33:22,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9375 to 4097. [2019-11-23 22:33:22,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4097 states. [2019-11-23 22:33:22,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 5929 transitions. [2019-11-23 22:33:22,361 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 5929 transitions. Word has length 50 [2019-11-23 22:33:22,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:22,362 INFO L462 AbstractCegarLoop]: Abstraction has 4097 states and 5929 transitions. [2019-11-23 22:33:22,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:33:22,362 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 5929 transitions. [2019-11-23 22:33:22,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:33:22,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:22,365 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:33:22,365 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:22,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:22,366 INFO L82 PathProgramCache]: Analyzing trace with hash 812162954, now seen corresponding path program 1 times [2019-11-23 22:33:22,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:22,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652955128] [2019-11-23 22:33:22,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:22,483 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:22,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652955128] [2019-11-23 22:33:22,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:22,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-23 22:33:22,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565908816] [2019-11-23 22:33:22,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 22:33:22,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:22,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 22:33:22,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:33:22,486 INFO L87 Difference]: Start difference. First operand 4097 states and 5929 transitions. Second operand 11 states. [2019-11-23 22:33:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:27,313 INFO L93 Difference]: Finished difference Result 15654 states and 22886 transitions. [2019-11-23 22:33:27,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-23 22:33:27,314 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2019-11-23 22:33:27,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:27,337 INFO L225 Difference]: With dead ends: 15654 [2019-11-23 22:33:27,337 INFO L226 Difference]: Without dead ends: 14627 [2019-11-23 22:33:27,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=287, Invalid=643, Unknown=0, NotChecked=0, Total=930 [2019-11-23 22:33:27,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14627 states. [2019-11-23 22:33:28,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14627 to 4097. [2019-11-23 22:33:28,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4097 states. [2019-11-23 22:33:28,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 5929 transitions. [2019-11-23 22:33:28,034 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 5929 transitions. Word has length 51 [2019-11-23 22:33:28,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:28,034 INFO L462 AbstractCegarLoop]: Abstraction has 4097 states and 5929 transitions. [2019-11-23 22:33:28,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 22:33:28,035 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 5929 transitions. [2019-11-23 22:33:28,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:33:28,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:28,040 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:33:28,040 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:28,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:28,041 INFO L82 PathProgramCache]: Analyzing trace with hash -364932990, now seen corresponding path program 1 times [2019-11-23 22:33:28,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:28,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141557616] [2019-11-23 22:33:28,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:28,140 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:28,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141557616] [2019-11-23 22:33:28,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:28,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:33:28,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013903984] [2019-11-23 22:33:28,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:33:28,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:28,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:33:28,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:33:28,142 INFO L87 Difference]: Start difference. First operand 4097 states and 5929 transitions. Second operand 9 states. [2019-11-23 22:33:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:30,410 INFO L93 Difference]: Finished difference Result 9577 states and 14042 transitions. [2019-11-23 22:33:30,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 22:33:30,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-11-23 22:33:30,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:30,420 INFO L225 Difference]: With dead ends: 9577 [2019-11-23 22:33:30,421 INFO L226 Difference]: Without dead ends: 6583 [2019-11-23 22:33:30,427 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:30,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6583 states. [2019-11-23 22:33:31,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6583 to 2539. [2019-11-23 22:33:31,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2539 states. [2019-11-23 22:33:31,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2539 states and 3630 transitions. [2019-11-23 22:33:31,143 INFO L78 Accepts]: Start accepts. Automaton has 2539 states and 3630 transitions. Word has length 51 [2019-11-23 22:33:31,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:31,144 INFO L462 AbstractCegarLoop]: Abstraction has 2539 states and 3630 transitions. [2019-11-23 22:33:31,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:33:31,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 3630 transitions. [2019-11-23 22:33:31,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:33:31,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:31,148 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:33:31,148 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:31,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:31,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1518595785, now seen corresponding path program 1 times [2019-11-23 22:33:31,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:31,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560333690] [2019-11-23 22:33:31,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:31,308 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:31,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560333690] [2019-11-23 22:33:31,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:31,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:33:31,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386043534] [2019-11-23 22:33:31,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:33:31,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:31,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:33:31,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:33:31,312 INFO L87 Difference]: Start difference. First operand 2539 states and 3630 transitions. Second operand 10 states. [2019-11-23 22:33:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:35,357 INFO L93 Difference]: Finished difference Result 8577 states and 12313 transitions. [2019-11-23 22:33:35,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 22:33:35,358 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-11-23 22:33:35,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:35,363 INFO L225 Difference]: With dead ends: 8577 [2019-11-23 22:33:35,364 INFO L226 Difference]: Without dead ends: 7787 [2019-11-23 22:33:35,366 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-11-23 22:33:35,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7787 states. [2019-11-23 22:33:35,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7787 to 2553. [2019-11-23 22:33:35,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2019-11-23 22:33:35,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 3648 transitions. [2019-11-23 22:33:35,888 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 3648 transitions. Word has length 51 [2019-11-23 22:33:35,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:35,889 INFO L462 AbstractCegarLoop]: Abstraction has 2553 states and 3648 transitions. [2019-11-23 22:33:35,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:33:35,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3648 transitions. [2019-11-23 22:33:35,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:33:35,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:35,892 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:33:35,892 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:35,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:35,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1225836544, now seen corresponding path program 1 times [2019-11-23 22:33:35,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:35,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651564815] [2019-11-23 22:33:35,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:35,984 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:35,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651564815] [2019-11-23 22:33:35,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:35,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:33:35,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188349224] [2019-11-23 22:33:35,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:33:35,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:35,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:33:35,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:33:35,987 INFO L87 Difference]: Start difference. First operand 2553 states and 3648 transitions. Second operand 9 states. [2019-11-23 22:33:39,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:39,143 INFO L93 Difference]: Finished difference Result 11115 states and 16256 transitions. [2019-11-23 22:33:39,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 22:33:39,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-11-23 22:33:39,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:39,151 INFO L225 Difference]: With dead ends: 11115 [2019-11-23 22:33:39,151 INFO L226 Difference]: Without dead ends: 9089 [2019-11-23 22:33:39,156 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:39,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9089 states. [2019-11-23 22:33:40,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9089 to 5536. [2019-11-23 22:33:40,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5536 states. [2019-11-23 22:33:40,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5536 states to 5536 states and 8084 transitions. [2019-11-23 22:33:40,042 INFO L78 Accepts]: Start accepts. Automaton has 5536 states and 8084 transitions. Word has length 51 [2019-11-23 22:33:40,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:40,043 INFO L462 AbstractCegarLoop]: Abstraction has 5536 states and 8084 transitions. [2019-11-23 22:33:40,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:33:40,043 INFO L276 IsEmpty]: Start isEmpty. Operand 5536 states and 8084 transitions. [2019-11-23 22:33:40,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:33:40,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:40,046 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:33:40,046 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:40,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:40,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1760099379, now seen corresponding path program 1 times [2019-11-23 22:33:40,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:40,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552520394] [2019-11-23 22:33:40,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:40,130 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:40,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552520394] [2019-11-23 22:33:40,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:40,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:33:40,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073678221] [2019-11-23 22:33:40,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:33:40,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:40,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:33:40,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:33:40,133 INFO L87 Difference]: Start difference. First operand 5536 states and 8084 transitions. Second operand 8 states. [2019-11-23 22:33:43,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:43,712 INFO L93 Difference]: Finished difference Result 13761 states and 20285 transitions. [2019-11-23 22:33:43,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 22:33:43,712 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-11-23 22:33:43,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:43,721 INFO L225 Difference]: With dead ends: 13761 [2019-11-23 22:33:43,721 INFO L226 Difference]: Without dead ends: 11639 [2019-11-23 22:33:43,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:33:43,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11639 states. [2019-11-23 22:33:44,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11639 to 5558. [2019-11-23 22:33:44,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5558 states. [2019-11-23 22:33:44,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 8115 transitions. [2019-11-23 22:33:44,728 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 8115 transitions. Word has length 51 [2019-11-23 22:33:44,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:44,729 INFO L462 AbstractCegarLoop]: Abstraction has 5558 states and 8115 transitions. [2019-11-23 22:33:44,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:33:44,729 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 8115 transitions. [2019-11-23 22:33:44,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:33:44,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:44,732 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:33:44,732 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:44,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:44,733 INFO L82 PathProgramCache]: Analyzing trace with hash -573449405, now seen corresponding path program 1 times [2019-11-23 22:33:44,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:44,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600155959] [2019-11-23 22:33:44,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:44,858 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:44,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600155959] [2019-11-23 22:33:44,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:44,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:33:44,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036672089] [2019-11-23 22:33:44,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:33:44,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:44,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:33:44,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:33:44,860 INFO L87 Difference]: Start difference. First operand 5558 states and 8115 transitions. Second operand 10 states. [2019-11-23 22:33:51,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:51,096 INFO L93 Difference]: Finished difference Result 19189 states and 27845 transitions. [2019-11-23 22:33:51,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 22:33:51,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-11-23 22:33:51,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:51,109 INFO L225 Difference]: With dead ends: 19189 [2019-11-23 22:33:51,110 INFO L226 Difference]: Without dead ends: 16903 [2019-11-23 22:33:51,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=554, Unknown=0, NotChecked=0, Total=812 [2019-11-23 22:33:51,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16903 states. [2019-11-23 22:33:52,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16903 to 5579. [2019-11-23 22:33:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5579 states. [2019-11-23 22:33:52,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5579 states to 5579 states and 8142 transitions. [2019-11-23 22:33:52,165 INFO L78 Accepts]: Start accepts. Automaton has 5579 states and 8142 transitions. Word has length 51 [2019-11-23 22:33:52,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:52,165 INFO L462 AbstractCegarLoop]: Abstraction has 5579 states and 8142 transitions. [2019-11-23 22:33:52,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:33:52,165 INFO L276 IsEmpty]: Start isEmpty. Operand 5579 states and 8142 transitions. [2019-11-23 22:33:52,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:33:52,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:52,168 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:33:52,168 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:52,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:52,169 INFO L82 PathProgramCache]: Analyzing trace with hash 977085562, now seen corresponding path program 1 times [2019-11-23 22:33:52,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:52,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955988813] [2019-11-23 22:33:52,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:52,249 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:52,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955988813] [2019-11-23 22:33:52,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:52,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:33:52,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784083966] [2019-11-23 22:33:52,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:33:52,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:52,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:33:52,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:33:52,251 INFO L87 Difference]: Start difference. First operand 5579 states and 8142 transitions. Second operand 8 states. [2019-11-23 22:33:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:58,774 INFO L93 Difference]: Finished difference Result 25911 states and 38556 transitions. [2019-11-23 22:33:58,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-23 22:33:58,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-11-23 22:33:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:58,791 INFO L225 Difference]: With dead ends: 25911 [2019-11-23 22:33:58,792 INFO L226 Difference]: Without dead ends: 21712 [2019-11-23 22:33:58,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2019-11-23 22:33:58,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21712 states. [2019-11-23 22:34:01,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21712 to 12654. [2019-11-23 22:34:01,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12654 states. [2019-11-23 22:34:01,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12654 states to 12654 states and 18774 transitions. [2019-11-23 22:34:01,412 INFO L78 Accepts]: Start accepts. Automaton has 12654 states and 18774 transitions. Word has length 51 [2019-11-23 22:34:01,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:01,412 INFO L462 AbstractCegarLoop]: Abstraction has 12654 states and 18774 transitions. [2019-11-23 22:34:01,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:34:01,413 INFO L276 IsEmpty]: Start isEmpty. Operand 12654 states and 18774 transitions. [2019-11-23 22:34:01,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:34:01,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:01,416 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:34:01,416 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:01,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:01,416 INFO L82 PathProgramCache]: Analyzing trace with hash -2025988922, now seen corresponding path program 1 times [2019-11-23 22:34:01,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:01,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236982601] [2019-11-23 22:34:01,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:01,485 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:01,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236982601] [2019-11-23 22:34:01,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:01,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:34:01,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055518277] [2019-11-23 22:34:01,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:34:01,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:01,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:34:01,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:34:01,488 INFO L87 Difference]: Start difference. First operand 12654 states and 18774 transitions. Second operand 7 states. [2019-11-23 22:34:15,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:15,509 INFO L93 Difference]: Finished difference Result 53782 states and 79966 transitions. [2019-11-23 22:34:15,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:34:15,509 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-11-23 22:34:15,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:15,562 INFO L225 Difference]: With dead ends: 53782 [2019-11-23 22:34:15,563 INFO L226 Difference]: Without dead ends: 52822 [2019-11-23 22:34:15,574 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:34:15,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-11-23 22:34:19,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 12655. [2019-11-23 22:34:19,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12655 states. [2019-11-23 22:34:19,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12655 states to 12655 states and 18776 transitions. [2019-11-23 22:34:19,625 INFO L78 Accepts]: Start accepts. Automaton has 12655 states and 18776 transitions. Word has length 51 [2019-11-23 22:34:19,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:19,625 INFO L462 AbstractCegarLoop]: Abstraction has 12655 states and 18776 transitions. [2019-11-23 22:34:19,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:34:19,625 INFO L276 IsEmpty]: Start isEmpty. Operand 12655 states and 18776 transitions. [2019-11-23 22:34:19,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:34:19,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:19,628 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:19,628 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:19,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:19,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1504648536, now seen corresponding path program 1 times [2019-11-23 22:34:19,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:19,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91320129] [2019-11-23 22:34:19,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:19,715 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,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91320129] [2019-11-23 22:34:19,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:19,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:34:19,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190811436] [2019-11-23 22:34:19,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:34:19,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:19,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:34:19,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:34:19,718 INFO L87 Difference]: Start difference. First operand 12655 states and 18776 transitions. Second operand 6 states.