java -Xss4m -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/s3_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-71425fa [2018-07-21 21:46:25,529 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-21 21:46:25,532 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-21 21:46:25,544 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-21 21:46:25,544 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-21 21:46:25,545 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-21 21:46:25,546 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-21 21:46:25,548 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-21 21:46:25,550 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-21 21:46:25,550 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-21 21:46:25,551 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-21 21:46:25,551 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-21 21:46:25,552 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-21 21:46:25,553 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-21 21:46:25,554 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-21 21:46:25,555 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-21 21:46:25,555 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-21 21:46:25,557 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-21 21:46:25,559 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-21 21:46:25,561 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-21 21:46:25,562 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-21 21:46:25,563 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-21 21:46:25,565 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-21 21:46:25,565 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-21 21:46:25,566 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-21 21:46:25,567 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-21 21:46:25,568 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-21 21:46:25,568 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-21 21:46:25,569 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-21 21:46:25,570 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-21 21:46:25,570 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-21 21:46:25,571 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-21 21:46:25,571 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-21 21:46:25,571 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-21 21:46:25,572 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-21 21:46:25,573 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-21 21:46:25,573 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-21 21:46:25,588 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-21 21:46:25,589 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-21 21:46:25,590 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-21 21:46:25,590 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-21 21:46:25,590 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-21 21:46:25,591 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-21 21:46:25,591 INFO L133 SettingsManager]: * Use SBE=true [2018-07-21 21:46:25,591 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-21 21:46:25,591 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-21 21:46:25,591 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-21 21:46:25,592 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-21 21:46:25,592 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-21 21:46:25,592 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-21 21:46:25,592 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-21 21:46:25,592 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-21 21:46:25,593 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-21 21:46:25,593 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-21 21:46:25,593 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-21 21:46:25,593 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-21 21:46:25,593 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-21 21:46:25,594 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-21 21:46:25,594 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-07-21 21:46:25,594 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-21 21:46:25,594 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-21 21:46:25,594 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-21 21:46:25,594 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-21 21:46:25,595 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-21 21:46:25,595 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-21 21:46:25,595 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-21 21:46:25,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-21 21:46:25,658 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-21 21:46:25,666 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-21 21:46:25,668 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-21 21:46:25,668 INFO L276 PluginConnector]: CDTParser initialized [2018-07-21 21:46:25,670 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/s3_false-unreach-call.i [2018-07-21 21:46:26,037 INFO L220 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/4b3649dca/c677c1c5b6594ef2b85034b6bd1f77ab/FLAG5cb4a8beb [2018-07-21 21:46:26,364 INFO L276 CDTParser]: Found 1 translation units. [2018-07-21 21:46:26,365 INFO L158 CDTParser]: Scanning /storage/ultimate/trunk/examples/svcomp/loops/s3_false-unreach-call.i [2018-07-21 21:46:26,403 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/4b3649dca/c677c1c5b6594ef2b85034b6bd1f77ab/FLAG5cb4a8beb [2018-07-21 21:46:26,424 INFO L332 CDTParser]: Successfully deleted /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/4b3649dca/c677c1c5b6594ef2b85034b6bd1f77ab [2018-07-21 21:46:26,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-21 21:46:26,440 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-21 21:46:26,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-21 21:46:26,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-21 21:46:26,450 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-21 21:46:26,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:46:26" (1/1) ... [2018-07-21 21:46:26,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@140f639c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:46:26, skipping insertion in model container [2018-07-21 21:46:26,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:46:26" (1/1) ... [2018-07-21 21:46:26,711 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-21 21:46:27,315 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-21 21:46:27,340 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-21 21:46:27,601 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-21 21:46:27,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:46:27 WrapperNode [2018-07-21 21:46:27,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-21 21:46:27,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-21 21:46:27,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-21 21:46:27,651 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-21 21:46:27,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:46:27" (1/1) ... [2018-07-21 21:46:27,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:46:27" (1/1) ... [2018-07-21 21:46:27,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-21 21:46:27,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-21 21:46:27,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-21 21:46:27,864 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-21 21:46:27,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:46:27" (1/1) ... [2018-07-21 21:46:27,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:46:27" (1/1) ... [2018-07-21 21:46:27,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:46:27" (1/1) ... [2018-07-21 21:46:27,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:46:27" (1/1) ... [2018-07-21 21:46:27,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:46:27" (1/1) ... [2018-07-21 21:46:27,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:46:27" (1/1) ... [2018-07-21 21:46:28,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:46:27" (1/1) ... [2018-07-21 21:46:28,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-21 21:46:28,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-21 21:46:28,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-21 21:46:28,013 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-21 21:46:28,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:46:27" (1/1) ... No working directory specified, using /storage/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 [2018-07-21 21:46:28,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-07-21 21:46:28,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-07-21 21:46:28,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-07-21 21:46:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-07-21 21:46:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-21 21:46:28,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-21 21:46:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-07-21 21:46:28,311 WARN L483 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-07-21 21:46:28,311 WARN L448 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-07-21 21:46:30,713 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-21 21:46:30,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:46:30 BoogieIcfgContainer [2018-07-21 21:46:30,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-21 21:46:30,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-21 21:46:30,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-21 21:46:30,719 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-21 21:46:30,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 09:46:26" (1/3) ... [2018-07-21 21:46:30,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209bca54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:46:30, skipping insertion in model container [2018-07-21 21:46:30,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:46:27" (2/3) ... [2018-07-21 21:46:30,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209bca54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:46:30, skipping insertion in model container [2018-07-21 21:46:30,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:46:30" (3/3) ... [2018-07-21 21:46:30,724 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_false-unreach-call.i [2018-07-21 21:46:30,736 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-21 21:46:30,744 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-21 21:46:30,809 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-21 21:46:30,810 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-21 21:46:30,810 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-21 21:46:30,810 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-21 21:46:30,810 INFO L376 AbstractCegarLoop]: Backedges is TWOTRACK [2018-07-21 21:46:30,810 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-21 21:46:30,811 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-21 21:46:30,811 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-21 21:46:30,811 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-21 21:46:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states. [2018-07-21 21:46:30,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-21 21:46:30,879 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:30,883 INFO L358 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:30,884 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:30,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1261209972, now seen corresponding path program 1 times [2018-07-21 21:46:30,892 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:30,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:30,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:30,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:30,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:31,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-21 21:46:31,410 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:31,411 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-21 21:46:31,414 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-21 21:46:31,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-21 21:46:31,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-21 21:46:31,432 INFO L87 Difference]: Start difference. First operand 342 states. Second operand 3 states. [2018-07-21 21:46:31,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:31,875 INFO L93 Difference]: Finished difference Result 898 states and 1149 transitions. [2018-07-21 21:46:31,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-21 21:46:31,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2018-07-21 21:46:31,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:31,912 INFO L225 Difference]: With dead ends: 898 [2018-07-21 21:46:31,912 INFO L226 Difference]: Without dead ends: 550 [2018-07-21 21:46:31,919 INFO L578 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 [2018-07-21 21:46:31,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-07-21 21:46:32,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2018-07-21 21:46:32,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2018-07-21 21:46:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 654 transitions. [2018-07-21 21:46:32,027 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 654 transitions. Word has length 88 [2018-07-21 21:46:32,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:32,028 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 654 transitions. [2018-07-21 21:46:32,028 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-21 21:46:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 654 transitions. [2018-07-21 21:46:32,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-07-21 21:46:32,036 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:32,036 INFO L358 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:32,036 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:32,037 INFO L82 PathProgramCache]: Analyzing trace with hash 631583294, now seen corresponding path program 1 times [2018-07-21 21:46:32,037 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:32,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:32,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:32,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:32,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:32,259 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-21 21:46:32,259 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:32,259 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-21 21:46:32,262 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-21 21:46:32,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-21 21:46:32,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-21 21:46:32,263 INFO L87 Difference]: Start difference. First operand 550 states and 654 transitions. Second operand 3 states. [2018-07-21 21:46:32,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:32,397 INFO L93 Difference]: Finished difference Result 1040 states and 1250 transitions. [2018-07-21 21:46:32,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-21 21:46:32,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-07-21 21:46:32,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:32,405 INFO L225 Difference]: With dead ends: 1040 [2018-07-21 21:46:32,406 INFO L226 Difference]: Without dead ends: 791 [2018-07-21 21:46:32,408 INFO L578 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 [2018-07-21 21:46:32,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2018-07-21 21:46:32,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 791. [2018-07-21 21:46:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2018-07-21 21:46:32,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 942 transitions. [2018-07-21 21:46:32,445 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 942 transitions. Word has length 117 [2018-07-21 21:46:32,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:32,447 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 942 transitions. [2018-07-21 21:46:32,447 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-21 21:46:32,447 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 942 transitions. [2018-07-21 21:46:32,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-21 21:46:32,451 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:32,451 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:32,452 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:32,452 INFO L82 PathProgramCache]: Analyzing trace with hash -916631362, now seen corresponding path program 1 times [2018-07-21 21:46:32,452 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:32,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:32,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:32,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:32,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:32,893 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-21 21:46:32,894 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:32,894 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:32,895 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:32,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:32,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:32,895 INFO L87 Difference]: Start difference. First operand 791 states and 942 transitions. Second operand 4 states. [2018-07-21 21:46:33,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:33,943 INFO L93 Difference]: Finished difference Result 1668 states and 2007 transitions. [2018-07-21 21:46:33,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:33,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-07-21 21:46:33,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:33,949 INFO L225 Difference]: With dead ends: 1668 [2018-07-21 21:46:33,950 INFO L226 Difference]: Without dead ends: 937 [2018-07-21 21:46:33,953 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:33,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2018-07-21 21:46:33,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 863. [2018-07-21 21:46:33,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2018-07-21 21:46:33,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1042 transitions. [2018-07-21 21:46:33,994 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1042 transitions. Word has length 148 [2018-07-21 21:46:33,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:33,995 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1042 transitions. [2018-07-21 21:46:33,995 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:46:33,995 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1042 transitions. [2018-07-21 21:46:33,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-21 21:46:33,998 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:33,999 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:33,999 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:33,999 INFO L82 PathProgramCache]: Analyzing trace with hash 223162462, now seen corresponding path program 1 times [2018-07-21 21:46:33,999 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:33,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:34,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:34,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:34,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-21 21:46:34,172 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:34,172 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:34,173 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:34,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:34,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:34,174 INFO L87 Difference]: Start difference. First operand 863 states and 1042 transitions. Second operand 4 states. [2018-07-21 21:46:35,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:35,165 INFO L93 Difference]: Finished difference Result 2008 states and 2455 transitions. [2018-07-21 21:46:35,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:35,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-07-21 21:46:35,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:35,175 INFO L225 Difference]: With dead ends: 2008 [2018-07-21 21:46:35,175 INFO L226 Difference]: Without dead ends: 1205 [2018-07-21 21:46:35,177 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:35,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2018-07-21 21:46:35,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 949. [2018-07-21 21:46:35,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2018-07-21 21:46:35,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1164 transitions. [2018-07-21 21:46:35,211 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1164 transitions. Word has length 148 [2018-07-21 21:46:35,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:35,212 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1164 transitions. [2018-07-21 21:46:35,212 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:46:35,212 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1164 transitions. [2018-07-21 21:46:35,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-21 21:46:35,215 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:35,215 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:35,215 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:35,216 INFO L82 PathProgramCache]: Analyzing trace with hash -479169991, now seen corresponding path program 1 times [2018-07-21 21:46:35,216 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:35,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:35,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:35,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:35,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-21 21:46:35,491 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:35,491 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:35,491 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:35,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:35,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:35,492 INFO L87 Difference]: Start difference. First operand 949 states and 1164 transitions. Second operand 4 states. [2018-07-21 21:46:36,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:36,754 INFO L93 Difference]: Finished difference Result 2086 states and 2566 transitions. [2018-07-21 21:46:36,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:36,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-07-21 21:46:36,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:36,777 INFO L225 Difference]: With dead ends: 2086 [2018-07-21 21:46:36,777 INFO L226 Difference]: Without dead ends: 1197 [2018-07-21 21:46:36,779 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:36,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2018-07-21 21:46:36,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 953. [2018-07-21 21:46:36,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2018-07-21 21:46:36,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1168 transitions. [2018-07-21 21:46:36,810 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1168 transitions. Word has length 150 [2018-07-21 21:46:36,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:36,811 INFO L471 AbstractCegarLoop]: Abstraction has 953 states and 1168 transitions. [2018-07-21 21:46:36,811 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:46:36,811 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1168 transitions. [2018-07-21 21:46:36,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-21 21:46:36,816 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:36,817 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:36,817 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:36,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1105058092, now seen corresponding path program 1 times [2018-07-21 21:46:36,817 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:36,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:36,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:36,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:36,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:37,035 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-21 21:46:37,036 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:37,036 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:37,036 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:37,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:37,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:37,037 INFO L87 Difference]: Start difference. First operand 953 states and 1168 transitions. Second operand 4 states. [2018-07-21 21:46:37,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:37,423 INFO L93 Difference]: Finished difference Result 2090 states and 2568 transitions. [2018-07-21 21:46:37,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:37,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-07-21 21:46:37,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:37,429 INFO L225 Difference]: With dead ends: 2090 [2018-07-21 21:46:37,429 INFO L226 Difference]: Without dead ends: 1197 [2018-07-21 21:46:37,430 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:37,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2018-07-21 21:46:37,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 957. [2018-07-21 21:46:37,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2018-07-21 21:46:37,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1172 transitions. [2018-07-21 21:46:37,467 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1172 transitions. Word has length 152 [2018-07-21 21:46:37,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:37,467 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 1172 transitions. [2018-07-21 21:46:37,467 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:46:37,467 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1172 transitions. [2018-07-21 21:46:37,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-21 21:46:37,470 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:37,470 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:37,470 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:37,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1295728209, now seen corresponding path program 1 times [2018-07-21 21:46:37,471 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:37,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:37,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:37,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:37,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-21 21:46:37,604 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:37,604 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:37,604 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:37,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:37,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:37,605 INFO L87 Difference]: Start difference. First operand 957 states and 1172 transitions. Second operand 4 states. [2018-07-21 21:46:37,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:37,965 INFO L93 Difference]: Finished difference Result 2076 states and 2550 transitions. [2018-07-21 21:46:37,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:37,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-07-21 21:46:37,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:37,972 INFO L225 Difference]: With dead ends: 2076 [2018-07-21 21:46:37,973 INFO L226 Difference]: Without dead ends: 1179 [2018-07-21 21:46:37,974 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:37,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-07-21 21:46:38,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 961. [2018-07-21 21:46:38,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2018-07-21 21:46:38,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1176 transitions. [2018-07-21 21:46:38,007 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1176 transitions. Word has length 154 [2018-07-21 21:46:38,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:38,007 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1176 transitions. [2018-07-21 21:46:38,008 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:46:38,017 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1176 transitions. [2018-07-21 21:46:38,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-21 21:46:38,020 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:38,020 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:38,021 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:38,021 INFO L82 PathProgramCache]: Analyzing trace with hash 563487619, now seen corresponding path program 1 times [2018-07-21 21:46:38,021 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:38,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:38,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:38,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:38,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-21 21:46:38,475 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:38,476 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-21 21:46:38,476 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-21 21:46:38,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-21 21:46:38,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-07-21 21:46:38,477 INFO L87 Difference]: Start difference. First operand 961 states and 1176 transitions. Second operand 6 states. [2018-07-21 21:46:39,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:39,455 INFO L93 Difference]: Finished difference Result 2955 states and 3634 transitions. [2018-07-21 21:46:39,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-21 21:46:39,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2018-07-21 21:46:39,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:39,466 INFO L225 Difference]: With dead ends: 2955 [2018-07-21 21:46:39,466 INFO L226 Difference]: Without dead ends: 2054 [2018-07-21 21:46:39,469 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-07-21 21:46:39,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2018-07-21 21:46:39,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 969. [2018-07-21 21:46:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2018-07-21 21:46:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1184 transitions. [2018-07-21 21:46:39,510 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1184 transitions. Word has length 158 [2018-07-21 21:46:39,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:39,511 INFO L471 AbstractCegarLoop]: Abstraction has 969 states and 1184 transitions. [2018-07-21 21:46:39,511 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-21 21:46:39,511 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1184 transitions. [2018-07-21 21:46:39,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-21 21:46:39,513 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:39,514 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:39,514 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:39,514 INFO L82 PathProgramCache]: Analyzing trace with hash -848626909, now seen corresponding path program 1 times [2018-07-21 21:46:39,514 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:39,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:39,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:39,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:39,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:39,758 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-21 21:46:39,759 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:39,759 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-21 21:46:39,759 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-21 21:46:39,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-21 21:46:39,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-21 21:46:39,759 INFO L87 Difference]: Start difference. First operand 969 states and 1184 transitions. Second operand 6 states. [2018-07-21 21:46:40,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:40,636 INFO L93 Difference]: Finished difference Result 3317 states and 4083 transitions. [2018-07-21 21:46:40,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-21 21:46:40,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2018-07-21 21:46:40,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:40,644 INFO L225 Difference]: With dead ends: 3317 [2018-07-21 21:46:40,644 INFO L226 Difference]: Without dead ends: 2408 [2018-07-21 21:46:40,646 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-07-21 21:46:40,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2018-07-21 21:46:40,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 1043. [2018-07-21 21:46:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2018-07-21 21:46:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1284 transitions. [2018-07-21 21:46:40,690 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1284 transitions. Word has length 158 [2018-07-21 21:46:40,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:40,691 INFO L471 AbstractCegarLoop]: Abstraction has 1043 states and 1284 transitions. [2018-07-21 21:46:40,691 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-21 21:46:40,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1284 transitions. [2018-07-21 21:46:40,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-21 21:46:40,694 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:40,694 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:40,694 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:40,695 INFO L82 PathProgramCache]: Analyzing trace with hash 323395518, now seen corresponding path program 1 times [2018-07-21 21:46:40,695 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:40,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:40,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:40,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:40,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:41,319 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-21 21:46:41,319 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:41,319 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-21 21:46:41,320 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-21 21:46:41,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-21 21:46:41,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-21 21:46:41,321 INFO L87 Difference]: Start difference. First operand 1043 states and 1284 transitions. Second operand 6 states. [2018-07-21 21:46:42,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:42,442 INFO L93 Difference]: Finished difference Result 3383 states and 4172 transitions. [2018-07-21 21:46:42,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-21 21:46:42,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2018-07-21 21:46:42,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:42,452 INFO L225 Difference]: With dead ends: 3383 [2018-07-21 21:46:42,452 INFO L226 Difference]: Without dead ends: 2400 [2018-07-21 21:46:42,454 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-07-21 21:46:42,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2018-07-21 21:46:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 1047. [2018-07-21 21:46:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2018-07-21 21:46:42,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1288 transitions. [2018-07-21 21:46:42,531 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1288 transitions. Word has length 160 [2018-07-21 21:46:42,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:42,531 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1288 transitions. [2018-07-21 21:46:42,531 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-21 21:46:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1288 transitions. [2018-07-21 21:46:42,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-21 21:46:42,534 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:42,535 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:42,535 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:42,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1361250073, now seen corresponding path program 1 times [2018-07-21 21:46:42,535 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:42,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:42,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:42,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:42,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-21 21:46:42,815 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:42,815 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-21 21:46:42,816 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-21 21:46:42,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-21 21:46:42,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-21 21:46:42,816 INFO L87 Difference]: Start difference. First operand 1047 states and 1288 transitions. Second operand 6 states. [2018-07-21 21:46:43,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:43,777 INFO L93 Difference]: Finished difference Result 3387 states and 4174 transitions. [2018-07-21 21:46:43,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-21 21:46:43,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2018-07-21 21:46:43,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:43,784 INFO L225 Difference]: With dead ends: 3387 [2018-07-21 21:46:43,784 INFO L226 Difference]: Without dead ends: 2400 [2018-07-21 21:46:43,786 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-07-21 21:46:43,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2018-07-21 21:46:43,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 1051. [2018-07-21 21:46:43,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2018-07-21 21:46:43,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1292 transitions. [2018-07-21 21:46:43,826 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1292 transitions. Word has length 162 [2018-07-21 21:46:43,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:43,826 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1292 transitions. [2018-07-21 21:46:43,827 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-21 21:46:43,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1292 transitions. [2018-07-21 21:46:43,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-21 21:46:43,830 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:43,830 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:43,830 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:43,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1995529036, now seen corresponding path program 1 times [2018-07-21 21:46:43,831 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:43,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:43,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:43,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:43,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:44,152 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-21 21:46:44,153 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:44,153 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-21 21:46:44,153 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-21 21:46:44,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-21 21:46:44,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-21 21:46:44,154 INFO L87 Difference]: Start difference. First operand 1051 states and 1292 transitions. Second operand 6 states. [2018-07-21 21:46:45,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:45,740 INFO L93 Difference]: Finished difference Result 3373 states and 4156 transitions. [2018-07-21 21:46:45,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-21 21:46:45,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-07-21 21:46:45,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:45,747 INFO L225 Difference]: With dead ends: 3373 [2018-07-21 21:46:45,747 INFO L226 Difference]: Without dead ends: 2382 [2018-07-21 21:46:45,750 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-07-21 21:46:45,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2382 states. [2018-07-21 21:46:45,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2382 to 977. [2018-07-21 21:46:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-07-21 21:46:45,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1192 transitions. [2018-07-21 21:46:45,787 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1192 transitions. Word has length 164 [2018-07-21 21:46:45,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:45,787 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1192 transitions. [2018-07-21 21:46:45,787 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-21 21:46:45,787 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1192 transitions. [2018-07-21 21:46:45,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-21 21:46:45,790 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:45,791 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:45,791 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:45,791 INFO L82 PathProgramCache]: Analyzing trace with hash 861305591, now seen corresponding path program 1 times [2018-07-21 21:46:45,791 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:45,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:45,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:45,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:45,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:46,111 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-21 21:46:46,112 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:46,112 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:46,112 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:46,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:46,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:46,113 INFO L87 Difference]: Start difference. First operand 977 states and 1192 transitions. Second operand 4 states. [2018-07-21 21:46:46,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:46,307 INFO L93 Difference]: Finished difference Result 2012 states and 2467 transitions. [2018-07-21 21:46:46,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:46,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-07-21 21:46:46,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:46,311 INFO L225 Difference]: With dead ends: 2012 [2018-07-21 21:46:46,311 INFO L226 Difference]: Without dead ends: 1095 [2018-07-21 21:46:46,312 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:46,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-07-21 21:46:46,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 995. [2018-07-21 21:46:46,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-07-21 21:46:46,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1212 transitions. [2018-07-21 21:46:46,346 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1212 transitions. Word has length 176 [2018-07-21 21:46:46,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:46,346 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 1212 transitions. [2018-07-21 21:46:46,347 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:46:46,347 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1212 transitions. [2018-07-21 21:46:46,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-21 21:46:46,350 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:46,350 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:46,351 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:46,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1262441833, now seen corresponding path program 1 times [2018-07-21 21:46:46,351 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:46,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:46,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:46,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:46,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-21 21:46:46,704 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:46,705 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:46,705 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:46,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:46,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:46,706 INFO L87 Difference]: Start difference. First operand 995 states and 1212 transitions. Second operand 4 states. [2018-07-21 21:46:47,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:47,681 INFO L93 Difference]: Finished difference Result 2220 states and 2722 transitions. [2018-07-21 21:46:47,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:47,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-07-21 21:46:47,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:47,686 INFO L225 Difference]: With dead ends: 2220 [2018-07-21 21:46:47,686 INFO L226 Difference]: Without dead ends: 1285 [2018-07-21 21:46:47,687 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2018-07-21 21:46:47,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1013. [2018-07-21 21:46:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-07-21 21:46:47,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1232 transitions. [2018-07-21 21:46:47,722 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1232 transitions. Word has length 176 [2018-07-21 21:46:47,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:47,722 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1232 transitions. [2018-07-21 21:46:47,722 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:46:47,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1232 transitions. [2018-07-21 21:46:47,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-07-21 21:46:47,725 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:47,726 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:47,726 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:47,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1941340786, now seen corresponding path program 1 times [2018-07-21 21:46:47,726 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:47,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:47,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:47,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:47,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-21 21:46:47,913 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:47,913 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:47,914 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:47,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:47,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:47,914 INFO L87 Difference]: Start difference. First operand 1013 states and 1232 transitions. Second operand 4 states. [2018-07-21 21:46:48,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:48,101 INFO L93 Difference]: Finished difference Result 1717 states and 2095 transitions. [2018-07-21 21:46:48,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:48,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2018-07-21 21:46:48,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:48,104 INFO L225 Difference]: With dead ends: 1717 [2018-07-21 21:46:48,104 INFO L226 Difference]: Without dead ends: 1113 [2018-07-21 21:46:48,105 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:48,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2018-07-21 21:46:48,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1029. [2018-07-21 21:46:48,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2018-07-21 21:46:48,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1254 transitions. [2018-07-21 21:46:48,137 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1254 transitions. Word has length 177 [2018-07-21 21:46:48,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:48,138 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1254 transitions. [2018-07-21 21:46:48,138 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:46:48,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1254 transitions. [2018-07-21 21:46:48,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-07-21 21:46:48,142 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:48,142 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:48,142 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:48,143 INFO L82 PathProgramCache]: Analyzing trace with hash 529680082, now seen corresponding path program 1 times [2018-07-21 21:46:48,143 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:48,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:48,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:48,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:48,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:48,374 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-21 21:46:48,374 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:48,375 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:48,379 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:48,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:48,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:48,380 INFO L87 Difference]: Start difference. First operand 1029 states and 1254 transitions. Second operand 4 states. [2018-07-21 21:46:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:48,739 INFO L93 Difference]: Finished difference Result 1913 states and 2343 transitions. [2018-07-21 21:46:48,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:48,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2018-07-21 21:46:48,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:48,743 INFO L225 Difference]: With dead ends: 1913 [2018-07-21 21:46:48,743 INFO L226 Difference]: Without dead ends: 1301 [2018-07-21 21:46:48,744 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2018-07-21 21:46:48,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1045. [2018-07-21 21:46:48,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1045 states. [2018-07-21 21:46:48,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1276 transitions. [2018-07-21 21:46:48,777 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1276 transitions. Word has length 177 [2018-07-21 21:46:48,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:48,778 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1276 transitions. [2018-07-21 21:46:48,778 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:46:48,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1276 transitions. [2018-07-21 21:46:48,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-21 21:46:48,780 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:48,780 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:48,780 INFO L414 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:48,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1272780974, now seen corresponding path program 1 times [2018-07-21 21:46:48,781 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:48,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:48,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:48,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:48,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-21 21:46:48,980 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:48,981 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:48,981 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:48,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:48,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:48,981 INFO L87 Difference]: Start difference. First operand 1045 states and 1276 transitions. Second operand 4 states. [2018-07-21 21:46:49,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:49,188 INFO L93 Difference]: Finished difference Result 2114 states and 2589 transitions. [2018-07-21 21:46:49,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:49,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-07-21 21:46:49,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:49,191 INFO L225 Difference]: With dead ends: 2114 [2018-07-21 21:46:49,191 INFO L226 Difference]: Without dead ends: 1129 [2018-07-21 21:46:49,192 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:49,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2018-07-21 21:46:49,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1045. [2018-07-21 21:46:49,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1045 states. [2018-07-21 21:46:49,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1274 transitions. [2018-07-21 21:46:49,221 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1274 transitions. Word has length 178 [2018-07-21 21:46:49,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:49,221 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1274 transitions. [2018-07-21 21:46:49,221 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:46:49,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1274 transitions. [2018-07-21 21:46:49,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-21 21:46:49,223 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:49,223 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:49,224 INFO L414 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:49,224 INFO L82 PathProgramCache]: Analyzing trace with hash -2084589838, now seen corresponding path program 1 times [2018-07-21 21:46:49,224 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:49,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:49,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:49,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:49,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:49,540 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-21 21:46:49,541 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:49,541 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:49,541 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:49,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:49,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:49,542 INFO L87 Difference]: Start difference. First operand 1045 states and 1274 transitions. Second operand 4 states. [2018-07-21 21:46:50,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:50,084 INFO L93 Difference]: Finished difference Result 2286 states and 2800 transitions. [2018-07-21 21:46:50,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:50,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-07-21 21:46:50,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:50,088 INFO L225 Difference]: With dead ends: 2286 [2018-07-21 21:46:50,088 INFO L226 Difference]: Without dead ends: 1301 [2018-07-21 21:46:50,089 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:50,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2018-07-21 21:46:50,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1045. [2018-07-21 21:46:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1045 states. [2018-07-21 21:46:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1272 transitions. [2018-07-21 21:46:50,119 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1272 transitions. Word has length 178 [2018-07-21 21:46:50,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:50,119 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1272 transitions. [2018-07-21 21:46:50,119 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:46:50,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1272 transitions. [2018-07-21 21:46:50,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-07-21 21:46:50,121 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:50,121 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:50,121 INFO L414 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:50,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1195803767, now seen corresponding path program 1 times [2018-07-21 21:46:50,122 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:50,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:50,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:50,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:50,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:50,270 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-21 21:46:50,270 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:50,270 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:50,271 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:50,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:50,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:50,271 INFO L87 Difference]: Start difference. First operand 1045 states and 1272 transitions. Second operand 4 states. [2018-07-21 21:46:50,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:50,488 INFO L93 Difference]: Finished difference Result 1739 states and 2120 transitions. [2018-07-21 21:46:50,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:50,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-07-21 21:46:50,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:50,493 INFO L225 Difference]: With dead ends: 1739 [2018-07-21 21:46:50,493 INFO L226 Difference]: Without dead ends: 1119 [2018-07-21 21:46:50,494 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:50,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-07-21 21:46:50,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1049. [2018-07-21 21:46:50,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1049 states. [2018-07-21 21:46:50,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1276 transitions. [2018-07-21 21:46:50,518 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1276 transitions. Word has length 179 [2018-07-21 21:46:50,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:50,518 INFO L471 AbstractCegarLoop]: Abstraction has 1049 states and 1276 transitions. [2018-07-21 21:46:50,518 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:46:50,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1276 transitions. [2018-07-21 21:46:50,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-07-21 21:46:50,520 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:50,521 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:50,521 INFO L414 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:50,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1799532759, now seen corresponding path program 1 times [2018-07-21 21:46:50,521 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:50,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:50,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:50,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:50,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:50,640 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-21 21:46:50,640 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:50,640 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:50,640 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:50,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:50,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:50,641 INFO L87 Difference]: Start difference. First operand 1049 states and 1276 transitions. Second operand 4 states. [2018-07-21 21:46:50,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:50,876 INFO L93 Difference]: Finished difference Result 1917 states and 2341 transitions. [2018-07-21 21:46:50,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:50,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-07-21 21:46:50,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:50,888 INFO L225 Difference]: With dead ends: 1917 [2018-07-21 21:46:50,888 INFO L226 Difference]: Without dead ends: 1295 [2018-07-21 21:46:50,890 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:50,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2018-07-21 21:46:50,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1053. [2018-07-21 21:46:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2018-07-21 21:46:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1280 transitions. [2018-07-21 21:46:50,934 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1280 transitions. Word has length 179 [2018-07-21 21:46:50,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:50,934 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1280 transitions. [2018-07-21 21:46:50,934 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:46:50,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1280 transitions. [2018-07-21 21:46:50,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-21 21:46:50,937 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:50,937 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:50,937 INFO L414 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:50,937 INFO L82 PathProgramCache]: Analyzing trace with hash 474206253, now seen corresponding path program 1 times [2018-07-21 21:46:50,938 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:50,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:50,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:50,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:50,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:51,213 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-21 21:46:51,213 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:51,213 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:51,213 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:51,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:51,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:51,214 INFO L87 Difference]: Start difference. First operand 1053 states and 1280 transitions. Second operand 4 states. [2018-07-21 21:46:51,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:51,399 INFO L93 Difference]: Finished difference Result 2116 states and 2580 transitions. [2018-07-21 21:46:51,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:51,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-07-21 21:46:51,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:51,403 INFO L225 Difference]: With dead ends: 2116 [2018-07-21 21:46:51,403 INFO L226 Difference]: Without dead ends: 1123 [2018-07-21 21:46:51,405 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:51,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-07-21 21:46:51,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1053. [2018-07-21 21:46:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2018-07-21 21:46:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1278 transitions. [2018-07-21 21:46:51,427 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1278 transitions. Word has length 180 [2018-07-21 21:46:51,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:51,427 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1278 transitions. [2018-07-21 21:46:51,427 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:46:51,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1278 transitions. [2018-07-21 21:46:51,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-21 21:46:51,428 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:51,428 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:51,428 INFO L414 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:51,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1350147591, now seen corresponding path program 1 times [2018-07-21 21:46:51,429 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:51,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:51,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:51,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:51,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-21 21:46:51,757 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:51,757 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:51,757 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:51,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:51,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:51,758 INFO L87 Difference]: Start difference. First operand 1053 states and 1278 transitions. Second operand 4 states. [2018-07-21 21:46:51,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:51,942 INFO L93 Difference]: Finished difference Result 2112 states and 2572 transitions. [2018-07-21 21:46:51,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:51,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-07-21 21:46:51,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:51,946 INFO L225 Difference]: With dead ends: 2112 [2018-07-21 21:46:51,946 INFO L226 Difference]: Without dead ends: 1119 [2018-07-21 21:46:51,947 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:51,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-07-21 21:46:51,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1053. [2018-07-21 21:46:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2018-07-21 21:46:51,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1276 transitions. [2018-07-21 21:46:51,974 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1276 transitions. Word has length 180 [2018-07-21 21:46:51,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:51,974 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1276 transitions. [2018-07-21 21:46:51,974 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:46:51,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1276 transitions. [2018-07-21 21:46:51,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-21 21:46:51,975 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:51,975 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:51,975 INFO L414 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:51,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2009935821, now seen corresponding path program 1 times [2018-07-21 21:46:51,976 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:51,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:51,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:51,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:51,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:52,125 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-21 21:46:52,125 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:52,126 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:52,126 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:52,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:52,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:52,126 INFO L87 Difference]: Start difference. First operand 1053 states and 1276 transitions. Second operand 4 states. [2018-07-21 21:46:52,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:52,358 INFO L93 Difference]: Finished difference Result 2288 states and 2787 transitions. [2018-07-21 21:46:52,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:52,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-07-21 21:46:52,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:52,360 INFO L225 Difference]: With dead ends: 2288 [2018-07-21 21:46:52,360 INFO L226 Difference]: Without dead ends: 1295 [2018-07-21 21:46:52,361 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:52,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2018-07-21 21:46:52,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1053. [2018-07-21 21:46:52,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2018-07-21 21:46:52,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1274 transitions. [2018-07-21 21:46:52,387 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1274 transitions. Word has length 180 [2018-07-21 21:46:52,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:52,387 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1274 transitions. [2018-07-21 21:46:52,387 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:46:52,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1274 transitions. [2018-07-21 21:46:52,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-21 21:46:52,389 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:52,389 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:52,390 INFO L414 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:52,390 INFO L82 PathProgramCache]: Analyzing trace with hash 185581977, now seen corresponding path program 1 times [2018-07-21 21:46:52,390 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:52,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:52,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:52,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:52,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-21 21:46:52,545 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:52,545 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:52,546 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:52,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:52,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:52,546 INFO L87 Difference]: Start difference. First operand 1053 states and 1274 transitions. Second operand 4 states. [2018-07-21 21:46:52,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:52,800 INFO L93 Difference]: Finished difference Result 2284 states and 2779 transitions. [2018-07-21 21:46:52,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:52,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-07-21 21:46:52,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:52,802 INFO L225 Difference]: With dead ends: 2284 [2018-07-21 21:46:52,802 INFO L226 Difference]: Without dead ends: 1291 [2018-07-21 21:46:52,803 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:52,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2018-07-21 21:46:52,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1053. [2018-07-21 21:46:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2018-07-21 21:46:52,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1272 transitions. [2018-07-21 21:46:52,826 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1272 transitions. Word has length 180 [2018-07-21 21:46:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:52,827 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1272 transitions. [2018-07-21 21:46:52,827 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:46:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1272 transitions. [2018-07-21 21:46:52,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-21 21:46:52,828 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:52,828 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:52,828 INFO L414 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:52,828 INFO L82 PathProgramCache]: Analyzing trace with hash -393472632, now seen corresponding path program 1 times [2018-07-21 21:46:52,828 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:52,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:52,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:52,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:52,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:52,988 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-21 21:46:52,988 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:52,988 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:52,988 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:52,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:52,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:52,989 INFO L87 Difference]: Start difference. First operand 1053 states and 1272 transitions. Second operand 4 states. [2018-07-21 21:46:53,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:53,160 INFO L93 Difference]: Finished difference Result 2086 states and 2530 transitions. [2018-07-21 21:46:53,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:53,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-07-21 21:46:53,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:53,162 INFO L225 Difference]: With dead ends: 2086 [2018-07-21 21:46:53,162 INFO L226 Difference]: Without dead ends: 1093 [2018-07-21 21:46:53,163 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:53,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2018-07-21 21:46:53,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1053. [2018-07-21 21:46:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2018-07-21 21:46:53,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1270 transitions. [2018-07-21 21:46:53,184 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1270 transitions. Word has length 182 [2018-07-21 21:46:53,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:53,184 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1270 transitions. [2018-07-21 21:46:53,184 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:46:53,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1270 transitions. [2018-07-21 21:46:53,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-21 21:46:53,185 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:53,185 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:53,186 INFO L414 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:53,186 INFO L82 PathProgramCache]: Analyzing trace with hash 337740511, now seen corresponding path program 1 times [2018-07-21 21:46:53,186 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:53,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:53,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:53,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:53,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-07-21 21:46:53,330 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:53,330 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-21 21:46:53,330 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-21 21:46:53,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-21 21:46:53,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-21 21:46:53,331 INFO L87 Difference]: Start difference. First operand 1053 states and 1270 transitions. Second operand 3 states. [2018-07-21 21:46:53,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:53,667 INFO L93 Difference]: Finished difference Result 2052 states and 2489 transitions. [2018-07-21 21:46:53,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-21 21:46:53,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-07-21 21:46:53,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:53,670 INFO L225 Difference]: With dead ends: 2052 [2018-07-21 21:46:53,670 INFO L226 Difference]: Without dead ends: 1431 [2018-07-21 21:46:53,671 INFO L578 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 [2018-07-21 21:46:53,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2018-07-21 21:46:53,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1431. [2018-07-21 21:46:53,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2018-07-21 21:46:53,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1732 transitions. [2018-07-21 21:46:53,717 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1732 transitions. Word has length 182 [2018-07-21 21:46:53,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:53,717 INFO L471 AbstractCegarLoop]: Abstraction has 1431 states and 1732 transitions. [2018-07-21 21:46:53,718 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-21 21:46:53,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1732 transitions. [2018-07-21 21:46:53,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-21 21:46:53,719 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:53,720 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:53,720 INFO L414 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:53,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1103319563, now seen corresponding path program 1 times [2018-07-21 21:46:53,720 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:53,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:53,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:53,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:53,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-07-21 21:46:53,810 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:53,810 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-21 21:46:53,810 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-21 21:46:53,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-21 21:46:53,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-21 21:46:53,811 INFO L87 Difference]: Start difference. First operand 1431 states and 1732 transitions. Second operand 3 states. [2018-07-21 21:46:53,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:53,872 INFO L93 Difference]: Finished difference Result 1811 states and 2198 transitions. [2018-07-21 21:46:53,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-21 21:46:53,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2018-07-21 21:46:53,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:53,875 INFO L225 Difference]: With dead ends: 1811 [2018-07-21 21:46:53,875 INFO L226 Difference]: Without dead ends: 1809 [2018-07-21 21:46:53,875 INFO L578 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 [2018-07-21 21:46:53,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2018-07-21 21:46:53,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2018-07-21 21:46:53,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1809 states. [2018-07-21 21:46:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2195 transitions. [2018-07-21 21:46:53,920 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2195 transitions. Word has length 184 [2018-07-21 21:46:53,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:53,920 INFO L471 AbstractCegarLoop]: Abstraction has 1809 states and 2195 transitions. [2018-07-21 21:46:53,920 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-21 21:46:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2195 transitions. [2018-07-21 21:46:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-07-21 21:46:53,922 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:53,923 INFO L358 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:53,923 INFO L414 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:53,923 INFO L82 PathProgramCache]: Analyzing trace with hash -2004616657, now seen corresponding path program 1 times [2018-07-21 21:46:53,923 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:53,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:53,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:53,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:53,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:54,062 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-07-21 21:46:54,063 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:54,063 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-21 21:46:54,063 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-21 21:46:54,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-21 21:46:54,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-21 21:46:54,063 INFO L87 Difference]: Start difference. First operand 1809 states and 2195 transitions. Second operand 3 states. [2018-07-21 21:46:54,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:54,106 INFO L93 Difference]: Finished difference Result 3179 states and 3866 transitions. [2018-07-21 21:46:54,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-21 21:46:54,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2018-07-21 21:46:54,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:54,109 INFO L225 Difference]: With dead ends: 3179 [2018-07-21 21:46:54,109 INFO L226 Difference]: Without dead ends: 1802 [2018-07-21 21:46:54,111 INFO L578 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 [2018-07-21 21:46:54,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2018-07-21 21:46:54,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2018-07-21 21:46:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2018-07-21 21:46:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2181 transitions. [2018-07-21 21:46:54,154 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2181 transitions. Word has length 223 [2018-07-21 21:46:54,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:54,154 INFO L471 AbstractCegarLoop]: Abstraction has 1802 states and 2181 transitions. [2018-07-21 21:46:54,154 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-21 21:46:54,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2181 transitions. [2018-07-21 21:46:54,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-07-21 21:46:54,157 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:54,158 INFO L358 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:54,158 INFO L414 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:54,158 INFO L82 PathProgramCache]: Analyzing trace with hash -900882395, now seen corresponding path program 1 times [2018-07-21 21:46:54,159 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:54,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:54,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:54,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:54,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-07-21 21:46:54,569 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:54,569 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:54,570 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:54,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:54,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:54,570 INFO L87 Difference]: Start difference. First operand 1802 states and 2181 transitions. Second operand 4 states. [2018-07-21 21:46:55,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:55,206 INFO L93 Difference]: Finished difference Result 3977 states and 4852 transitions. [2018-07-21 21:46:55,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:55,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2018-07-21 21:46:55,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:55,211 INFO L225 Difference]: With dead ends: 3977 [2018-07-21 21:46:55,211 INFO L226 Difference]: Without dead ends: 2235 [2018-07-21 21:46:55,213 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:55,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2235 states. [2018-07-21 21:46:55,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2235 to 2017. [2018-07-21 21:46:55,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2017 states. [2018-07-21 21:46:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2486 transitions. [2018-07-21 21:46:55,265 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2486 transitions. Word has length 227 [2018-07-21 21:46:55,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:55,265 INFO L471 AbstractCegarLoop]: Abstraction has 2017 states and 2486 transitions. [2018-07-21 21:46:55,265 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:46:55,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2486 transitions. [2018-07-21 21:46:55,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-07-21 21:46:55,268 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:55,268 INFO L358 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:55,268 INFO L414 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:55,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1738027222, now seen corresponding path program 1 times [2018-07-21 21:46:55,269 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:55,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:55,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:55,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:55,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:56,006 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-07-21 21:46:56,006 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:56,006 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-21 21:46:56,007 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-21 21:46:56,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-21 21:46:56,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-07-21 21:46:56,007 INFO L87 Difference]: Start difference. First operand 2017 states and 2486 transitions. Second operand 6 states. [2018-07-21 21:46:56,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:56,733 INFO L93 Difference]: Finished difference Result 6354 states and 7819 transitions. [2018-07-21 21:46:56,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-21 21:46:56,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2018-07-21 21:46:56,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:56,738 INFO L225 Difference]: With dead ends: 6354 [2018-07-21 21:46:56,738 INFO L226 Difference]: Without dead ends: 4397 [2018-07-21 21:46:56,741 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-07-21 21:46:56,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4397 states. [2018-07-21 21:46:56,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4397 to 2037. [2018-07-21 21:46:56,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2037 states. [2018-07-21 21:46:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 2506 transitions. [2018-07-21 21:46:56,811 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 2506 transitions. Word has length 237 [2018-07-21 21:46:56,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:56,811 INFO L471 AbstractCegarLoop]: Abstraction has 2037 states and 2506 transitions. [2018-07-21 21:46:56,812 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-21 21:46:56,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 2506 transitions. [2018-07-21 21:46:56,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-07-21 21:46:56,814 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:56,815 INFO L358 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:56,815 INFO L414 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:56,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1902060126, now seen corresponding path program 1 times [2018-07-21 21:46:56,815 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:56,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:56,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:56,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:56,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:57,015 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-07-21 21:46:57,016 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:57,027 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:57,028 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:57,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:57,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:57,028 INFO L87 Difference]: Start difference. First operand 2037 states and 2506 transitions. Second operand 4 states. [2018-07-21 21:46:57,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:57,232 INFO L93 Difference]: Finished difference Result 4382 states and 5407 transitions. [2018-07-21 21:46:57,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:57,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 255 [2018-07-21 21:46:57,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:57,236 INFO L225 Difference]: With dead ends: 4382 [2018-07-21 21:46:57,236 INFO L226 Difference]: Without dead ends: 2405 [2018-07-21 21:46:57,238 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:57,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2018-07-21 21:46:57,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2082. [2018-07-21 21:46:57,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2018-07-21 21:46:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 2556 transitions. [2018-07-21 21:46:57,294 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 2556 transitions. Word has length 255 [2018-07-21 21:46:57,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:57,295 INFO L471 AbstractCegarLoop]: Abstraction has 2082 states and 2556 transitions. [2018-07-21 21:46:57,295 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:46:57,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2556 transitions. [2018-07-21 21:46:57,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-07-21 21:46:57,298 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:57,298 INFO L358 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:57,298 INFO L414 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:57,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2110019479, now seen corresponding path program 1 times [2018-07-21 21:46:57,299 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:57,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:57,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:57,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:57,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-07-21 21:46:57,585 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:57,585 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:57,585 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:57,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:57,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:57,586 INFO L87 Difference]: Start difference. First operand 2082 states and 2556 transitions. Second operand 4 states. [2018-07-21 21:46:57,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:57,799 INFO L93 Difference]: Finished difference Result 3915 states and 4827 transitions. [2018-07-21 21:46:57,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:57,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2018-07-21 21:46:57,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:57,801 INFO L225 Difference]: With dead ends: 3915 [2018-07-21 21:46:57,801 INFO L226 Difference]: Without dead ends: 2321 [2018-07-21 21:46:57,803 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:57,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2018-07-21 21:46:57,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2206. [2018-07-21 21:46:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2206 states. [2018-07-21 21:46:57,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 2728 transitions. [2018-07-21 21:46:57,860 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 2728 transitions. Word has length 256 [2018-07-21 21:46:57,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:57,861 INFO L471 AbstractCegarLoop]: Abstraction has 2206 states and 2728 transitions. [2018-07-21 21:46:57,861 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:46:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 2728 transitions. [2018-07-21 21:46:57,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-07-21 21:46:57,864 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:57,865 INFO L358 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:57,865 INFO L414 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:57,866 INFO L82 PathProgramCache]: Analyzing trace with hash -159100679, now seen corresponding path program 1 times [2018-07-21 21:46:57,866 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:57,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:57,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:57,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:57,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:58,206 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-07-21 21:46:58,206 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:58,206 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:58,207 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:58,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:58,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:58,210 INFO L87 Difference]: Start difference. First operand 2206 states and 2728 transitions. Second operand 4 states. [2018-07-21 21:46:58,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:58,504 INFO L93 Difference]: Finished difference Result 4675 states and 5796 transitions. [2018-07-21 21:46:58,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:58,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 257 [2018-07-21 21:46:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:58,506 INFO L225 Difference]: With dead ends: 4675 [2018-07-21 21:46:58,506 INFO L226 Difference]: Without dead ends: 2529 [2018-07-21 21:46:58,508 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:58,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2018-07-21 21:46:58,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2216. [2018-07-21 21:46:58,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-07-21 21:46:58,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 2738 transitions. [2018-07-21 21:46:58,568 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 2738 transitions. Word has length 257 [2018-07-21 21:46:58,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:58,570 INFO L471 AbstractCegarLoop]: Abstraction has 2216 states and 2738 transitions. [2018-07-21 21:46:58,570 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:46:58,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2738 transitions. [2018-07-21 21:46:58,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-07-21 21:46:58,573 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:58,573 INFO L358 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:58,573 INFO L414 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:58,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1240517652, now seen corresponding path program 1 times [2018-07-21 21:46:58,574 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:58,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:58,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:58,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:58,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-07-21 21:46:58,936 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:58,936 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:58,937 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:58,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:58,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:58,937 INFO L87 Difference]: Start difference. First operand 2216 states and 2738 transitions. Second operand 4 states. [2018-07-21 21:46:59,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:59,144 INFO L93 Difference]: Finished difference Result 4685 states and 5801 transitions. [2018-07-21 21:46:59,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:59,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 259 [2018-07-21 21:46:59,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:59,146 INFO L225 Difference]: With dead ends: 4685 [2018-07-21 21:46:59,146 INFO L226 Difference]: Without dead ends: 2529 [2018-07-21 21:46:59,148 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:59,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2018-07-21 21:46:59,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2226. [2018-07-21 21:46:59,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2226 states. [2018-07-21 21:46:59,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 2748 transitions. [2018-07-21 21:46:59,190 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 2748 transitions. Word has length 259 [2018-07-21 21:46:59,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:46:59,191 INFO L471 AbstractCegarLoop]: Abstraction has 2226 states and 2748 transitions. [2018-07-21 21:46:59,191 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:46:59,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 2748 transitions. [2018-07-21 21:46:59,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-07-21 21:46:59,193 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:46:59,193 INFO L358 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:46:59,193 INFO L414 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:46:59,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1925027808, now seen corresponding path program 1 times [2018-07-21 21:46:59,193 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:46:59,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:46:59,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:59,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:46:59,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:46:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:46:59,531 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-07-21 21:46:59,532 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:46:59,532 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:46:59,532 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:46:59,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:46:59,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:46:59,533 INFO L87 Difference]: Start difference. First operand 2226 states and 2748 transitions. Second operand 4 states. [2018-07-21 21:46:59,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:46:59,992 INFO L93 Difference]: Finished difference Result 4685 states and 5796 transitions. [2018-07-21 21:46:59,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:46:59,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 259 [2018-07-21 21:46:59,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:46:59,994 INFO L225 Difference]: With dead ends: 4685 [2018-07-21 21:46:59,994 INFO L226 Difference]: Without dead ends: 2519 [2018-07-21 21:46:59,996 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:46:59,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2018-07-21 21:47:00,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 2226. [2018-07-21 21:47:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2226 states. [2018-07-21 21:47:00,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 2743 transitions. [2018-07-21 21:47:00,032 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 2743 transitions. Word has length 259 [2018-07-21 21:47:00,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:47:00,032 INFO L471 AbstractCegarLoop]: Abstraction has 2226 states and 2743 transitions. [2018-07-21 21:47:00,032 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:47:00,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 2743 transitions. [2018-07-21 21:47:00,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-07-21 21:47:00,034 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:47:00,035 INFO L358 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:47:00,035 INFO L414 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:47:00,035 INFO L82 PathProgramCache]: Analyzing trace with hash -150768721, now seen corresponding path program 1 times [2018-07-21 21:47:00,035 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:47:00,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:47:00,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:47:00,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:47:00,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:47:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:47:00,249 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-07-21 21:47:00,249 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:47:00,249 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:47:00,249 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:47:00,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:47:00,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:47:00,250 INFO L87 Difference]: Start difference. First operand 2226 states and 2743 transitions. Second operand 4 states. [2018-07-21 21:47:00,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:47:00,441 INFO L93 Difference]: Finished difference Result 4620 states and 5711 transitions. [2018-07-21 21:47:00,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:47:00,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2018-07-21 21:47:00,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:47:00,443 INFO L225 Difference]: With dead ends: 4620 [2018-07-21 21:47:00,444 INFO L226 Difference]: Without dead ends: 2454 [2018-07-21 21:47:00,446 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:47:00,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2018-07-21 21:47:00,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2236. [2018-07-21 21:47:00,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2236 states. [2018-07-21 21:47:00,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2753 transitions. [2018-07-21 21:47:00,496 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2753 transitions. Word has length 261 [2018-07-21 21:47:00,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:47:00,496 INFO L471 AbstractCegarLoop]: Abstraction has 2236 states and 2753 transitions. [2018-07-21 21:47:00,496 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:47:00,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2753 transitions. [2018-07-21 21:47:00,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-07-21 21:47:00,498 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:47:00,499 INFO L358 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:47:00,499 INFO L414 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:47:00,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1424252294, now seen corresponding path program 1 times [2018-07-21 21:47:00,499 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:47:00,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:47:00,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:47:00,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:47:00,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:47:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:47:00,790 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-07-21 21:47:00,791 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:47:00,791 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-21 21:47:00,791 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-21 21:47:00,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-21 21:47:00,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-21 21:47:00,792 INFO L87 Difference]: Start difference. First operand 2236 states and 2753 transitions. Second operand 4 states. [2018-07-21 21:47:01,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:47:01,005 INFO L93 Difference]: Finished difference Result 4805 states and 5946 transitions. [2018-07-21 21:47:01,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-21 21:47:01,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2018-07-21 21:47:01,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:47:01,009 INFO L225 Difference]: With dead ends: 4805 [2018-07-21 21:47:01,009 INFO L226 Difference]: Without dead ends: 2629 [2018-07-21 21:47:01,011 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-21 21:47:01,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2018-07-21 21:47:01,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2431. [2018-07-21 21:47:01,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2431 states. [2018-07-21 21:47:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 3028 transitions. [2018-07-21 21:47:01,053 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 3028 transitions. Word has length 261 [2018-07-21 21:47:01,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:47:01,053 INFO L471 AbstractCegarLoop]: Abstraction has 2431 states and 3028 transitions. [2018-07-21 21:47:01,053 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-21 21:47:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 3028 transitions. [2018-07-21 21:47:01,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-07-21 21:47:01,056 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:47:01,056 INFO L358 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:47:01,056 INFO L414 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:47:01,056 INFO L82 PathProgramCache]: Analyzing trace with hash -302233629, now seen corresponding path program 1 times [2018-07-21 21:47:01,057 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:47:01,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:47:01,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:47:01,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:47:01,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:47:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:47:01,205 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-07-21 21:47:01,205 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:47:01,205 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-21 21:47:01,206 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-21 21:47:01,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-21 21:47:01,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-21 21:47:01,206 INFO L87 Difference]: Start difference. First operand 2431 states and 3028 transitions. Second operand 3 states. [2018-07-21 21:47:01,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:47:01,399 INFO L93 Difference]: Finished difference Result 6820 states and 8495 transitions. [2018-07-21 21:47:01,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-21 21:47:01,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2018-07-21 21:47:01,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:47:01,404 INFO L225 Difference]: With dead ends: 6820 [2018-07-21 21:47:01,404 INFO L226 Difference]: Without dead ends: 4449 [2018-07-21 21:47:01,407 INFO L578 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 [2018-07-21 21:47:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4449 states. [2018-07-21 21:47:01,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4449 to 4445. [2018-07-21 21:47:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4445 states. [2018-07-21 21:47:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4445 states to 4445 states and 5496 transitions. [2018-07-21 21:47:01,555 INFO L78 Accepts]: Start accepts. Automaton has 4445 states and 5496 transitions. Word has length 265 [2018-07-21 21:47:01,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:47:01,555 INFO L471 AbstractCegarLoop]: Abstraction has 4445 states and 5496 transitions. [2018-07-21 21:47:01,555 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-21 21:47:01,556 INFO L276 IsEmpty]: Start isEmpty. Operand 4445 states and 5496 transitions. [2018-07-21 21:47:01,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-07-21 21:47:01,561 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:47:01,562 INFO L358 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:47:01,562 INFO L414 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:47:01,562 INFO L82 PathProgramCache]: Analyzing trace with hash -735962715, now seen corresponding path program 1 times [2018-07-21 21:47:01,562 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:47:01,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:47:01,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:47:01,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:47:01,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:47:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:47:02,107 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-07-21 21:47:02,107 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:47:02,108 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-21 21:47:02,108 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-21 21:47:02,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-21 21:47:02,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-07-21 21:47:02,108 INFO L87 Difference]: Start difference. First operand 4445 states and 5496 transitions. Second operand 6 states. [2018-07-21 21:47:02,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:47:02,720 INFO L93 Difference]: Finished difference Result 9383 states and 11528 transitions. [2018-07-21 21:47:02,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-21 21:47:02,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 265 [2018-07-21 21:47:02,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:47:02,725 INFO L225 Difference]: With dead ends: 9383 [2018-07-21 21:47:02,725 INFO L226 Difference]: Without dead ends: 7012 [2018-07-21 21:47:02,728 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-07-21 21:47:02,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7012 states. [2018-07-21 21:47:02,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7012 to 4445. [2018-07-21 21:47:02,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4445 states. [2018-07-21 21:47:02,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4445 states to 4445 states and 5491 transitions. [2018-07-21 21:47:02,888 INFO L78 Accepts]: Start accepts. Automaton has 4445 states and 5491 transitions. Word has length 265 [2018-07-21 21:47:02,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:47:02,888 INFO L471 AbstractCegarLoop]: Abstraction has 4445 states and 5491 transitions. [2018-07-21 21:47:02,888 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-21 21:47:02,889 INFO L276 IsEmpty]: Start isEmpty. Operand 4445 states and 5491 transitions. [2018-07-21 21:47:02,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-07-21 21:47:02,892 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:47:02,893 INFO L358 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:47:02,893 INFO L414 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:47:02,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1174577124, now seen corresponding path program 1 times [2018-07-21 21:47:02,893 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:47:02,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:47:02,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:47:02,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:47:02,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:47:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:47:03,081 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-07-21 21:47:03,081 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:47:03,081 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-21 21:47:03,082 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-21 21:47:03,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-21 21:47:03,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-07-21 21:47:03,082 INFO L87 Difference]: Start difference. First operand 4445 states and 5491 transitions. Second operand 6 states. [2018-07-21 21:47:03,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:47:03,657 INFO L93 Difference]: Finished difference Result 8456 states and 10411 transitions. [2018-07-21 21:47:03,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-21 21:47:03,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 266 [2018-07-21 21:47:03,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:47:03,662 INFO L225 Difference]: With dead ends: 8456 [2018-07-21 21:47:03,662 INFO L226 Difference]: Without dead ends: 6558 [2018-07-21 21:47:03,665 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-07-21 21:47:03,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6558 states. [2018-07-21 21:47:03,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6558 to 4461. [2018-07-21 21:47:03,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4461 states. [2018-07-21 21:47:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4461 states to 4461 states and 5507 transitions. [2018-07-21 21:47:03,763 INFO L78 Accepts]: Start accepts. Automaton has 4461 states and 5507 transitions. Word has length 266 [2018-07-21 21:47:03,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:47:03,763 INFO L471 AbstractCegarLoop]: Abstraction has 4461 states and 5507 transitions. [2018-07-21 21:47:03,763 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-21 21:47:03,763 INFO L276 IsEmpty]: Start isEmpty. Operand 4461 states and 5507 transitions. [2018-07-21 21:47:03,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-07-21 21:47:03,767 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:47:03,767 INFO L358 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:47:03,767 INFO L414 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:47:03,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1500251392, now seen corresponding path program 1 times [2018-07-21 21:47:03,767 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:47:03,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:47:03,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:47:03,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:47:03,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:47:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:47:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-07-21 21:47:04,212 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:47:04,213 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-21 21:47:04,213 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-21 21:47:04,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-21 21:47:04,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-07-21 21:47:04,213 INFO L87 Difference]: Start difference. First operand 4461 states and 5507 transitions. Second operand 6 states. [2018-07-21 21:47:04,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:47:04,915 INFO L93 Difference]: Finished difference Result 9423 states and 11558 transitions. [2018-07-21 21:47:04,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-21 21:47:04,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 267 [2018-07-21 21:47:04,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:47:04,919 INFO L225 Difference]: With dead ends: 9423 [2018-07-21 21:47:04,920 INFO L226 Difference]: Without dead ends: 7036 [2018-07-21 21:47:04,922 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-07-21 21:47:04,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7036 states. [2018-07-21 21:47:05,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7036 to 4461. [2018-07-21 21:47:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4461 states. [2018-07-21 21:47:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4461 states to 4461 states and 5502 transitions. [2018-07-21 21:47:05,018 INFO L78 Accepts]: Start accepts. Automaton has 4461 states and 5502 transitions. Word has length 267 [2018-07-21 21:47:05,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:47:05,019 INFO L471 AbstractCegarLoop]: Abstraction has 4461 states and 5502 transitions. [2018-07-21 21:47:05,019 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-21 21:47:05,019 INFO L276 IsEmpty]: Start isEmpty. Operand 4461 states and 5502 transitions. [2018-07-21 21:47:05,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-07-21 21:47:05,023 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:47:05,023 INFO L358 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:47:05,024 INFO L414 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:47:05,024 INFO L82 PathProgramCache]: Analyzing trace with hash -122516888, now seen corresponding path program 1 times [2018-07-21 21:47:05,024 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:47:05,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:47:05,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:47:05,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:47:05,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:47:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:47:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-07-21 21:47:05,575 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:47:05,575 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-07-21 21:47:05,575 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-21 21:47:05,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-21 21:47:05,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-07-21 21:47:05,576 INFO L87 Difference]: Start difference. First operand 4461 states and 5502 transitions. Second operand 10 states. [2018-07-21 21:47:06,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:47:06,020 INFO L93 Difference]: Finished difference Result 8870 states and 10949 transitions. [2018-07-21 21:47:06,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-21 21:47:06,020 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 268 [2018-07-21 21:47:06,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:47:06,023 INFO L225 Difference]: With dead ends: 8870 [2018-07-21 21:47:06,023 INFO L226 Difference]: Without dead ends: 4469 [2018-07-21 21:47:06,026 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-07-21 21:47:06,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4469 states. [2018-07-21 21:47:06,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4469 to 4467. [2018-07-21 21:47:06,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4467 states. [2018-07-21 21:47:06,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4467 states to 4467 states and 5508 transitions. [2018-07-21 21:47:06,145 INFO L78 Accepts]: Start accepts. Automaton has 4467 states and 5508 transitions. Word has length 268 [2018-07-21 21:47:06,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:47:06,145 INFO L471 AbstractCegarLoop]: Abstraction has 4467 states and 5508 transitions. [2018-07-21 21:47:06,145 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-21 21:47:06,146 INFO L276 IsEmpty]: Start isEmpty. Operand 4467 states and 5508 transitions. [2018-07-21 21:47:06,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-07-21 21:47:06,149 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:47:06,150 INFO L358 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:47:06,150 INFO L414 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:47:06,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1483670493, now seen corresponding path program 1 times [2018-07-21 21:47:06,150 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:47:06,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:47:06,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:47:06,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:47:06,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:47:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-21 21:47:06,707 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-07-21 21:47:06,707 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-21 21:47:06,707 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-21 21:47:06,708 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-21 21:47:06,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-21 21:47:06,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-21 21:47:06,708 INFO L87 Difference]: Start difference. First operand 4467 states and 5508 transitions. Second operand 6 states. [2018-07-21 21:47:08,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-21 21:47:08,265 INFO L93 Difference]: Finished difference Result 11198 states and 13824 transitions. [2018-07-21 21:47:08,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-21 21:47:08,265 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 300 [2018-07-21 21:47:08,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-21 21:47:08,270 INFO L225 Difference]: With dead ends: 11198 [2018-07-21 21:47:08,270 INFO L226 Difference]: Without dead ends: 6797 [2018-07-21 21:47:08,273 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-07-21 21:47:08,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6797 states. [2018-07-21 21:47:08,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6797 to 4478. [2018-07-21 21:47:08,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4478 states. [2018-07-21 21:47:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4478 states to 4478 states and 5521 transitions. [2018-07-21 21:47:08,392 INFO L78 Accepts]: Start accepts. Automaton has 4478 states and 5521 transitions. Word has length 300 [2018-07-21 21:47:08,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-21 21:47:08,392 INFO L471 AbstractCegarLoop]: Abstraction has 4478 states and 5521 transitions. [2018-07-21 21:47:08,392 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-21 21:47:08,392 INFO L276 IsEmpty]: Start isEmpty. Operand 4478 states and 5521 transitions. [2018-07-21 21:47:08,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-07-21 21:47:08,396 INFO L350 BasicCegarLoop]: Found error trace [2018-07-21 21:47:08,396 INFO L358 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-21 21:47:08,396 INFO L414 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-21 21:47:08,396 INFO L82 PathProgramCache]: Analyzing trace with hash 907633125, now seen corresponding path program 1 times [2018-07-21 21:47:08,396 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-21 21:47:08,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-21 21:47:08,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:47:08,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-21 21:47:08,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-21 21:47:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-21 21:47:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-21 21:47:08,803 INFO L424 BasicCegarLoop]: Counterexample might be feasible [2018-07-21 21:47:09,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 09:47:09 BoogieIcfgContainer [2018-07-21 21:47:09,013 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-21 21:47:09,014 INFO L168 Benchmark]: Toolchain (without parser) took 42579.39 ms. Allocated memory was 308.8 MB in the beginning and 1.0 GB in the end (delta: 695.2 MB). Free memory was 252.3 MB in the beginning and 747.6 MB in the end (delta: -495.3 MB). Peak memory consumption was 199.9 MB. Max. memory is 5.3 GB. [2018-07-21 21:47:09,015 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-07-21 21:47:09,016 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1208.46 ms. Allocated memory was 308.8 MB in the beginning and 335.5 MB in the end (delta: 26.7 MB). Free memory was 252.3 MB in the beginning and 250.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 74.5 MB. Max. memory is 5.3 GB. [2018-07-21 21:47:09,016 INFO L168 Benchmark]: Boogie Procedure Inliner took 212.45 ms. Allocated memory was 335.5 MB in the beginning and 491.8 MB in the end (delta: 156.2 MB). Free memory was 249.3 MB in the beginning and 467.7 MB in the end (delta: -218.4 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. [2018-07-21 21:47:09,017 INFO L168 Benchmark]: Boogie Preprocessor took 148.24 ms. Allocated memory is still 491.8 MB. Free memory was 467.7 MB in the beginning and 461.4 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 5.3 GB. [2018-07-21 21:47:09,017 INFO L168 Benchmark]: RCFGBuilder took 2701.90 ms. Allocated memory is still 491.8 MB. Free memory was 461.4 MB in the beginning and 365.0 MB in the end (delta: 96.4 MB). Peak memory consumption was 96.4 MB. Max. memory is 5.3 GB. [2018-07-21 21:47:09,018 INFO L168 Benchmark]: TraceAbstraction took 38298.07 ms. Allocated memory was 491.8 MB in the beginning and 1.0 GB in the end (delta: 512.2 MB). Free memory was 365.0 MB in the beginning and 747.6 MB in the end (delta: -382.6 MB). Peak memory consumption was 129.7 MB. Max. memory is 5.3 GB. [2018-07-21 21:47:09,022 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 1208.46 ms. Allocated memory was 308.8 MB in the beginning and 335.5 MB in the end (delta: 26.7 MB). Free memory was 252.3 MB in the beginning and 250.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 74.5 MB. Max. memory is 5.3 GB. * Boogie Procedure Inliner took 212.45 ms. Allocated memory was 335.5 MB in the beginning and 491.8 MB in the end (delta: 156.2 MB). Free memory was 249.3 MB in the beginning and 467.7 MB in the end (delta: -218.4 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 148.24 ms. Allocated memory is still 491.8 MB. Free memory was 467.7 MB in the beginning and 461.4 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 2701.90 ms. Allocated memory is still 491.8 MB. Free memory was 461.4 MB in the beginning and 365.0 MB in the end (delta: 96.4 MB). Peak memory consumption was 96.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 38298.07 ms. Allocated memory was 491.8 MB in the beginning and 1.0 GB in the end (delta: 512.2 MB). Free memory was 365.0 MB in the beginning and 747.6 MB in the end (delta: -382.6 MB). Peak memory consumption was 129.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1645]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1330. Possible FailurePath: [L1039] static int init = 1; VAL [init=1] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] CALL static SSL_METHOD SSLv3_client_data ; [L1040] RET static SSL_METHOD SSLv3_client_data ; [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={20485:0}] [L1062] SSL *s ; VAL [init=1, SSLv3_client_data={20485:0}] [L1066] EXPR, FCALL malloc (sizeof (SSL)) VAL [init=1, SSLv3_client_data={20485:0}] [L1066] s = malloc (sizeof (SSL)) VAL [init=1, SSLv3_client_data={20485:0}] [L1067] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) VAL [init=1, SSLv3_client_data={20485:0}] [L1067] FCALL s->s3 = malloc(sizeof(struct ssl3_state_st)) VAL [init=1, SSLv3_client_data={20485:0}] [L1068] EXPR, FCALL malloc(sizeof(SSL_CTX)) VAL [init=1, SSLv3_client_data={20485:0}] [L1068] FCALL s->ctx = malloc(sizeof(SSL_CTX)) VAL [init=1, SSLv3_client_data={20485:0}] [L1069] FCALL s->state = 12292 VAL [init=1, SSLv3_client_data={20485:0}] [L1070] FCALL s->version = __VERIFIER_nondet_int() VAL [init=1, SSLv3_client_data={20485:0}] [L1071] CALL ssl3_connect(s) [L1077] BUF_MEM *buf = __VERIFIER_nondet_pointer(); [L1078] unsigned long tmp ; [L1079] unsigned long l ; [L1080] long num1 ; [L1081] void (*cb)() ; [L1082] int ret ; [L1083] int new_state ; [L1084] int state ; [L1085] int skip ; [L1086] int *tmp___0 ; [L1087] int tmp___1 = __VERIFIER_nondet_int(); [L1088] int tmp___2 = __VERIFIER_nondet_int(); [L1089] int tmp___3 ; [L1090] int tmp___4 ; [L1091] int tmp___5 ; [L1092] int tmp___6 ; [L1093] int tmp___7 ; [L1094] int tmp___8 ; [L1095] long tmp___9 ; [L1097] int blastFlag ; [L1100] blastFlag = 0 VAL [init=1, SSLv3_client_data={20485:0}] [L1101] FCALL s->state = 12292 VAL [init=1, SSLv3_client_data={20485:0}] [L1102] FCALL s->hit = __VERIFIER_nondet_int() VAL [init=1, SSLv3_client_data={20485:0}] [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 VAL [init=1, SSLv3_client_data={20485:0}] [L1108] EXPR, FCALL malloc(sizeof(int)) VAL [init=1, SSLv3_client_data={20485:0}] [L1108] tmp___0 = (int*)malloc(sizeof(int)) VAL [init=1, SSLv3_client_data={20485:0}] [L1109] FCALL *tmp___0 = 0 VAL [init=1, SSLv3_client_data={20485:0}] [L1110] EXPR, FCALL s->info_callback VAL [init=1, SSLv3_client_data={20485:0}] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR, FCALL s->info_callback VAL [init=1, SSLv3_client_data={20485:0}] [L1111] cb = s->info_callback [L1119] EXPR, FCALL s->in_handshake VAL [init=1, SSLv3_client_data={20485:0}] [L1119] FCALL s->in_handshake += 1 VAL [init=1, SSLv3_client_data={20485:0}] [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={20485:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={20485:0}] [L1132] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1133] COND TRUE s->state == 12292 [L1236] FCALL s->new_session = 1 VAL [init=1, SSLv3_client_data={20485:0}] [L1237] FCALL s->state = 4096 VAL [init=1, SSLv3_client_data={20485:0}] [L1238] EXPR, FCALL s->ctx VAL [init=1, SSLv3_client_data={20485:0}] [L1238] EXPR, FCALL (s->ctx)->stats.sess_connect_renegotiate VAL [init=1, SSLv3_client_data={20485:0}] [L1238] FCALL (s->ctx)->stats.sess_connect_renegotiate += 1 VAL [init=1, SSLv3_client_data={20485:0}] [L1243] FCALL s->server = 0 VAL [init=1, SSLv3_client_data={20485:0}] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={20485:0}] [L1249] EXPR, FCALL s->version VAL [init=1, SSLv3_client_data={20485:0}] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] FCALL s->type = 4096 VAL [init=1, SSLv3_client_data={20485:0}] [L1256] EXPR, FCALL s->init_buf VAL [init=1, SSLv3_client_data={20485:0}] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1268] tmp___4 = __VERIFIER_nondet_int() [L1269] COND FALSE !(! tmp___4) [L1275] tmp___5 = __VERIFIER_nondet_int() [L1276] COND FALSE !(! tmp___5) VAL [init=1, SSLv3_client_data={20485:0}] [L1282] FCALL s->state = 4368 VAL [init=1, SSLv3_client_data={20485:0}] [L1283] EXPR, FCALL s->ctx VAL [init=1, SSLv3_client_data={20485:0}] [L1283] EXPR, FCALL (s->ctx)->stats.sess_connect VAL [init=1, SSLv3_client_data={20485:0}] [L1283] FCALL (s->ctx)->stats.sess_connect += 1 VAL [init=1, SSLv3_client_data={20485:0}] [L1284] FCALL s->init_num = 0 VAL [init=1, SSLv3_client_data={20485:0}] [L1604] EXPR, FCALL s->s3 VAL [init=1, SSLv3_client_data={20485:0}] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={20485:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={20485:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={20485:0}] [L1132] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1148] COND TRUE s->state == 4368 [L1288] FCALL s->shutdown = 0 VAL [init=1, SSLv3_client_data={20485:0}] [L1289] ret = __VERIFIER_nondet_int() [L1290] COND TRUE blastFlag == 0 [L1291] blastFlag = 1 VAL [init=1, SSLv3_client_data={20485:0}] [L1295] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={20485:0}] [L1300] FCALL s->state = 4384 VAL [init=1, SSLv3_client_data={20485:0}] [L1301] FCALL s->init_num = 0 VAL [init=1, SSLv3_client_data={20485:0}] [L1302] EXPR, FCALL s->bbio VAL [init=1, SSLv3_client_data={20485:0}] [L1302] EXPR, FCALL s->wbio VAL [init=1, SSLv3_client_data={20485:0}] [L1302] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1604] EXPR, FCALL s->s3 VAL [init=1, SSLv3_client_data={20485:0}] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={20485:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={20485:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={20485:0}] [L1132] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1154] COND TRUE s->state == 4384 [L1310] ret = __VERIFIER_nondet_int() [L1311] COND TRUE blastFlag == 1 [L1312] blastFlag = 2 VAL [init=1, SSLv3_client_data={20485:0}] [L1316] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={20485:0}] [L1321] FCALL s->hit VAL [init=1, SSLv3_client_data={20485:0}] [L1321] COND FALSE !(s->hit) [L1324] FCALL s->state = 4400 VAL [init=1, SSLv3_client_data={20485:0}] [L1326] FCALL s->init_num = 0 VAL [init=1, SSLv3_client_data={20485:0}] [L1604] EXPR, FCALL s->s3 VAL [init=1, SSLv3_client_data={20485:0}] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={20485:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={20485:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={20485:0}] [L1132] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1160] COND TRUE s->state == 4400 [L1330] EXPR, FCALL s->s3 VAL [init=1, SSLv3_client_data={20485:0}] [L1330] EXPR, FCALL (s->s3)->tmp.new_cipher VAL [init=1, SSLv3_client_data={20485:0}] [L1330] EXPR, FCALL ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={20485:0}] [L1330] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 2 [L1335] blastFlag = 3 VAL [init=1, SSLv3_client_data={20485:0}] [L1339] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={20485:0}] [L1345] FCALL s->state = 4416 VAL [init=1, SSLv3_client_data={20485:0}] [L1346] FCALL s->init_num = 0 VAL [init=1, SSLv3_client_data={20485:0}] [L1604] EXPR, FCALL s->s3 VAL [init=1, SSLv3_client_data={20485:0}] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={20485:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={20485:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={20485:0}] [L1132] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1166] COND TRUE s->state == 4416 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 3 [L1352] blastFlag = 4 VAL [init=1, SSLv3_client_data={20485:0}] [L1356] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={20485:0}] [L1361] FCALL s->state = 4432 VAL [init=1, SSLv3_client_data={20485:0}] [L1362] FCALL s->init_num = 0 VAL [init=1, SSLv3_client_data={20485:0}] [L1363] tmp___6 = __VERIFIER_nondet_int() [L1364] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={20485:0}] [L1604] EXPR, FCALL s->s3 VAL [init=1, SSLv3_client_data={20485:0}] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={20485:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={20485:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={20485:0}] [L1132] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1172] COND TRUE s->state == 4432 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={20485:0}] [L1379] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={20485:0}] [L1384] FCALL s->state = 4448 VAL [init=1, SSLv3_client_data={20485:0}] [L1385] FCALL s->init_num = 0 VAL [init=1, SSLv3_client_data={20485:0}] [L1604] EXPR, FCALL s->s3 VAL [init=1, SSLv3_client_data={20485:0}] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={20485:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={20485:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={20485:0}] [L1132] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1172] COND FALSE !(s->state == 4432) [L1175] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1175] COND FALSE !(s->state == 4433) [L1178] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20485:0}] [L1178] COND TRUE s->state == 4448 [L1389] ret = __VERIFIER_nondet_int() [L1390] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={20485:0}] [L1645] __VERIFIER_error() VAL [init=1, SSLv3_client_data={20485:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 344 locations, 1 error locations. UNSAFE Result, 38.2s OverallTime, 44 OverallIterations, 7 TraceHistogramMax, 22.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 21645 SDtfs, 10722 SDslu, 39164 SDs, 0 SdLazy, 14217 SolverSat, 422 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 398 GetRequests, 155 SyntacticMatches, 63 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4478occurred in iteration=43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 43 MinimizatonAttempts, 23514 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 8873 NumberOfCodeBlocks, 8873 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 8530 ConstructedInterpolants, 0 QuantifiedInterpolants, 3525505 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 PerfectInterpolantSequences, 6910/6910 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_false-unreach-call.i_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-21_21-47-09-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_false-unreach-call.i_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-21_21-47-09-034.csv Received shutdown request...