java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -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-df4b876 [2018-11-06 22:36:31,839 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 22:36:31,842 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 22:36:31,860 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 22:36:31,860 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 22:36:31,861 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 22:36:31,864 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 22:36:31,868 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 22:36:31,870 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 22:36:31,872 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 22:36:31,873 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 22:36:31,873 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 22:36:31,876 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 22:36:31,879 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 22:36:31,888 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 22:36:31,889 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 22:36:31,891 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 22:36:31,892 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 22:36:31,896 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 22:36:31,901 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 22:36:31,902 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 22:36:31,904 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 22:36:31,911 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 22:36:31,911 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 22:36:31,911 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 22:36:31,913 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 22:36:31,914 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 22:36:31,916 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 22:36:31,917 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 22:36:31,918 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 22:36:31,918 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 22:36:31,919 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 22:36:31,919 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 22:36:31,919 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 22:36:31,922 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 22:36:31,924 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 22:36:31,924 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 22:36:31,948 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 22:36:31,948 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 22:36:31,949 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 22:36:31,950 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 22:36:31,950 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 22:36:31,950 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 22:36:31,951 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 22:36:31,951 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 22:36:31,951 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 22:36:31,951 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 22:36:31,952 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 22:36:31,953 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 22:36:31,953 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 22:36:31,953 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 22:36:31,953 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 22:36:31,954 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 22:36:31,954 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 22:36:31,954 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 22:36:31,955 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 22:36:31,955 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 22:36:31,955 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 22:36:31,955 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 22:36:31,956 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 22:36:31,956 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 22:36:31,956 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 22:36:31,956 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 22:36:31,956 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 22:36:31,958 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 22:36:32,007 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 22:36:32,024 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 22:36:32,028 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 22:36:32,030 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 22:36:32,030 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 22:36:32,031 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/s3_false-unreach-call.i [2018-11-06 22:36:32,109 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a54501941/41ef2e3765c146e88de53f924632f721/FLAGe684b36fb [2018-11-06 22:36:32,750 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 22:36:32,751 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/s3_false-unreach-call.i [2018-11-06 22:36:32,773 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a54501941/41ef2e3765c146e88de53f924632f721/FLAGe684b36fb [2018-11-06 22:36:32,789 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a54501941/41ef2e3765c146e88de53f924632f721 [2018-11-06 22:36:32,801 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 22:36:32,803 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 22:36:32,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 22:36:32,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 22:36:32,809 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 22:36:32,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:36:32" (1/1) ... [2018-11-06 22:36:32,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ec00248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:32, skipping insertion in model container [2018-11-06 22:36:32,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:36:32" (1/1) ... [2018-11-06 22:36:32,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 22:36:32,924 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 22:36:33,853 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:36:33,871 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 22:36:34,340 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:36:34,361 INFO L193 MainTranslator]: Completed translation [2018-11-06 22:36:34,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:34 WrapperNode [2018-11-06 22:36:34,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 22:36:34,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 22:36:34,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 22:36:34,363 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 22:36:34,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:34" (1/1) ... [2018-11-06 22:36:34,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:34" (1/1) ... [2018-11-06 22:36:34,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 22:36:34,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 22:36:34,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 22:36:34,451 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 22:36:34,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:34" (1/1) ... [2018-11-06 22:36:34,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:34" (1/1) ... [2018-11-06 22:36:34,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:34" (1/1) ... [2018-11-06 22:36:34,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:34" (1/1) ... [2018-11-06 22:36:34,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:34" (1/1) ... [2018-11-06 22:36:34,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:34" (1/1) ... [2018-11-06 22:36:34,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:34" (1/1) ... [2018-11-06 22:36:34,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 22:36:34,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 22:36:34,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 22:36:34,575 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 22:36:34,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 22:36:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-06 22:36:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-06 22:36:34,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-06 22:36:34,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-06 22:36:34,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-06 22:36:34,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 22:36:34,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 22:36:34,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-06 22:36:34,892 WARN L671 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-06 22:36:34,893 WARN L636 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-06 22:36:36,818 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 22:36:36,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:36:36 BoogieIcfgContainer [2018-11-06 22:36:36,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 22:36:36,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 22:36:36,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 22:36:36,825 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 22:36:36,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:36:32" (1/3) ... [2018-11-06 22:36:36,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23912fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:36:36, skipping insertion in model container [2018-11-06 22:36:36,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:34" (2/3) ... [2018-11-06 22:36:36,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23912fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:36:36, skipping insertion in model container [2018-11-06 22:36:36,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:36:36" (3/3) ... [2018-11-06 22:36:36,829 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_false-unreach-call.i [2018-11-06 22:36:36,839 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 22:36:36,847 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 22:36:36,863 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 22:36:36,899 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 22:36:36,900 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 22:36:36,900 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 22:36:36,900 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 22:36:36,901 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 22:36:36,901 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 22:36:36,901 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 22:36:36,901 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 22:36:36,901 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 22:36:36,926 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states. [2018-11-06 22:36:36,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-06 22:36:36,939 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:36,940 INFO L375 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-11-06 22:36:36,943 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:36,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:36,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1261209972, now seen corresponding path program 1 times [2018-11-06 22:36:36,952 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:36,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:37,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:37,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:37,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:37,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:36:37,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:36:37,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:36:37,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:36:37,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:36:37,411 INFO L87 Difference]: Start difference. First operand 342 states. Second operand 3 states. [2018-11-06 22:36:37,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:37,770 INFO L93 Difference]: Finished difference Result 898 states and 1149 transitions. [2018-11-06 22:36:37,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:36:37,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2018-11-06 22:36:37,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:37,793 INFO L225 Difference]: With dead ends: 898 [2018-11-06 22:36:37,793 INFO L226 Difference]: Without dead ends: 550 [2018-11-06 22:36:37,798 INFO L604 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-11-06 22:36:37,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-11-06 22:36:37,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2018-11-06 22:36:37,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2018-11-06 22:36:37,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 654 transitions. [2018-11-06 22:36:37,879 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 654 transitions. Word has length 88 [2018-11-06 22:36:37,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:37,880 INFO L480 AbstractCegarLoop]: Abstraction has 550 states and 654 transitions. [2018-11-06 22:36:37,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:36:37,880 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 654 transitions. [2018-11-06 22:36:37,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-06 22:36:37,887 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:37,887 INFO L375 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-11-06 22:36:37,887 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:37,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:37,888 INFO L82 PathProgramCache]: Analyzing trace with hash 631583294, now seen corresponding path program 1 times [2018-11-06 22:36:37,888 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:37,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:37,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:37,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:37,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:38,193 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:36:38,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:36:38,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:36:38,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:36:38,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:36:38,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:36:38,198 INFO L87 Difference]: Start difference. First operand 550 states and 654 transitions. Second operand 3 states. [2018-11-06 22:36:38,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:38,412 INFO L93 Difference]: Finished difference Result 1040 states and 1250 transitions. [2018-11-06 22:36:38,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:36:38,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-11-06 22:36:38,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:38,422 INFO L225 Difference]: With dead ends: 1040 [2018-11-06 22:36:38,422 INFO L226 Difference]: Without dead ends: 791 [2018-11-06 22:36:38,428 INFO L604 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-11-06 22:36:38,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2018-11-06 22:36:38,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 791. [2018-11-06 22:36:38,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2018-11-06 22:36:38,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 942 transitions. [2018-11-06 22:36:38,476 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 942 transitions. Word has length 117 [2018-11-06 22:36:38,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:38,477 INFO L480 AbstractCegarLoop]: Abstraction has 791 states and 942 transitions. [2018-11-06 22:36:38,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:36:38,477 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 942 transitions. [2018-11-06 22:36:38,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-06 22:36:38,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:38,482 INFO L375 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-11-06 22:36:38,482 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:38,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:38,482 INFO L82 PathProgramCache]: Analyzing trace with hash -916631362, now seen corresponding path program 1 times [2018-11-06 22:36:38,483 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:38,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:38,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:38,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:38,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:36:38,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:36:38,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:36:38,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:36:38,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:36:38,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:36:38,827 INFO L87 Difference]: Start difference. First operand 791 states and 942 transitions. Second operand 4 states. [2018-11-06 22:36:39,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:39,704 INFO L93 Difference]: Finished difference Result 1668 states and 2007 transitions. [2018-11-06 22:36:39,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:36:39,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-11-06 22:36:39,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:39,710 INFO L225 Difference]: With dead ends: 1668 [2018-11-06 22:36:39,711 INFO L226 Difference]: Without dead ends: 937 [2018-11-06 22:36:39,712 INFO L604 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-11-06 22:36:39,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2018-11-06 22:36:39,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 863. [2018-11-06 22:36:39,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2018-11-06 22:36:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1042 transitions. [2018-11-06 22:36:39,736 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1042 transitions. Word has length 148 [2018-11-06 22:36:39,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:39,736 INFO L480 AbstractCegarLoop]: Abstraction has 863 states and 1042 transitions. [2018-11-06 22:36:39,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:36:39,737 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1042 transitions. [2018-11-06 22:36:39,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-06 22:36:39,740 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:39,740 INFO L375 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-11-06 22:36:39,741 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:39,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:39,741 INFO L82 PathProgramCache]: Analyzing trace with hash 223162462, now seen corresponding path program 1 times [2018-11-06 22:36:39,741 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:39,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:39,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:39,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:39,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:36:40,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:36:40,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:36:40,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:36:40,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:36:40,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:36:40,051 INFO L87 Difference]: Start difference. First operand 863 states and 1042 transitions. Second operand 4 states. [2018-11-06 22:36:41,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:41,493 INFO L93 Difference]: Finished difference Result 2008 states and 2455 transitions. [2018-11-06 22:36:41,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:36:41,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-11-06 22:36:41,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:41,505 INFO L225 Difference]: With dead ends: 2008 [2018-11-06 22:36:41,505 INFO L226 Difference]: Without dead ends: 1205 [2018-11-06 22:36:41,506 INFO L604 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-11-06 22:36:41,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2018-11-06 22:36:41,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 949. [2018-11-06 22:36:41,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2018-11-06 22:36:41,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1164 transitions. [2018-11-06 22:36:41,532 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1164 transitions. Word has length 148 [2018-11-06 22:36:41,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:41,532 INFO L480 AbstractCegarLoop]: Abstraction has 949 states and 1164 transitions. [2018-11-06 22:36:41,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:36:41,532 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1164 transitions. [2018-11-06 22:36:41,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-06 22:36:41,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:41,536 INFO L375 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-11-06 22:36:41,536 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:41,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:41,536 INFO L82 PathProgramCache]: Analyzing trace with hash -479169991, now seen corresponding path program 1 times [2018-11-06 22:36:41,536 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:41,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:41,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:41,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:41,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:36:41,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:36:41,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:36:41,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:36:41,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:36:41,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:36:41,839 INFO L87 Difference]: Start difference. First operand 949 states and 1164 transitions. Second operand 4 states. [2018-11-06 22:36:42,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:42,592 INFO L93 Difference]: Finished difference Result 2086 states and 2566 transitions. [2018-11-06 22:36:42,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:36:42,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-11-06 22:36:42,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:42,600 INFO L225 Difference]: With dead ends: 2086 [2018-11-06 22:36:42,600 INFO L226 Difference]: Without dead ends: 1197 [2018-11-06 22:36:42,602 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:36:42,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2018-11-06 22:36:42,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 953. [2018-11-06 22:36:42,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2018-11-06 22:36:42,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1168 transitions. [2018-11-06 22:36:42,633 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1168 transitions. Word has length 150 [2018-11-06 22:36:42,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:42,634 INFO L480 AbstractCegarLoop]: Abstraction has 953 states and 1168 transitions. [2018-11-06 22:36:42,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:36:42,634 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1168 transitions. [2018-11-06 22:36:42,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-06 22:36:42,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:42,638 INFO L375 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-11-06 22:36:42,638 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:42,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:42,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1105058092, now seen corresponding path program 1 times [2018-11-06 22:36:42,639 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:42,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:42,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:42,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:42,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:42,969 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:36:42,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:36:42,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:36:42,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:36:42,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:36:42,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:36:42,971 INFO L87 Difference]: Start difference. First operand 953 states and 1168 transitions. Second operand 4 states. [2018-11-06 22:36:44,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:44,158 INFO L93 Difference]: Finished difference Result 2090 states and 2568 transitions. [2018-11-06 22:36:44,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:36:44,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-11-06 22:36:44,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:44,164 INFO L225 Difference]: With dead ends: 2090 [2018-11-06 22:36:44,165 INFO L226 Difference]: Without dead ends: 1197 [2018-11-06 22:36:44,166 INFO L604 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-11-06 22:36:44,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2018-11-06 22:36:44,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 957. [2018-11-06 22:36:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2018-11-06 22:36:44,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1172 transitions. [2018-11-06 22:36:44,192 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1172 transitions. Word has length 152 [2018-11-06 22:36:44,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:44,193 INFO L480 AbstractCegarLoop]: Abstraction has 957 states and 1172 transitions. [2018-11-06 22:36:44,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:36:44,193 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1172 transitions. [2018-11-06 22:36:44,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-06 22:36:44,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:44,197 INFO L375 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-11-06 22:36:44,197 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:44,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:44,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1295728209, now seen corresponding path program 1 times [2018-11-06 22:36:44,197 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:44,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:44,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:44,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:44,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:44,450 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:36:44,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:36:44,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:36:44,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:36:44,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:36:44,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:36:44,452 INFO L87 Difference]: Start difference. First operand 957 states and 1172 transitions. Second operand 4 states. [2018-11-06 22:36:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:45,223 INFO L93 Difference]: Finished difference Result 2076 states and 2550 transitions. [2018-11-06 22:36:45,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:36:45,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-11-06 22:36:45,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:45,237 INFO L225 Difference]: With dead ends: 2076 [2018-11-06 22:36:45,237 INFO L226 Difference]: Without dead ends: 1179 [2018-11-06 22:36:45,239 INFO L604 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-11-06 22:36:45,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-11-06 22:36:45,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 961. [2018-11-06 22:36:45,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2018-11-06 22:36:45,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1176 transitions. [2018-11-06 22:36:45,261 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1176 transitions. Word has length 154 [2018-11-06 22:36:45,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:45,262 INFO L480 AbstractCegarLoop]: Abstraction has 961 states and 1176 transitions. [2018-11-06 22:36:45,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:36:45,262 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1176 transitions. [2018-11-06 22:36:45,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-06 22:36:45,265 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:45,265 INFO L375 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-11-06 22:36:45,265 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:45,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:45,266 INFO L82 PathProgramCache]: Analyzing trace with hash 563487619, now seen corresponding path program 1 times [2018-11-06 22:36:45,266 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:45,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:45,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:45,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:45,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:45,980 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:36:45,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:36:45,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:36:45,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:36:45,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:36:45,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:36:45,982 INFO L87 Difference]: Start difference. First operand 961 states and 1176 transitions. Second operand 6 states. [2018-11-06 22:36:47,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:47,893 INFO L93 Difference]: Finished difference Result 2955 states and 3634 transitions. [2018-11-06 22:36:47,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 22:36:47,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2018-11-06 22:36:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:47,905 INFO L225 Difference]: With dead ends: 2955 [2018-11-06 22:36:47,906 INFO L226 Difference]: Without dead ends: 2054 [2018-11-06 22:36:47,908 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-06 22:36:47,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2018-11-06 22:36:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 969. [2018-11-06 22:36:47,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2018-11-06 22:36:47,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1184 transitions. [2018-11-06 22:36:47,939 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1184 transitions. Word has length 158 [2018-11-06 22:36:47,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:47,940 INFO L480 AbstractCegarLoop]: Abstraction has 969 states and 1184 transitions. [2018-11-06 22:36:47,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:36:47,940 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1184 transitions. [2018-11-06 22:36:47,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-06 22:36:47,943 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:47,943 INFO L375 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-11-06 22:36:47,943 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:47,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:47,944 INFO L82 PathProgramCache]: Analyzing trace with hash -848626909, now seen corresponding path program 1 times [2018-11-06 22:36:47,944 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:47,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:47,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:47,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:47,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:48,217 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:36:48,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:36:48,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:36:48,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:36:48,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:36:48,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:36:48,219 INFO L87 Difference]: Start difference. First operand 969 states and 1184 transitions. Second operand 6 states. [2018-11-06 22:36:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:50,343 INFO L93 Difference]: Finished difference Result 3317 states and 4083 transitions. [2018-11-06 22:36:50,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 22:36:50,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2018-11-06 22:36:50,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:50,355 INFO L225 Difference]: With dead ends: 3317 [2018-11-06 22:36:50,355 INFO L226 Difference]: Without dead ends: 2408 [2018-11-06 22:36:50,357 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-06 22:36:50,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2018-11-06 22:36:50,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 1043. [2018-11-06 22:36:50,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2018-11-06 22:36:50,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1284 transitions. [2018-11-06 22:36:50,393 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1284 transitions. Word has length 158 [2018-11-06 22:36:50,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:50,394 INFO L480 AbstractCegarLoop]: Abstraction has 1043 states and 1284 transitions. [2018-11-06 22:36:50,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:36:50,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1284 transitions. [2018-11-06 22:36:50,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-06 22:36:50,397 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:50,397 INFO L375 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-11-06 22:36:50,398 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:50,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:50,398 INFO L82 PathProgramCache]: Analyzing trace with hash 323395518, now seen corresponding path program 1 times [2018-11-06 22:36:50,398 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:50,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:50,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:50,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:50,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:36:50,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:36:50,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:36:50,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:36:50,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:36:50,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:36:50,962 INFO L87 Difference]: Start difference. First operand 1043 states and 1284 transitions. Second operand 6 states. [2018-11-06 22:36:52,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:52,416 INFO L93 Difference]: Finished difference Result 3383 states and 4172 transitions. [2018-11-06 22:36:52,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 22:36:52,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2018-11-06 22:36:52,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:52,430 INFO L225 Difference]: With dead ends: 3383 [2018-11-06 22:36:52,430 INFO L226 Difference]: Without dead ends: 2400 [2018-11-06 22:36:52,433 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-06 22:36:52,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2018-11-06 22:36:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 1047. [2018-11-06 22:36:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2018-11-06 22:36:52,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1288 transitions. [2018-11-06 22:36:52,478 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1288 transitions. Word has length 160 [2018-11-06 22:36:52,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:52,479 INFO L480 AbstractCegarLoop]: Abstraction has 1047 states and 1288 transitions. [2018-11-06 22:36:52,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:36:52,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1288 transitions. [2018-11-06 22:36:52,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-06 22:36:52,482 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:52,485 INFO L375 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-11-06 22:36:52,485 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:52,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:52,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1361250073, now seen corresponding path program 1 times [2018-11-06 22:36:52,486 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:52,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:52,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:52,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:52,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:52,808 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:36:52,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:36:52,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:36:52,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:36:52,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:36:52,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:36:52,810 INFO L87 Difference]: Start difference. First operand 1047 states and 1288 transitions. Second operand 6 states. [2018-11-06 22:36:54,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:54,521 INFO L93 Difference]: Finished difference Result 3387 states and 4174 transitions. [2018-11-06 22:36:54,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 22:36:54,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2018-11-06 22:36:54,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:54,529 INFO L225 Difference]: With dead ends: 3387 [2018-11-06 22:36:54,529 INFO L226 Difference]: Without dead ends: 2400 [2018-11-06 22:36:54,531 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-06 22:36:54,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2018-11-06 22:36:54,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 1051. [2018-11-06 22:36:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2018-11-06 22:36:54,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1292 transitions. [2018-11-06 22:36:54,565 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1292 transitions. Word has length 162 [2018-11-06 22:36:54,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:54,565 INFO L480 AbstractCegarLoop]: Abstraction has 1051 states and 1292 transitions. [2018-11-06 22:36:54,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:36:54,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1292 transitions. [2018-11-06 22:36:54,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-06 22:36:54,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:54,569 INFO L375 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-11-06 22:36:54,569 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:54,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:54,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1995529036, now seen corresponding path program 1 times [2018-11-06 22:36:54,569 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:54,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:54,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:54,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:54,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:54,764 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:36:54,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:36:54,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:36:54,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:36:54,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:36:54,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:36:54,765 INFO L87 Difference]: Start difference. First operand 1051 states and 1292 transitions. Second operand 6 states. [2018-11-06 22:36:57,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:57,546 INFO L93 Difference]: Finished difference Result 3373 states and 4156 transitions. [2018-11-06 22:36:57,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 22:36:57,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-11-06 22:36:57,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:57,553 INFO L225 Difference]: With dead ends: 3373 [2018-11-06 22:36:57,554 INFO L226 Difference]: Without dead ends: 2382 [2018-11-06 22:36:57,555 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-06 22:36:57,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2382 states. [2018-11-06 22:36:57,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2382 to 977. [2018-11-06 22:36:57,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-11-06 22:36:57,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1192 transitions. [2018-11-06 22:36:57,589 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1192 transitions. Word has length 164 [2018-11-06 22:36:57,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:57,590 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 1192 transitions. [2018-11-06 22:36:57,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:36:57,590 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1192 transitions. [2018-11-06 22:36:57,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-06 22:36:57,593 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:57,593 INFO L375 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-11-06 22:36:57,594 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:57,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:57,594 INFO L82 PathProgramCache]: Analyzing trace with hash 861305591, now seen corresponding path program 1 times [2018-11-06 22:36:57,594 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:57,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:57,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:57,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:57,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:57,883 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:36:57,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:36:57,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:36:57,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:36:57,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:36:57,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:36:57,885 INFO L87 Difference]: Start difference. First operand 977 states and 1192 transitions. Second operand 4 states. [2018-11-06 22:36:58,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:58,369 INFO L93 Difference]: Finished difference Result 2012 states and 2467 transitions. [2018-11-06 22:36:58,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:36:58,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-11-06 22:36:58,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:58,373 INFO L225 Difference]: With dead ends: 2012 [2018-11-06 22:36:58,373 INFO L226 Difference]: Without dead ends: 1095 [2018-11-06 22:36:58,374 INFO L604 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-11-06 22:36:58,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-11-06 22:36:58,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 995. [2018-11-06 22:36:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-11-06 22:36:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1212 transitions. [2018-11-06 22:36:58,403 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1212 transitions. Word has length 176 [2018-11-06 22:36:58,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:58,403 INFO L480 AbstractCegarLoop]: Abstraction has 995 states and 1212 transitions. [2018-11-06 22:36:58,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:36:58,403 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1212 transitions. [2018-11-06 22:36:58,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-06 22:36:58,406 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:58,407 INFO L375 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-11-06 22:36:58,407 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:58,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:58,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1262441833, now seen corresponding path program 1 times [2018-11-06 22:36:58,407 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:58,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:58,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:58,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:58,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:58,517 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:36:58,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:36:58,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:36:58,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:36:58,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:36:58,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:36:58,519 INFO L87 Difference]: Start difference. First operand 995 states and 1212 transitions. Second operand 4 states. [2018-11-06 22:36:58,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:58,885 INFO L93 Difference]: Finished difference Result 2220 states and 2722 transitions. [2018-11-06 22:36:58,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:36:58,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-11-06 22:36:58,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:58,892 INFO L225 Difference]: With dead ends: 2220 [2018-11-06 22:36:58,892 INFO L226 Difference]: Without dead ends: 1285 [2018-11-06 22:36:58,893 INFO L604 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-11-06 22:36:58,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2018-11-06 22:36:58,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1013. [2018-11-06 22:36:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-11-06 22:36:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1232 transitions. [2018-11-06 22:36:58,924 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1232 transitions. Word has length 176 [2018-11-06 22:36:58,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:36:58,924 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 1232 transitions. [2018-11-06 22:36:58,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:36:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1232 transitions. [2018-11-06 22:36:58,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-06 22:36:58,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:36:58,928 INFO L375 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-11-06 22:36:58,928 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:36:58,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:36:58,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1941340786, now seen corresponding path program 1 times [2018-11-06 22:36:58,929 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:36:58,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:36:58,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:58,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:36:58,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:36:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:36:59,237 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:36:59,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:36:59,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:36:59,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:36:59,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:36:59,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:36:59,238 INFO L87 Difference]: Start difference. First operand 1013 states and 1232 transitions. Second operand 4 states. [2018-11-06 22:36:59,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:36:59,978 INFO L93 Difference]: Finished difference Result 1717 states and 2095 transitions. [2018-11-06 22:36:59,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:36:59,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2018-11-06 22:36:59,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:36:59,982 INFO L225 Difference]: With dead ends: 1717 [2018-11-06 22:36:59,982 INFO L226 Difference]: Without dead ends: 1113 [2018-11-06 22:36:59,983 INFO L604 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-11-06 22:36:59,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2018-11-06 22:37:00,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1029. [2018-11-06 22:37:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2018-11-06 22:37:00,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1254 transitions. [2018-11-06 22:37:00,011 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1254 transitions. Word has length 177 [2018-11-06 22:37:00,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:00,012 INFO L480 AbstractCegarLoop]: Abstraction has 1029 states and 1254 transitions. [2018-11-06 22:37:00,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:37:00,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1254 transitions. [2018-11-06 22:37:00,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-06 22:37:00,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:00,016 INFO L375 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-11-06 22:37:00,016 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:00,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:00,016 INFO L82 PathProgramCache]: Analyzing trace with hash 529680082, now seen corresponding path program 1 times [2018-11-06 22:37:00,016 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:00,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:00,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:00,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:00,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:00,323 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:37:00,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:00,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:37:00,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:37:00,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:37:00,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:37:00,325 INFO L87 Difference]: Start difference. First operand 1029 states and 1254 transitions. Second operand 4 states. [2018-11-06 22:37:01,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:01,080 INFO L93 Difference]: Finished difference Result 1913 states and 2343 transitions. [2018-11-06 22:37:01,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:37:01,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2018-11-06 22:37:01,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:01,085 INFO L225 Difference]: With dead ends: 1913 [2018-11-06 22:37:01,085 INFO L226 Difference]: Without dead ends: 1301 [2018-11-06 22:37:01,086 INFO L604 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-11-06 22:37:01,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2018-11-06 22:37:01,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1045. [2018-11-06 22:37:01,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1045 states. [2018-11-06 22:37:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1276 transitions. [2018-11-06 22:37:01,118 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1276 transitions. Word has length 177 [2018-11-06 22:37:01,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:01,118 INFO L480 AbstractCegarLoop]: Abstraction has 1045 states and 1276 transitions. [2018-11-06 22:37:01,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:37:01,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1276 transitions. [2018-11-06 22:37:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-06 22:37:01,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:01,122 INFO L375 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-11-06 22:37:01,122 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:01,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:01,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1272780974, now seen corresponding path program 1 times [2018-11-06 22:37:01,123 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:01,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:01,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:01,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:01,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:01,456 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:37:01,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:01,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:37:01,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:37:01,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:37:01,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:37:01,458 INFO L87 Difference]: Start difference. First operand 1045 states and 1276 transitions. Second operand 4 states. [2018-11-06 22:37:02,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:02,055 INFO L93 Difference]: Finished difference Result 2114 states and 2589 transitions. [2018-11-06 22:37:02,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:37:02,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-11-06 22:37:02,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:02,067 INFO L225 Difference]: With dead ends: 2114 [2018-11-06 22:37:02,067 INFO L226 Difference]: Without dead ends: 1129 [2018-11-06 22:37:02,069 INFO L604 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-11-06 22:37:02,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2018-11-06 22:37:02,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1045. [2018-11-06 22:37:02,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1045 states. [2018-11-06 22:37:02,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1274 transitions. [2018-11-06 22:37:02,129 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1274 transitions. Word has length 178 [2018-11-06 22:37:02,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:02,130 INFO L480 AbstractCegarLoop]: Abstraction has 1045 states and 1274 transitions. [2018-11-06 22:37:02,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:37:02,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1274 transitions. [2018-11-06 22:37:02,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-06 22:37:02,132 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:02,133 INFO L375 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-11-06 22:37:02,133 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:02,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:02,133 INFO L82 PathProgramCache]: Analyzing trace with hash -2084589838, now seen corresponding path program 1 times [2018-11-06 22:37:02,134 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:02,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:02,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:02,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:02,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:02,435 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:37:02,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:02,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:37:02,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:37:02,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:37:02,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:37:02,437 INFO L87 Difference]: Start difference. First operand 1045 states and 1274 transitions. Second operand 4 states. [2018-11-06 22:37:03,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:03,411 INFO L93 Difference]: Finished difference Result 2286 states and 2800 transitions. [2018-11-06 22:37:03,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:37:03,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-11-06 22:37:03,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:03,416 INFO L225 Difference]: With dead ends: 2286 [2018-11-06 22:37:03,416 INFO L226 Difference]: Without dead ends: 1301 [2018-11-06 22:37:03,417 INFO L604 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-11-06 22:37:03,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2018-11-06 22:37:03,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1045. [2018-11-06 22:37:03,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1045 states. [2018-11-06 22:37:03,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1272 transitions. [2018-11-06 22:37:03,446 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1272 transitions. Word has length 178 [2018-11-06 22:37:03,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:03,447 INFO L480 AbstractCegarLoop]: Abstraction has 1045 states and 1272 transitions. [2018-11-06 22:37:03,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:37:03,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1272 transitions. [2018-11-06 22:37:03,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-06 22:37:03,449 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:03,450 INFO L375 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-11-06 22:37:03,450 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:03,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:03,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1195803767, now seen corresponding path program 1 times [2018-11-06 22:37:03,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:03,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:03,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:03,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:03,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:03,705 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:37:03,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:03,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:37:03,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:37:03,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:37:03,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:37:03,707 INFO L87 Difference]: Start difference. First operand 1045 states and 1272 transitions. Second operand 4 states. [2018-11-06 22:37:03,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:03,985 INFO L93 Difference]: Finished difference Result 1739 states and 2120 transitions. [2018-11-06 22:37:03,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:37:03,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-11-06 22:37:03,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:03,993 INFO L225 Difference]: With dead ends: 1739 [2018-11-06 22:37:03,993 INFO L226 Difference]: Without dead ends: 1119 [2018-11-06 22:37:03,995 INFO L604 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-11-06 22:37:03,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-11-06 22:37:04,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1049. [2018-11-06 22:37:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1049 states. [2018-11-06 22:37:04,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1276 transitions. [2018-11-06 22:37:04,022 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1276 transitions. Word has length 179 [2018-11-06 22:37:04,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:04,023 INFO L480 AbstractCegarLoop]: Abstraction has 1049 states and 1276 transitions. [2018-11-06 22:37:04,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:37:04,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1276 transitions. [2018-11-06 22:37:04,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-06 22:37:04,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:04,025 INFO L375 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-11-06 22:37:04,026 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:04,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:04,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1799532759, now seen corresponding path program 1 times [2018-11-06 22:37:04,026 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:04,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:04,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:04,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:04,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:04,246 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:37:04,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:04,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:37:04,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:37:04,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:37:04,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:37:04,247 INFO L87 Difference]: Start difference. First operand 1049 states and 1276 transitions. Second operand 4 states. [2018-11-06 22:37:04,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:04,633 INFO L93 Difference]: Finished difference Result 1917 states and 2341 transitions. [2018-11-06 22:37:04,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:37:04,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-11-06 22:37:04,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:04,639 INFO L225 Difference]: With dead ends: 1917 [2018-11-06 22:37:04,639 INFO L226 Difference]: Without dead ends: 1295 [2018-11-06 22:37:04,640 INFO L604 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-11-06 22:37:04,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2018-11-06 22:37:04,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1053. [2018-11-06 22:37:04,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2018-11-06 22:37:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1280 transitions. [2018-11-06 22:37:04,670 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1280 transitions. Word has length 179 [2018-11-06 22:37:04,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:04,670 INFO L480 AbstractCegarLoop]: Abstraction has 1053 states and 1280 transitions. [2018-11-06 22:37:04,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:37:04,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1280 transitions. [2018-11-06 22:37:04,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-06 22:37:04,672 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:04,673 INFO L375 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-11-06 22:37:04,673 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:04,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:04,673 INFO L82 PathProgramCache]: Analyzing trace with hash 474206253, now seen corresponding path program 1 times [2018-11-06 22:37:04,673 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:04,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:04,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:04,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:04,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:04,867 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:37:04,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:04,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:37:04,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:37:04,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:37:04,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:37:04,869 INFO L87 Difference]: Start difference. First operand 1053 states and 1280 transitions. Second operand 4 states. [2018-11-06 22:37:05,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:05,130 INFO L93 Difference]: Finished difference Result 2116 states and 2580 transitions. [2018-11-06 22:37:05,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:37:05,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-11-06 22:37:05,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:05,143 INFO L225 Difference]: With dead ends: 2116 [2018-11-06 22:37:05,143 INFO L226 Difference]: Without dead ends: 1123 [2018-11-06 22:37:05,148 INFO L604 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-11-06 22:37:05,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-11-06 22:37:05,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1053. [2018-11-06 22:37:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2018-11-06 22:37:05,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1278 transitions. [2018-11-06 22:37:05,176 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1278 transitions. Word has length 180 [2018-11-06 22:37:05,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:05,176 INFO L480 AbstractCegarLoop]: Abstraction has 1053 states and 1278 transitions. [2018-11-06 22:37:05,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:37:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1278 transitions. [2018-11-06 22:37:05,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-06 22:37:05,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:05,179 INFO L375 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-11-06 22:37:05,179 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:05,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:05,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1350147591, now seen corresponding path program 1 times [2018-11-06 22:37:05,179 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:05,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:05,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:05,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:05,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:37:05,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:05,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:37:05,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:37:05,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:37:05,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:37:05,366 INFO L87 Difference]: Start difference. First operand 1053 states and 1278 transitions. Second operand 4 states. [2018-11-06 22:37:05,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:05,626 INFO L93 Difference]: Finished difference Result 2112 states and 2572 transitions. [2018-11-06 22:37:05,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:37:05,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-11-06 22:37:05,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:05,632 INFO L225 Difference]: With dead ends: 2112 [2018-11-06 22:37:05,632 INFO L226 Difference]: Without dead ends: 1119 [2018-11-06 22:37:05,634 INFO L604 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-11-06 22:37:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-11-06 22:37:05,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1053. [2018-11-06 22:37:05,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2018-11-06 22:37:05,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1276 transitions. [2018-11-06 22:37:05,656 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1276 transitions. Word has length 180 [2018-11-06 22:37:05,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:05,656 INFO L480 AbstractCegarLoop]: Abstraction has 1053 states and 1276 transitions. [2018-11-06 22:37:05,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:37:05,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1276 transitions. [2018-11-06 22:37:05,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-06 22:37:05,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:05,658 INFO L375 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-11-06 22:37:05,658 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:05,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:05,659 INFO L82 PathProgramCache]: Analyzing trace with hash 2009935821, now seen corresponding path program 1 times [2018-11-06 22:37:05,659 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:05,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:05,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:05,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:05,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:05,809 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:37:05,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:05,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:37:05,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:37:05,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:37:05,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:37:05,810 INFO L87 Difference]: Start difference. First operand 1053 states and 1276 transitions. Second operand 4 states. [2018-11-06 22:37:06,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:06,215 INFO L93 Difference]: Finished difference Result 2288 states and 2787 transitions. [2018-11-06 22:37:06,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:37:06,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-11-06 22:37:06,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:06,218 INFO L225 Difference]: With dead ends: 2288 [2018-11-06 22:37:06,218 INFO L226 Difference]: Without dead ends: 1295 [2018-11-06 22:37:06,220 INFO L604 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-11-06 22:37:06,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2018-11-06 22:37:06,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1053. [2018-11-06 22:37:06,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2018-11-06 22:37:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1274 transitions. [2018-11-06 22:37:06,249 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1274 transitions. Word has length 180 [2018-11-06 22:37:06,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:06,250 INFO L480 AbstractCegarLoop]: Abstraction has 1053 states and 1274 transitions. [2018-11-06 22:37:06,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:37:06,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1274 transitions. [2018-11-06 22:37:06,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-06 22:37:06,252 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:06,252 INFO L375 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-11-06 22:37:06,252 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:06,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:06,253 INFO L82 PathProgramCache]: Analyzing trace with hash 185581977, now seen corresponding path program 1 times [2018-11-06 22:37:06,253 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:06,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:06,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:06,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:06,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:06,547 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:37:06,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:06,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:37:06,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:37:06,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:37:06,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:37:06,549 INFO L87 Difference]: Start difference. First operand 1053 states and 1274 transitions. Second operand 4 states. [2018-11-06 22:37:07,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:07,058 INFO L93 Difference]: Finished difference Result 2284 states and 2779 transitions. [2018-11-06 22:37:07,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:37:07,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-11-06 22:37:07,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:07,060 INFO L225 Difference]: With dead ends: 2284 [2018-11-06 22:37:07,060 INFO L226 Difference]: Without dead ends: 1291 [2018-11-06 22:37:07,062 INFO L604 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-11-06 22:37:07,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2018-11-06 22:37:07,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1053. [2018-11-06 22:37:07,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2018-11-06 22:37:07,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1272 transitions. [2018-11-06 22:37:07,089 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1272 transitions. Word has length 180 [2018-11-06 22:37:07,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:07,089 INFO L480 AbstractCegarLoop]: Abstraction has 1053 states and 1272 transitions. [2018-11-06 22:37:07,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:37:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1272 transitions. [2018-11-06 22:37:07,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-06 22:37:07,092 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:07,092 INFO L375 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-11-06 22:37:07,092 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:07,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:07,093 INFO L82 PathProgramCache]: Analyzing trace with hash -393472632, now seen corresponding path program 1 times [2018-11-06 22:37:07,093 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:07,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:07,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:07,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:07,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:37:07,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:07,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:37:07,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:37:07,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:37:07,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:37:07,395 INFO L87 Difference]: Start difference. First operand 1053 states and 1272 transitions. Second operand 4 states. [2018-11-06 22:37:07,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:07,839 INFO L93 Difference]: Finished difference Result 2086 states and 2530 transitions. [2018-11-06 22:37:07,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:37:07,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-11-06 22:37:07,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:07,840 INFO L225 Difference]: With dead ends: 2086 [2018-11-06 22:37:07,841 INFO L226 Difference]: Without dead ends: 1093 [2018-11-06 22:37:07,842 INFO L604 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-11-06 22:37:07,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2018-11-06 22:37:07,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1053. [2018-11-06 22:37:07,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2018-11-06 22:37:07,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1270 transitions. [2018-11-06 22:37:07,869 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1270 transitions. Word has length 182 [2018-11-06 22:37:07,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:07,869 INFO L480 AbstractCegarLoop]: Abstraction has 1053 states and 1270 transitions. [2018-11-06 22:37:07,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:37:07,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1270 transitions. [2018-11-06 22:37:07,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-06 22:37:07,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:07,871 INFO L375 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-11-06 22:37:07,871 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:07,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:07,871 INFO L82 PathProgramCache]: Analyzing trace with hash 337740511, now seen corresponding path program 1 times [2018-11-06 22:37:07,872 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:07,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:07,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:07,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:07,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:07,993 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-06 22:37:07,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:07,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:37:07,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:37:07,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:37:07,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:37:07,994 INFO L87 Difference]: Start difference. First operand 1053 states and 1270 transitions. Second operand 3 states. [2018-11-06 22:37:08,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:08,162 INFO L93 Difference]: Finished difference Result 2052 states and 2489 transitions. [2018-11-06 22:37:08,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:37:08,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-11-06 22:37:08,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:08,164 INFO L225 Difference]: With dead ends: 2052 [2018-11-06 22:37:08,164 INFO L226 Difference]: Without dead ends: 1431 [2018-11-06 22:37:08,165 INFO L604 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-11-06 22:37:08,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2018-11-06 22:37:08,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1431. [2018-11-06 22:37:08,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2018-11-06 22:37:08,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1732 transitions. [2018-11-06 22:37:08,194 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1732 transitions. Word has length 182 [2018-11-06 22:37:08,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:08,194 INFO L480 AbstractCegarLoop]: Abstraction has 1431 states and 1732 transitions. [2018-11-06 22:37:08,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:37:08,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1732 transitions. [2018-11-06 22:37:08,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-06 22:37:08,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:08,196 INFO L375 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-11-06 22:37:08,196 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:08,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:08,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1103319563, now seen corresponding path program 1 times [2018-11-06 22:37:08,196 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:08,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:08,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:08,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:08,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:08,305 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-06 22:37:08,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:08,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:37:08,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:37:08,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:37:08,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:37:08,307 INFO L87 Difference]: Start difference. First operand 1431 states and 1732 transitions. Second operand 3 states. [2018-11-06 22:37:08,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:08,442 INFO L93 Difference]: Finished difference Result 1811 states and 2198 transitions. [2018-11-06 22:37:08,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:37:08,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2018-11-06 22:37:08,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:08,446 INFO L225 Difference]: With dead ends: 1811 [2018-11-06 22:37:08,447 INFO L226 Difference]: Without dead ends: 1809 [2018-11-06 22:37:08,447 INFO L604 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-11-06 22:37:08,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2018-11-06 22:37:08,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2018-11-06 22:37:08,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1809 states. [2018-11-06 22:37:08,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2195 transitions. [2018-11-06 22:37:08,486 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2195 transitions. Word has length 184 [2018-11-06 22:37:08,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:08,487 INFO L480 AbstractCegarLoop]: Abstraction has 1809 states and 2195 transitions. [2018-11-06 22:37:08,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:37:08,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2195 transitions. [2018-11-06 22:37:08,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-06 22:37:08,490 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:08,490 INFO L375 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-11-06 22:37:08,491 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:08,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:08,491 INFO L82 PathProgramCache]: Analyzing trace with hash -2004616657, now seen corresponding path program 1 times [2018-11-06 22:37:08,491 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:08,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:08,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:08,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:08,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-06 22:37:08,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:08,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:37:08,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:37:08,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:37:08,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:37:08,617 INFO L87 Difference]: Start difference. First operand 1809 states and 2195 transitions. Second operand 3 states. [2018-11-06 22:37:08,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:08,746 INFO L93 Difference]: Finished difference Result 3179 states and 3866 transitions. [2018-11-06 22:37:08,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:37:08,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2018-11-06 22:37:08,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:08,749 INFO L225 Difference]: With dead ends: 3179 [2018-11-06 22:37:08,749 INFO L226 Difference]: Without dead ends: 1802 [2018-11-06 22:37:08,751 INFO L604 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-11-06 22:37:08,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2018-11-06 22:37:08,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2018-11-06 22:37:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2018-11-06 22:37:08,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2181 transitions. [2018-11-06 22:37:08,790 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2181 transitions. Word has length 223 [2018-11-06 22:37:08,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:08,790 INFO L480 AbstractCegarLoop]: Abstraction has 1802 states and 2181 transitions. [2018-11-06 22:37:08,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:37:08,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2181 transitions. [2018-11-06 22:37:08,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-06 22:37:08,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:08,794 INFO L375 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-11-06 22:37:08,794 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:08,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:08,794 INFO L82 PathProgramCache]: Analyzing trace with hash -900882395, now seen corresponding path program 1 times [2018-11-06 22:37:08,794 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:08,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:08,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:08,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:08,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:09,116 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-06 22:37:09,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:09,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:37:09,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:37:09,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:37:09,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:37:09,117 INFO L87 Difference]: Start difference. First operand 1802 states and 2181 transitions. Second operand 4 states. [2018-11-06 22:37:09,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:09,591 INFO L93 Difference]: Finished difference Result 3977 states and 4852 transitions. [2018-11-06 22:37:09,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:37:09,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2018-11-06 22:37:09,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:09,594 INFO L225 Difference]: With dead ends: 3977 [2018-11-06 22:37:09,594 INFO L226 Difference]: Without dead ends: 2235 [2018-11-06 22:37:09,596 INFO L604 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-11-06 22:37:09,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2235 states. [2018-11-06 22:37:09,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2235 to 2017. [2018-11-06 22:37:09,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2017 states. [2018-11-06 22:37:09,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2486 transitions. [2018-11-06 22:37:09,644 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2486 transitions. Word has length 227 [2018-11-06 22:37:09,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:09,644 INFO L480 AbstractCegarLoop]: Abstraction has 2017 states and 2486 transitions. [2018-11-06 22:37:09,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:37:09,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2486 transitions. [2018-11-06 22:37:09,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-06 22:37:09,648 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:09,649 INFO L375 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-11-06 22:37:09,649 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:09,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:09,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1738027222, now seen corresponding path program 1 times [2018-11-06 22:37:09,650 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:09,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:09,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:09,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:09,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:09,949 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-06 22:37:09,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:09,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:37:09,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:37:09,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:37:09,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:37:09,950 INFO L87 Difference]: Start difference. First operand 2017 states and 2486 transitions. Second operand 6 states. [2018-11-06 22:37:10,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:10,722 INFO L93 Difference]: Finished difference Result 6354 states and 7819 transitions. [2018-11-06 22:37:10,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 22:37:10,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2018-11-06 22:37:10,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:10,728 INFO L225 Difference]: With dead ends: 6354 [2018-11-06 22:37:10,728 INFO L226 Difference]: Without dead ends: 4397 [2018-11-06 22:37:10,731 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-06 22:37:10,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4397 states. [2018-11-06 22:37:10,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4397 to 2037. [2018-11-06 22:37:10,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2037 states. [2018-11-06 22:37:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 2506 transitions. [2018-11-06 22:37:10,796 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 2506 transitions. Word has length 237 [2018-11-06 22:37:10,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:10,796 INFO L480 AbstractCegarLoop]: Abstraction has 2037 states and 2506 transitions. [2018-11-06 22:37:10,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:37:10,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 2506 transitions. [2018-11-06 22:37:10,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-11-06 22:37:10,800 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:10,800 INFO L375 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-11-06 22:37:10,801 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:10,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:10,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1902060126, now seen corresponding path program 1 times [2018-11-06 22:37:10,801 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:10,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:10,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:10,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:10,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:11,125 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-06 22:37:11,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:11,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:37:11,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:37:11,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:37:11,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:37:11,126 INFO L87 Difference]: Start difference. First operand 2037 states and 2506 transitions. Second operand 4 states. [2018-11-06 22:37:11,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:11,433 INFO L93 Difference]: Finished difference Result 4382 states and 5407 transitions. [2018-11-06 22:37:11,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:37:11,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 255 [2018-11-06 22:37:11,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:11,437 INFO L225 Difference]: With dead ends: 4382 [2018-11-06 22:37:11,437 INFO L226 Difference]: Without dead ends: 2405 [2018-11-06 22:37:11,439 INFO L604 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-11-06 22:37:11,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2018-11-06 22:37:11,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2082. [2018-11-06 22:37:11,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2018-11-06 22:37:11,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 2556 transitions. [2018-11-06 22:37:11,492 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 2556 transitions. Word has length 255 [2018-11-06 22:37:11,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:11,493 INFO L480 AbstractCegarLoop]: Abstraction has 2082 states and 2556 transitions. [2018-11-06 22:37:11,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:37:11,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2556 transitions. [2018-11-06 22:37:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-11-06 22:37:11,497 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:11,497 INFO L375 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-11-06 22:37:11,497 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:11,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:11,498 INFO L82 PathProgramCache]: Analyzing trace with hash 2110019479, now seen corresponding path program 1 times [2018-11-06 22:37:11,498 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:11,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:11,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:11,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:11,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-11-06 22:37:11,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:11,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:37:11,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:37:11,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:37:11,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:37:11,789 INFO L87 Difference]: Start difference. First operand 2082 states and 2556 transitions. Second operand 4 states. [2018-11-06 22:37:12,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:12,167 INFO L93 Difference]: Finished difference Result 3915 states and 4827 transitions. [2018-11-06 22:37:12,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:37:12,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2018-11-06 22:37:12,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:12,170 INFO L225 Difference]: With dead ends: 3915 [2018-11-06 22:37:12,170 INFO L226 Difference]: Without dead ends: 2321 [2018-11-06 22:37:12,172 INFO L604 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-11-06 22:37:12,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2018-11-06 22:37:12,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2206. [2018-11-06 22:37:12,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2206 states. [2018-11-06 22:37:12,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 2728 transitions. [2018-11-06 22:37:12,241 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 2728 transitions. Word has length 256 [2018-11-06 22:37:12,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:12,242 INFO L480 AbstractCegarLoop]: Abstraction has 2206 states and 2728 transitions. [2018-11-06 22:37:12,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:37:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 2728 transitions. [2018-11-06 22:37:12,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-11-06 22:37:12,247 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:12,247 INFO L375 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-11-06 22:37:12,247 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:12,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:12,248 INFO L82 PathProgramCache]: Analyzing trace with hash -159100679, now seen corresponding path program 1 times [2018-11-06 22:37:12,248 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:12,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:12,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:12,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:12,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-06 22:37:12,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:12,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:37:12,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:37:12,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:37:12,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:37:12,613 INFO L87 Difference]: Start difference. First operand 2206 states and 2728 transitions. Second operand 4 states. [2018-11-06 22:37:12,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:12,923 INFO L93 Difference]: Finished difference Result 4675 states and 5796 transitions. [2018-11-06 22:37:12,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:37:12,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 257 [2018-11-06 22:37:12,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:12,925 INFO L225 Difference]: With dead ends: 4675 [2018-11-06 22:37:12,925 INFO L226 Difference]: Without dead ends: 2529 [2018-11-06 22:37:12,928 INFO L604 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-11-06 22:37:12,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2018-11-06 22:37:12,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2216. [2018-11-06 22:37:12,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-11-06 22:37:12,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 2738 transitions. [2018-11-06 22:37:12,976 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 2738 transitions. Word has length 257 [2018-11-06 22:37:12,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:12,976 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 2738 transitions. [2018-11-06 22:37:12,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:37:12,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2738 transitions. [2018-11-06 22:37:12,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-11-06 22:37:12,980 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:12,980 INFO L375 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-11-06 22:37:12,980 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:12,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:12,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1240517652, now seen corresponding path program 1 times [2018-11-06 22:37:12,981 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:12,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:12,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:12,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:12,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:13,145 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-06 22:37:13,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:13,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:37:13,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:37:13,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:37:13,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:37:13,147 INFO L87 Difference]: Start difference. First operand 2216 states and 2738 transitions. Second operand 4 states. [2018-11-06 22:37:13,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:13,459 INFO L93 Difference]: Finished difference Result 4685 states and 5801 transitions. [2018-11-06 22:37:13,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:37:13,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 259 [2018-11-06 22:37:13,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:13,464 INFO L225 Difference]: With dead ends: 4685 [2018-11-06 22:37:13,465 INFO L226 Difference]: Without dead ends: 2529 [2018-11-06 22:37:13,467 INFO L604 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-11-06 22:37:13,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2018-11-06 22:37:13,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2226. [2018-11-06 22:37:13,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2226 states. [2018-11-06 22:37:13,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 2748 transitions. [2018-11-06 22:37:13,524 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 2748 transitions. Word has length 259 [2018-11-06 22:37:13,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:13,525 INFO L480 AbstractCegarLoop]: Abstraction has 2226 states and 2748 transitions. [2018-11-06 22:37:13,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:37:13,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 2748 transitions. [2018-11-06 22:37:13,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-11-06 22:37:13,529 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:13,529 INFO L375 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-11-06 22:37:13,529 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:13,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:13,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1925027808, now seen corresponding path program 1 times [2018-11-06 22:37:13,530 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:13,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:13,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:13,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:13,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-06 22:37:13,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:13,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:37:13,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:37:13,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:37:13,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:37:13,824 INFO L87 Difference]: Start difference. First operand 2226 states and 2748 transitions. Second operand 4 states. [2018-11-06 22:37:14,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:14,229 INFO L93 Difference]: Finished difference Result 4685 states and 5796 transitions. [2018-11-06 22:37:14,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:37:14,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 259 [2018-11-06 22:37:14,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:14,232 INFO L225 Difference]: With dead ends: 4685 [2018-11-06 22:37:14,232 INFO L226 Difference]: Without dead ends: 2519 [2018-11-06 22:37:14,234 INFO L604 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-11-06 22:37:14,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2018-11-06 22:37:14,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 2226. [2018-11-06 22:37:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2226 states. [2018-11-06 22:37:14,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 2743 transitions. [2018-11-06 22:37:14,273 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 2743 transitions. Word has length 259 [2018-11-06 22:37:14,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:14,273 INFO L480 AbstractCegarLoop]: Abstraction has 2226 states and 2743 transitions. [2018-11-06 22:37:14,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:37:14,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 2743 transitions. [2018-11-06 22:37:14,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-06 22:37:14,276 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:14,276 INFO L375 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-11-06 22:37:14,276 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:14,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:14,277 INFO L82 PathProgramCache]: Analyzing trace with hash -150768721, now seen corresponding path program 1 times [2018-11-06 22:37:14,277 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:14,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:14,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:14,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:14,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-06 22:37:14,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:14,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:37:14,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:37:14,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:37:14,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:37:14,614 INFO L87 Difference]: Start difference. First operand 2226 states and 2743 transitions. Second operand 4 states. [2018-11-06 22:37:15,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:15,167 INFO L93 Difference]: Finished difference Result 4620 states and 5711 transitions. [2018-11-06 22:37:15,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:37:15,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2018-11-06 22:37:15,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:15,170 INFO L225 Difference]: With dead ends: 4620 [2018-11-06 22:37:15,171 INFO L226 Difference]: Without dead ends: 2454 [2018-11-06 22:37:15,173 INFO L604 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-11-06 22:37:15,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2018-11-06 22:37:15,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2236. [2018-11-06 22:37:15,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2236 states. [2018-11-06 22:37:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2753 transitions. [2018-11-06 22:37:15,222 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2753 transitions. Word has length 261 [2018-11-06 22:37:15,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:15,222 INFO L480 AbstractCegarLoop]: Abstraction has 2236 states and 2753 transitions. [2018-11-06 22:37:15,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:37:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2753 transitions. [2018-11-06 22:37:15,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-06 22:37:15,225 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:15,225 INFO L375 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-11-06 22:37:15,225 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:15,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:15,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1424252294, now seen corresponding path program 1 times [2018-11-06 22:37:15,226 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:15,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:15,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:15,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:15,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:15,421 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-06 22:37:15,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:15,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:37:15,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:37:15,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:37:15,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:37:15,422 INFO L87 Difference]: Start difference. First operand 2236 states and 2753 transitions. Second operand 4 states. [2018-11-06 22:37:15,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:15,722 INFO L93 Difference]: Finished difference Result 4805 states and 5946 transitions. [2018-11-06 22:37:15,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:37:15,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2018-11-06 22:37:15,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:15,725 INFO L225 Difference]: With dead ends: 4805 [2018-11-06 22:37:15,725 INFO L226 Difference]: Without dead ends: 2629 [2018-11-06 22:37:15,727 INFO L604 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-11-06 22:37:15,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2018-11-06 22:37:15,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2431. [2018-11-06 22:37:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2431 states. [2018-11-06 22:37:15,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 3028 transitions. [2018-11-06 22:37:15,774 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 3028 transitions. Word has length 261 [2018-11-06 22:37:15,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:15,774 INFO L480 AbstractCegarLoop]: Abstraction has 2431 states and 3028 transitions. [2018-11-06 22:37:15,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:37:15,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 3028 transitions. [2018-11-06 22:37:15,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-06 22:37:15,778 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:15,778 INFO L375 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-11-06 22:37:15,778 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:15,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:15,778 INFO L82 PathProgramCache]: Analyzing trace with hash -302233629, now seen corresponding path program 1 times [2018-11-06 22:37:15,779 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:15,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:15,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:15,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:15,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:15,933 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-11-06 22:37:15,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:15,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:37:15,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:37:15,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:37:15,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:37:15,934 INFO L87 Difference]: Start difference. First operand 2431 states and 3028 transitions. Second operand 3 states. [2018-11-06 22:37:16,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:16,163 INFO L93 Difference]: Finished difference Result 6820 states and 8495 transitions. [2018-11-06 22:37:16,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:37:16,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2018-11-06 22:37:16,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:16,169 INFO L225 Difference]: With dead ends: 6820 [2018-11-06 22:37:16,169 INFO L226 Difference]: Without dead ends: 4449 [2018-11-06 22:37:16,172 INFO L604 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-11-06 22:37:16,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4449 states. [2018-11-06 22:37:16,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4449 to 4445. [2018-11-06 22:37:16,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4445 states. [2018-11-06 22:37:16,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4445 states to 4445 states and 5496 transitions. [2018-11-06 22:37:16,357 INFO L78 Accepts]: Start accepts. Automaton has 4445 states and 5496 transitions. Word has length 265 [2018-11-06 22:37:16,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:16,357 INFO L480 AbstractCegarLoop]: Abstraction has 4445 states and 5496 transitions. [2018-11-06 22:37:16,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:37:16,357 INFO L276 IsEmpty]: Start isEmpty. Operand 4445 states and 5496 transitions. [2018-11-06 22:37:16,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-06 22:37:16,365 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:16,365 INFO L375 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-11-06 22:37:16,365 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:16,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:16,366 INFO L82 PathProgramCache]: Analyzing trace with hash -735962715, now seen corresponding path program 1 times [2018-11-06 22:37:16,366 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:16,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:16,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:16,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:16,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-06 22:37:17,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:17,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:37:17,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:37:17,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:37:17,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:37:17,054 INFO L87 Difference]: Start difference. First operand 4445 states and 5496 transitions. Second operand 6 states. [2018-11-06 22:37:17,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:17,831 INFO L93 Difference]: Finished difference Result 9383 states and 11528 transitions. [2018-11-06 22:37:17,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 22:37:17,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 265 [2018-11-06 22:37:17,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:17,836 INFO L225 Difference]: With dead ends: 9383 [2018-11-06 22:37:17,836 INFO L226 Difference]: Without dead ends: 7012 [2018-11-06 22:37:17,839 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-06 22:37:17,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7012 states. [2018-11-06 22:37:17,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7012 to 4445. [2018-11-06 22:37:17,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4445 states. [2018-11-06 22:37:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4445 states to 4445 states and 5491 transitions. [2018-11-06 22:37:17,931 INFO L78 Accepts]: Start accepts. Automaton has 4445 states and 5491 transitions. Word has length 265 [2018-11-06 22:37:17,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:17,931 INFO L480 AbstractCegarLoop]: Abstraction has 4445 states and 5491 transitions. [2018-11-06 22:37:17,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:37:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 4445 states and 5491 transitions. [2018-11-06 22:37:17,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-06 22:37:17,937 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:17,937 INFO L375 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-11-06 22:37:17,937 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:17,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:17,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1174577124, now seen corresponding path program 1 times [2018-11-06 22:37:17,938 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:17,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:17,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:17,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:17,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-11-06 22:37:18,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:18,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:37:18,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:37:18,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:37:18,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:37:18,257 INFO L87 Difference]: Start difference. First operand 4445 states and 5491 transitions. Second operand 6 states. [2018-11-06 22:37:18,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:18,938 INFO L93 Difference]: Finished difference Result 8456 states and 10411 transitions. [2018-11-06 22:37:18,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 22:37:18,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 266 [2018-11-06 22:37:18,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:18,943 INFO L225 Difference]: With dead ends: 8456 [2018-11-06 22:37:18,943 INFO L226 Difference]: Without dead ends: 6558 [2018-11-06 22:37:18,945 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-06 22:37:18,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6558 states. [2018-11-06 22:37:19,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6558 to 4461. [2018-11-06 22:37:19,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4461 states. [2018-11-06 22:37:19,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4461 states to 4461 states and 5507 transitions. [2018-11-06 22:37:19,043 INFO L78 Accepts]: Start accepts. Automaton has 4461 states and 5507 transitions. Word has length 266 [2018-11-06 22:37:19,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:19,043 INFO L480 AbstractCegarLoop]: Abstraction has 4461 states and 5507 transitions. [2018-11-06 22:37:19,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:37:19,043 INFO L276 IsEmpty]: Start isEmpty. Operand 4461 states and 5507 transitions. [2018-11-06 22:37:19,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-11-06 22:37:19,048 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:19,048 INFO L375 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-11-06 22:37:19,048 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:19,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:19,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1500251392, now seen corresponding path program 1 times [2018-11-06 22:37:19,049 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:19,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:19,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:19,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:19,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-06 22:37:19,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:19,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:37:19,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:37:19,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:37:19,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:37:19,396 INFO L87 Difference]: Start difference. First operand 4461 states and 5507 transitions. Second operand 6 states. [2018-11-06 22:37:20,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:20,517 INFO L93 Difference]: Finished difference Result 9423 states and 11558 transitions. [2018-11-06 22:37:20,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 22:37:20,518 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 267 [2018-11-06 22:37:20,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:20,523 INFO L225 Difference]: With dead ends: 9423 [2018-11-06 22:37:20,523 INFO L226 Difference]: Without dead ends: 7036 [2018-11-06 22:37:20,526 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-06 22:37:20,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7036 states. [2018-11-06 22:37:20,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7036 to 4461. [2018-11-06 22:37:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4461 states. [2018-11-06 22:37:20,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4461 states to 4461 states and 5502 transitions. [2018-11-06 22:37:20,631 INFO L78 Accepts]: Start accepts. Automaton has 4461 states and 5502 transitions. Word has length 267 [2018-11-06 22:37:20,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:20,632 INFO L480 AbstractCegarLoop]: Abstraction has 4461 states and 5502 transitions. [2018-11-06 22:37:20,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:37:20,632 INFO L276 IsEmpty]: Start isEmpty. Operand 4461 states and 5502 transitions. [2018-11-06 22:37:20,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-11-06 22:37:20,638 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:20,638 INFO L375 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-11-06 22:37:20,638 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:20,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:20,638 INFO L82 PathProgramCache]: Analyzing trace with hash -122516888, now seen corresponding path program 1 times [2018-11-06 22:37:20,639 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:20,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:20,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:20,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:20,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:21,210 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-11-06 22:37:21,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:21,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-06 22:37:21,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 22:37:21,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 22:37:21,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-06 22:37:21,211 INFO L87 Difference]: Start difference. First operand 4461 states and 5502 transitions. Second operand 10 states. [2018-11-06 22:37:21,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:21,809 INFO L93 Difference]: Finished difference Result 8870 states and 10949 transitions. [2018-11-06 22:37:21,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 22:37:21,809 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 268 [2018-11-06 22:37:21,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:21,813 INFO L225 Difference]: With dead ends: 8870 [2018-11-06 22:37:21,813 INFO L226 Difference]: Without dead ends: 4469 [2018-11-06 22:37:21,817 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-11-06 22:37:21,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4469 states. [2018-11-06 22:37:22,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4469 to 4467. [2018-11-06 22:37:22,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4467 states. [2018-11-06 22:37:22,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4467 states to 4467 states and 5508 transitions. [2018-11-06 22:37:22,013 INFO L78 Accepts]: Start accepts. Automaton has 4467 states and 5508 transitions. Word has length 268 [2018-11-06 22:37:22,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:22,014 INFO L480 AbstractCegarLoop]: Abstraction has 4467 states and 5508 transitions. [2018-11-06 22:37:22,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 22:37:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 4467 states and 5508 transitions. [2018-11-06 22:37:22,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-11-06 22:37:22,020 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:22,020 INFO L375 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-11-06 22:37:22,020 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:22,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:22,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1483670493, now seen corresponding path program 1 times [2018-11-06 22:37:22,021 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:22,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:22,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:22,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:22,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:37:22,285 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-06 22:37:22,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:37:22,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:37:22,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:37:22,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:37:22,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:37:22,287 INFO L87 Difference]: Start difference. First operand 4467 states and 5508 transitions. Second operand 6 states. [2018-11-06 22:37:23,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:37:23,642 INFO L93 Difference]: Finished difference Result 11198 states and 13824 transitions. [2018-11-06 22:37:23,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 22:37:23,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 300 [2018-11-06 22:37:23,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:37:23,652 INFO L225 Difference]: With dead ends: 11198 [2018-11-06 22:37:23,652 INFO L226 Difference]: Without dead ends: 6797 [2018-11-06 22:37:23,658 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-06 22:37:23,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6797 states. [2018-11-06 22:37:23,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6797 to 4478. [2018-11-06 22:37:23,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4478 states. [2018-11-06 22:37:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4478 states to 4478 states and 5521 transitions. [2018-11-06 22:37:23,817 INFO L78 Accepts]: Start accepts. Automaton has 4478 states and 5521 transitions. Word has length 300 [2018-11-06 22:37:23,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:37:23,817 INFO L480 AbstractCegarLoop]: Abstraction has 4478 states and 5521 transitions. [2018-11-06 22:37:23,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:37:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 4478 states and 5521 transitions. [2018-11-06 22:37:23,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-11-06 22:37:23,821 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:37:23,822 INFO L375 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-11-06 22:37:23,822 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:37:23,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:37:23,822 INFO L82 PathProgramCache]: Analyzing trace with hash 907633125, now seen corresponding path program 1 times [2018-11-06 22:37:23,822 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:37:23,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:37:23,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:23,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:37:23,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:37:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-06 22:37:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-06 22:37:24,177 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-06 22:37:24,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:37:24 BoogieIcfgContainer [2018-11-06 22:37:24,385 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 22:37:24,388 INFO L168 Benchmark]: Toolchain (without parser) took 51585.48 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -843.3 MB). Peak memory consumption was 491.0 MB. Max. memory is 7.1 GB. [2018-11-06 22:37:24,391 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 22:37:24,392 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1558.10 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -729.4 MB). Peak memory consumption was 105.2 MB. Max. memory is 7.1 GB. [2018-11-06 22:37:24,394 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.58 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2018-11-06 22:37:24,395 INFO L168 Benchmark]: Boogie Preprocessor took 123.97 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 22:37:24,396 INFO L168 Benchmark]: RCFGBuilder took 2245.50 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 94.7 MB). Peak memory consumption was 94.7 MB. Max. memory is 7.1 GB. [2018-11-06 22:37:24,397 INFO L168 Benchmark]: TraceAbstraction took 47563.48 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 580.4 MB). Free memory was 2.0 GB in the beginning and 2.3 GB in the end (delta: -222.6 MB). Peak memory consumption was 357.8 MB. Max. memory is 7.1 GB. [2018-11-06 22:37:24,403 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 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1558.10 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -729.4 MB). Peak memory consumption was 105.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 87.58 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.97 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 2245.50 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 94.7 MB). Peak memory consumption was 94.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 47563.48 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 580.4 MB). Free memory was 2.0 GB in the beginning and 2.3 GB in the end (delta: -222.6 MB). Peak memory consumption was 357.8 MB. Max. memory is 7.1 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={20483:0}] [L1062] SSL *s ; VAL [init=1, SSLv3_client_data={20483:0}] [L1066] EXPR, FCALL malloc (sizeof (SSL)) VAL [init=1, SSLv3_client_data={20483:0}] [L1066] s = malloc (sizeof (SSL)) VAL [init=1, SSLv3_client_data={20483:0}] [L1067] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) VAL [init=1, SSLv3_client_data={20483:0}] [L1067] FCALL s->s3 = malloc(sizeof(struct ssl3_state_st)) VAL [init=1, SSLv3_client_data={20483:0}] [L1068] EXPR, FCALL malloc(sizeof(SSL_CTX)) VAL [init=1, SSLv3_client_data={20483:0}] [L1068] FCALL s->ctx = malloc(sizeof(SSL_CTX)) VAL [init=1, SSLv3_client_data={20483:0}] [L1069] FCALL s->state = 12292 VAL [init=1, SSLv3_client_data={20483:0}] [L1070] FCALL s->version = __VERIFIER_nondet_int() VAL [init=1, SSLv3_client_data={20483: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={20483:0}] [L1101] FCALL s->state = 12292 VAL [init=1, SSLv3_client_data={20483:0}] [L1102] FCALL s->hit = __VERIFIER_nondet_int() VAL [init=1, SSLv3_client_data={20483:0}] [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 VAL [init=1, SSLv3_client_data={20483:0}] [L1108] EXPR, FCALL malloc(sizeof(int)) VAL [init=1, SSLv3_client_data={20483:0}] [L1108] tmp___0 = (int*)malloc(sizeof(int)) VAL [init=1, SSLv3_client_data={20483:0}] [L1109] FCALL *tmp___0 = 0 VAL [init=1, SSLv3_client_data={20483:0}] [L1110] EXPR, FCALL s->info_callback VAL [init=1, SSLv3_client_data={20483: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={20483:0}] [L1111] cb = s->info_callback [L1119] EXPR, FCALL s->in_handshake VAL [init=1, SSLv3_client_data={20483:0}] [L1119] FCALL s->in_handshake += 1 VAL [init=1, SSLv3_client_data={20483:0}] [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={20483:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={20483:0}] [L1132] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1133] COND TRUE s->state == 12292 [L1236] FCALL s->new_session = 1 VAL [init=1, SSLv3_client_data={20483:0}] [L1237] FCALL s->state = 4096 VAL [init=1, SSLv3_client_data={20483:0}] [L1238] EXPR, FCALL s->ctx VAL [init=1, SSLv3_client_data={20483:0}] [L1238] EXPR, FCALL (s->ctx)->stats.sess_connect_renegotiate VAL [init=1, SSLv3_client_data={20483:0}] [L1238] FCALL (s->ctx)->stats.sess_connect_renegotiate += 1 VAL [init=1, SSLv3_client_data={20483:0}] [L1243] FCALL s->server = 0 VAL [init=1, SSLv3_client_data={20483:0}] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={20483:0}] [L1249] EXPR, FCALL s->version VAL [init=1, SSLv3_client_data={20483:0}] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] FCALL s->type = 4096 VAL [init=1, SSLv3_client_data={20483:0}] [L1256] EXPR, FCALL s->init_buf VAL [init=1, SSLv3_client_data={20483: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={20483:0}] [L1282] FCALL s->state = 4368 VAL [init=1, SSLv3_client_data={20483:0}] [L1283] EXPR, FCALL s->ctx VAL [init=1, SSLv3_client_data={20483:0}] [L1283] EXPR, FCALL (s->ctx)->stats.sess_connect VAL [init=1, SSLv3_client_data={20483:0}] [L1283] FCALL (s->ctx)->stats.sess_connect += 1 VAL [init=1, SSLv3_client_data={20483:0}] [L1284] FCALL s->init_num = 0 VAL [init=1, SSLv3_client_data={20483:0}] [L1604] EXPR, FCALL s->s3 VAL [init=1, SSLv3_client_data={20483:0}] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={20483:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={20483:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={20483:0}] [L1132] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1148] COND TRUE s->state == 4368 [L1288] FCALL s->shutdown = 0 VAL [init=1, SSLv3_client_data={20483:0}] [L1289] ret = __VERIFIER_nondet_int() [L1290] COND TRUE blastFlag == 0 [L1291] blastFlag = 1 VAL [init=1, SSLv3_client_data={20483:0}] [L1295] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={20483:0}] [L1300] FCALL s->state = 4384 VAL [init=1, SSLv3_client_data={20483:0}] [L1301] FCALL s->init_num = 0 VAL [init=1, SSLv3_client_data={20483:0}] [L1302] EXPR, FCALL s->bbio VAL [init=1, SSLv3_client_data={20483:0}] [L1302] EXPR, FCALL s->wbio VAL [init=1, SSLv3_client_data={20483:0}] [L1302] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1604] EXPR, FCALL s->s3 VAL [init=1, SSLv3_client_data={20483:0}] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={20483:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={20483:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={20483:0}] [L1132] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483: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={20483:0}] [L1316] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={20483:0}] [L1321] FCALL s->hit VAL [init=1, SSLv3_client_data={20483:0}] [L1321] COND FALSE !(s->hit) [L1324] FCALL s->state = 4400 VAL [init=1, SSLv3_client_data={20483:0}] [L1326] FCALL s->init_num = 0 VAL [init=1, SSLv3_client_data={20483:0}] [L1604] EXPR, FCALL s->s3 VAL [init=1, SSLv3_client_data={20483:0}] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={20483:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={20483:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={20483:0}] [L1132] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1160] COND TRUE s->state == 4400 [L1330] EXPR, FCALL s->s3 VAL [init=1, SSLv3_client_data={20483:0}] [L1330] EXPR, FCALL (s->s3)->tmp.new_cipher VAL [init=1, SSLv3_client_data={20483:0}] [L1330] EXPR, FCALL ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={20483: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={20483:0}] [L1339] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={20483:0}] [L1345] FCALL s->state = 4416 VAL [init=1, SSLv3_client_data={20483:0}] [L1346] FCALL s->init_num = 0 VAL [init=1, SSLv3_client_data={20483:0}] [L1604] EXPR, FCALL s->s3 VAL [init=1, SSLv3_client_data={20483:0}] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={20483:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={20483:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={20483:0}] [L1132] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483: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={20483:0}] [L1356] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={20483:0}] [L1361] FCALL s->state = 4432 VAL [init=1, SSLv3_client_data={20483:0}] [L1362] FCALL s->init_num = 0 VAL [init=1, SSLv3_client_data={20483:0}] [L1363] tmp___6 = __VERIFIER_nondet_int() [L1364] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={20483:0}] [L1604] EXPR, FCALL s->s3 VAL [init=1, SSLv3_client_data={20483:0}] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={20483:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={20483:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={20483:0}] [L1132] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1172] COND TRUE s->state == 4432 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={20483:0}] [L1379] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={20483:0}] [L1384] FCALL s->state = 4448 VAL [init=1, SSLv3_client_data={20483:0}] [L1385] FCALL s->init_num = 0 VAL [init=1, SSLv3_client_data={20483:0}] [L1604] EXPR, FCALL s->s3 VAL [init=1, SSLv3_client_data={20483:0}] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={20483:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={20483:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={20483:0}] [L1132] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1172] COND FALSE !(s->state == 4432) [L1175] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1175] COND FALSE !(s->state == 4433) [L1178] EXPR, FCALL s->state VAL [init=1, SSLv3_client_data={20483:0}] [L1178] COND TRUE s->state == 4448 [L1389] ret = __VERIFIER_nondet_int() [L1390] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={20483:0}] [L1645] __VERIFIER_error() VAL [init=1, SSLv3_client_data={20483:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 344 locations, 1 error locations. UNSAFE Result, 47.4s OverallTime, 44 OverallIterations, 7 TraceHistogramMax, 31.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 21645 SDtfs, 10712 SDslu, 41464 SDs, 0 SdLazy, 13909 SolverSat, 420 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 412 GetRequests, 150 SyntacticMatches, 77 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 9.4s 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.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 8873 NumberOfCodeBlocks, 8873 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 8530 ConstructedInterpolants, 0 QuantifiedInterpolants, 3506497 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 Received shutdown request...