/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:47:37,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:47:37,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:47:37,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:47:37,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:47:37,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:47:37,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:47:37,071 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:47:37,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:47:37,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:47:37,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:47:37,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:47:37,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:47:37,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:47:37,084 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:47:37,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:47:37,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:47:37,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:47:37,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:47:37,090 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:47:37,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:47:37,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:47:37,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:47:37,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:47:37,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:47:37,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:47:37,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:47:37,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:47:37,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:47:37,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:47:37,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:47:37,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:47:37,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:47:37,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:47:37,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:47:37,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:47:37,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:47:37,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:47:37,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:47:37,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:47:37,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:47:37,106 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:47:37,119 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:47:37,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:47:37,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:47:37,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:47:37,121 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:47:37,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:47:37,122 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:47:37,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:47:37,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:47:37,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:47:37,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:47:37,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:47:37,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:47:37,123 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:47:37,123 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:47:37,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:47:37,124 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:47:37,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:47:37,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:47:37,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:47:37,124 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:47:37,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:47:37,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:47:37,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:47:37,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:47:37,125 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:47:37,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:47:37,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:47:37,126 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:47:37,126 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:47:37,405 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:47:37,418 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:47:37,422 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:47:37,423 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:47:37,424 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:47:37,424 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-3.c [2019-11-23 22:47:37,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f55616363/452278684ad341ff97c5badb9950e0f0/FLAG54fc5200f [2019-11-23 22:47:38,052 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:47:38,052 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-3.c [2019-11-23 22:47:38,063 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f55616363/452278684ad341ff97c5badb9950e0f0/FLAG54fc5200f [2019-11-23 22:47:38,468 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f55616363/452278684ad341ff97c5badb9950e0f0 [2019-11-23 22:47:38,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:47:38,479 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:47:38,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:47:38,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:47:38,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:47:38,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:47:38" (1/1) ... [2019-11-23 22:47:38,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c39350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:38, skipping insertion in model container [2019-11-23 22:47:38,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:47:38" (1/1) ... [2019-11-23 22:47:38,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:47:38,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:47:38,890 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:47:38,895 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:47:38,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:47:38,991 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:47:38,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:38 WrapperNode [2019-11-23 22:47:38,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:47:38,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:47:38,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:47:38,993 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:47:39,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:38" (1/1) ... [2019-11-23 22:47:39,013 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:38" (1/1) ... [2019-11-23 22:47:39,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:47:39,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:47:39,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:47:39,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:47:39,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:38" (1/1) ... [2019-11-23 22:47:39,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:38" (1/1) ... [2019-11-23 22:47:39,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:38" (1/1) ... [2019-11-23 22:47:39,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:38" (1/1) ... [2019-11-23 22:47:39,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:38" (1/1) ... [2019-11-23 22:47:39,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:38" (1/1) ... [2019-11-23 22:47:39,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:38" (1/1) ... [2019-11-23 22:47:39,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:47:39,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:47:39,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:47:39,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:47:39,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:47:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:47:39,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:47:39,304 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:47:39,970 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-23 22:47:39,971 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-23 22:47:39,973 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:47:39,974 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 22:47:39,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:47:39 BoogieIcfgContainer [2019-11-23 22:47:39,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:47:39,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:47:39,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:47:39,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:47:39,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:47:38" (1/3) ... [2019-11-23 22:47:39,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@797a25a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:47:39, skipping insertion in model container [2019-11-23 22:47:39,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:38" (2/3) ... [2019-11-23 22:47:39,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@797a25a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:47:39, skipping insertion in model container [2019-11-23 22:47:39,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:47:39" (3/3) ... [2019-11-23 22:47:39,990 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-3.c [2019-11-23 22:47:40,000 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:47:40,009 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:47:40,020 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:47:40,048 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:47:40,049 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:47:40,049 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:47:40,049 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:47:40,049 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:47:40,050 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:47:40,050 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:47:40,050 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:47:40,068 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-11-23 22:47:40,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:47:40,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:40,076 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:40,076 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:40,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:40,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-11-23 22:47:40,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:40,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447688994] [2019-11-23 22:47:40,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:47:40,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447688994] [2019-11-23 22:47:40,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:40,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:47:40,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081054527] [2019-11-23 22:47:40,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:40,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:40,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:40,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:40,329 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-11-23 22:47:40,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:40,590 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-11-23 22:47:40,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:40,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:47:40,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:40,603 INFO L225 Difference]: With dead ends: 251 [2019-11-23 22:47:40,604 INFO L226 Difference]: Without dead ends: 114 [2019-11-23 22:47:40,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:40,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-23 22:47:40,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-23 22:47:40,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-23 22:47:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-11-23 22:47:40,649 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-11-23 22:47:40,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:40,649 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-11-23 22:47:40,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:40,650 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-11-23 22:47:40,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 22:47:40,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:40,652 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:47:40,652 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:40,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:40,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-11-23 22:47:40,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:40,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787923113] [2019-11-23 22:47:40,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:47:40,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787923113] [2019-11-23 22:47:40,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:40,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:40,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541505798] [2019-11-23 22:47:40,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:40,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:40,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:40,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:40,748 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-11-23 22:47:40,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:40,925 INFO L93 Difference]: Finished difference Result 237 states and 359 transitions. [2019-11-23 22:47:40,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:40,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-23 22:47:40,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:40,928 INFO L225 Difference]: With dead ends: 237 [2019-11-23 22:47:40,928 INFO L226 Difference]: Without dead ends: 132 [2019-11-23 22:47:40,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:40,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-23 22:47:40,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2019-11-23 22:47:40,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-23 22:47:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-11-23 22:47:40,959 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-11-23 22:47:40,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:40,962 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-11-23 22:47:40,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:40,962 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-11-23 22:47:40,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:47:40,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:40,964 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:47:40,964 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:40,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:40,966 INFO L82 PathProgramCache]: Analyzing trace with hash -462623258, now seen corresponding path program 1 times [2019-11-23 22:47:40,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:40,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279208889] [2019-11-23 22:47:40,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:41,105 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 22:47:41,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279208889] [2019-11-23 22:47:41,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:41,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:41,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322076017] [2019-11-23 22:47:41,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:41,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:41,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:41,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:41,111 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-11-23 22:47:41,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:41,269 INFO L93 Difference]: Finished difference Result 271 states and 407 transitions. [2019-11-23 22:47:41,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:41,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-23 22:47:41,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:41,272 INFO L225 Difference]: With dead ends: 271 [2019-11-23 22:47:41,272 INFO L226 Difference]: Without dead ends: 151 [2019-11-23 22:47:41,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:41,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-23 22:47:41,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 146. [2019-11-23 22:47:41,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-23 22:47:41,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-11-23 22:47:41,284 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-11-23 22:47:41,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:41,285 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-11-23 22:47:41,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:41,285 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-11-23 22:47:41,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-23 22:47:41,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:41,287 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:47:41,288 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:41,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:41,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1174891697, now seen corresponding path program 1 times [2019-11-23 22:47:41,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:41,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785581431] [2019-11-23 22:47:41,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:41,416 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-23 22:47:41,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785581431] [2019-11-23 22:47:41,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:41,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:41,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104573385] [2019-11-23 22:47:41,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:41,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:41,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:41,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:41,419 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-11-23 22:47:41,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:41,629 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-11-23 22:47:41,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:41,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-23 22:47:41,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:41,632 INFO L225 Difference]: With dead ends: 334 [2019-11-23 22:47:41,632 INFO L226 Difference]: Without dead ends: 196 [2019-11-23 22:47:41,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:41,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-23 22:47:41,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-11-23 22:47:41,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-23 22:47:41,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-11-23 22:47:41,646 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-11-23 22:47:41,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:41,646 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-11-23 22:47:41,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:41,647 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-11-23 22:47:41,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-23 22:47:41,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:41,649 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:47:41,649 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:41,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:41,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1314637265, now seen corresponding path program 1 times [2019-11-23 22:47:41,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:41,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629007211] [2019-11-23 22:47:41,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:41,706 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-23 22:47:41,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629007211] [2019-11-23 22:47:41,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:41,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:41,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296545025] [2019-11-23 22:47:41,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:41,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:41,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:41,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:41,710 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-11-23 22:47:41,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:41,876 INFO L93 Difference]: Finished difference Result 389 states and 554 transitions. [2019-11-23 22:47:41,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:41,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-23 22:47:41,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:41,879 INFO L225 Difference]: With dead ends: 389 [2019-11-23 22:47:41,879 INFO L226 Difference]: Without dead ends: 211 [2019-11-23 22:47:41,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:41,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-23 22:47:41,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-11-23 22:47:41,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-23 22:47:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-11-23 22:47:41,890 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-11-23 22:47:41,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:41,891 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-11-23 22:47:41,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-11-23 22:47:41,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 22:47:41,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:41,893 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-11-23 22:47:41,894 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:41,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:41,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1231866158, now seen corresponding path program 1 times [2019-11-23 22:47:41,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:41,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137124890] [2019-11-23 22:47:41,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-23 22:47:41,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137124890] [2019-11-23 22:47:41,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:41,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:41,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747414210] [2019-11-23 22:47:41,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:41,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:41,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:41,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:41,949 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-11-23 22:47:42,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:42,087 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-11-23 22:47:42,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:42,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-23 22:47:42,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:42,089 INFO L225 Difference]: With dead ends: 427 [2019-11-23 22:47:42,090 INFO L226 Difference]: Without dead ends: 230 [2019-11-23 22:47:42,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:42,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-23 22:47:42,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-11-23 22:47:42,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-23 22:47:42,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-11-23 22:47:42,098 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-11-23 22:47:42,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:42,099 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-11-23 22:47:42,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-11-23 22:47:42,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-23 22:47:42,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:42,103 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:42,103 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:42,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:42,103 INFO L82 PathProgramCache]: Analyzing trace with hash 266431114, now seen corresponding path program 1 times [2019-11-23 22:47:42,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:42,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180519857] [2019-11-23 22:47:42,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:42,186 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 22:47:42,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180519857] [2019-11-23 22:47:42,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:42,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:42,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933866612] [2019-11-23 22:47:42,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:42,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:42,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:42,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:42,189 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-11-23 22:47:42,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:42,234 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-11-23 22:47:42,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:42,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-23 22:47:42,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:42,238 INFO L225 Difference]: With dead ends: 661 [2019-11-23 22:47:42,239 INFO L226 Difference]: Without dead ends: 443 [2019-11-23 22:47:42,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:42,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-23 22:47:42,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-11-23 22:47:42,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-11-23 22:47:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-11-23 22:47:42,254 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-11-23 22:47:42,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:42,254 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-11-23 22:47:42,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:42,255 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-11-23 22:47:42,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-23 22:47:42,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:42,257 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-11-23 22:47:42,257 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:42,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:42,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1706663820, now seen corresponding path program 1 times [2019-11-23 22:47:42,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:42,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987900095] [2019-11-23 22:47:42,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:42,316 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-23 22:47:42,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987900095] [2019-11-23 22:47:42,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:42,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:42,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346551084] [2019-11-23 22:47:42,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:42,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:42,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:42,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:42,319 INFO L87 Difference]: Start difference. First operand 443 states and 609 transitions. Second operand 3 states. [2019-11-23 22:47:42,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:42,365 INFO L93 Difference]: Finished difference Result 661 states and 909 transitions. [2019-11-23 22:47:42,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:42,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-23 22:47:42,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:42,370 INFO L225 Difference]: With dead ends: 661 [2019-11-23 22:47:42,370 INFO L226 Difference]: Without dead ends: 659 [2019-11-23 22:47:42,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:42,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-23 22:47:42,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-11-23 22:47:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-23 22:47:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2019-11-23 22:47:42,408 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 106 [2019-11-23 22:47:42,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:42,409 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2019-11-23 22:47:42,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2019-11-23 22:47:42,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-23 22:47:42,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:42,412 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 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] [2019-11-23 22:47:42,412 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:42,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:42,412 INFO L82 PathProgramCache]: Analyzing trace with hash 589479754, now seen corresponding path program 1 times [2019-11-23 22:47:42,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:42,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681295797] [2019-11-23 22:47:42,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:42,494 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-23 22:47:42,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681295797] [2019-11-23 22:47:42,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:42,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:42,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043254946] [2019-11-23 22:47:42,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:42,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:42,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:42,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:42,503 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 3 states. [2019-11-23 22:47:42,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:42,680 INFO L93 Difference]: Finished difference Result 1462 states and 2068 transitions. [2019-11-23 22:47:42,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:42,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-11-23 22:47:42,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:42,686 INFO L225 Difference]: With dead ends: 1462 [2019-11-23 22:47:42,686 INFO L226 Difference]: Without dead ends: 809 [2019-11-23 22:47:42,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:42,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2019-11-23 22:47:42,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 776. [2019-11-23 22:47:42,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-11-23 22:47:42,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1096 transitions. [2019-11-23 22:47:42,711 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1096 transitions. Word has length 161 [2019-11-23 22:47:42,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:42,712 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1096 transitions. [2019-11-23 22:47:42,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:42,712 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1096 transitions. [2019-11-23 22:47:42,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-23 22:47:42,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:42,716 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 22:47:42,716 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:42,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:42,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1596288335, now seen corresponding path program 1 times [2019-11-23 22:47:42,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:42,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207690098] [2019-11-23 22:47:42,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-23 22:47:42,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207690098] [2019-11-23 22:47:42,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:42,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:42,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079611946] [2019-11-23 22:47:42,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:42,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:42,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:42,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:42,819 INFO L87 Difference]: Start difference. First operand 776 states and 1096 transitions. Second operand 3 states. [2019-11-23 22:47:43,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:43,064 INFO L93 Difference]: Finished difference Result 1824 states and 2649 transitions. [2019-11-23 22:47:43,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:43,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-23 22:47:43,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:43,073 INFO L225 Difference]: With dead ends: 1824 [2019-11-23 22:47:43,075 INFO L226 Difference]: Without dead ends: 1006 [2019-11-23 22:47:43,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:43,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-11-23 22:47:43,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 965. [2019-11-23 22:47:43,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-11-23 22:47:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1348 transitions. [2019-11-23 22:47:43,125 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1348 transitions. Word has length 188 [2019-11-23 22:47:43,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:43,126 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1348 transitions. [2019-11-23 22:47:43,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:43,126 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1348 transitions. [2019-11-23 22:47:43,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-23 22:47:43,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:43,134 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 22:47:43,134 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:43,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:43,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1275827432, now seen corresponding path program 1 times [2019-11-23 22:47:43,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:43,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698066372] [2019-11-23 22:47:43,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:43,227 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-11-23 22:47:43,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698066372] [2019-11-23 22:47:43,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:43,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:43,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655163684] [2019-11-23 22:47:43,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:43,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:43,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:43,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:43,229 INFO L87 Difference]: Start difference. First operand 965 states and 1348 transitions. Second operand 3 states. [2019-11-23 22:47:43,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:43,409 INFO L93 Difference]: Finished difference Result 2080 states and 2926 transitions. [2019-11-23 22:47:43,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:43,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-11-23 22:47:43,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:43,419 INFO L225 Difference]: With dead ends: 2080 [2019-11-23 22:47:43,419 INFO L226 Difference]: Without dead ends: 1079 [2019-11-23 22:47:43,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:43,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-23 22:47:43,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1040. [2019-11-23 22:47:43,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-11-23 22:47:43,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1444 transitions. [2019-11-23 22:47:43,468 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1444 transitions. Word has length 209 [2019-11-23 22:47:43,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:43,468 INFO L462 AbstractCegarLoop]: Abstraction has 1040 states and 1444 transitions. [2019-11-23 22:47:43,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:43,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1444 transitions. [2019-11-23 22:47:43,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-23 22:47:43,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:43,474 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 22:47:43,475 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:43,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:43,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1859847365, now seen corresponding path program 1 times [2019-11-23 22:47:43,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:43,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734666060] [2019-11-23 22:47:43,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:43,659 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-23 22:47:43,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734666060] [2019-11-23 22:47:43,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:43,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:43,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341798317] [2019-11-23 22:47:43,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:43,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:43,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:43,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:43,662 INFO L87 Difference]: Start difference. First operand 1040 states and 1444 transitions. Second operand 3 states. [2019-11-23 22:47:43,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:43,887 INFO L93 Difference]: Finished difference Result 2230 states and 3115 transitions. [2019-11-23 22:47:43,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:43,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-23 22:47:43,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:43,894 INFO L225 Difference]: With dead ends: 2230 [2019-11-23 22:47:43,894 INFO L226 Difference]: Without dead ends: 1160 [2019-11-23 22:47:43,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:43,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-11-23 22:47:43,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1124. [2019-11-23 22:47:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-11-23 22:47:43,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1555 transitions. [2019-11-23 22:47:43,938 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1555 transitions. Word has length 233 [2019-11-23 22:47:43,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:43,939 INFO L462 AbstractCegarLoop]: Abstraction has 1124 states and 1555 transitions. [2019-11-23 22:47:43,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:43,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1555 transitions. [2019-11-23 22:47:43,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-23 22:47:43,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:43,943 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 22:47:43,944 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:43,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:43,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1978288839, now seen corresponding path program 1 times [2019-11-23 22:47:43,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:43,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839589930] [2019-11-23 22:47:43,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-23 22:47:44,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839589930] [2019-11-23 22:47:44,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:44,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:44,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219333619] [2019-11-23 22:47:44,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:44,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:44,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:44,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:44,031 INFO L87 Difference]: Start difference. First operand 1124 states and 1555 transitions. Second operand 3 states. [2019-11-23 22:47:44,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:44,218 INFO L93 Difference]: Finished difference Result 2398 states and 3340 transitions. [2019-11-23 22:47:44,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:44,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-23 22:47:44,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:44,225 INFO L225 Difference]: With dead ends: 2398 [2019-11-23 22:47:44,225 INFO L226 Difference]: Without dead ends: 1256 [2019-11-23 22:47:44,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:44,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-11-23 22:47:44,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1217. [2019-11-23 22:47:44,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-11-23 22:47:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1687 transitions. [2019-11-23 22:47:44,263 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1687 transitions. Word has length 233 [2019-11-23 22:47:44,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:44,263 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 1687 transitions. [2019-11-23 22:47:44,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:44,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1687 transitions. [2019-11-23 22:47:44,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-23 22:47:44,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:44,268 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 22:47:44,269 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:44,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:44,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1116608197, now seen corresponding path program 1 times [2019-11-23 22:47:44,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:44,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389210898] [2019-11-23 22:47:44,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:44,413 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-11-23 22:47:44,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389210898] [2019-11-23 22:47:44,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:44,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:44,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139949565] [2019-11-23 22:47:44,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:44,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:44,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:44,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:44,415 INFO L87 Difference]: Start difference. First operand 1217 states and 1687 transitions. Second operand 3 states. [2019-11-23 22:47:44,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:44,464 INFO L93 Difference]: Finished difference Result 3630 states and 5032 transitions. [2019-11-23 22:47:44,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:44,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-23 22:47:44,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:44,478 INFO L225 Difference]: With dead ends: 3630 [2019-11-23 22:47:44,478 INFO L226 Difference]: Without dead ends: 2422 [2019-11-23 22:47:44,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:44,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2019-11-23 22:47:44,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2420. [2019-11-23 22:47:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-11-23 22:47:44,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3354 transitions. [2019-11-23 22:47:44,552 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3354 transitions. Word has length 263 [2019-11-23 22:47:44,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:44,552 INFO L462 AbstractCegarLoop]: Abstraction has 2420 states and 3354 transitions. [2019-11-23 22:47:44,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:44,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3354 transitions. [2019-11-23 22:47:44,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-23 22:47:44,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:44,561 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 22:47:44,561 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:44,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:44,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1235049671, now seen corresponding path program 1 times [2019-11-23 22:47:44,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:44,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475895436] [2019-11-23 22:47:44,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:44,696 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-11-23 22:47:44,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475895436] [2019-11-23 22:47:44,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:44,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:44,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663245812] [2019-11-23 22:47:44,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:44,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:44,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:44,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:44,698 INFO L87 Difference]: Start difference. First operand 2420 states and 3354 transitions. Second operand 3 states. [2019-11-23 22:47:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:44,918 INFO L93 Difference]: Finished difference Result 5143 states and 7169 transitions. [2019-11-23 22:47:44,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:44,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-23 22:47:44,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:44,933 INFO L225 Difference]: With dead ends: 5143 [2019-11-23 22:47:44,933 INFO L226 Difference]: Without dead ends: 2702 [2019-11-23 22:47:44,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:44,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-11-23 22:47:45,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2630. [2019-11-23 22:47:45,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2019-11-23 22:47:45,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3666 transitions. [2019-11-23 22:47:45,015 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3666 transitions. Word has length 263 [2019-11-23 22:47:45,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:45,015 INFO L462 AbstractCegarLoop]: Abstraction has 2630 states and 3666 transitions. [2019-11-23 22:47:45,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:45,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3666 transitions. [2019-11-23 22:47:45,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-11-23 22:47:45,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:45,023 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 22:47:45,023 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:45,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:45,024 INFO L82 PathProgramCache]: Analyzing trace with hash 2135776069, now seen corresponding path program 1 times [2019-11-23 22:47:45,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:45,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292464160] [2019-11-23 22:47:45,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:45,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-11-23 22:47:45,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292464160] [2019-11-23 22:47:45,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:45,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:45,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925613227] [2019-11-23 22:47:45,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:45,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:45,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:45,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:45,154 INFO L87 Difference]: Start difference. First operand 2630 states and 3666 transitions. Second operand 3 states. [2019-11-23 22:47:45,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:45,400 INFO L93 Difference]: Finished difference Result 5335 states and 7421 transitions. [2019-11-23 22:47:45,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:45,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-11-23 22:47:45,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:45,420 INFO L225 Difference]: With dead ends: 5335 [2019-11-23 22:47:45,421 INFO L226 Difference]: Without dead ends: 2696 [2019-11-23 22:47:45,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:45,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2019-11-23 22:47:45,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2624. [2019-11-23 22:47:45,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-11-23 22:47:45,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3630 transitions. [2019-11-23 22:47:45,547 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3630 transitions. Word has length 298 [2019-11-23 22:47:45,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:45,547 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3630 transitions. [2019-11-23 22:47:45,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:45,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3630 transitions. [2019-11-23 22:47:45,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-23 22:47:45,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:45,556 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2019-11-23 22:47:45,556 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:45,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:45,557 INFO L82 PathProgramCache]: Analyzing trace with hash -901475869, now seen corresponding path program 1 times [2019-11-23 22:47:45,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:45,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831867489] [2019-11-23 22:47:45,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-23 22:47:45,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831867489] [2019-11-23 22:47:45,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:45,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:45,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124264964] [2019-11-23 22:47:45,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:45,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:45,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:45,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:45,745 INFO L87 Difference]: Start difference. First operand 2624 states and 3630 transitions. Second operand 3 states. [2019-11-23 22:47:45,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:45,964 INFO L93 Difference]: Finished difference Result 5299 states and 7319 transitions. [2019-11-23 22:47:45,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:45,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-11-23 22:47:45,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:45,979 INFO L225 Difference]: With dead ends: 5299 [2019-11-23 22:47:45,979 INFO L226 Difference]: Without dead ends: 2684 [2019-11-23 22:47:45,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:45,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2019-11-23 22:47:46,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2624. [2019-11-23 22:47:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-11-23 22:47:46,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3576 transitions. [2019-11-23 22:47:46,078 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3576 transitions. Word has length 307 [2019-11-23 22:47:46,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:46,079 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3576 transitions. [2019-11-23 22:47:46,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3576 transitions. [2019-11-23 22:47:46,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-23 22:47:46,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:46,138 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 22:47:46,138 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:46,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:46,139 INFO L82 PathProgramCache]: Analyzing trace with hash 503398906, now seen corresponding path program 1 times [2019-11-23 22:47:46,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:46,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342958172] [2019-11-23 22:47:46,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:46,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-23 22:47:46,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342958172] [2019-11-23 22:47:46,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:46,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:46,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835398912] [2019-11-23 22:47:46,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:46,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:46,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:46,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:46,266 INFO L87 Difference]: Start difference. First operand 2624 states and 3576 transitions. Second operand 3 states. [2019-11-23 22:47:46,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:46,456 INFO L93 Difference]: Finished difference Result 5545 states and 7499 transitions. [2019-11-23 22:47:46,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:46,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-11-23 22:47:46,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:46,471 INFO L225 Difference]: With dead ends: 5545 [2019-11-23 22:47:46,472 INFO L226 Difference]: Without dead ends: 2930 [2019-11-23 22:47:46,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:46,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2019-11-23 22:47:46,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2714. [2019-11-23 22:47:46,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2019-11-23 22:47:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3696 transitions. [2019-11-23 22:47:46,580 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3696 transitions. Word has length 335 [2019-11-23 22:47:46,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:46,580 INFO L462 AbstractCegarLoop]: Abstraction has 2714 states and 3696 transitions. [2019-11-23 22:47:46,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:46,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3696 transitions. [2019-11-23 22:47:46,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-23 22:47:46,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:46,594 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 22:47:46,595 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:46,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:46,595 INFO L82 PathProgramCache]: Analyzing trace with hash -121520003, now seen corresponding path program 1 times [2019-11-23 22:47:46,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:46,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519186743] [2019-11-23 22:47:46,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:46,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2019-11-23 22:47:46,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519186743] [2019-11-23 22:47:46,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:46,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:46,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907082134] [2019-11-23 22:47:46,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:46,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:46,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:46,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:46,844 INFO L87 Difference]: Start difference. First operand 2714 states and 3696 transitions. Second operand 3 states. [2019-11-23 22:47:46,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:46,952 INFO L93 Difference]: Finished difference Result 7734 states and 10582 transitions. [2019-11-23 22:47:46,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:46,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-11-23 22:47:46,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:47,012 INFO L225 Difference]: With dead ends: 7734 [2019-11-23 22:47:47,019 INFO L226 Difference]: Without dead ends: 5029 [2019-11-23 22:47:47,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2019-11-23 22:47:47,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5027. [2019-11-23 22:47:47,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5027 states. [2019-11-23 22:47:47,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 6880 transitions. [2019-11-23 22:47:47,233 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 6880 transitions. Word has length 336 [2019-11-23 22:47:47,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:47,234 INFO L462 AbstractCegarLoop]: Abstraction has 5027 states and 6880 transitions. [2019-11-23 22:47:47,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:47,234 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 6880 transitions. [2019-11-23 22:47:47,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-11-23 22:47:47,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:47,256 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 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] [2019-11-23 22:47:47,257 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:47,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:47,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1651416633, now seen corresponding path program 1 times [2019-11-23 22:47:47,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:47,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505793575] [2019-11-23 22:47:47,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-23 22:47:47,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505793575] [2019-11-23 22:47:47,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176837029] [2019-11-23 22:47:47,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:47,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:47:47,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:47:47,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-23 22:47:47,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:47:47,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:47:47,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584502867] [2019-11-23 22:47:47,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:47:47,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:47,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:47:47,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:47:47,949 INFO L87 Difference]: Start difference. First operand 5027 states and 6880 transitions. Second operand 4 states. [2019-11-23 22:47:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:48,372 INFO L93 Difference]: Finished difference Result 9987 states and 13646 transitions. [2019-11-23 22:47:48,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:47:48,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 346 [2019-11-23 22:47:48,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:48,395 INFO L225 Difference]: With dead ends: 9987 [2019-11-23 22:47:48,395 INFO L226 Difference]: Without dead ends: 7540 [2019-11-23 22:47:48,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:48,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7540 states. [2019-11-23 22:47:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7540 to 5561. [2019-11-23 22:47:48,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5561 states. [2019-11-23 22:47:48,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 7516 transitions. [2019-11-23 22:47:48,583 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 7516 transitions. Word has length 346 [2019-11-23 22:47:48,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:48,584 INFO L462 AbstractCegarLoop]: Abstraction has 5561 states and 7516 transitions. [2019-11-23 22:47:48,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:47:48,584 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 7516 transitions. [2019-11-23 22:47:48,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-11-23 22:47:48,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:48,597 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 22:47:48,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:48,803 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:48,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:48,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1397611342, now seen corresponding path program 1 times [2019-11-23 22:47:48,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:48,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36068502] [2019-11-23 22:47:48,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:49,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-23 22:47:49,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36068502] [2019-11-23 22:47:49,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478512609] [2019-11-23 22:47:49,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:49,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:47:49,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:47:49,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-23 22:47:49,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:47:49,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:47:49,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93941258] [2019-11-23 22:47:49,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:47:49,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:49,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:47:49,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:47:49,316 INFO L87 Difference]: Start difference. First operand 5561 states and 7516 transitions. Second operand 4 states. [2019-11-23 22:47:49,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:49,950 INFO L93 Difference]: Finished difference Result 12544 states and 16972 transitions. [2019-11-23 22:47:49,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:47:49,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2019-11-23 22:47:49,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:49,975 INFO L225 Difference]: With dead ends: 12544 [2019-11-23 22:47:49,976 INFO L226 Difference]: Without dead ends: 6979 [2019-11-23 22:47:49,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:50,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6979 states. [2019-11-23 22:47:50,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 5709. [2019-11-23 22:47:50,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5709 states. [2019-11-23 22:47:50,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 7634 transitions. [2019-11-23 22:47:50,159 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 7634 transitions. Word has length 373 [2019-11-23 22:47:50,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:50,160 INFO L462 AbstractCegarLoop]: Abstraction has 5709 states and 7634 transitions. [2019-11-23 22:47:50,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:47:50,160 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 7634 transitions. [2019-11-23 22:47:50,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-11-23 22:47:50,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:50,173 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 22:47:50,387 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:50,387 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:50,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:50,388 INFO L82 PathProgramCache]: Analyzing trace with hash -236946382, now seen corresponding path program 1 times [2019-11-23 22:47:50,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:50,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381683416] [2019-11-23 22:47:50,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:50,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-23 22:47:50,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381683416] [2019-11-23 22:47:50,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:50,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:50,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894703083] [2019-11-23 22:47:50,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:50,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:50,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:50,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:50,574 INFO L87 Difference]: Start difference. First operand 5709 states and 7634 transitions. Second operand 3 states. [2019-11-23 22:47:50,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:50,822 INFO L93 Difference]: Finished difference Result 11015 states and 14510 transitions. [2019-11-23 22:47:50,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:50,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-11-23 22:47:50,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:50,830 INFO L225 Difference]: With dead ends: 11015 [2019-11-23 22:47:50,830 INFO L226 Difference]: Without dead ends: 3069 [2019-11-23 22:47:50,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:50,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2019-11-23 22:47:50,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2976. [2019-11-23 22:47:50,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2976 states. [2019-11-23 22:47:50,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 3983 transitions. [2019-11-23 22:47:50,907 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 3983 transitions. Word has length 412 [2019-11-23 22:47:50,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:50,908 INFO L462 AbstractCegarLoop]: Abstraction has 2976 states and 3983 transitions. [2019-11-23 22:47:50,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:50,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3983 transitions. [2019-11-23 22:47:50,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-11-23 22:47:50,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:50,920 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 22:47:50,921 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:50,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:50,921 INFO L82 PathProgramCache]: Analyzing trace with hash -788979008, now seen corresponding path program 1 times [2019-11-23 22:47:50,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:50,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602776132] [2019-11-23 22:47:50,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1571 proven. 14 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2019-11-23 22:47:51,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602776132] [2019-11-23 22:47:51,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186417083] [2019-11-23 22:47:51,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:51,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:47:51,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:47:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2019-11-23 22:47:51,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:47:51,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:47:51,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103671580] [2019-11-23 22:47:51,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:51,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:51,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:51,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:51,712 INFO L87 Difference]: Start difference. First operand 2976 states and 3983 transitions. Second operand 3 states. [2019-11-23 22:47:51,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:51,757 INFO L93 Difference]: Finished difference Result 3028 states and 4049 transitions. [2019-11-23 22:47:51,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:51,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2019-11-23 22:47:51,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:51,763 INFO L225 Difference]: With dead ends: 3028 [2019-11-23 22:47:51,763 INFO L226 Difference]: Without dead ends: 2531 [2019-11-23 22:47:51,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:51,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2019-11-23 22:47:51,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2481. [2019-11-23 22:47:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2481 states. [2019-11-23 22:47:51,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3319 transitions. [2019-11-23 22:47:51,853 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3319 transitions. Word has length 496 [2019-11-23 22:47:51,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:51,854 INFO L462 AbstractCegarLoop]: Abstraction has 2481 states and 3319 transitions. [2019-11-23 22:47:51,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:51,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3319 transitions. [2019-11-23 22:47:51,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2019-11-23 22:47:51,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:51,878 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 22:47:52,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:52,092 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:52,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:52,093 INFO L82 PathProgramCache]: Analyzing trace with hash 866163585, now seen corresponding path program 1 times [2019-11-23 22:47:52,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:52,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270448463] [2019-11-23 22:47:52,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:52,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2607 backedges. 1546 proven. 14 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2019-11-23 22:47:52,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270448463] [2019-11-23 22:47:52,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687934702] [2019-11-23 22:47:52,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:52,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 22:47:52,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:47:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2607 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 2339 trivial. 0 not checked. [2019-11-23 22:47:52,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:47:52,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:47:52,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556837535] [2019-11-23 22:47:52,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:52,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:52,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:52,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:52,993 INFO L87 Difference]: Start difference. First operand 2481 states and 3319 transitions. Second operand 3 states. [2019-11-23 22:47:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:53,186 INFO L93 Difference]: Finished difference Result 5060 states and 6783 transitions. [2019-11-23 22:47:53,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:53,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 497 [2019-11-23 22:47:53,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:53,193 INFO L225 Difference]: With dead ends: 5060 [2019-11-23 22:47:53,193 INFO L226 Difference]: Without dead ends: 2589 [2019-11-23 22:47:53,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:53,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2019-11-23 22:47:53,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2586. [2019-11-23 22:47:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2586 states. [2019-11-23 22:47:53,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 3331 transitions. [2019-11-23 22:47:53,256 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 3331 transitions. Word has length 497 [2019-11-23 22:47:53,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:53,257 INFO L462 AbstractCegarLoop]: Abstraction has 2586 states and 3331 transitions. [2019-11-23 22:47:53,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:53,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3331 transitions. [2019-11-23 22:47:53,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2019-11-23 22:47:53,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:53,274 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:47:53,480 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:53,480 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:53,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:53,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1604973917, now seen corresponding path program 2 times [2019-11-23 22:47:53,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:53,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755116347] [2019-11-23 22:47:53,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-11-23 22:47:53,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755116347] [2019-11-23 22:47:53,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656161972] [2019-11-23 22:47:53,829 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:54,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:47:54,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:47:54,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:47:54,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:47:54,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-11-23 22:47:54,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:47:54,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:47:54,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069831797] [2019-11-23 22:47:54,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:47:54,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:54,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:47:54,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:47:54,486 INFO L87 Difference]: Start difference. First operand 2586 states and 3331 transitions. Second operand 4 states. [2019-11-23 22:47:54,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:54,770 INFO L93 Difference]: Finished difference Result 2848 states and 3664 transitions. [2019-11-23 22:47:54,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:47:54,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 608 [2019-11-23 22:47:54,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:54,771 INFO L225 Difference]: With dead ends: 2848 [2019-11-23 22:47:54,771 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:47:54,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 610 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:54,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:47:54,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:47:54,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:47:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:47:54,776 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 608 [2019-11-23 22:47:54,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:54,777 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:47:54,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:47:54,777 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:47:54,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:47:54,985 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:54,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:47:55,865 WARN L192 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 111 [2019-11-23 22:47:56,003 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-11-23 22:47:57,063 WARN L192 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2019-11-23 22:47:57,283 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2019-11-23 22:47:57,527 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 22 [2019-11-23 22:47:57,596 INFO L440 ceAbstractionStarter]: At program point L201(lines 197 514) the Hoare annotation is: (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (not .cse0) .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse1 .cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-23 22:47:57,596 INFO L440 ceAbstractionStarter]: At program point L135(lines 131 536) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-23 22:47:57,596 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 104) no Hoare annotation was computed. [2019-11-23 22:47:57,596 INFO L444 ceAbstractionStarter]: For program point L235(lines 235 251) no Hoare annotation was computed. [2019-11-23 22:47:57,597 INFO L444 ceAbstractionStarter]: For program point L235-2(lines 210 508) no Hoare annotation was computed. [2019-11-23 22:47:57,597 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 479) no Hoare annotation was computed. [2019-11-23 22:47:57,597 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 448) no Hoare annotation was computed. [2019-11-23 22:47:57,597 INFO L444 ceAbstractionStarter]: For program point L434-1(lines 434 448) no Hoare annotation was computed. [2019-11-23 22:47:57,597 INFO L444 ceAbstractionStarter]: For program point L467-2(lines 467 479) no Hoare annotation was computed. [2019-11-23 22:47:57,597 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 338) no Hoare annotation was computed. [2019-11-23 22:47:57,598 INFO L444 ceAbstractionStarter]: For program point L269(lines 269 271) no Hoare annotation was computed. [2019-11-23 22:47:57,598 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 512) no Hoare annotation was computed. [2019-11-23 22:47:57,598 INFO L444 ceAbstractionStarter]: For program point L269-2(lines 210 508) no Hoare annotation was computed. [2019-11-23 22:47:57,598 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 523) no Hoare annotation was computed. [2019-11-23 22:47:57,598 INFO L444 ceAbstractionStarter]: For program point L137(lines 137 534) no Hoare annotation was computed. [2019-11-23 22:47:57,599 INFO L444 ceAbstractionStarter]: For program point L501(lines 501 503) no Hoare annotation was computed. [2019-11-23 22:47:57,601 INFO L440 ceAbstractionStarter]: At program point L204(lines 203 512) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (not .cse0) .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse1 .cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-23 22:47:57,602 INFO L440 ceAbstractionStarter]: At program point L171(lines 161 526) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-23 22:47:57,602 INFO L444 ceAbstractionStarter]: For program point L568(lines 568 570) no Hoare annotation was computed. [2019-11-23 22:47:57,602 INFO L444 ceAbstractionStarter]: For program point L568-2(lines 568 570) no Hoare annotation was computed. [2019-11-23 22:47:57,602 INFO L444 ceAbstractionStarter]: For program point L370(lines 370 372) no Hoare annotation was computed. [2019-11-23 22:47:57,603 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 406) no Hoare annotation was computed. [2019-11-23 22:47:57,603 INFO L444 ceAbstractionStarter]: For program point L206(lines 206 511) no Hoare annotation was computed. [2019-11-23 22:47:57,603 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 522) no Hoare annotation was computed. [2019-11-23 22:47:57,603 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 533) no Hoare annotation was computed. [2019-11-23 22:47:57,603 INFO L444 ceAbstractionStarter]: For program point L107-1(lines 84 574) no Hoare annotation was computed. [2019-11-23 22:47:57,603 INFO L444 ceAbstractionStarter]: For program point L438(lines 438 444) no Hoare annotation was computed. [2019-11-23 22:47:57,606 INFO L447 ceAbstractionStarter]: At program point L207(lines 206 511) the Hoare annotation is: true [2019-11-23 22:47:57,607 INFO L440 ceAbstractionStarter]: At program point L141(lines 137 534) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2019-11-23 22:47:57,607 INFO L444 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-23 22:47:57,607 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 244) no Hoare annotation was computed. [2019-11-23 22:47:57,607 INFO L444 ceAbstractionStarter]: For program point L473(lines 473 476) no Hoare annotation was computed. [2019-11-23 22:47:57,607 INFO L447 ceAbstractionStarter]: At program point L209(lines 208 511) the Hoare annotation is: true [2019-11-23 22:47:57,608 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 521) no Hoare annotation was computed. [2019-11-23 22:47:57,608 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 532) no Hoare annotation was computed. [2019-11-23 22:47:57,608 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 543) no Hoare annotation was computed. [2019-11-23 22:47:57,608 INFO L447 ceAbstractionStarter]: At program point L573(lines 10 575) the Hoare annotation is: true [2019-11-23 22:47:57,608 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 319) no Hoare annotation was computed. [2019-11-23 22:47:57,610 INFO L444 ceAbstractionStarter]: For program point L309-2(lines 309 319) no Hoare annotation was computed. [2019-11-23 22:47:57,610 INFO L440 ceAbstractionStarter]: At program point L177(lines 173 522) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-23 22:47:57,610 INFO L440 ceAbstractionStarter]: At program point L111(lines 110 543) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-23 22:47:57,612 INFO L444 ceAbstractionStarter]: For program point L343(lines 343 345) no Hoare annotation was computed. [2019-11-23 22:47:57,613 INFO L440 ceAbstractionStarter]: At program point L509(lines 107 562) the Hoare annotation is: (let ((.cse8 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (let ((.cse4 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse12 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse1 (not .cse8)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse9 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse1 .cse2 .cse3 .cse0) (and .cse4 .cse5) (and .cse6 .cse7 .cse8 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse7 .cse8 .cse5 .cse9) (and .cse0 .cse4 .cse8) (and .cse10 .cse11 .cse12 .cse8 .cse5) (and .cse2 .cse3 .cse12 .cse8 .cse5) (and (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0) .cse7 .cse8) (and .cse1 .cse10 .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse11) (and .cse0 (= 4384 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse8 .cse9) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse6 .cse0)))) [2019-11-23 22:47:57,613 INFO L444 ceAbstractionStarter]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-11-23 22:47:57,613 INFO L440 ceAbstractionStarter]: At program point L344(lines 84 574) the Hoare annotation is: false [2019-11-23 22:47:57,613 INFO L444 ceAbstractionStarter]: For program point L410-2(lines 210 508) no Hoare annotation was computed. [2019-11-23 22:47:57,614 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 520) no Hoare annotation was computed. [2019-11-23 22:47:57,614 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 531) no Hoare annotation was computed. [2019-11-23 22:47:57,614 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 542) no Hoare annotation was computed. [2019-11-23 22:47:57,614 INFO L444 ceAbstractionStarter]: For program point L246(lines 246 249) no Hoare annotation was computed. [2019-11-23 22:47:57,614 INFO L440 ceAbstractionStarter]: At program point L147(lines 143 532) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) [2019-11-23 22:47:57,615 INFO L444 ceAbstractionStarter]: For program point L544(lines 544 560) no Hoare annotation was computed. [2019-11-23 22:47:57,615 INFO L444 ceAbstractionStarter]: For program point L379(lines 379 381) no Hoare annotation was computed. [2019-11-23 22:47:57,615 INFO L444 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2019-11-23 22:47:57,615 INFO L444 ceAbstractionStarter]: For program point L313(lines 313 315) no Hoare annotation was computed. [2019-11-23 22:47:57,615 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 282) no Hoare annotation was computed. [2019-11-23 22:47:57,615 INFO L444 ceAbstractionStarter]: For program point L313-2(lines 311 319) no Hoare annotation was computed. [2019-11-23 22:47:57,616 INFO L444 ceAbstractionStarter]: For program point L545(lines 545 559) no Hoare annotation was computed. [2019-11-23 22:47:57,616 INFO L440 ceAbstractionStarter]: At program point L215(lines 113 542) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) [2019-11-23 22:47:57,616 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 519) no Hoare annotation was computed. [2019-11-23 22:47:57,616 INFO L444 ceAbstractionStarter]: For program point L149(lines 149 530) no Hoare annotation was computed. [2019-11-23 22:47:57,616 INFO L444 ceAbstractionStarter]: For program point L116(lines 116 541) no Hoare annotation was computed. [2019-11-23 22:47:57,617 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 551) no Hoare annotation was computed. [2019-11-23 22:47:57,617 INFO L444 ceAbstractionStarter]: For program point L546-2(lines 545 559) no Hoare annotation was computed. [2019-11-23 22:47:57,617 INFO L440 ceAbstractionStarter]: At program point L183(lines 179 520) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-23 22:47:57,617 INFO L444 ceAbstractionStarter]: For program point L548(lines 548 550) no Hoare annotation was computed. [2019-11-23 22:47:57,617 INFO L444 ceAbstractionStarter]: For program point L383(lines 383 388) no Hoare annotation was computed. [2019-11-23 22:47:57,617 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:47:57,618 INFO L444 ceAbstractionStarter]: For program point L383-2(lines 383 388) no Hoare annotation was computed. [2019-11-23 22:47:57,618 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 518) no Hoare annotation was computed. [2019-11-23 22:47:57,618 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 529) no Hoare annotation was computed. [2019-11-23 22:47:57,618 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 540) no Hoare annotation was computed. [2019-11-23 22:47:57,620 INFO L440 ceAbstractionStarter]: At program point L153(lines 149 530) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-23 22:47:57,620 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 484 486) no Hoare annotation was computed. [2019-11-23 22:47:57,620 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-11-23 22:47:57,620 INFO L444 ceAbstractionStarter]: For program point L220-2(lines 220 222) no Hoare annotation was computed. [2019-11-23 22:47:57,620 INFO L447 ceAbstractionStarter]: At program point L584(lines 576 586) the Hoare annotation is: true [2019-11-23 22:47:57,620 INFO L444 ceAbstractionStarter]: For program point L419(lines 419 422) no Hoare annotation was computed. [2019-11-23 22:47:57,621 INFO L444 ceAbstractionStarter]: For program point L188(lines 188 517) no Hoare annotation was computed. [2019-11-23 22:47:57,621 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 528) no Hoare annotation was computed. [2019-11-23 22:47:57,621 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 539) no Hoare annotation was computed. [2019-11-23 22:47:57,621 INFO L444 ceAbstractionStarter]: For program point L288(lines 288 294) no Hoare annotation was computed. [2019-11-23 22:47:57,621 INFO L440 ceAbstractionStarter]: At program point L189(lines 185 518) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-23 22:47:57,622 INFO L444 ceAbstractionStarter]: For program point L553(lines 553 557) no Hoare annotation was computed. [2019-11-23 22:47:57,622 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 456) no Hoare annotation was computed. [2019-11-23 22:47:57,622 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 357) no Hoare annotation was computed. [2019-11-23 22:47:57,622 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:47:57,624 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 260) no Hoare annotation was computed. [2019-11-23 22:47:57,624 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 516) no Hoare annotation was computed. [2019-11-23 22:47:57,624 INFO L444 ceAbstractionStarter]: For program point L158(lines 158 527) no Hoare annotation was computed. [2019-11-23 22:47:57,625 INFO L444 ceAbstractionStarter]: For program point L125(lines 125 538) no Hoare annotation was computed. [2019-11-23 22:47:57,625 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 293) no Hoare annotation was computed. [2019-11-23 22:47:57,625 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2019-11-23 22:47:57,625 INFO L444 ceAbstractionStarter]: For program point L291-2(lines 210 508) no Hoare annotation was computed. [2019-11-23 22:47:57,625 INFO L440 ceAbstractionStarter]: At program point L159(lines 155 528) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4464) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-23 22:47:57,625 INFO L444 ceAbstractionStarter]: For program point L93(lines 93 99) no Hoare annotation was computed. [2019-11-23 22:47:57,626 INFO L444 ceAbstractionStarter]: For program point L490(lines 490 492) no Hoare annotation was computed. [2019-11-23 22:47:57,626 INFO L444 ceAbstractionStarter]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-11-23 22:47:57,626 INFO L444 ceAbstractionStarter]: For program point L490-2(lines 490 492) no Hoare annotation was computed. [2019-11-23 22:47:57,626 INFO L444 ceAbstractionStarter]: For program point L457-2(lines 457 461) no Hoare annotation was computed. [2019-11-23 22:47:57,626 INFO L444 ceAbstractionStarter]: For program point L358(lines 358 362) no Hoare annotation was computed. [2019-11-23 22:47:57,626 INFO L444 ceAbstractionStarter]: For program point L358-2(lines 358 362) no Hoare annotation was computed. [2019-11-23 22:47:57,626 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:47:57,627 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 515) no Hoare annotation was computed. [2019-11-23 22:47:57,627 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 526) no Hoare annotation was computed. [2019-11-23 22:47:57,627 INFO L444 ceAbstractionStarter]: For program point L128(lines 128 537) no Hoare annotation was computed. [2019-11-23 22:47:57,627 INFO L444 ceAbstractionStarter]: For program point L327(lines 327 329) no Hoare annotation was computed. [2019-11-23 22:47:57,629 INFO L444 ceAbstractionStarter]: For program point L327-2(lines 210 508) no Hoare annotation was computed. [2019-11-23 22:47:57,629 INFO L440 ceAbstractionStarter]: At program point L195(lines 191 516) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-23 22:47:57,629 INFO L440 ceAbstractionStarter]: At program point L129(lines 125 538) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-23 22:47:57,629 INFO L444 ceAbstractionStarter]: For program point L96(lines 96 98) no Hoare annotation was computed. [2019-11-23 22:47:57,629 INFO L444 ceAbstractionStarter]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2019-11-23 22:47:57,630 INFO L444 ceAbstractionStarter]: For program point L427(lines 427 429) no Hoare annotation was computed. [2019-11-23 22:47:57,630 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 396) no Hoare annotation was computed. [2019-11-23 22:47:57,630 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 514) no Hoare annotation was computed. [2019-11-23 22:47:57,630 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 525) no Hoare annotation was computed. [2019-11-23 22:47:57,630 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 536) no Hoare annotation was computed. [2019-11-23 22:47:57,631 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 572) no Hoare annotation was computed. [2019-11-23 22:47:57,631 INFO L444 ceAbstractionStarter]: For program point L496(lines 496 498) no Hoare annotation was computed. [2019-11-23 22:47:57,631 INFO L444 ceAbstractionStarter]: For program point L496-2(lines 496 498) no Hoare annotation was computed. [2019-11-23 22:47:57,631 INFO L444 ceAbstractionStarter]: For program point L298(lines 298 302) no Hoare annotation was computed. [2019-11-23 22:47:57,631 INFO L444 ceAbstractionStarter]: For program point L298-2(lines 298 302) no Hoare annotation was computed. [2019-11-23 22:47:57,631 INFO L447 ceAbstractionStarter]: At program point L563(lines 106 564) the Hoare annotation is: true [2019-11-23 22:47:57,632 INFO L444 ceAbstractionStarter]: For program point L200(lines 200 513) no Hoare annotation was computed. [2019-11-23 22:47:57,632 INFO L444 ceAbstractionStarter]: For program point L167(lines 167 524) no Hoare annotation was computed. [2019-11-23 22:47:57,632 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 535) no Hoare annotation was computed. [2019-11-23 22:47:57,632 INFO L444 ceAbstractionStarter]: For program point L101(lines 101 105) no Hoare annotation was computed. [2019-11-23 22:47:57,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:47:57 BoogieIcfgContainer [2019-11-23 22:47:57,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:47:57,692 INFO L168 Benchmark]: Toolchain (without parser) took 19213.84 ms. Allocated memory was 144.2 MB in the beginning and 926.9 MB in the end (delta: 782.8 MB). Free memory was 101.3 MB in the beginning and 613.3 MB in the end (delta: -512.0 MB). Peak memory consumption was 699.2 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:57,696 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 144.2 MB. Free memory is still 120.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-23 22:47:57,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 512.68 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 101.3 MB in the beginning and 175.8 MB in the end (delta: -74.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:57,697 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.37 ms. Allocated memory is still 200.8 MB. Free memory was 175.8 MB in the beginning and 172.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:57,698 INFO L168 Benchmark]: Boogie Preprocessor took 56.15 ms. Allocated memory is still 200.8 MB. Free memory was 172.8 MB in the beginning and 169.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:57,698 INFO L168 Benchmark]: RCFGBuilder took 865.06 ms. Allocated memory is still 200.8 MB. Free memory was 169.8 MB in the beginning and 120.8 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:57,701 INFO L168 Benchmark]: TraceAbstraction took 17709.93 ms. Allocated memory was 200.8 MB in the beginning and 926.9 MB in the end (delta: 726.1 MB). Free memory was 120.8 MB in the beginning and 613.3 MB in the end (delta: -492.4 MB). Peak memory consumption was 662.1 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:57,703 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 144.2 MB. Free memory is still 120.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 512.68 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 101.3 MB in the beginning and 175.8 MB in the end (delta: -74.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.37 ms. Allocated memory is still 200.8 MB. Free memory was 175.8 MB in the beginning and 172.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.15 ms. Allocated memory is still 200.8 MB. Free memory was 172.8 MB in the beginning and 169.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 865.06 ms. Allocated memory is still 200.8 MB. Free memory was 169.8 MB in the beginning and 120.8 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17709.93 ms. Allocated memory was 200.8 MB in the beginning and 926.9 MB in the end (delta: 726.1 MB). Free memory was 120.8 MB in the beginning and 613.3 MB in the end (delta: -492.4 MB). Peak memory consumption was 662.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 572]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 12292 == s__state - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2) - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((s__state <= 4464 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((s__state <= 4480 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && 4368 == s__state) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || (((blastFlag <= 4 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4400 == s__state)) || ((blastFlag <= 2 && s__state <= 3) && 0 == s__hit)) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((4416 == s__state && blastFlag <= 4) && 0 == s__hit)) || ((((!(0 == s__hit) && s__state <= 4352) && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || (blastFlag <= 2 && 4384 == s__state)) || ((blastFlag <= 2 && 0 == s__hit) && 4400 == s__state)) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((!(0 == s__hit) && s__state <= 4352) && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: s__state <= 4560 && blastFlag <= 2 - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state) || (((s__state <= 4560 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || ((4512 <= s__state && s__state <= 4560) && blastFlag <= 2) - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4448) && 0 == s__hit) && 4432 <= s__state - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Result: SAFE, OverallTime: 17.5s, OverallIterations: 25, TraceHistogramMax: 21, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, HoareTripleCheckerStatistics: 4490 SDtfs, 2114 SDslu, 2318 SDs, 0 SdLazy, 2460 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2400 GetRequests, 2365 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5709occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 4032 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 155 NumberOfFragments, 425 HoareAnnotationTreeSize, 22 FomulaSimplifications, 31460 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 22 FomulaSimplificationsInter, 24851 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 8415 NumberOfCodeBlocks, 8415 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 8385 ConstructedInterpolants, 0 QuantifiedInterpolants, 4385301 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3916 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 30 InterpolantComputations, 22 PerfectInterpolantSequences, 37271/37361 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...