./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_srvr_4.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ssh-simplified/s3_srvr_4.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 64a8f3377d83624025022bfde8edd1f829e70f73 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:40:18,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:40:18,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:40:18,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:40:18,115 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:40:18,116 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:40:18,118 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:40:18,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:40:18,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:40:18,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:40:18,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:40:18,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:40:18,127 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:40:18,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:40:18,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:40:18,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:40:18,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:40:18,134 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:40:18,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:40:18,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:40:18,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:40:18,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:40:18,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:40:18,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:40:18,146 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:40:18,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:40:18,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:40:18,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:40:18,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:40:18,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:40:18,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:40:18,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:40:18,151 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:40:18,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:40:18,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:40:18,154 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:40:18,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:40:18,155 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:40:18,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:40:18,156 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:40:18,157 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:40:18,158 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:40:18,173 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:40:18,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:40:18,175 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:40:18,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:40:18,176 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:40:18,177 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:40:18,177 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:40:18,177 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:40:18,178 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:40:18,178 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:40:18,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:40:18,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:40:18,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:40:18,179 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:40:18,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:40:18,180 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:40:18,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:40:18,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:40:18,181 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:40:18,181 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:40:18,181 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:40:18,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:40:18,182 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:40:18,182 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:40:18,182 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:40:18,183 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:40:18,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:40:18,183 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:40:18,183 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:40:18,184 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 64a8f3377d83624025022bfde8edd1f829e70f73 [2019-11-28 15:40:18,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:40:18,564 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:40:18,568 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:40:18,569 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:40:18,570 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:40:18,571 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_srvr_4.cil.c [2019-11-28 15:40:18,637 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff7a1d0ed/f9a3ee630c8d47b58cf7d23a9d35ff10/FLAG080ba5abc [2019-11-28 15:40:19,109 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:40:19,110 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_srvr_4.cil.c [2019-11-28 15:40:19,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff7a1d0ed/f9a3ee630c8d47b58cf7d23a9d35ff10/FLAG080ba5abc [2019-11-28 15:40:19,487 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff7a1d0ed/f9a3ee630c8d47b58cf7d23a9d35ff10 [2019-11-28 15:40:19,491 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:40:19,493 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:40:19,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:19,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:40:19,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:40:19,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:19" (1/1) ... [2019-11-28 15:40:19,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@381b270f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:19, skipping insertion in model container [2019-11-28 15:40:19,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:19" (1/1) ... [2019-11-28 15:40:19,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:40:19,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:40:19,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:19,875 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:40:20,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:20,065 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:40:20,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:20 WrapperNode [2019-11-28 15:40:20,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:20,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:20,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:40:20,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:40:20,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:20" (1/1) ... [2019-11-28 15:40:20,108 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:20" (1/1) ... [2019-11-28 15:40:20,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:20,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:40:20,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:40:20,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:40:20,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:20" (1/1) ... [2019-11-28 15:40:20,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:20" (1/1) ... [2019-11-28 15:40:20,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:20" (1/1) ... [2019-11-28 15:40:20,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:20" (1/1) ... [2019-11-28 15:40:20,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:20" (1/1) ... [2019-11-28 15:40:20,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:20" (1/1) ... [2019-11-28 15:40:20,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:20" (1/1) ... [2019-11-28 15:40:20,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:40:20,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:40:20,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:40:20,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:40:20,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:20" (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-28 15:40:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:40:20,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:40:20,405 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:40:21,113 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-28 15:40:21,113 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-28 15:40:21,114 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:40:21,115 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:40:21,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:21 BoogieIcfgContainer [2019-11-28 15:40:21,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:40:21,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:40:21,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:40:21,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:40:21,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:40:19" (1/3) ... [2019-11-28 15:40:21,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87ef4a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:21, skipping insertion in model container [2019-11-28 15:40:21,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:20" (2/3) ... [2019-11-28 15:40:21,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87ef4a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:21, skipping insertion in model container [2019-11-28 15:40:21,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:21" (3/3) ... [2019-11-28 15:40:21,125 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c [2019-11-28 15:40:21,135 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:40:21,143 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:40:21,156 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:40:21,197 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:40:21,197 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:40:21,199 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:40:21,199 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:40:21,199 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:40:21,199 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:40:21,200 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:40:21,200 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:40:21,218 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-11-28 15:40:21,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 15:40:21,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:21,230 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:21,231 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:21,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:21,238 INFO L82 PathProgramCache]: Analyzing trace with hash -91605785, now seen corresponding path program 1 times [2019-11-28 15:40:21,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:21,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883780957] [2019-11-28 15:40:21,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:21,513 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-28 15:40:21,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883780957] [2019-11-28 15:40:21,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:21,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:21,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7140131] [2019-11-28 15:40:21,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:21,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:21,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:21,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:21,542 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-11-28 15:40:21,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:21,912 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-11-28 15:40:21,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:21,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-28 15:40:21,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:21,930 INFO L225 Difference]: With dead ends: 327 [2019-11-28 15:40:21,930 INFO L226 Difference]: Without dead ends: 174 [2019-11-28 15:40:21,935 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-28 15:40:21,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-28 15:40:22,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-11-28 15:40:22,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-28 15:40:22,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-11-28 15:40:22,046 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-11-28 15:40:22,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:22,047 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-11-28 15:40:22,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:22,049 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-11-28 15:40:22,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 15:40:22,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:22,054 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:22,054 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:22,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:22,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033262, now seen corresponding path program 1 times [2019-11-28 15:40:22,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:22,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742675309] [2019-11-28 15:40:22,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:22,210 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-28 15:40:22,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742675309] [2019-11-28 15:40:22,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:22,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:22,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022908969] [2019-11-28 15:40:22,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:22,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:22,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:22,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:22,217 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-11-28 15:40:22,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:22,496 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-11-28 15:40:22,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:22,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-28 15:40:22,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:22,500 INFO L225 Difference]: With dead ends: 379 [2019-11-28 15:40:22,503 INFO L226 Difference]: Without dead ends: 215 [2019-11-28 15:40:22,505 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-28 15:40:22,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-28 15:40:22,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-11-28 15:40:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-28 15:40:22,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-11-28 15:40:22,526 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-11-28 15:40:22,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:22,527 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-11-28 15:40:22,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:22,527 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-11-28 15:40:22,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-28 15:40:22,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:22,531 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 15:40:22,531 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:22,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:22,531 INFO L82 PathProgramCache]: Analyzing trace with hash 25102818, now seen corresponding path program 1 times [2019-11-28 15:40:22,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:22,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084608671] [2019-11-28 15:40:22,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:22,604 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:22,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084608671] [2019-11-28 15:40:22,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:22,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:22,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917760015] [2019-11-28 15:40:22,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:22,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:22,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:22,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:22,611 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-11-28 15:40:22,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:22,840 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-11-28 15:40:22,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:22,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-28 15:40:22,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:22,845 INFO L225 Difference]: With dead ends: 444 [2019-11-28 15:40:22,845 INFO L226 Difference]: Without dead ends: 241 [2019-11-28 15:40:22,847 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-28 15:40:22,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-28 15:40:22,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-11-28 15:40:22,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-28 15:40:22,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-11-28 15:40:22,882 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-11-28 15:40:22,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:22,882 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-11-28 15:40:22,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-11-28 15:40:22,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-28 15:40:22,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:22,894 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-28 15:40:22,894 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:22,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:22,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1824447496, now seen corresponding path program 1 times [2019-11-28 15:40:22,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:22,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65155286] [2019-11-28 15:40:22,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:40:22,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65155286] [2019-11-28 15:40:22,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:22,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:22,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925911407] [2019-11-28 15:40:22,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:22,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:22,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:22,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:22,997 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-11-28 15:40:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:23,143 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-11-28 15:40:23,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:23,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-28 15:40:23,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:23,146 INFO L225 Difference]: With dead ends: 492 [2019-11-28 15:40:23,147 INFO L226 Difference]: Without dead ends: 258 [2019-11-28 15:40:23,148 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-28 15:40:23,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-28 15:40:23,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-11-28 15:40:23,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-28 15:40:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-11-28 15:40:23,166 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-11-28 15:40:23,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:23,167 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-11-28 15:40:23,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:23,167 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-11-28 15:40:23,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-28 15:40:23,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:23,170 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 15:40:23,170 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:23,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:23,170 INFO L82 PathProgramCache]: Analyzing trace with hash 471399807, now seen corresponding path program 1 times [2019-11-28 15:40:23,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:23,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788334981] [2019-11-28 15:40:23,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:23,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788334981] [2019-11-28 15:40:23,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:23,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:23,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010148977] [2019-11-28 15:40:23,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:23,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:23,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:23,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:23,240 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-11-28 15:40:23,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:23,448 INFO L93 Difference]: Finished difference Result 552 states and 932 transitions. [2019-11-28 15:40:23,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:23,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-28 15:40:23,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:23,453 INFO L225 Difference]: With dead ends: 552 [2019-11-28 15:40:23,454 INFO L226 Difference]: Without dead ends: 303 [2019-11-28 15:40:23,455 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-28 15:40:23,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-28 15:40:23,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 298. [2019-11-28 15:40:23,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-28 15:40:23,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-11-28 15:40:23,469 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-11-28 15:40:23,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:23,469 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-11-28 15:40:23,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:23,470 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-11-28 15:40:23,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-28 15:40:23,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:23,472 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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-28 15:40:23,472 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:23,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:23,473 INFO L82 PathProgramCache]: Analyzing trace with hash -455139068, now seen corresponding path program 1 times [2019-11-28 15:40:23,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:23,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121611330] [2019-11-28 15:40:23,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:40:23,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121611330] [2019-11-28 15:40:23,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:23,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:23,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817289477] [2019-11-28 15:40:23,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:23,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:23,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:23,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:23,555 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-11-28 15:40:23,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:23,685 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-11-28 15:40:23,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:23,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-28 15:40:23,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:23,688 INFO L225 Difference]: With dead ends: 591 [2019-11-28 15:40:23,688 INFO L226 Difference]: Without dead ends: 300 [2019-11-28 15:40:23,689 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-28 15:40:23,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-28 15:40:23,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-11-28 15:40:23,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-28 15:40:23,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-11-28 15:40:23,700 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-11-28 15:40:23,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:23,700 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-11-28 15:40:23,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:23,700 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-11-28 15:40:23,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-28 15:40:23,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:23,702 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 15:40:23,702 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:23,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:23,703 INFO L82 PathProgramCache]: Analyzing trace with hash -190163418, now seen corresponding path program 1 times [2019-11-28 15:40:23,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:23,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116799824] [2019-11-28 15:40:23,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:23,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116799824] [2019-11-28 15:40:23,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:23,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:23,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302334270] [2019-11-28 15:40:23,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:23,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:23,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:23,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:23,777 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-11-28 15:40:23,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:23,946 INFO L93 Difference]: Finished difference Result 594 states and 996 transitions. [2019-11-28 15:40:23,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:23,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-28 15:40:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:23,948 INFO L225 Difference]: With dead ends: 594 [2019-11-28 15:40:23,949 INFO L226 Difference]: Without dead ends: 301 [2019-11-28 15:40:23,950 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-28 15:40:23,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-28 15:40:23,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 296. [2019-11-28 15:40:23,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-28 15:40:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-11-28 15:40:23,962 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-11-28 15:40:23,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:23,963 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-11-28 15:40:23,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-11-28 15:40:23,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-28 15:40:23,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:23,965 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2019-11-28 15:40:23,965 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:23,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:23,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1935111195, now seen corresponding path program 1 times [2019-11-28 15:40:23,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:23,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906365319] [2019-11-28 15:40:23,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:24,044 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-28 15:40:24,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906365319] [2019-11-28 15:40:24,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:24,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:24,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809314781] [2019-11-28 15:40:24,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:24,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:24,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:24,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:24,049 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-11-28 15:40:24,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:24,207 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-11-28 15:40:24,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:24,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-28 15:40:24,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:24,211 INFO L225 Difference]: With dead ends: 594 [2019-11-28 15:40:24,211 INFO L226 Difference]: Without dead ends: 305 [2019-11-28 15:40:24,212 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-28 15:40:24,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-28 15:40:24,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-11-28 15:40:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-28 15:40:24,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-11-28 15:40:24,233 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-11-28 15:40:24,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:24,233 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-11-28 15:40:24,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:24,234 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-11-28 15:40:24,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-28 15:40:24,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:24,237 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:24,237 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:24,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:24,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1438087397, now seen corresponding path program 1 times [2019-11-28 15:40:24,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:24,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991434] [2019-11-28 15:40:24,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:40:24,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991434] [2019-11-28 15:40:24,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:24,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:24,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332515733] [2019-11-28 15:40:24,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:24,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:24,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:24,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:24,337 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-11-28 15:40:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:24,625 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-11-28 15:40:24,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:24,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-28 15:40:24,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:24,629 INFO L225 Difference]: With dead ends: 634 [2019-11-28 15:40:24,629 INFO L226 Difference]: Without dead ends: 336 [2019-11-28 15:40:24,632 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-28 15:40:24,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-28 15:40:24,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-28 15:40:24,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-28 15:40:24,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-11-28 15:40:24,648 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-11-28 15:40:24,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:24,649 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-11-28 15:40:24,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:24,649 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-11-28 15:40:24,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-28 15:40:24,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:24,652 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-28 15:40:24,652 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:24,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:24,653 INFO L82 PathProgramCache]: Analyzing trace with hash 384185223, now seen corresponding path program 1 times [2019-11-28 15:40:24,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:24,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255006181] [2019-11-28 15:40:24,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:40:24,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255006181] [2019-11-28 15:40:24,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:24,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:24,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731329226] [2019-11-28 15:40:24,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:24,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:24,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:24,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:24,718 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-11-28 15:40:24,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:24,925 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-11-28 15:40:24,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:24,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-28 15:40:24,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:24,928 INFO L225 Difference]: With dead ends: 663 [2019-11-28 15:40:24,928 INFO L226 Difference]: Without dead ends: 336 [2019-11-28 15:40:24,929 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-28 15:40:24,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-28 15:40:24,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-28 15:40:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-28 15:40:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-11-28 15:40:24,953 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-11-28 15:40:24,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:24,954 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-11-28 15:40:24,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:24,955 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-11-28 15:40:24,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-28 15:40:24,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:24,957 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-28 15:40:24,958 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:24,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:24,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1845992555, now seen corresponding path program 1 times [2019-11-28 15:40:24,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:24,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705222594] [2019-11-28 15:40:24,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:25,037 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:40:25,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705222594] [2019-11-28 15:40:25,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:25,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:25,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457728347] [2019-11-28 15:40:25,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:25,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:25,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:25,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:25,041 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-11-28 15:40:25,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:25,250 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-11-28 15:40:25,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:25,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-28 15:40:25,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:25,254 INFO L225 Difference]: With dead ends: 696 [2019-11-28 15:40:25,254 INFO L226 Difference]: Without dead ends: 369 [2019-11-28 15:40:25,255 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-28 15:40:25,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-28 15:40:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-28 15:40:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-28 15:40:25,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-11-28 15:40:25,275 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-11-28 15:40:25,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:25,276 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-11-28 15:40:25,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:25,276 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-11-28 15:40:25,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-28 15:40:25,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:25,279 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-28 15:40:25,279 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:25,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:25,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1032094409, now seen corresponding path program 1 times [2019-11-28 15:40:25,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:25,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135791557] [2019-11-28 15:40:25,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:25,341 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:40:25,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135791557] [2019-11-28 15:40:25,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:25,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:25,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918921273] [2019-11-28 15:40:25,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:25,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:25,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:25,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:25,344 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-11-28 15:40:25,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:25,492 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-11-28 15:40:25,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:25,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-28 15:40:25,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:25,495 INFO L225 Difference]: With dead ends: 723 [2019-11-28 15:40:25,496 INFO L226 Difference]: Without dead ends: 369 [2019-11-28 15:40:25,497 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-28 15:40:25,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-28 15:40:25,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-28 15:40:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-28 15:40:25,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-11-28 15:40:25,515 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-11-28 15:40:25,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:25,515 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-11-28 15:40:25,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:25,515 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-11-28 15:40:25,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-28 15:40:25,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:25,517 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-28 15:40:25,518 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:25,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:25,518 INFO L82 PathProgramCache]: Analyzing trace with hash -2114438894, now seen corresponding path program 1 times [2019-11-28 15:40:25,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:25,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598196672] [2019-11-28 15:40:25,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:25,567 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-28 15:40:25,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598196672] [2019-11-28 15:40:25,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:25,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:25,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967243732] [2019-11-28 15:40:25,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:25,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:25,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:25,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:25,570 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-11-28 15:40:25,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:25,719 INFO L93 Difference]: Finished difference Result 740 states and 1192 transitions. [2019-11-28 15:40:25,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:25,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-28 15:40:25,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:25,721 INFO L225 Difference]: With dead ends: 740 [2019-11-28 15:40:25,722 INFO L226 Difference]: Without dead ends: 386 [2019-11-28 15:40:25,723 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-28 15:40:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-11-28 15:40:25,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-11-28 15:40:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-28 15:40:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-11-28 15:40:25,739 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-11-28 15:40:25,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:25,740 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-11-28 15:40:25,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-11-28 15:40:25,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-28 15:40:25,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:25,742 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-28 15:40:25,742 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:25,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:25,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1334837850, now seen corresponding path program 1 times [2019-11-28 15:40:25,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:25,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35359492] [2019-11-28 15:40:25,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-28 15:40:25,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35359492] [2019-11-28 15:40:25,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:25,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:25,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712951747] [2019-11-28 15:40:25,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:25,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:25,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:25,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:25,805 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-11-28 15:40:25,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:25,929 INFO L93 Difference]: Finished difference Result 761 states and 1215 transitions. [2019-11-28 15:40:25,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:25,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-28 15:40:25,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:25,932 INFO L225 Difference]: With dead ends: 761 [2019-11-28 15:40:25,932 INFO L226 Difference]: Without dead ends: 386 [2019-11-28 15:40:25,933 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-28 15:40:25,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-11-28 15:40:25,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-11-28 15:40:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-28 15:40:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-11-28 15:40:25,947 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-11-28 15:40:25,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:25,947 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-11-28 15:40:25,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-11-28 15:40:25,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-28 15:40:25,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:25,949 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-28 15:40:25,949 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:25,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:25,950 INFO L82 PathProgramCache]: Analyzing trace with hash -457491278, now seen corresponding path program 1 times [2019-11-28 15:40:25,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:25,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249736190] [2019-11-28 15:40:25,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-28 15:40:26,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249736190] [2019-11-28 15:40:26,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454840354] [2019-11-28 15:40:26,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,004 INFO L87 Difference]: Start difference. First operand 382 states and 604 transitions. Second operand 3 states. [2019-11-28 15:40:26,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,052 INFO L93 Difference]: Finished difference Result 757 states and 1197 transitions. [2019-11-28 15:40:26,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-28 15:40:26,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,057 INFO L225 Difference]: With dead ends: 757 [2019-11-28 15:40:26,058 INFO L226 Difference]: Without dead ends: 755 [2019-11-28 15:40:26,060 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-28 15:40:26,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-11-28 15:40:26,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-11-28 15:40:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-11-28 15:40:26,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1195 transitions. [2019-11-28 15:40:26,087 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1195 transitions. Word has length 120 [2019-11-28 15:40:26,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,087 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 1195 transitions. [2019-11-28 15:40:26,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1195 transitions. [2019-11-28 15:40:26,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-28 15:40:26,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,090 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-28 15:40:26,090 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1678103130, now seen corresponding path program 1 times [2019-11-28 15:40:26,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374801427] [2019-11-28 15:40:26,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,143 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 15:40:26,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374801427] [2019-11-28 15:40:26,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991751921] [2019-11-28 15:40:26,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,147 INFO L87 Difference]: Start difference. First operand 755 states and 1195 transitions. Second operand 3 states. [2019-11-28 15:40:26,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,201 INFO L93 Difference]: Finished difference Result 1831 states and 2899 transitions. [2019-11-28 15:40:26,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-28 15:40:26,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,208 INFO L225 Difference]: With dead ends: 1831 [2019-11-28 15:40:26,208 INFO L226 Difference]: Without dead ends: 1083 [2019-11-28 15:40:26,210 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-28 15:40:26,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-11-28 15:40:26,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083. [2019-11-28 15:40:26,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2019-11-28 15:40:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1712 transitions. [2019-11-28 15:40:26,249 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1712 transitions. Word has length 121 [2019-11-28 15:40:26,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,250 INFO L462 AbstractCegarLoop]: Abstraction has 1083 states and 1712 transitions. [2019-11-28 15:40:26,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1712 transitions. [2019-11-28 15:40:26,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-28 15:40:26,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,253 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-28 15:40:26,253 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,253 INFO L82 PathProgramCache]: Analyzing trace with hash -740381348, now seen corresponding path program 1 times [2019-11-28 15:40:26,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760826711] [2019-11-28 15:40:26,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,292 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-28 15:40:26,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760826711] [2019-11-28 15:40:26,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011869150] [2019-11-28 15:40:26,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,294 INFO L87 Difference]: Start difference. First operand 1083 states and 1712 transitions. Second operand 3 states. [2019-11-28 15:40:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,359 INFO L93 Difference]: Finished difference Result 2528 states and 3999 transitions. [2019-11-28 15:40:26,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-28 15:40:26,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,366 INFO L225 Difference]: With dead ends: 2528 [2019-11-28 15:40:26,367 INFO L226 Difference]: Without dead ends: 1452 [2019-11-28 15:40:26,369 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-28 15:40:26,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2019-11-28 15:40:26,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1452. [2019-11-28 15:40:26,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1452 states. [2019-11-28 15:40:26,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 2294 transitions. [2019-11-28 15:40:26,424 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 2294 transitions. Word has length 121 [2019-11-28 15:40:26,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,424 INFO L462 AbstractCegarLoop]: Abstraction has 1452 states and 2294 transitions. [2019-11-28 15:40:26,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 2294 transitions. [2019-11-28 15:40:26,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-28 15:40:26,428 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,428 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-28 15:40:26,428 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,429 INFO L82 PathProgramCache]: Analyzing trace with hash 648912666, now seen corresponding path program 1 times [2019-11-28 15:40:26,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896229286] [2019-11-28 15:40:26,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-28 15:40:26,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896229286] [2019-11-28 15:40:26,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:26,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091863898] [2019-11-28 15:40:26,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,465 INFO L87 Difference]: Start difference. First operand 1452 states and 2294 transitions. Second operand 3 states. [2019-11-28 15:40:26,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,542 INFO L93 Difference]: Finished difference Result 3248 states and 5132 transitions. [2019-11-28 15:40:26,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-28 15:40:26,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,555 INFO L225 Difference]: With dead ends: 3248 [2019-11-28 15:40:26,555 INFO L226 Difference]: Without dead ends: 1803 [2019-11-28 15:40:26,558 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-28 15:40:26,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2019-11-28 15:40:26,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1803. [2019-11-28 15:40:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-11-28 15:40:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2845 transitions. [2019-11-28 15:40:26,635 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2845 transitions. Word has length 121 [2019-11-28 15:40:26,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,636 INFO L462 AbstractCegarLoop]: Abstraction has 1803 states and 2845 transitions. [2019-11-28 15:40:26,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2845 transitions. [2019-11-28 15:40:26,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-28 15:40:26,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,642 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:26,642 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1430663259, now seen corresponding path program 1 times [2019-11-28 15:40:26,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968908067] [2019-11-28 15:40:26,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,715 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-28 15:40:26,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968908067] [2019-11-28 15:40:26,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244564556] [2019-11-28 15:40:26,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,719 INFO L87 Difference]: Start difference. First operand 1803 states and 2845 transitions. Second operand 3 states. [2019-11-28 15:40:26,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,927 INFO L93 Difference]: Finished difference Result 3649 states and 5739 transitions. [2019-11-28 15:40:26,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-28 15:40:26,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,937 INFO L225 Difference]: With dead ends: 3649 [2019-11-28 15:40:26,937 INFO L226 Difference]: Without dead ends: 1853 [2019-11-28 15:40:26,940 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-28 15:40:26,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2019-11-28 15:40:27,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1803. [2019-11-28 15:40:27,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-11-28 15:40:27,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2773 transitions. [2019-11-28 15:40:27,025 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2773 transitions. Word has length 198 [2019-11-28 15:40:27,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:27,025 INFO L462 AbstractCegarLoop]: Abstraction has 1803 states and 2773 transitions. [2019-11-28 15:40:27,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:27,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2773 transitions. [2019-11-28 15:40:27,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-28 15:40:27,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:27,032 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 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, 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] [2019-11-28 15:40:27,032 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:27,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:27,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1183282719, now seen corresponding path program 1 times [2019-11-28 15:40:27,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:27,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110234790] [2019-11-28 15:40:27,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:27,187 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-28 15:40:27,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110234790] [2019-11-28 15:40:27,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:27,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:27,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836088162] [2019-11-28 15:40:27,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:27,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:27,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:27,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:27,189 INFO L87 Difference]: Start difference. First operand 1803 states and 2773 transitions. Second operand 3 states. [2019-11-28 15:40:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:27,393 INFO L93 Difference]: Finished difference Result 3666 states and 5612 transitions. [2019-11-28 15:40:27,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:27,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-11-28 15:40:27,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:27,403 INFO L225 Difference]: With dead ends: 3666 [2019-11-28 15:40:27,403 INFO L226 Difference]: Without dead ends: 1870 [2019-11-28 15:40:27,406 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-28 15:40:27,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2019-11-28 15:40:27,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1803. [2019-11-28 15:40:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-11-28 15:40:27,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2697 transitions. [2019-11-28 15:40:27,473 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2697 transitions. Word has length 212 [2019-11-28 15:40:27,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:27,473 INFO L462 AbstractCegarLoop]: Abstraction has 1803 states and 2697 transitions. [2019-11-28 15:40:27,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:27,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2697 transitions. [2019-11-28 15:40:27,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-28 15:40:27,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:27,479 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-28 15:40:27,479 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:27,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:27,479 INFO L82 PathProgramCache]: Analyzing trace with hash 317822775, now seen corresponding path program 1 times [2019-11-28 15:40:27,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:27,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575444256] [2019-11-28 15:40:27,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:27,567 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-28 15:40:27,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575444256] [2019-11-28 15:40:27,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042051690] [2019-11-28 15:40:27,568 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-28 15:40:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:27,668 INFO L264 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:40:27,692 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-28 15:40:27,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:40:27,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 15:40:27,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754773173] [2019-11-28 15:40:27,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:40:27,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:27,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:40:27,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:40:27,761 INFO L87 Difference]: Start difference. First operand 1803 states and 2697 transitions. Second operand 4 states. [2019-11-28 15:40:28,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:28,188 INFO L93 Difference]: Finished difference Result 4264 states and 6328 transitions. [2019-11-28 15:40:28,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:40:28,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-11-28 15:40:28,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:28,202 INFO L225 Difference]: With dead ends: 4264 [2019-11-28 15:40:28,203 INFO L226 Difference]: Without dead ends: 2435 [2019-11-28 15:40:28,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 233 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-28 15:40:28,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2019-11-28 15:40:28,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 1603. [2019-11-28 15:40:28,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2019-11-28 15:40:28,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2361 transitions. [2019-11-28 15:40:28,282 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2361 transitions. Word has length 231 [2019-11-28 15:40:28,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:28,283 INFO L462 AbstractCegarLoop]: Abstraction has 1603 states and 2361 transitions. [2019-11-28 15:40:28,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:40:28,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2361 transitions. [2019-11-28 15:40:28,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-28 15:40:28,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:28,289 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-28 15:40:28,492 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:28,493 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:28,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:28,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1244258795, now seen corresponding path program 1 times [2019-11-28 15:40:28,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:28,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836133754] [2019-11-28 15:40:28,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:28,617 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-11-28 15:40:28,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836133754] [2019-11-28 15:40:28,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:28,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:28,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035585881] [2019-11-28 15:40:28,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:28,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:28,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:28,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:28,620 INFO L87 Difference]: Start difference. First operand 1603 states and 2361 transitions. Second operand 3 states. [2019-11-28 15:40:28,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:28,847 INFO L93 Difference]: Finished difference Result 3394 states and 5016 transitions. [2019-11-28 15:40:28,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:28,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-11-28 15:40:28,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:28,858 INFO L225 Difference]: With dead ends: 3394 [2019-11-28 15:40:28,858 INFO L226 Difference]: Without dead ends: 1678 [2019-11-28 15:40:28,867 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-28 15:40:28,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-11-28 15:40:28,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1678. [2019-11-28 15:40:28,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1678 states. [2019-11-28 15:40:28,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 2426 transitions. [2019-11-28 15:40:28,940 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 2426 transitions. Word has length 240 [2019-11-28 15:40:28,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:28,941 INFO L462 AbstractCegarLoop]: Abstraction has 1678 states and 2426 transitions. [2019-11-28 15:40:28,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:28,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2426 transitions. [2019-11-28 15:40:28,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-28 15:40:28,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:28,949 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-28 15:40:28,950 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:28,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:28,951 INFO L82 PathProgramCache]: Analyzing trace with hash -2075878606, now seen corresponding path program 1 times [2019-11-28 15:40:28,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:28,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668709346] [2019-11-28 15:40:28,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-28 15:40:29,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668709346] [2019-11-28 15:40:29,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673005416] [2019-11-28 15:40:29,076 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-28 15:40:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:29,176 INFO L264 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:40:29,194 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-28 15:40:29,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:40:29,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 15:40:29,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688131927] [2019-11-28 15:40:29,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:40:29,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:29,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:40:29,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:40:29,251 INFO L87 Difference]: Start difference. First operand 1678 states and 2426 transitions. Second operand 4 states. [2019-11-28 15:40:29,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:29,710 INFO L93 Difference]: Finished difference Result 5319 states and 7732 transitions. [2019-11-28 15:40:29,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:40:29,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-11-28 15:40:29,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:29,728 INFO L225 Difference]: With dead ends: 5319 [2019-11-28 15:40:29,729 INFO L226 Difference]: Without dead ends: 3648 [2019-11-28 15:40:29,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 254 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-28 15:40:29,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2019-11-28 15:40:29,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 2003. [2019-11-28 15:40:29,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2003 states. [2019-11-28 15:40:29,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 2003 states and 2728 transitions. [2019-11-28 15:40:29,820 INFO L78 Accepts]: Start accepts. Automaton has 2003 states and 2728 transitions. Word has length 252 [2019-11-28 15:40:29,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:29,820 INFO L462 AbstractCegarLoop]: Abstraction has 2003 states and 2728 transitions. [2019-11-28 15:40:29,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:40:29,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 2728 transitions. [2019-11-28 15:40:29,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-28 15:40:29,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:29,827 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-28 15:40:30,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:30,033 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:30,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:30,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1787059216, now seen corresponding path program 1 times [2019-11-28 15:40:30,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:30,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489875096] [2019-11-28 15:40:30,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:30,123 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-28 15:40:30,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489875096] [2019-11-28 15:40:30,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:30,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:30,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896308356] [2019-11-28 15:40:30,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:30,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:30,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:30,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:30,126 INFO L87 Difference]: Start difference. First operand 2003 states and 2728 transitions. Second operand 3 states. [2019-11-28 15:40:30,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:30,272 INFO L93 Difference]: Finished difference Result 5741 states and 7863 transitions. [2019-11-28 15:40:30,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:30,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-11-28 15:40:30,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:30,294 INFO L225 Difference]: With dead ends: 5741 [2019-11-28 15:40:30,294 INFO L226 Difference]: Without dead ends: 3745 [2019-11-28 15:40:30,298 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-28 15:40:30,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2019-11-28 15:40:30,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3743. [2019-11-28 15:40:30,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3743 states. [2019-11-28 15:40:30,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5133 transitions. [2019-11-28 15:40:30,521 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5133 transitions. Word has length 252 [2019-11-28 15:40:30,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:30,522 INFO L462 AbstractCegarLoop]: Abstraction has 3743 states and 5133 transitions. [2019-11-28 15:40:30,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:30,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5133 transitions. [2019-11-28 15:40:30,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-11-28 15:40:30,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:30,539 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-28 15:40:30,540 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:30,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:30,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1938581061, now seen corresponding path program 1 times [2019-11-28 15:40:30,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:30,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457544048] [2019-11-28 15:40:30,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:30,734 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-28 15:40:30,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457544048] [2019-11-28 15:40:30,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:30,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:30,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144085183] [2019-11-28 15:40:30,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:30,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:30,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:30,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:30,739 INFO L87 Difference]: Start difference. First operand 3743 states and 5133 transitions. Second operand 3 states. [2019-11-28 15:40:31,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:31,088 INFO L93 Difference]: Finished difference Result 7697 states and 10553 transitions. [2019-11-28 15:40:31,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:31,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-11-28 15:40:31,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:31,100 INFO L225 Difference]: With dead ends: 7697 [2019-11-28 15:40:31,100 INFO L226 Difference]: Without dead ends: 3961 [2019-11-28 15:40:31,106 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-28 15:40:31,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3961 states. [2019-11-28 15:40:31,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3961 to 3743. [2019-11-28 15:40:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3743 states. [2019-11-28 15:40:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5029 transitions. [2019-11-28 15:40:31,302 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5029 transitions. Word has length 255 [2019-11-28 15:40:31,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:31,303 INFO L462 AbstractCegarLoop]: Abstraction has 3743 states and 5029 transitions. [2019-11-28 15:40:31,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:31,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5029 transitions. [2019-11-28 15:40:31,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-11-28 15:40:31,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:31,321 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-11-28 15:40:31,322 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:31,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:31,323 INFO L82 PathProgramCache]: Analyzing trace with hash 501059335, now seen corresponding path program 1 times [2019-11-28 15:40:31,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:31,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773807289] [2019-11-28 15:40:31,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:31,459 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-11-28 15:40:31,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773807289] [2019-11-28 15:40:31,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:31,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:31,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678681842] [2019-11-28 15:40:31,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:31,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:31,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:31,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:31,463 INFO L87 Difference]: Start difference. First operand 3743 states and 5029 transitions. Second operand 3 states. [2019-11-28 15:40:31,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:31,755 INFO L93 Difference]: Finished difference Result 7611 states and 10229 transitions. [2019-11-28 15:40:31,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:31,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2019-11-28 15:40:31,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:31,782 INFO L225 Difference]: With dead ends: 7611 [2019-11-28 15:40:31,782 INFO L226 Difference]: Without dead ends: 3875 [2019-11-28 15:40:31,791 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-28 15:40:31,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3875 states. [2019-11-28 15:40:31,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3875 to 3835. [2019-11-28 15:40:31,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3835 states. [2019-11-28 15:40:31,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3835 states to 3835 states and 5141 transitions. [2019-11-28 15:40:31,962 INFO L78 Accepts]: Start accepts. Automaton has 3835 states and 5141 transitions. Word has length 289 [2019-11-28 15:40:31,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:31,962 INFO L462 AbstractCegarLoop]: Abstraction has 3835 states and 5141 transitions. [2019-11-28 15:40:31,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3835 states and 5141 transitions. [2019-11-28 15:40:31,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-11-28 15:40:31,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:31,974 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-11-28 15:40:31,974 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:31,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:31,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1381959862, now seen corresponding path program 1 times [2019-11-28 15:40:31,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:31,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356967735] [2019-11-28 15:40:31,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2019-11-28 15:40:32,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356967735] [2019-11-28 15:40:32,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:32,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:32,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072173784] [2019-11-28 15:40:32,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:32,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:32,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:32,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:32,087 INFO L87 Difference]: Start difference. First operand 3835 states and 5141 transitions. Second operand 3 states. [2019-11-28 15:40:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:32,320 INFO L93 Difference]: Finished difference Result 8043 states and 10851 transitions. [2019-11-28 15:40:32,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:32,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-11-28 15:40:32,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:32,330 INFO L225 Difference]: With dead ends: 8043 [2019-11-28 15:40:32,331 INFO L226 Difference]: Without dead ends: 4215 [2019-11-28 15:40:32,336 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-28 15:40:32,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4215 states. [2019-11-28 15:40:32,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4215 to 4085. [2019-11-28 15:40:32,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4085 states. [2019-11-28 15:40:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4085 states to 4085 states and 5441 transitions. [2019-11-28 15:40:32,501 INFO L78 Accepts]: Start accepts. Automaton has 4085 states and 5441 transitions. Word has length 310 [2019-11-28 15:40:32,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:32,501 INFO L462 AbstractCegarLoop]: Abstraction has 4085 states and 5441 transitions. [2019-11-28 15:40:32,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:32,502 INFO L276 IsEmpty]: Start isEmpty. Operand 4085 states and 5441 transitions. [2019-11-28 15:40:32,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-11-28 15:40:32,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:32,513 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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-28 15:40:32,513 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:32,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:32,513 INFO L82 PathProgramCache]: Analyzing trace with hash -978123879, now seen corresponding path program 1 times [2019-11-28 15:40:32,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:32,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527719985] [2019-11-28 15:40:32,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-11-28 15:40:32,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527719985] [2019-11-28 15:40:32,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:32,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:32,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866886830] [2019-11-28 15:40:32,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:32,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:32,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:32,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:32,629 INFO L87 Difference]: Start difference. First operand 4085 states and 5441 transitions. Second operand 3 states. [2019-11-28 15:40:32,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:32,799 INFO L93 Difference]: Finished difference Result 6854 states and 9018 transitions. [2019-11-28 15:40:32,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:32,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-11-28 15:40:32,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:32,807 INFO L225 Difference]: With dead ends: 6854 [2019-11-28 15:40:32,808 INFO L226 Difference]: Without dead ends: 2132 [2019-11-28 15:40:32,814 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-28 15:40:32,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2019-11-28 15:40:32,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2132. [2019-11-28 15:40:32,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-11-28 15:40:32,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2773 transitions. [2019-11-28 15:40:32,885 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2773 transitions. Word has length 320 [2019-11-28 15:40:32,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:32,885 INFO L462 AbstractCegarLoop]: Abstraction has 2132 states and 2773 transitions. [2019-11-28 15:40:32,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:32,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2773 transitions. [2019-11-28 15:40:32,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-28 15:40:32,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:32,894 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-11-28 15:40:32,894 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:32,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:32,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1544826379, now seen corresponding path program 1 times [2019-11-28 15:40:32,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:32,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981232388] [2019-11-28 15:40:32,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:33,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-11-28 15:40:33,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981232388] [2019-11-28 15:40:33,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:33,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:33,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277925099] [2019-11-28 15:40:33,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:33,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:33,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:33,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:33,007 INFO L87 Difference]: Start difference. First operand 2132 states and 2773 transitions. Second operand 3 states. [2019-11-28 15:40:33,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:33,215 INFO L93 Difference]: Finished difference Result 4297 states and 5600 transitions. [2019-11-28 15:40:33,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:33,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-11-28 15:40:33,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:33,221 INFO L225 Difference]: With dead ends: 4297 [2019-11-28 15:40:33,221 INFO L226 Difference]: Without dead ends: 2172 [2019-11-28 15:40:33,228 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-28 15:40:33,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2019-11-28 15:40:33,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2132. [2019-11-28 15:40:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-11-28 15:40:33,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2733 transitions. [2019-11-28 15:40:33,303 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2733 transitions. Word has length 336 [2019-11-28 15:40:33,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:33,304 INFO L462 AbstractCegarLoop]: Abstraction has 2132 states and 2733 transitions. [2019-11-28 15:40:33,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:33,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2733 transitions. [2019-11-28 15:40:33,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-11-28 15:40:33,312 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:33,312 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-11-28 15:40:33,313 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:33,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:33,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1385591610, now seen corresponding path program 1 times [2019-11-28 15:40:33,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:33,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951031686] [2019-11-28 15:40:33,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:33,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-11-28 15:40:33,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951031686] [2019-11-28 15:40:33,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:33,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:33,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097615509] [2019-11-28 15:40:33,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:33,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:33,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:33,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:33,459 INFO L87 Difference]: Start difference. First operand 2132 states and 2733 transitions. Second operand 3 states. [2019-11-28 15:40:33,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:33,695 INFO L93 Difference]: Finished difference Result 4267 states and 5465 transitions. [2019-11-28 15:40:33,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:33,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 359 [2019-11-28 15:40:33,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:33,701 INFO L225 Difference]: With dead ends: 4267 [2019-11-28 15:40:33,702 INFO L226 Difference]: Without dead ends: 2142 [2019-11-28 15:40:33,708 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-28 15:40:33,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2019-11-28 15:40:33,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 2132. [2019-11-28 15:40:33,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-11-28 15:40:33,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2693 transitions. [2019-11-28 15:40:33,817 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2693 transitions. Word has length 359 [2019-11-28 15:40:33,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:33,818 INFO L462 AbstractCegarLoop]: Abstraction has 2132 states and 2693 transitions. [2019-11-28 15:40:33,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2693 transitions. [2019-11-28 15:40:33,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-11-28 15:40:33,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:33,830 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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-28 15:40:33,830 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:33,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:33,831 INFO L82 PathProgramCache]: Analyzing trace with hash 228313073, now seen corresponding path program 1 times [2019-11-28 15:40:33,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:33,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073861058] [2019-11-28 15:40:33,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:34,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-11-28 15:40:34,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073861058] [2019-11-28 15:40:34,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329514998] [2019-11-28 15:40:34,058 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-28 15:40:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:34,184 INFO L264 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:40:34,189 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-11-28 15:40:34,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:40:34,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-28 15:40:34,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198733411] [2019-11-28 15:40:34,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:34,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:34,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:34,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:34,352 INFO L87 Difference]: Start difference. First operand 2132 states and 2693 transitions. Second operand 3 states. [2019-11-28 15:40:34,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:34,425 INFO L93 Difference]: Finished difference Result 2710 states and 3447 transitions. [2019-11-28 15:40:34,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:34,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-11-28 15:40:34,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:34,435 INFO L225 Difference]: With dead ends: 2710 [2019-11-28 15:40:34,436 INFO L226 Difference]: Without dead ends: 2572 [2019-11-28 15:40:34,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 392 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-28 15:40:34,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2019-11-28 15:40:34,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 1996. [2019-11-28 15:40:34,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1996 states. [2019-11-28 15:40:34,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 2539 transitions. [2019-11-28 15:40:34,515 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 2539 transitions. Word has length 392 [2019-11-28 15:40:34,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:34,516 INFO L462 AbstractCegarLoop]: Abstraction has 1996 states and 2539 transitions. [2019-11-28 15:40:34,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:34,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2539 transitions. [2019-11-28 15:40:34,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-11-28 15:40:34,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:34,527 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-11-28 15:40:34,733 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:34,733 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:34,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:34,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1194864871, now seen corresponding path program 1 times [2019-11-28 15:40:34,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:34,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148406175] [2019-11-28 15:40:34,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-11-28 15:40:34,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148406175] [2019-11-28 15:40:34,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434825495] [2019-11-28 15:40:34,900 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-28 15:40:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:35,027 INFO L264 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:40:35,032 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:35,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-11-28 15:40:35,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:40:35,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 15:40:35,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566029151] [2019-11-28 15:40:35,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:40:35,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:35,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:40:35,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:40:35,187 INFO L87 Difference]: Start difference. First operand 1996 states and 2539 transitions. Second operand 4 states. [2019-11-28 15:40:35,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:35,568 INFO L93 Difference]: Finished difference Result 5015 states and 6403 transitions. [2019-11-28 15:40:35,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:40:35,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 408 [2019-11-28 15:40:35,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:35,575 INFO L225 Difference]: With dead ends: 5015 [2019-11-28 15:40:35,575 INFO L226 Difference]: Without dead ends: 2984 [2019-11-28 15:40:35,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 410 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-28 15:40:35,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2019-11-28 15:40:35,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2156. [2019-11-28 15:40:35,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2156 states. [2019-11-28 15:40:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2759 transitions. [2019-11-28 15:40:35,650 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2759 transitions. Word has length 408 [2019-11-28 15:40:35,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:35,650 INFO L462 AbstractCegarLoop]: Abstraction has 2156 states and 2759 transitions. [2019-11-28 15:40:35,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:40:35,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2759 transitions. [2019-11-28 15:40:35,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2019-11-28 15:40:35,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:35,664 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:40:35,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:35,869 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:35,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:35,870 INFO L82 PathProgramCache]: Analyzing trace with hash 276993037, now seen corresponding path program 1 times [2019-11-28 15:40:35,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:35,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970616358] [2019-11-28 15:40:35,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:36,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2337 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2019-11-28 15:40:36,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970616358] [2019-11-28 15:40:36,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:36,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:36,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154409195] [2019-11-28 15:40:36,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:36,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:36,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:36,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:36,048 INFO L87 Difference]: Start difference. First operand 2156 states and 2759 transitions. Second operand 3 states. [2019-11-28 15:40:36,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:36,222 INFO L93 Difference]: Finished difference Result 4485 states and 5762 transitions. [2019-11-28 15:40:36,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:36,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 470 [2019-11-28 15:40:36,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:36,227 INFO L225 Difference]: With dead ends: 4485 [2019-11-28 15:40:36,227 INFO L226 Difference]: Without dead ends: 2336 [2019-11-28 15:40:36,231 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-28 15:40:36,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2019-11-28 15:40:36,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2326. [2019-11-28 15:40:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-11-28 15:40:36,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 2954 transitions. [2019-11-28 15:40:36,296 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 2954 transitions. Word has length 470 [2019-11-28 15:40:36,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:36,297 INFO L462 AbstractCegarLoop]: Abstraction has 2326 states and 2954 transitions. [2019-11-28 15:40:36,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:36,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 2954 transitions. [2019-11-28 15:40:36,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-11-28 15:40:36,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:36,304 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:40:36,304 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:36,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:36,305 INFO L82 PathProgramCache]: Analyzing trace with hash 373235815, now seen corresponding path program 1 times [2019-11-28 15:40:36,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:36,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999147409] [2019-11-28 15:40:36,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3102 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1342 trivial. 0 not checked. [2019-11-28 15:40:36,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999147409] [2019-11-28 15:40:36,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:36,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:36,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458725045] [2019-11-28 15:40:36,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:36,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:36,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:36,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:36,581 INFO L87 Difference]: Start difference. First operand 2326 states and 2954 transitions. Second operand 3 states. [2019-11-28 15:40:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:36,762 INFO L93 Difference]: Finished difference Result 4640 states and 5887 transitions. [2019-11-28 15:40:36,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:36,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 532 [2019-11-28 15:40:36,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:36,768 INFO L225 Difference]: With dead ends: 4640 [2019-11-28 15:40:36,768 INFO L226 Difference]: Without dead ends: 2321 [2019-11-28 15:40:36,771 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-28 15:40:36,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2019-11-28 15:40:36,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2321. [2019-11-28 15:40:36,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2321 states. [2019-11-28 15:40:36,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 2884 transitions. [2019-11-28 15:40:36,837 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 2884 transitions. Word has length 532 [2019-11-28 15:40:36,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:36,838 INFO L462 AbstractCegarLoop]: Abstraction has 2321 states and 2884 transitions. [2019-11-28 15:40:36,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:36,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 2884 transitions. [2019-11-28 15:40:36,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2019-11-28 15:40:36,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:36,847 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:40:36,847 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:36,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:36,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1632000361, now seen corresponding path program 1 times [2019-11-28 15:40:36,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:36,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446284630] [2019-11-28 15:40:36,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-28 15:40:37,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446284630] [2019-11-28 15:40:37,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396119390] [2019-11-28 15:40:37,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-28 15:40:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:37,246 INFO L264 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:40:37,252 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:37,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-28 15:40:37,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:40:37,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 15:40:37,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947712971] [2019-11-28 15:40:37,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:40:37,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:37,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:40:37,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:40:37,589 INFO L87 Difference]: Start difference. First operand 2321 states and 2884 transitions. Second operand 4 states. [2019-11-28 15:40:37,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:37,795 INFO L93 Difference]: Finished difference Result 3916 states and 4894 transitions. [2019-11-28 15:40:37,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:40:37,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 598 [2019-11-28 15:40:37,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:37,797 INFO L225 Difference]: With dead ends: 3916 [2019-11-28 15:40:37,797 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:40:37,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 600 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-28 15:40:37,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:40:37,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:40:37,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:40:37,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:40:37,803 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 598 [2019-11-28 15:40:37,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:37,803 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:40:37,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:40:37,804 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:40:37,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:40:38,010 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:38,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:40:38,139 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-11-28 15:40:39,230 WARN L192 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 211 [2019-11-28 15:40:40,079 WARN L192 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 211 [2019-11-28 15:40:40,526 WARN L192 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2019-11-28 15:40:40,939 WARN L192 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-11-28 15:40:41,409 WARN L192 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-11-28 15:40:41,700 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 24 [2019-11-28 15:40:41,930 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 24 [2019-11-28 15:40:42,291 WARN L192 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2019-11-28 15:40:44,752 WARN L192 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 176 DAG size of output: 103 [2019-11-28 15:40:45,099 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-11-28 15:40:45,494 WARN L192 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 44 [2019-11-28 15:40:45,742 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-11-28 15:40:45,961 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 25 [2019-11-28 15:40:46,278 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 29 [2019-11-28 15:40:46,598 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-28 15:40:47,007 WARN L192 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-11-28 15:40:47,384 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 33 [2019-11-28 15:40:47,818 WARN L192 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-11-28 15:40:50,373 WARN L192 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 176 DAG size of output: 103 [2019-11-28 15:40:50,658 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-11-28 15:40:50,920 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-11-28 15:40:51,193 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 19 [2019-11-28 15:40:51,469 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-11-28 15:40:51,473 INFO L246 CegarLoopResult]: For program point L465(lines 465 467) no Hoare annotation was computed. [2019-11-28 15:40:51,474 INFO L246 CegarLoopResult]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-11-28 15:40:51,474 INFO L246 CegarLoopResult]: For program point L333(lines 333 363) no Hoare annotation was computed. [2019-11-28 15:40:51,478 INFO L242 CegarLoopResult]: At program point L201(lines 197 546) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (and .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2) (and (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) (and .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2))) [2019-11-28 15:40:51,478 INFO L242 CegarLoopResult]: At program point L102(lines 101 578) the Hoare annotation is: false [2019-11-28 15:40:51,478 INFO L249 CegarLoopResult]: At program point L598(lines 97 599) the Hoare annotation is: true [2019-11-28 15:40:51,479 INFO L246 CegarLoopResult]: For program point L532(lines 532 534) no Hoare annotation was computed. [2019-11-28 15:40:51,479 INFO L246 CegarLoopResult]: For program point L203(lines 203 544) no Hoare annotation was computed. [2019-11-28 15:40:51,479 INFO L246 CegarLoopResult]: For program point L170(lines 170 555) no Hoare annotation was computed. [2019-11-28 15:40:51,479 INFO L246 CegarLoopResult]: For program point L137(lines 137 566) no Hoare annotation was computed. [2019-11-28 15:40:51,479 INFO L246 CegarLoopResult]: For program point L104(lines 104 577) no Hoare annotation was computed. [2019-11-28 15:40:51,480 INFO L246 CegarLoopResult]: For program point L303(lines 303 310) no Hoare annotation was computed. [2019-11-28 15:40:51,480 INFO L246 CegarLoopResult]: For program point L303-2(lines 303 310) no Hoare annotation was computed. [2019-11-28 15:40:51,480 INFO L242 CegarLoopResult]: At program point L204(lines 203 544) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-28 15:40:51,480 INFO L242 CegarLoopResult]: At program point L171(lines 167 556) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse5 .cse6 .cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2 .cse3 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-11-28 15:40:51,481 INFO L242 CegarLoopResult]: At program point L138(lines 134 567) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-11-28 15:40:51,483 INFO L246 CegarLoopResult]: For program point L338(lines 338 361) no Hoare annotation was computed. [2019-11-28 15:40:51,483 INFO L242 CegarLoopResult]: At program point L206(lines 205 544) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-28 15:40:51,483 INFO L246 CegarLoopResult]: For program point L173(lines 173 554) no Hoare annotation was computed. [2019-11-28 15:40:51,483 INFO L246 CegarLoopResult]: For program point L140(lines 140 565) no Hoare annotation was computed. [2019-11-28 15:40:51,483 INFO L246 CegarLoopResult]: For program point L107(lines 107 576) no Hoare annotation was computed. [2019-11-28 15:40:51,483 INFO L246 CegarLoopResult]: For program point L603(lines 603 605) no Hoare annotation was computed. [2019-11-28 15:40:51,484 INFO L246 CegarLoopResult]: For program point L603-2(lines 603 605) no Hoare annotation was computed. [2019-11-28 15:40:51,484 INFO L246 CegarLoopResult]: For program point L504(lines 504 507) no Hoare annotation was computed. [2019-11-28 15:40:51,484 INFO L246 CegarLoopResult]: For program point L273(lines 273 275) no Hoare annotation was computed. [2019-11-28 15:40:51,484 INFO L246 CegarLoopResult]: For program point L273-2(lines 207 541) no Hoare annotation was computed. [2019-11-28 15:40:51,484 INFO L246 CegarLoopResult]: For program point L439(lines 439 441) no Hoare annotation was computed. [2019-11-28 15:40:51,484 INFO L246 CegarLoopResult]: For program point L307(lines 307 309) no Hoare annotation was computed. [2019-11-28 15:40:51,484 INFO L246 CegarLoopResult]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-28 15:40:51,485 INFO L246 CegarLoopResult]: For program point L341-2(lines 341 345) no Hoare annotation was computed. [2019-11-28 15:40:51,485 INFO L246 CegarLoopResult]: For program point L242(lines 242 252) no Hoare annotation was computed. [2019-11-28 15:40:51,485 INFO L246 CegarLoopResult]: For program point L176(lines 176 553) no Hoare annotation was computed. [2019-11-28 15:40:51,485 INFO L246 CegarLoopResult]: For program point L143(lines 143 564) no Hoare annotation was computed. [2019-11-28 15:40:51,485 INFO L246 CegarLoopResult]: For program point L110(lines 110 575) no Hoare annotation was computed. [2019-11-28 15:40:51,485 INFO L246 CegarLoopResult]: For program point L474(lines 474 476) no Hoare annotation was computed. [2019-11-28 15:40:51,486 INFO L246 CegarLoopResult]: For program point L375(lines 375 407) no Hoare annotation was computed. [2019-11-28 15:40:51,486 INFO L246 CegarLoopResult]: For program point L243(lines 243 246) no Hoare annotation was computed. [2019-11-28 15:40:51,486 INFO L242 CegarLoopResult]: At program point L210(lines 104 577) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 .cse1 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2) (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2))) [2019-11-28 15:40:51,486 INFO L242 CegarLoopResult]: At program point L177(lines 173 554) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse5 .cse6 .cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2 .cse3 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-11-28 15:40:51,487 INFO L242 CegarLoopResult]: At program point L144(lines 140 565) the Hoare annotation is: (let ((.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2) (and .cse3 .cse4 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2))) [2019-11-28 15:40:51,487 INFO L246 CegarLoopResult]: For program point L442(lines 442 451) no Hoare annotation was computed. [2019-11-28 15:40:51,487 INFO L246 CegarLoopResult]: For program point L376(lines 376 382) no Hoare annotation was computed. [2019-11-28 15:40:51,488 INFO L249 CegarLoopResult]: At program point L608(lines 10 610) the Hoare annotation is: true [2019-11-28 15:40:51,488 INFO L242 CegarLoopResult]: At program point L542(lines 98 597) the Hoare annotation is: (let ((.cse21 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse29 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (.cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse27 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse2 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse23 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse5 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse3 (not .cse10)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse26 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse24 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse22 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse28 (not .cse29)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse12 (not .cse21)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse19 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse15 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse8) (and .cse9 .cse10 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse20 .cse9 .cse10) (and .cse21 .cse15 .cse10) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse22 .cse8 .cse23 .cse3) (and .cse0 .cse24 .cse25 .cse26) (and .cse27 .cse9 .cse10 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (and .cse4 .cse24 .cse6) (and .cse7 .cse24) (and .cse27 .cse5 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse27 .cse24 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse0 .cse4 .cse1 .cse2) (and .cse11 .cse5 .cse13 .cse14 .cse16 .cse22 .cse6 .cse20 .cse9) (and .cse0 .cse5 .cse25 .cse26 .cse10) (and .cse7 .cse5) (and .cse4 .cse15 .cse6 .cse10) (and .cse5 .cse18 .cse26) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse22 .cse23 .cse10) (and .cse11 .cse13 .cse14 .cse24 .cse16 .cse22 .cse17 .cse6 .cse20 .cse9) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (and .cse0 .cse25 .cse15 .cse26 .cse3) (and .cse5 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse7 .cse15) (and .cse8 .cse18 .cse26 .cse3) (and .cse0 .cse4 .cse25 .cse15 .cse26) (and .cse24 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse15 .cse29 .cse10)))) [2019-11-28 15:40:51,488 INFO L246 CegarLoopResult]: For program point L179(lines 179 552) no Hoare annotation was computed. [2019-11-28 15:40:51,489 INFO L246 CegarLoopResult]: For program point L146(lines 146 563) no Hoare annotation was computed. [2019-11-28 15:40:51,489 INFO L246 CegarLoopResult]: For program point L113(lines 113 574) no Hoare annotation was computed. [2019-11-28 15:40:51,489 INFO L246 CegarLoopResult]: For program point L477(lines 477 481) no Hoare annotation was computed. [2019-11-28 15:40:51,489 INFO L246 CegarLoopResult]: For program point L477-2(lines 477 481) no Hoare annotation was computed. [2019-11-28 15:40:51,489 INFO L246 CegarLoopResult]: For program point L81(lines 81 87) no Hoare annotation was computed. [2019-11-28 15:40:51,490 INFO L246 CegarLoopResult]: For program point L512(lines 512 514) no Hoare annotation was computed. [2019-11-28 15:40:51,490 INFO L246 CegarLoopResult]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-11-28 15:40:51,490 INFO L246 CegarLoopResult]: For program point L215(lines 215 217) no Hoare annotation was computed. [2019-11-28 15:40:51,490 INFO L246 CegarLoopResult]: For program point L182(lines 182 551) no Hoare annotation was computed. [2019-11-28 15:40:51,490 INFO L246 CegarLoopResult]: For program point L149(lines 149 562) no Hoare annotation was computed. [2019-11-28 15:40:51,490 INFO L246 CegarLoopResult]: For program point L215-2(lines 215 217) no Hoare annotation was computed. [2019-11-28 15:40:51,491 INFO L246 CegarLoopResult]: For program point L116(lines 116 573) no Hoare annotation was computed. [2019-11-28 15:40:51,491 INFO L246 CegarLoopResult]: For program point L579(lines 579 595) no Hoare annotation was computed. [2019-11-28 15:40:51,491 INFO L242 CegarLoopResult]: At program point L513(lines 71 609) the Hoare annotation is: false [2019-11-28 15:40:51,491 INFO L242 CegarLoopResult]: At program point L183(lines 179 552) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0))) [2019-11-28 15:40:51,491 INFO L242 CegarLoopResult]: At program point L150(lines 146 563) the Hoare annotation is: (let ((.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2) (and .cse3 .cse4 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2))) [2019-11-28 15:40:51,492 INFO L246 CegarLoopResult]: For program point L84(lines 84 86) no Hoare annotation was computed. [2019-11-28 15:40:51,492 INFO L246 CegarLoopResult]: For program point L84-2(lines 81 87) no Hoare annotation was computed. [2019-11-28 15:40:51,492 INFO L246 CegarLoopResult]: For program point L580(lines 580 594) no Hoare annotation was computed. [2019-11-28 15:40:51,493 INFO L246 CegarLoopResult]: For program point L349(lines 349 357) no Hoare annotation was computed. [2019-11-28 15:40:51,493 INFO L246 CegarLoopResult]: For program point L581(lines 581 586) no Hoare annotation was computed. [2019-11-28 15:40:51,493 INFO L246 CegarLoopResult]: For program point L515(lines 515 517) no Hoare annotation was computed. [2019-11-28 15:40:51,493 INFO L246 CegarLoopResult]: For program point L581-2(lines 580 594) no Hoare annotation was computed. [2019-11-28 15:40:51,493 INFO L242 CegarLoopResult]: At program point L350(lines 326 368) the Hoare annotation is: (let ((.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2) (and .cse3 .cse4 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2))) [2019-11-28 15:40:51,494 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:40:51,494 INFO L246 CegarLoopResult]: For program point L185(lines 185 550) no Hoare annotation was computed. [2019-11-28 15:40:51,494 INFO L246 CegarLoopResult]: For program point L152(lines 152 561) no Hoare annotation was computed. [2019-11-28 15:40:51,495 INFO L246 CegarLoopResult]: For program point L119(lines 119 572) no Hoare annotation was computed. [2019-11-28 15:40:51,495 INFO L246 CegarLoopResult]: For program point L417(lines 417 419) no Hoare annotation was computed. [2019-11-28 15:40:51,496 INFO L242 CegarLoopResult]: At program point L384(lines 375 407) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-11-28 15:40:51,496 INFO L242 CegarLoopResult]: At program point L120(lines 116 573) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse0 .cse2 .cse3 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-11-28 15:40:51,496 INFO L246 CegarLoopResult]: For program point L583(lines 583 585) no Hoare annotation was computed. [2019-11-28 15:40:51,496 INFO L246 CegarLoopResult]: For program point L352(lines 352 354) no Hoare annotation was computed. [2019-11-28 15:40:51,496 INFO L246 CegarLoopResult]: For program point L286(lines 286 288) no Hoare annotation was computed. [2019-11-28 15:40:51,497 INFO L246 CegarLoopResult]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-11-28 15:40:51,497 INFO L246 CegarLoopResult]: For program point L286-2(lines 207 541) no Hoare annotation was computed. [2019-11-28 15:40:51,497 INFO L246 CegarLoopResult]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-11-28 15:40:51,497 INFO L246 CegarLoopResult]: For program point L320-2(lines 207 541) no Hoare annotation was computed. [2019-11-28 15:40:51,497 INFO L246 CegarLoopResult]: For program point L188(lines 188 549) no Hoare annotation was computed. [2019-11-28 15:40:51,497 INFO L246 CegarLoopResult]: For program point L155(lines 155 560) no Hoare annotation was computed. [2019-11-28 15:40:51,497 INFO L246 CegarLoopResult]: For program point L122(lines 122 571) no Hoare annotation was computed. [2019-11-28 15:40:51,498 INFO L246 CegarLoopResult]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-11-28 15:40:51,498 INFO L246 CegarLoopResult]: For program point L89-1(lines 71 609) no Hoare annotation was computed. [2019-11-28 15:40:51,498 INFO L246 CegarLoopResult]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-11-28 15:40:51,498 INFO L246 CegarLoopResult]: For program point L519-2(lines 519 523) no Hoare annotation was computed. [2019-11-28 15:40:51,498 INFO L246 CegarLoopResult]: For program point L387(lines 387 405) no Hoare annotation was computed. [2019-11-28 15:40:51,498 INFO L242 CegarLoopResult]: At program point L189(lines 185 550) the Hoare annotation is: (let ((.cse5 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3 .cse4 .cse6) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 .cse2 .cse5 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse4 .cse6))) [2019-11-28 15:40:51,499 INFO L242 CegarLoopResult]: At program point L156(lines 152 561) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-11-28 15:40:51,499 INFO L242 CegarLoopResult]: At program point L123(lines 122 571) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-11-28 15:40:51,499 INFO L246 CegarLoopResult]: For program point L90(lines 90 92) no Hoare annotation was computed. [2019-11-28 15:40:51,500 INFO L246 CegarLoopResult]: For program point L487(lines 487 490) no Hoare annotation was computed. [2019-11-28 15:40:51,500 INFO L246 CegarLoopResult]: For program point L388(lines 388 394) no Hoare annotation was computed. [2019-11-28 15:40:51,500 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:40:51,500 INFO L249 CegarLoopResult]: At program point L620(lines 611 622) the Hoare annotation is: true [2019-11-28 15:40:51,500 INFO L246 CegarLoopResult]: For program point L191(lines 191 548) no Hoare annotation was computed. [2019-11-28 15:40:51,500 INFO L246 CegarLoopResult]: For program point L158(lines 158 559) no Hoare annotation was computed. [2019-11-28 15:40:51,501 INFO L246 CegarLoopResult]: For program point L125(lines 125 570) no Hoare annotation was computed. [2019-11-28 15:40:51,501 INFO L246 CegarLoopResult]: For program point L588(lines 588 592) no Hoare annotation was computed. [2019-11-28 15:40:51,501 INFO L246 CegarLoopResult]: For program point L456(lines 456 458) no Hoare annotation was computed. [2019-11-28 15:40:51,501 INFO L246 CegarLoopResult]: For program point L258(lines 258 260) no Hoare annotation was computed. [2019-11-28 15:40:51,501 INFO L246 CegarLoopResult]: For program point L225(lines 225 236) no Hoare annotation was computed. [2019-11-28 15:40:51,501 INFO L246 CegarLoopResult]: For program point L225-2(lines 207 541) no Hoare annotation was computed. [2019-11-28 15:40:51,502 INFO L246 CegarLoopResult]: For program point L292(lines 292 296) no Hoare annotation was computed. [2019-11-28 15:40:51,502 INFO L246 CegarLoopResult]: For program point L292-2(lines 292 296) no Hoare annotation was computed. [2019-11-28 15:40:51,502 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:40:51,502 INFO L246 CegarLoopResult]: For program point L425-1(lines 425 433) no Hoare annotation was computed. [2019-11-28 15:40:51,502 INFO L246 CegarLoopResult]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-11-28 15:40:51,502 INFO L246 CegarLoopResult]: For program point L194(lines 194 547) no Hoare annotation was computed. [2019-11-28 15:40:51,503 INFO L246 CegarLoopResult]: For program point L161(lines 161 558) no Hoare annotation was computed. [2019-11-28 15:40:51,503 INFO L246 CegarLoopResult]: For program point L128(lines 128 569) no Hoare annotation was computed. [2019-11-28 15:40:51,503 INFO L246 CegarLoopResult]: For program point L492(lines 492 498) no Hoare annotation was computed. [2019-11-28 15:40:51,503 INFO L242 CegarLoopResult]: At program point L195(lines 191 548) the Hoare annotation is: (let ((.cse1 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (not .cse4)) (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4) (and .cse0 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3))) [2019-11-28 15:40:51,503 INFO L242 CegarLoopResult]: At program point L162(lines 158 559) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-11-28 15:40:51,504 INFO L246 CegarLoopResult]: For program point L428(lines 428 431) no Hoare annotation was computed. [2019-11-28 15:40:51,504 INFO L246 CegarLoopResult]: For program point L329(lines 329 367) no Hoare annotation was computed. [2019-11-28 15:40:51,504 INFO L246 CegarLoopResult]: For program point L197(lines 197 546) no Hoare annotation was computed. [2019-11-28 15:40:51,504 INFO L246 CegarLoopResult]: For program point L164(lines 164 557) no Hoare annotation was computed. [2019-11-28 15:40:51,504 INFO L246 CegarLoopResult]: For program point L131(lines 131 568) no Hoare annotation was computed. [2019-11-28 15:40:51,505 INFO L242 CegarLoopResult]: At program point L98-2(lines 98 597) the Hoare annotation is: (let ((.cse21 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse29 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (.cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse27 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse2 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse23 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse5 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse3 (not .cse10)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse26 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse24 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse22 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse28 (not .cse29)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse12 (not .cse21)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse19 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse15 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse8) (and .cse9 .cse10 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse20 .cse9 .cse10) (and .cse21 .cse15 .cse10) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse22 .cse8 .cse23 .cse3) (and .cse0 .cse24 .cse25 .cse26) (and .cse27 .cse9 .cse10 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (and .cse4 .cse24 .cse6) (and .cse7 .cse24) (and .cse27 .cse5 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse27 .cse24 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse0 .cse4 .cse1 .cse2) (and .cse11 .cse5 .cse13 .cse14 .cse16 .cse22 .cse6 .cse20 .cse9) (and .cse0 .cse5 .cse25 .cse26 .cse10) (and .cse7 .cse5) (and .cse4 .cse15 .cse6 .cse10) (and .cse5 .cse18 .cse26) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse22 .cse23 .cse10) (and .cse11 .cse13 .cse14 .cse24 .cse16 .cse22 .cse17 .cse6 .cse20 .cse9) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (and .cse0 .cse25 .cse15 .cse26 .cse3) (and .cse5 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse7 .cse15) (and .cse8 .cse18 .cse26 .cse3) (and .cse0 .cse4 .cse25 .cse15 .cse26) (and .cse24 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse15 .cse29 .cse10)))) [2019-11-28 15:40:51,505 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 607) no Hoare annotation was computed. [2019-11-28 15:40:51,505 INFO L246 CegarLoopResult]: For program point L495(lines 495 497) no Hoare annotation was computed. [2019-11-28 15:40:51,505 INFO L246 CegarLoopResult]: For program point L495-2(lines 207 541) no Hoare annotation was computed. [2019-11-28 15:40:51,506 INFO L242 CegarLoopResult]: At program point L396(lines 387 405) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-11-28 15:40:51,506 INFO L246 CegarLoopResult]: For program point L231(lines 231 234) no Hoare annotation was computed. [2019-11-28 15:40:51,506 INFO L242 CegarLoopResult]: At program point L165(lines 164 557) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) (and .cse0 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2 .cse3) (and .cse0 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse2 (not .cse3)))) [2019-11-28 15:40:51,506 INFO L242 CegarLoopResult]: At program point L132(lines 125 570) the Hoare annotation is: (let ((.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2) (and .cse3 .cse4 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2))) [2019-11-28 15:40:51,508 INFO L246 CegarLoopResult]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-28 15:40:51,508 INFO L246 CegarLoopResult]: For program point L529(lines 529 535) no Hoare annotation was computed. [2019-11-28 15:40:51,508 INFO L246 CegarLoopResult]: For program point L529-1(lines 529 535) no Hoare annotation was computed. [2019-11-28 15:40:51,508 INFO L246 CegarLoopResult]: For program point L332(lines 332 366) no Hoare annotation was computed. [2019-11-28 15:40:51,508 INFO L246 CegarLoopResult]: For program point L332-1(lines 332 366) no Hoare annotation was computed. [2019-11-28 15:40:51,508 INFO L246 CegarLoopResult]: For program point L200(lines 200 545) no Hoare annotation was computed. [2019-11-28 15:40:51,509 INFO L246 CegarLoopResult]: For program point L167(lines 167 556) no Hoare annotation was computed. [2019-11-28 15:40:51,509 INFO L246 CegarLoopResult]: For program point L134(lines 134 567) no Hoare annotation was computed. [2019-11-28 15:40:51,509 INFO L246 CegarLoopResult]: For program point L101(lines 101 578) no Hoare annotation was computed. [2019-11-28 15:40:51,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:40:51 BoogieIcfgContainer [2019-11-28 15:40:51,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:40:51,581 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:40:51,581 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:40:51,581 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:40:51,582 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:21" (3/4) ... [2019-11-28 15:40:51,586 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:40:51,611 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 15:40:51,613 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:40:51,822 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:40:51,822 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:40:51,824 INFO L168 Benchmark]: Toolchain (without parser) took 32331.35 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 961.7 MB in the beginning and 1.8 GB in the end (delta: -829.1 MB). Peak memory consumption was 428.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:51,824 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:51,825 INFO L168 Benchmark]: CACSL2BoogieTranslator took 577.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -153.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:51,825 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:51,826 INFO L168 Benchmark]: Boogie Preprocessor took 39.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:51,826 INFO L168 Benchmark]: RCFGBuilder took 914.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:51,827 INFO L168 Benchmark]: TraceAbstraction took 30463.32 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -764.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-28 15:40:51,827 INFO L168 Benchmark]: Witness Printer took 241.32 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:51,831 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 577.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -153.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 89.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 914.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30463.32 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -764.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 241.32 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 607]: 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: 140]: Loop Invariant Derived loop invariant: (((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) || (((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8448)) && 2 == blastFlag) && s__state <= 8448) && 0 == s__hit) || (((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8448)) && 0 == blastFlag) && s__state <= 8448)) || (((s__s3__tmp__next_state___0 <= 8576 && 1 == blastFlag) && !(s__state == 8448)) && s__state <= 8448) - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((blastFlag <= 3 && 8672 <= s__state) && !(s__state == 12292)) && !(0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 12292))) || ((1 == blastFlag && 8672 <= s__state) && !(s__state == 12292))) || ((8672 <= s__state && 0 == blastFlag) && !(s__state == 12292)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit) || ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && !(0 == s__hit)) || ((s__s3__tmp__next_state___0 <= 8576 && 1 == blastFlag) && s__state <= 8576)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || ((((((((((((!(s__state == 8545) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8528) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit)) || ((s__state == 8544 && 2 == blastFlag) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit))) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8657)) && 8640 <= s__state)) || ((((((((((((s__state == 8592 && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || ((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && s__state <= 8576)) || (s__state <= 3 && 0 == blastFlag)) || ((((((((((((s__state == 8592 && 1 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || ((((((((((((s__state == 8592 && 0 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state)) || ((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || ((((s__state <= 8672 && 1 == blastFlag) && !(s__state == 8657)) && 8640 <= s__state) && 0 == s__hit)) || (s__state <= 3 && 1 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && 2 == blastFlag) && s__state <= 8576) && 0 == s__hit)) || ((1 == blastFlag && s__state <= 8640) && 8640 <= s__state)) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit) && s__state == 8512)) || ((((s__state <= 8672 && !(s__state == 8657)) && 2 == blastFlag) && 8640 <= s__state) && !(0 == s__hit))) || ((((((((((((1 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || (s__state <= 3 && 2 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || ((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8657)) && 2 == blastFlag) && 8640 <= s__state)) || ((((((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || ((2 == blastFlag && s__state == 8560) && 0 == s__hit) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) || (((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((((((!(s__state == 8544) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit) || (((((((((!(s__state == 8544) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((!(s__state == 8544) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545)) || ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545)) && 0 == s__hit) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) || ((((s__state <= 8672 && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit))) || ((((s__state <= 8672 && 1 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && 0 == s__hit)) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((((s__s3__tmp__next_state___0 <= 8576 && 1 == blastFlag) && 8448 <= s__state) && s__state <= 8448) || (((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && 8448 <= s__state) && s__state <= 8448)) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || ((((s__s3__tmp__next_state___0 <= 8576 && 2 == blastFlag) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit)) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (((((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((s__state <= 8672 && 1 == blastFlag) && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) || (((((s__state <= 8672 && !(s__state == 8656)) && 0 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state)) || ((((((s__state <= 8672 && !(s__state == 8656)) && !(s__state == 8657)) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit))) || ((((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8657)) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state)) || ((((((s__state <= 8672 && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 8672)) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && !(0 == s__hit)) || ((s__s3__tmp__next_state___0 <= 8576 && 1 == blastFlag) && s__state <= 8576)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || ((((((((((((!(s__state == 8545) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8528) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit)) || ((s__state == 8544 && 2 == blastFlag) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit))) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8657)) && 8640 <= s__state)) || ((((((((((((s__state == 8592 && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || ((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && s__state <= 8576)) || (s__state <= 3 && 0 == blastFlag)) || ((((((((((((s__state == 8592 && 1 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || ((((((((((((s__state == 8592 && 0 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state)) || ((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || ((((s__state <= 8672 && 1 == blastFlag) && !(s__state == 8657)) && 8640 <= s__state) && 0 == s__hit)) || (s__state <= 3 && 1 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && 2 == blastFlag) && s__state <= 8576) && 0 == s__hit)) || ((1 == blastFlag && s__state <= 8640) && 8640 <= s__state)) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit) && s__state == 8512)) || ((((s__state <= 8672 && !(s__state == 8657)) && 2 == blastFlag) && 8640 <= s__state) && !(0 == s__hit))) || ((((((((((((1 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || (s__state <= 3 && 2 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || ((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8657)) && 2 == blastFlag) && 8640 <= s__state)) || ((((((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || ((2 == blastFlag && s__state == 8560) && 0 == s__hit) - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: (((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((s__s3__tmp__next_state___0 <= 8576 && 2 == blastFlag) && s__state == 8608) && 0 == s__hit) || (1 == blastFlag && s__state == 8608)) || (0 == blastFlag && s__state == 8608) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. Result: SAFE, OverallTime: 16.8s, OverallIterations: 35, TraceHistogramMax: 19, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.4s, HoareTripleCheckerStatistics: 6655 SDtfs, 4128 SDslu, 3144 SDs, 0 SdLazy, 3455 SolverSat, 958 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1979 GetRequests, 1934 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4085occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 4500 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 241 NumberOfFragments, 3545 HoareAnnotationTreeSize, 28 FomulaSimplifications, 146928 FormulaSimplificationTreeSizeReduction, 2.1s HoareSimplificationTime, 28 FomulaSimplificationsInter, 38499 FormulaSimplificationTreeSizeReductionInter, 11.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 9209 NumberOfCodeBlocks, 9209 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 9169 ConstructedInterpolants, 0 QuantifiedInterpolants, 3945115 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2970 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 40 InterpolantComputations, 31 PerfectInterpolantSequences, 30536/30750 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...