./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_04112d6d-c6df-46a2-9cdf-2bde7ef3b7dc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_04112d6d-c6df-46a2-9cdf-2bde7ef3b7dc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_04112d6d-c6df-46a2-9cdf-2bde7ef3b7dc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_04112d6d-c6df-46a2-9cdf-2bde7ef3b7dc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-2.c -s /tmp/vcloud-vcloud-master/worker/working_dir_04112d6d-c6df-46a2-9cdf-2bde7ef3b7dc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_04112d6d-c6df-46a2-9cdf-2bde7ef3b7dc/bin/uautomizer --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 e0e56f31735966f4f707c387e0c065ba9050357d ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:57:20,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:20,211 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:20,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:20,220 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:20,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:20,221 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:20,223 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:20,224 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:20,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:20,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:20,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:20,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:20,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:20,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:20,228 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:20,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:20,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:20,231 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:20,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:20,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:20,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:20,235 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:20,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:20,237 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:20,237 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:20,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:20,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:20,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:20,239 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:20,239 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:20,240 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:20,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:20,241 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:20,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:20,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:20,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:20,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:20,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:20,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:20,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:20,244 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_04112d6d-c6df-46a2-9cdf-2bde7ef3b7dc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:57:20,254 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:20,254 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:20,255 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:20,255 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:20,255 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:20,255 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:20,255 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:57:20,256 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:20,256 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:57:20,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:20,256 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:57:20,256 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:57:20,256 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:57:20,257 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:57:20,257 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:20,257 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:20,257 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:57:20,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:20,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:20,258 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:57:20,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:57:20,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:57:20,259 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:20,259 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:57:20,259 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:57:20,259 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:20,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:57:20,259 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:57:20,260 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_04112d6d-c6df-46a2-9cdf-2bde7ef3b7dc/bin/uautomizer 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 -> e0e56f31735966f4f707c387e0c065ba9050357d [2019-10-22 08:57:20,283 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:20,301 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:20,306 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:20,308 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:20,309 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:20,309 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_04112d6d-c6df-46a2-9cdf-2bde7ef3b7dc/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-2.c [2019-10-22 08:57:20,352 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_04112d6d-c6df-46a2-9cdf-2bde7ef3b7dc/bin/uautomizer/data/af58e38f9/f4c9d13fca5c417a91e0f8dd87092cdc/FLAG6ac325563 [2019-10-22 08:57:20,771 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:20,772 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_04112d6d-c6df-46a2-9cdf-2bde7ef3b7dc/sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-2.c [2019-10-22 08:57:20,782 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_04112d6d-c6df-46a2-9cdf-2bde7ef3b7dc/bin/uautomizer/data/af58e38f9/f4c9d13fca5c417a91e0f8dd87092cdc/FLAG6ac325563 [2019-10-22 08:57:21,145 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_04112d6d-c6df-46a2-9cdf-2bde7ef3b7dc/bin/uautomizer/data/af58e38f9/f4c9d13fca5c417a91e0f8dd87092cdc [2019-10-22 08:57:21,147 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:21,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:21,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:21,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:21,152 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:21,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:21" (1/1) ... [2019-10-22 08:57:21,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cf0cb33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:21, skipping insertion in model container [2019-10-22 08:57:21,155 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:21" (1/1) ... [2019-10-22 08:57:21,161 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:21,193 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:21,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:21,457 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:21,503 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:21,515 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:21,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:21 WrapperNode [2019-10-22 08:57:21,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:21,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:21,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:21,516 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:21,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:21" (1/1) ... [2019-10-22 08:57:21,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:21" (1/1) ... [2019-10-22 08:57:21,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:21,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:21,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:21,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:21,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:21" (1/1) ... [2019-10-22 08:57:21,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:21" (1/1) ... [2019-10-22 08:57:21,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:21" (1/1) ... [2019-10-22 08:57:21,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:21" (1/1) ... [2019-10-22 08:57:21,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:21" (1/1) ... [2019-10-22 08:57:21,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:21" (1/1) ... [2019-10-22 08:57:21,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:21" (1/1) ... [2019-10-22 08:57:21,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:21,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:21,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:21,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:21,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04112d6d-c6df-46a2-9cdf-2bde7ef3b7dc/bin/uautomizer/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-10-22 08:57:21,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:21,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:21,753 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:57:22,250 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-22 08:57:22,251 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-22 08:57:22,252 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:22,252 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-22 08:57:22,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:22 BoogieIcfgContainer [2019-10-22 08:57:22,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:22,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:57:22,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:57:22,259 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:57:22,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:57:21" (1/3) ... [2019-10-22 08:57:22,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cdad58b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:57:22, skipping insertion in model container [2019-10-22 08:57:22,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:21" (2/3) ... [2019-10-22 08:57:22,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cdad58b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:57:22, skipping insertion in model container [2019-10-22 08:57:22,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:22" (3/3) ... [2019-10-22 08:57:22,262 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-2.c [2019-10-22 08:57:22,268 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:57:22,275 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:57:22,285 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:57:22,316 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:57:22,316 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:57:22,317 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:57:22,317 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:22,317 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:22,318 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:57:22,318 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:22,318 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:57:22,335 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2019-10-22 08:57:22,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 08:57:22,344 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:22,344 INFO L380 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-10-22 08:57:22,346 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:22,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:22,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1455126418, now seen corresponding path program 1 times [2019-10-22 08:57:22,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:22,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58324287] [2019-10-22 08:57:22,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:22,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:22,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58324287] [2019-10-22 08:57:22,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:22,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:22,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522735999] [2019-10-22 08:57:22,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:22,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:22,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:22,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:22,593 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 3 states. [2019-10-22 08:57:22,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:22,843 INFO L93 Difference]: Finished difference Result 332 states and 569 transitions. [2019-10-22 08:57:22,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:22,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-22 08:57:22,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:22,855 INFO L225 Difference]: With dead ends: 332 [2019-10-22 08:57:22,855 INFO L226 Difference]: Without dead ends: 177 [2019-10-22 08:57:22,858 INFO L600 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-10-22 08:57:22,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-10-22 08:57:22,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2019-10-22 08:57:22,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-22 08:57:22,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 277 transitions. [2019-10-22 08:57:22,900 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 277 transitions. Word has length 44 [2019-10-22 08:57:22,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:22,901 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 277 transitions. [2019-10-22 08:57:22,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:22,901 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 277 transitions. [2019-10-22 08:57:22,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 08:57:22,902 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:22,903 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:22,903 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:22,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:22,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1939296619, now seen corresponding path program 1 times [2019-10-22 08:57:22,903 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:22,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513265306] [2019-10-22 08:57:22,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:22,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:22,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513265306] [2019-10-22 08:57:22,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:22,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:22,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150727030] [2019-10-22 08:57:22,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:22,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:22,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:22,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:22,958 INFO L87 Difference]: Start difference. First operand 171 states and 277 transitions. Second operand 3 states. [2019-10-22 08:57:23,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:23,126 INFO L93 Difference]: Finished difference Result 384 states and 631 transitions. [2019-10-22 08:57:23,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:23,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-22 08:57:23,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:23,129 INFO L225 Difference]: With dead ends: 384 [2019-10-22 08:57:23,129 INFO L226 Difference]: Without dead ends: 218 [2019-10-22 08:57:23,130 INFO L600 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-10-22 08:57:23,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-10-22 08:57:23,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 212. [2019-10-22 08:57:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-22 08:57:23,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 354 transitions. [2019-10-22 08:57:23,144 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 354 transitions. Word has length 45 [2019-10-22 08:57:23,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:23,144 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 354 transitions. [2019-10-22 08:57:23,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:23,144 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 354 transitions. [2019-10-22 08:57:23,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-22 08:57:23,146 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:23,147 INFO L380 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, 1, 1] [2019-10-22 08:57:23,147 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:23,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:23,147 INFO L82 PathProgramCache]: Analyzing trace with hash -128378241, now seen corresponding path program 1 times [2019-10-22 08:57:23,147 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:23,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306838012] [2019-10-22 08:57:23,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:23,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:23,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:23,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306838012] [2019-10-22 08:57:23,200 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:23,200 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:23,200 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862592641] [2019-10-22 08:57:23,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:23,201 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:23,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:23,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:23,201 INFO L87 Difference]: Start difference. First operand 212 states and 354 transitions. Second operand 3 states. [2019-10-22 08:57:23,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:23,361 INFO L93 Difference]: Finished difference Result 448 states and 755 transitions. [2019-10-22 08:57:23,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:23,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-22 08:57:23,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:23,363 INFO L225 Difference]: With dead ends: 448 [2019-10-22 08:57:23,363 INFO L226 Difference]: Without dead ends: 243 [2019-10-22 08:57:23,364 INFO L600 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-10-22 08:57:23,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-10-22 08:57:23,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-10-22 08:57:23,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-10-22 08:57:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 410 transitions. [2019-10-22 08:57:23,377 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 410 transitions. Word has length 73 [2019-10-22 08:57:23,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:23,378 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 410 transitions. [2019-10-22 08:57:23,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:23,378 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 410 transitions. [2019-10-22 08:57:23,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:57:23,380 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:23,380 INFO L380 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, 1] [2019-10-22 08:57:23,381 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:23,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:23,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1989171317, now seen corresponding path program 1 times [2019-10-22 08:57:23,381 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:23,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135295229] [2019-10-22 08:57:23,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:23,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:23,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:23,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135295229] [2019-10-22 08:57:23,481 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:23,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:23,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655208834] [2019-10-22 08:57:23,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:23,484 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:23,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:23,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:23,484 INFO L87 Difference]: Start difference. First operand 243 states and 410 transitions. Second operand 3 states. [2019-10-22 08:57:23,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:23,670 INFO L93 Difference]: Finished difference Result 525 states and 891 transitions. [2019-10-22 08:57:23,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:23,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-22 08:57:23,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:23,672 INFO L225 Difference]: With dead ends: 525 [2019-10-22 08:57:23,672 INFO L226 Difference]: Without dead ends: 289 [2019-10-22 08:57:23,673 INFO L600 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-10-22 08:57:23,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-10-22 08:57:23,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2019-10-22 08:57:23,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-10-22 08:57:23,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 485 transitions. [2019-10-22 08:57:23,684 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 485 transitions. Word has length 84 [2019-10-22 08:57:23,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:23,684 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 485 transitions. [2019-10-22 08:57:23,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:23,684 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 485 transitions. [2019-10-22 08:57:23,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 08:57:23,686 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:23,687 INFO L380 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, 1, 1] [2019-10-22 08:57:23,687 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:23,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:23,687 INFO L82 PathProgramCache]: Analyzing trace with hash -575477867, now seen corresponding path program 1 times [2019-10-22 08:57:23,687 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:23,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448470685] [2019-10-22 08:57:23,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:23,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:23,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:57:23,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448470685] [2019-10-22 08:57:23,720 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:23,720 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:23,720 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353872862] [2019-10-22 08:57:23,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:23,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:23,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:23,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:23,721 INFO L87 Difference]: Start difference. First operand 285 states and 485 transitions. Second operand 3 states. [2019-10-22 08:57:23,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:23,847 INFO L93 Difference]: Finished difference Result 580 states and 987 transitions. [2019-10-22 08:57:23,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:23,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-10-22 08:57:23,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:23,849 INFO L225 Difference]: With dead ends: 580 [2019-10-22 08:57:23,849 INFO L226 Difference]: Without dead ends: 302 [2019-10-22 08:57:23,850 INFO L600 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-10-22 08:57:23,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-22 08:57:23,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-10-22 08:57:23,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-10-22 08:57:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 507 transitions. [2019-10-22 08:57:23,863 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 507 transitions. Word has length 85 [2019-10-22 08:57:23,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:23,863 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 507 transitions. [2019-10-22 08:57:23,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 507 transitions. [2019-10-22 08:57:23,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 08:57:23,865 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:23,865 INFO L380 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, 1] [2019-10-22 08:57:23,865 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:23,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:23,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1339419474, now seen corresponding path program 1 times [2019-10-22 08:57:23,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:23,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288226624] [2019-10-22 08:57:23,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:23,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:23,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:23,953 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:23,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288226624] [2019-10-22 08:57:23,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:23,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:23,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205881099] [2019-10-22 08:57:23,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:23,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:23,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:23,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:23,955 INFO L87 Difference]: Start difference. First operand 300 states and 507 transitions. Second operand 3 states. [2019-10-22 08:57:24,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:24,102 INFO L93 Difference]: Finished difference Result 597 states and 1008 transitions. [2019-10-22 08:57:24,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:24,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-10-22 08:57:24,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:24,104 INFO L225 Difference]: With dead ends: 597 [2019-10-22 08:57:24,104 INFO L226 Difference]: Without dead ends: 302 [2019-10-22 08:57:24,105 INFO L600 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-10-22 08:57:24,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-22 08:57:24,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-10-22 08:57:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-22 08:57:24,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 502 transitions. [2019-10-22 08:57:24,114 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 502 transitions. Word has length 85 [2019-10-22 08:57:24,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:24,114 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 502 transitions. [2019-10-22 08:57:24,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:24,115 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 502 transitions. [2019-10-22 08:57:24,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-22 08:57:24,116 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:24,116 INFO L380 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, 1, 1] [2019-10-22 08:57:24,117 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:24,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:24,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1069928865, now seen corresponding path program 1 times [2019-10-22 08:57:24,117 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:24,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585624760] [2019-10-22 08:57:24,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:57:24,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585624760] [2019-10-22 08:57:24,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:24,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:24,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243880833] [2019-10-22 08:57:24,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:24,143 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:24,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:24,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:24,144 INFO L87 Difference]: Start difference. First operand 298 states and 502 transitions. Second operand 3 states. [2019-10-22 08:57:24,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:24,243 INFO L93 Difference]: Finished difference Result 591 states and 995 transitions. [2019-10-22 08:57:24,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:24,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-10-22 08:57:24,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:24,245 INFO L225 Difference]: With dead ends: 591 [2019-10-22 08:57:24,245 INFO L226 Difference]: Without dead ends: 300 [2019-10-22 08:57:24,245 INFO L600 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-10-22 08:57:24,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-22 08:57:24,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-10-22 08:57:24,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-22 08:57:24,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 498 transitions. [2019-10-22 08:57:24,254 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 498 transitions. Word has length 86 [2019-10-22 08:57:24,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:24,254 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 498 transitions. [2019-10-22 08:57:24,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:24,254 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 498 transitions. [2019-10-22 08:57:24,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 08:57:24,255 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:24,255 INFO L380 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, 1, 1, 1] [2019-10-22 08:57:24,255 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:24,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:24,256 INFO L82 PathProgramCache]: Analyzing trace with hash 608007676, now seen corresponding path program 1 times [2019-10-22 08:57:24,256 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:24,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069655066] [2019-10-22 08:57:24,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-22 08:57:24,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069655066] [2019-10-22 08:57:24,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:24,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:24,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469583926] [2019-10-22 08:57:24,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:24,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:24,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:24,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:24,283 INFO L87 Difference]: Start difference. First operand 298 states and 498 transitions. Second operand 3 states. [2019-10-22 08:57:24,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:24,375 INFO L93 Difference]: Finished difference Result 598 states and 997 transitions. [2019-10-22 08:57:24,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:24,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-22 08:57:24,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:24,377 INFO L225 Difference]: With dead ends: 598 [2019-10-22 08:57:24,377 INFO L226 Difference]: Without dead ends: 307 [2019-10-22 08:57:24,378 INFO L600 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-10-22 08:57:24,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-22 08:57:24,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-10-22 08:57:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-10-22 08:57:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 504 transitions. [2019-10-22 08:57:24,386 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 504 transitions. Word has length 99 [2019-10-22 08:57:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:24,387 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 504 transitions. [2019-10-22 08:57:24,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:24,387 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 504 transitions. [2019-10-22 08:57:24,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 08:57:24,388 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:24,388 INFO L380 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, 1, 1] [2019-10-22 08:57:24,388 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:24,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:24,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1349389816, now seen corresponding path program 1 times [2019-10-22 08:57:24,389 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:24,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168545448] [2019-10-22 08:57:24,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:24,440 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:57:24,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168545448] [2019-10-22 08:57:24,441 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:24,442 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:24,442 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335804896] [2019-10-22 08:57:24,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:24,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:24,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:24,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:24,443 INFO L87 Difference]: Start difference. First operand 307 states and 504 transitions. Second operand 3 states. [2019-10-22 08:57:24,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:24,559 INFO L93 Difference]: Finished difference Result 638 states and 1050 transitions. [2019-10-22 08:57:24,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:24,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-22 08:57:24,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:24,560 INFO L225 Difference]: With dead ends: 638 [2019-10-22 08:57:24,560 INFO L226 Difference]: Without dead ends: 338 [2019-10-22 08:57:24,561 INFO L600 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-10-22 08:57:24,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-22 08:57:24,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-10-22 08:57:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-22 08:57:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 551 transitions. [2019-10-22 08:57:24,570 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 551 transitions. Word has length 99 [2019-10-22 08:57:24,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:24,570 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 551 transitions. [2019-10-22 08:57:24,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:24,570 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 551 transitions. [2019-10-22 08:57:24,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 08:57:24,571 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:24,571 INFO L380 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, 1, 1] [2019-10-22 08:57:24,572 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:24,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:24,572 INFO L82 PathProgramCache]: Analyzing trace with hash 206720868, now seen corresponding path program 1 times [2019-10-22 08:57:24,572 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:24,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695139181] [2019-10-22 08:57:24,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:24,596 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:57:24,597 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695139181] [2019-10-22 08:57:24,597 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:24,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:24,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241155275] [2019-10-22 08:57:24,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:24,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:24,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:24,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:24,598 INFO L87 Difference]: Start difference. First operand 336 states and 551 transitions. Second operand 3 states. [2019-10-22 08:57:24,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:24,712 INFO L93 Difference]: Finished difference Result 667 states and 1093 transitions. [2019-10-22 08:57:24,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:24,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-10-22 08:57:24,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:24,714 INFO L225 Difference]: With dead ends: 667 [2019-10-22 08:57:24,714 INFO L226 Difference]: Without dead ends: 338 [2019-10-22 08:57:24,715 INFO L600 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-10-22 08:57:24,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-22 08:57:24,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-10-22 08:57:24,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-22 08:57:24,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 547 transitions. [2019-10-22 08:57:24,723 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 547 transitions. Word has length 100 [2019-10-22 08:57:24,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:24,723 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 547 transitions. [2019-10-22 08:57:24,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:24,724 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 547 transitions. [2019-10-22 08:57:24,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-22 08:57:24,725 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:24,725 INFO L380 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, 1, 1] [2019-10-22 08:57:24,725 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:24,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:24,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1011601848, now seen corresponding path program 1 times [2019-10-22 08:57:24,725 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:24,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691515811] [2019-10-22 08:57:24,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:24,757 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:57:24,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691515811] [2019-10-22 08:57:24,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:24,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:24,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388954302] [2019-10-22 08:57:24,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:24,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:24,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:24,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:24,758 INFO L87 Difference]: Start difference. First operand 336 states and 547 transitions. Second operand 3 states. [2019-10-22 08:57:24,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:24,877 INFO L93 Difference]: Finished difference Result 700 states and 1143 transitions. [2019-10-22 08:57:24,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:24,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-22 08:57:24,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:24,879 INFO L225 Difference]: With dead ends: 700 [2019-10-22 08:57:24,879 INFO L226 Difference]: Without dead ends: 371 [2019-10-22 08:57:24,880 INFO L600 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-10-22 08:57:24,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-10-22 08:57:24,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-10-22 08:57:24,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-10-22 08:57:24,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 589 transitions. [2019-10-22 08:57:24,889 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 589 transitions. Word has length 101 [2019-10-22 08:57:24,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:24,889 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 589 transitions. [2019-10-22 08:57:24,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 589 transitions. [2019-10-22 08:57:24,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-22 08:57:24,890 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:24,890 INFO L380 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, 1, 1] [2019-10-22 08:57:24,891 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:24,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:24,891 INFO L82 PathProgramCache]: Analyzing trace with hash -894235628, now seen corresponding path program 1 times [2019-10-22 08:57:24,891 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:24,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176291538] [2019-10-22 08:57:24,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:24,915 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:57:24,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176291538] [2019-10-22 08:57:24,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:24,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:24,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316338857] [2019-10-22 08:57:24,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:24,916 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:24,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:24,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:24,916 INFO L87 Difference]: Start difference. First operand 363 states and 589 transitions. Second operand 3 states. [2019-10-22 08:57:25,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:25,032 INFO L93 Difference]: Finished difference Result 727 states and 1180 transitions. [2019-10-22 08:57:25,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:25,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-10-22 08:57:25,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:25,034 INFO L225 Difference]: With dead ends: 727 [2019-10-22 08:57:25,035 INFO L226 Difference]: Without dead ends: 371 [2019-10-22 08:57:25,035 INFO L600 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-10-22 08:57:25,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-10-22 08:57:25,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-10-22 08:57:25,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-10-22 08:57:25,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 584 transitions. [2019-10-22 08:57:25,047 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 584 transitions. Word has length 102 [2019-10-22 08:57:25,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:25,047 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 584 transitions. [2019-10-22 08:57:25,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:25,047 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 584 transitions. [2019-10-22 08:57:25,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-22 08:57:25,049 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:25,049 INFO L380 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, 1] [2019-10-22 08:57:25,049 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:25,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:25,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1360340166, now seen corresponding path program 1 times [2019-10-22 08:57:25,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:25,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021326347] [2019-10-22 08:57:25,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 08:57:25,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021326347] [2019-10-22 08:57:25,091 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:25,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:25,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902485717] [2019-10-22 08:57:25,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:25,092 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:25,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:25,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:25,093 INFO L87 Difference]: Start difference. First operand 363 states and 584 transitions. Second operand 3 states. [2019-10-22 08:57:25,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:25,215 INFO L93 Difference]: Finished difference Result 744 states and 1198 transitions. [2019-10-22 08:57:25,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:25,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-22 08:57:25,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:25,219 INFO L225 Difference]: With dead ends: 744 [2019-10-22 08:57:25,219 INFO L226 Difference]: Without dead ends: 388 [2019-10-22 08:57:25,220 INFO L600 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-10-22 08:57:25,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-10-22 08:57:25,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-10-22 08:57:25,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-10-22 08:57:25,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 613 transitions. [2019-10-22 08:57:25,233 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 613 transitions. Word has length 105 [2019-10-22 08:57:25,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:25,233 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 613 transitions. [2019-10-22 08:57:25,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:25,233 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 613 transitions. [2019-10-22 08:57:25,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-22 08:57:25,235 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:25,235 INFO L380 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, 1] [2019-10-22 08:57:25,235 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:25,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:25,236 INFO L82 PathProgramCache]: Analyzing trace with hash -241831246, now seen corresponding path program 1 times [2019-10-22 08:57:25,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:25,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576629516] [2019-10-22 08:57:25,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:25,276 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 08:57:25,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576629516] [2019-10-22 08:57:25,276 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:25,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:25,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041845718] [2019-10-22 08:57:25,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:25,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:25,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:25,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:25,278 INFO L87 Difference]: Start difference. First operand 384 states and 613 transitions. Second operand 3 states. [2019-10-22 08:57:25,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:25,404 INFO L93 Difference]: Finished difference Result 765 states and 1221 transitions. [2019-10-22 08:57:25,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:25,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-22 08:57:25,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:25,406 INFO L225 Difference]: With dead ends: 765 [2019-10-22 08:57:25,406 INFO L226 Difference]: Without dead ends: 388 [2019-10-22 08:57:25,407 INFO L600 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-10-22 08:57:25,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-10-22 08:57:25,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-10-22 08:57:25,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-10-22 08:57:25,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 607 transitions. [2019-10-22 08:57:25,423 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 607 transitions. Word has length 106 [2019-10-22 08:57:25,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:25,423 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 607 transitions. [2019-10-22 08:57:25,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:25,423 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 607 transitions. [2019-10-22 08:57:25,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-22 08:57:25,425 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:25,425 INFO L380 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-10-22 08:57:25,425 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:25,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:25,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1868043870, now seen corresponding path program 1 times [2019-10-22 08:57:25,425 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:25,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975192758] [2019-10-22 08:57:25,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:25,478 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 08:57:25,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975192758] [2019-10-22 08:57:25,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:25,479 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:25,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961543691] [2019-10-22 08:57:25,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:25,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:25,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:25,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:25,480 INFO L87 Difference]: Start difference. First operand 384 states and 607 transitions. Second operand 3 states. [2019-10-22 08:57:25,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:25,530 INFO L93 Difference]: Finished difference Result 1092 states and 1729 transitions. [2019-10-22 08:57:25,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:25,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-10-22 08:57:25,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:25,533 INFO L225 Difference]: With dead ends: 1092 [2019-10-22 08:57:25,533 INFO L226 Difference]: Without dead ends: 715 [2019-10-22 08:57:25,535 INFO L600 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-10-22 08:57:25,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-10-22 08:57:25,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2019-10-22 08:57:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-10-22 08:57:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1127 transitions. [2019-10-22 08:57:25,557 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1127 transitions. Word has length 121 [2019-10-22 08:57:25,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:25,557 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1127 transitions. [2019-10-22 08:57:25,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1127 transitions. [2019-10-22 08:57:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-22 08:57:25,560 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:25,560 INFO L380 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-10-22 08:57:25,560 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:25,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:25,560 INFO L82 PathProgramCache]: Analyzing trace with hash 181343972, now seen corresponding path program 1 times [2019-10-22 08:57:25,560 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:25,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552637434] [2019-10-22 08:57:25,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-22 08:57:25,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552637434] [2019-10-22 08:57:25,607 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:25,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:25,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813748277] [2019-10-22 08:57:25,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:25,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:25,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:25,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:25,611 INFO L87 Difference]: Start difference. First operand 715 states and 1127 transitions. Second operand 3 states. [2019-10-22 08:57:25,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:25,661 INFO L93 Difference]: Finished difference Result 1798 states and 2838 transitions. [2019-10-22 08:57:25,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:25,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-10-22 08:57:25,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:25,665 INFO L225 Difference]: With dead ends: 1798 [2019-10-22 08:57:25,665 INFO L226 Difference]: Without dead ends: 1090 [2019-10-22 08:57:25,667 INFO L600 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-10-22 08:57:25,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2019-10-22 08:57:25,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1090. [2019-10-22 08:57:25,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2019-10-22 08:57:25,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1720 transitions. [2019-10-22 08:57:25,702 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1720 transitions. Word has length 121 [2019-10-22 08:57:25,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:25,703 INFO L462 AbstractCegarLoop]: Abstraction has 1090 states and 1720 transitions. [2019-10-22 08:57:25,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1720 transitions. [2019-10-22 08:57:25,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-22 08:57:25,705 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:25,706 INFO L380 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, 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] [2019-10-22 08:57:25,706 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:25,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:25,707 INFO L82 PathProgramCache]: Analyzing trace with hash -956252537, now seen corresponding path program 1 times [2019-10-22 08:57:25,707 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:25,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547322720] [2019-10-22 08:57:25,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 08:57:25,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547322720] [2019-10-22 08:57:25,743 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:25,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:25,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660074664] [2019-10-22 08:57:25,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:25,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:25,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:25,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:25,744 INFO L87 Difference]: Start difference. First operand 1090 states and 1720 transitions. Second operand 3 states. [2019-10-22 08:57:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:25,914 INFO L93 Difference]: Finished difference Result 2299 states and 3632 transitions. [2019-10-22 08:57:25,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:25,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-22 08:57:25,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:25,919 INFO L225 Difference]: With dead ends: 2299 [2019-10-22 08:57:25,919 INFO L226 Difference]: Without dead ends: 1216 [2019-10-22 08:57:25,921 INFO L600 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-10-22 08:57:25,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2019-10-22 08:57:25,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1204. [2019-10-22 08:57:25,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2019-10-22 08:57:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1898 transitions. [2019-10-22 08:57:25,962 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1898 transitions. Word has length 122 [2019-10-22 08:57:25,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:25,963 INFO L462 AbstractCegarLoop]: Abstraction has 1204 states and 1898 transitions. [2019-10-22 08:57:25,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1898 transitions. [2019-10-22 08:57:25,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-22 08:57:25,965 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:25,966 INFO L380 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, 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] [2019-10-22 08:57:25,966 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:25,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:25,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1998579872, now seen corresponding path program 1 times [2019-10-22 08:57:25,967 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:25,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999643321] [2019-10-22 08:57:25,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:26,006 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 08:57:26,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999643321] [2019-10-22 08:57:26,006 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:26,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:26,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016544988] [2019-10-22 08:57:26,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:26,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:26,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:26,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:26,008 INFO L87 Difference]: Start difference. First operand 1204 states and 1898 transitions. Second operand 3 states. [2019-10-22 08:57:26,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:26,187 INFO L93 Difference]: Finished difference Result 2413 states and 3802 transitions. [2019-10-22 08:57:26,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:26,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-10-22 08:57:26,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:26,191 INFO L225 Difference]: With dead ends: 2413 [2019-10-22 08:57:26,192 INFO L226 Difference]: Without dead ends: 1210 [2019-10-22 08:57:26,193 INFO L600 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-10-22 08:57:26,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-10-22 08:57:26,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1198. [2019-10-22 08:57:26,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2019-10-22 08:57:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1881 transitions. [2019-10-22 08:57:26,229 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1881 transitions. Word has length 123 [2019-10-22 08:57:26,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:26,230 INFO L462 AbstractCegarLoop]: Abstraction has 1198 states and 1881 transitions. [2019-10-22 08:57:26,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:26,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1881 transitions. [2019-10-22 08:57:26,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-22 08:57:26,233 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:26,233 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:26,234 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:26,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:26,234 INFO L82 PathProgramCache]: Analyzing trace with hash 496982003, now seen corresponding path program 1 times [2019-10-22 08:57:26,234 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:26,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120844975] [2019-10-22 08:57:26,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:26,275 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-22 08:57:26,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120844975] [2019-10-22 08:57:26,276 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:26,276 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:26,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147483017] [2019-10-22 08:57:26,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:26,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:26,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:26,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:26,278 INFO L87 Difference]: Start difference. First operand 1198 states and 1881 transitions. Second operand 3 states. [2019-10-22 08:57:26,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:26,460 INFO L93 Difference]: Finished difference Result 2503 states and 3931 transitions. [2019-10-22 08:57:26,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:26,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-10-22 08:57:26,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:26,466 INFO L225 Difference]: With dead ends: 2503 [2019-10-22 08:57:26,466 INFO L226 Difference]: Without dead ends: 1312 [2019-10-22 08:57:26,468 INFO L600 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-10-22 08:57:26,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-10-22 08:57:26,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1306. [2019-10-22 08:57:26,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1306 states. [2019-10-22 08:57:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 2044 transitions. [2019-10-22 08:57:26,523 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 2044 transitions. Word has length 155 [2019-10-22 08:57:26,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:26,523 INFO L462 AbstractCegarLoop]: Abstraction has 1306 states and 2044 transitions. [2019-10-22 08:57:26,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 2044 transitions. [2019-10-22 08:57:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-22 08:57:26,528 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:26,528 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:26,528 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:26,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:26,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1762620122, now seen corresponding path program 1 times [2019-10-22 08:57:26,529 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:26,529 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426751427] [2019-10-22 08:57:26,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:26,588 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-22 08:57:26,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426751427] [2019-10-22 08:57:26,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:26,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:26,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774374461] [2019-10-22 08:57:26,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:26,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:26,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:26,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:26,590 INFO L87 Difference]: Start difference. First operand 1306 states and 2044 transitions. Second operand 3 states. [2019-10-22 08:57:26,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:26,828 INFO L93 Difference]: Finished difference Result 2611 states and 4083 transitions. [2019-10-22 08:57:26,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:26,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-22 08:57:26,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:26,834 INFO L225 Difference]: With dead ends: 2611 [2019-10-22 08:57:26,834 INFO L226 Difference]: Without dead ends: 1306 [2019-10-22 08:57:26,835 INFO L600 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-10-22 08:57:26,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2019-10-22 08:57:26,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1300. [2019-10-22 08:57:26,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-10-22 08:57:26,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 2024 transitions. [2019-10-22 08:57:26,883 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 2024 transitions. Word has length 156 [2019-10-22 08:57:26,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:26,883 INFO L462 AbstractCegarLoop]: Abstraction has 1300 states and 2024 transitions. [2019-10-22 08:57:26,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:26,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 2024 transitions. [2019-10-22 08:57:26,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-22 08:57:26,887 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:26,887 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:26,888 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:26,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:26,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1655718978, now seen corresponding path program 1 times [2019-10-22 08:57:26,888 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:26,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815614556] [2019-10-22 08:57:26,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:26,937 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-10-22 08:57:26,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815614556] [2019-10-22 08:57:26,937 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:26,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:26,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586063563] [2019-10-22 08:57:26,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:26,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:26,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:26,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:26,940 INFO L87 Difference]: Start difference. First operand 1300 states and 2024 transitions. Second operand 3 states. [2019-10-22 08:57:27,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:27,134 INFO L93 Difference]: Finished difference Result 2701 states and 4205 transitions. [2019-10-22 08:57:27,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:27,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-10-22 08:57:27,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:27,140 INFO L225 Difference]: With dead ends: 2701 [2019-10-22 08:57:27,141 INFO L226 Difference]: Without dead ends: 1408 [2019-10-22 08:57:27,143 INFO L600 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-10-22 08:57:27,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2019-10-22 08:57:27,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1402. [2019-10-22 08:57:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-10-22 08:57:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2172 transitions. [2019-10-22 08:57:27,189 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2172 transitions. Word has length 186 [2019-10-22 08:57:27,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:27,189 INFO L462 AbstractCegarLoop]: Abstraction has 1402 states and 2172 transitions. [2019-10-22 08:57:27,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:27,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2172 transitions. [2019-10-22 08:57:27,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-22 08:57:27,193 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:27,194 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:27,194 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:27,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:27,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1614779429, now seen corresponding path program 1 times [2019-10-22 08:57:27,194 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:27,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65245205] [2019-10-22 08:57:27,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-10-22 08:57:27,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65245205] [2019-10-22 08:57:27,233 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:27,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:27,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286140277] [2019-10-22 08:57:27,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:27,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:27,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:27,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:27,235 INFO L87 Difference]: Start difference. First operand 1402 states and 2172 transitions. Second operand 3 states. [2019-10-22 08:57:27,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:27,382 INFO L93 Difference]: Finished difference Result 2803 states and 4339 transitions. [2019-10-22 08:57:27,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:27,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-10-22 08:57:27,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:27,386 INFO L225 Difference]: With dead ends: 2803 [2019-10-22 08:57:27,387 INFO L226 Difference]: Without dead ends: 1402 [2019-10-22 08:57:27,388 INFO L600 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-10-22 08:57:27,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-10-22 08:57:27,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1396. [2019-10-22 08:57:27,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1396 states. [2019-10-22 08:57:27,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2149 transitions. [2019-10-22 08:57:27,427 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2149 transitions. Word has length 187 [2019-10-22 08:57:27,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:27,427 INFO L462 AbstractCegarLoop]: Abstraction has 1396 states and 2149 transitions. [2019-10-22 08:57:27,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:27,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2149 transitions. [2019-10-22 08:57:27,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-22 08:57:27,431 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:27,431 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:27,431 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:27,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:27,431 INFO L82 PathProgramCache]: Analyzing trace with hash -848280398, now seen corresponding path program 1 times [2019-10-22 08:57:27,431 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:27,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102434423] [2019-10-22 08:57:27,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:27,470 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-10-22 08:57:27,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102434423] [2019-10-22 08:57:27,471 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:27,471 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:27,471 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293572015] [2019-10-22 08:57:27,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:27,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:27,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:27,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:27,472 INFO L87 Difference]: Start difference. First operand 1396 states and 2149 transitions. Second operand 3 states. [2019-10-22 08:57:27,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:27,612 INFO L93 Difference]: Finished difference Result 2899 states and 4473 transitions. [2019-10-22 08:57:27,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:27,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-10-22 08:57:27,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:27,618 INFO L225 Difference]: With dead ends: 2899 [2019-10-22 08:57:27,618 INFO L226 Difference]: Without dead ends: 1510 [2019-10-22 08:57:27,620 INFO L600 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-10-22 08:57:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2019-10-22 08:57:27,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1471. [2019-10-22 08:57:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-10-22 08:57:27,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2246 transitions. [2019-10-22 08:57:27,663 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2246 transitions. Word has length 205 [2019-10-22 08:57:27,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:27,664 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 2246 transitions. [2019-10-22 08:57:27,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:27,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2246 transitions. [2019-10-22 08:57:27,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-22 08:57:27,668 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:27,668 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:27,668 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:27,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:27,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1187572258, now seen corresponding path program 1 times [2019-10-22 08:57:27,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:27,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236168129] [2019-10-22 08:57:27,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-10-22 08:57:27,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236168129] [2019-10-22 08:57:27,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:27,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:27,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300693002] [2019-10-22 08:57:27,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:27,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:27,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:27,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:27,715 INFO L87 Difference]: Start difference. First operand 1471 states and 2246 transitions. Second operand 3 states. [2019-10-22 08:57:27,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:27,877 INFO L93 Difference]: Finished difference Result 2974 states and 4544 transitions. [2019-10-22 08:57:27,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:27,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-10-22 08:57:27,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:27,882 INFO L225 Difference]: With dead ends: 2974 [2019-10-22 08:57:27,882 INFO L226 Difference]: Without dead ends: 1510 [2019-10-22 08:57:27,884 INFO L600 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-10-22 08:57:27,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2019-10-22 08:57:27,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1471. [2019-10-22 08:57:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-10-22 08:57:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2220 transitions. [2019-10-22 08:57:27,925 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2220 transitions. Word has length 206 [2019-10-22 08:57:27,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:27,925 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 2220 transitions. [2019-10-22 08:57:27,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2220 transitions. [2019-10-22 08:57:27,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-22 08:57:27,929 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:27,929 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:27,929 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:27,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:27,930 INFO L82 PathProgramCache]: Analyzing trace with hash -778811277, now seen corresponding path program 1 times [2019-10-22 08:57:27,930 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:27,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391721051] [2019-10-22 08:57:27,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:27,983 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-10-22 08:57:27,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391721051] [2019-10-22 08:57:27,984 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:27,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:27,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68653024] [2019-10-22 08:57:27,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:27,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:27,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:27,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:27,985 INFO L87 Difference]: Start difference. First operand 1471 states and 2220 transitions. Second operand 3 states. [2019-10-22 08:57:28,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:28,115 INFO L93 Difference]: Finished difference Result 2947 states and 4444 transitions. [2019-10-22 08:57:28,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:28,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-10-22 08:57:28,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:28,120 INFO L225 Difference]: With dead ends: 2947 [2019-10-22 08:57:28,120 INFO L226 Difference]: Without dead ends: 1483 [2019-10-22 08:57:28,122 INFO L600 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-10-22 08:57:28,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2019-10-22 08:57:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1471. [2019-10-22 08:57:28,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-10-22 08:57:28,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2203 transitions. [2019-10-22 08:57:28,161 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2203 transitions. Word has length 217 [2019-10-22 08:57:28,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:28,162 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 2203 transitions. [2019-10-22 08:57:28,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:28,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2203 transitions. [2019-10-22 08:57:28,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-22 08:57:28,165 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:28,165 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:28,165 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:28,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:28,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1333590618, now seen corresponding path program 1 times [2019-10-22 08:57:28,166 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:28,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828104158] [2019-10-22 08:57:28,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:28,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:28,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:28,216 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-10-22 08:57:28,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828104158] [2019-10-22 08:57:28,216 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:28,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:28,216 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660074742] [2019-10-22 08:57:28,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:28,217 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:28,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:28,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:28,217 INFO L87 Difference]: Start difference. First operand 1471 states and 2203 transitions. Second operand 3 states. [2019-10-22 08:57:28,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:28,358 INFO L93 Difference]: Finished difference Result 2947 states and 4410 transitions. [2019-10-22 08:57:28,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:28,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-10-22 08:57:28,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:28,362 INFO L225 Difference]: With dead ends: 2947 [2019-10-22 08:57:28,362 INFO L226 Difference]: Without dead ends: 1456 [2019-10-22 08:57:28,364 INFO L600 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-10-22 08:57:28,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2019-10-22 08:57:28,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1444. [2019-10-22 08:57:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2019-10-22 08:57:28,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2147 transitions. [2019-10-22 08:57:28,406 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2147 transitions. Word has length 218 [2019-10-22 08:57:28,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:28,407 INFO L462 AbstractCegarLoop]: Abstraction has 1444 states and 2147 transitions. [2019-10-22 08:57:28,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:28,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2147 transitions. [2019-10-22 08:57:28,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-22 08:57:28,410 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:28,410 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:28,410 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:28,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:28,411 INFO L82 PathProgramCache]: Analyzing trace with hash 193493261, now seen corresponding path program 1 times [2019-10-22 08:57:28,411 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:28,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172921602] [2019-10-22 08:57:28,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:28,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:28,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:28,460 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-10-22 08:57:28,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172921602] [2019-10-22 08:57:28,460 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:28,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:28,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313606229] [2019-10-22 08:57:28,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:28,461 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:28,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:28,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:28,461 INFO L87 Difference]: Start difference. First operand 1444 states and 2147 transitions. Second operand 3 states. [2019-10-22 08:57:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:28,588 INFO L93 Difference]: Finished difference Result 2962 states and 4409 transitions. [2019-10-22 08:57:28,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:28,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-10-22 08:57:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:28,593 INFO L225 Difference]: With dead ends: 2962 [2019-10-22 08:57:28,593 INFO L226 Difference]: Without dead ends: 1525 [2019-10-22 08:57:28,594 INFO L600 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-10-22 08:57:28,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2019-10-22 08:57:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1513. [2019-10-22 08:57:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-10-22 08:57:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2229 transitions. [2019-10-22 08:57:28,637 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2229 transitions. Word has length 226 [2019-10-22 08:57:28,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:28,638 INFO L462 AbstractCegarLoop]: Abstraction has 1513 states and 2229 transitions. [2019-10-22 08:57:28,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:28,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2229 transitions. [2019-10-22 08:57:28,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-22 08:57:28,641 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:28,642 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:28,642 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:28,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:28,642 INFO L82 PathProgramCache]: Analyzing trace with hash -831258623, now seen corresponding path program 1 times [2019-10-22 08:57:28,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:28,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841488999] [2019-10-22 08:57:28,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:28,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:28,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:28,691 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-10-22 08:57:28,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841488999] [2019-10-22 08:57:28,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:28,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:28,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872324712] [2019-10-22 08:57:28,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:28,692 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:28,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:28,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:28,692 INFO L87 Difference]: Start difference. First operand 1513 states and 2229 transitions. Second operand 3 states. [2019-10-22 08:57:28,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:28,845 INFO L93 Difference]: Finished difference Result 3031 states and 4462 transitions. [2019-10-22 08:57:28,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:28,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-10-22 08:57:28,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:28,850 INFO L225 Difference]: With dead ends: 3031 [2019-10-22 08:57:28,850 INFO L226 Difference]: Without dead ends: 1513 [2019-10-22 08:57:28,852 INFO L600 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-10-22 08:57:28,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2019-10-22 08:57:28,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1501. [2019-10-22 08:57:28,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1501 states. [2019-10-22 08:57:28,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2182 transitions. [2019-10-22 08:57:28,912 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2182 transitions. Word has length 227 [2019-10-22 08:57:28,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:28,912 INFO L462 AbstractCegarLoop]: Abstraction has 1501 states and 2182 transitions. [2019-10-22 08:57:28,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:28,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2182 transitions. [2019-10-22 08:57:28,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-22 08:57:28,917 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:28,917 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:28,917 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:28,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:28,918 INFO L82 PathProgramCache]: Analyzing trace with hash 225623806, now seen corresponding path program 1 times [2019-10-22 08:57:28,918 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:28,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591366572] [2019-10-22 08:57:28,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:28,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:28,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2019-10-22 08:57:29,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591366572] [2019-10-22 08:57:29,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:29,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:29,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501617077] [2019-10-22 08:57:29,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:29,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:29,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:29,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:29,025 INFO L87 Difference]: Start difference. First operand 1501 states and 2182 transitions. Second operand 3 states. [2019-10-22 08:57:29,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:29,073 INFO L93 Difference]: Finished difference Result 3052 states and 4439 transitions. [2019-10-22 08:57:29,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:29,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-10-22 08:57:29,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:29,079 INFO L225 Difference]: With dead ends: 3052 [2019-10-22 08:57:29,079 INFO L226 Difference]: Without dead ends: 1558 [2019-10-22 08:57:29,081 INFO L600 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-10-22 08:57:29,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2019-10-22 08:57:29,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1558. [2019-10-22 08:57:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-10-22 08:57:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2266 transitions. [2019-10-22 08:57:29,126 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2266 transitions. Word has length 263 [2019-10-22 08:57:29,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:29,126 INFO L462 AbstractCegarLoop]: Abstraction has 1558 states and 2266 transitions. [2019-10-22 08:57:29,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:29,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2266 transitions. [2019-10-22 08:57:29,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-22 08:57:29,130 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:29,130 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:29,131 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:29,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:29,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1710298052, now seen corresponding path program 1 times [2019-10-22 08:57:29,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:29,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540757611] [2019-10-22 08:57:29,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:29,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:29,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2019-10-22 08:57:29,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540757611] [2019-10-22 08:57:29,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:29,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:29,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051468012] [2019-10-22 08:57:29,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:29,190 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:29,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:29,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:29,191 INFO L87 Difference]: Start difference. First operand 1558 states and 2266 transitions. Second operand 3 states. [2019-10-22 08:57:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:29,233 INFO L93 Difference]: Finished difference Result 3142 states and 4569 transitions. [2019-10-22 08:57:29,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:29,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-10-22 08:57:29,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:29,242 INFO L225 Difference]: With dead ends: 3142 [2019-10-22 08:57:29,243 INFO L226 Difference]: Without dead ends: 1591 [2019-10-22 08:57:29,244 INFO L600 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-10-22 08:57:29,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2019-10-22 08:57:29,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1591. [2019-10-22 08:57:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2019-10-22 08:57:29,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2313 transitions. [2019-10-22 08:57:29,288 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2313 transitions. Word has length 263 [2019-10-22 08:57:29,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:29,288 INFO L462 AbstractCegarLoop]: Abstraction has 1591 states and 2313 transitions. [2019-10-22 08:57:29,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:29,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2313 transitions. [2019-10-22 08:57:29,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-10-22 08:57:29,293 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:29,293 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:57:29,294 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:29,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:29,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1900040589, now seen corresponding path program 1 times [2019-10-22 08:57:29,294 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:29,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065364376] [2019-10-22 08:57:29,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:29,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:29,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:29,398 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-10-22 08:57:29,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065364376] [2019-10-22 08:57:29,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:29,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:29,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414089039] [2019-10-22 08:57:29,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:29,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:29,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:29,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:29,400 INFO L87 Difference]: Start difference. First operand 1591 states and 2313 transitions. Second operand 3 states. [2019-10-22 08:57:29,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:29,464 INFO L93 Difference]: Finished difference Result 4612 states and 6703 transitions. [2019-10-22 08:57:29,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:29,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2019-10-22 08:57:29,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:29,475 INFO L225 Difference]: With dead ends: 4612 [2019-10-22 08:57:29,479 INFO L226 Difference]: Without dead ends: 3061 [2019-10-22 08:57:29,481 INFO L600 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-10-22 08:57:29,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3061 states. [2019-10-22 08:57:29,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3061 to 3059. [2019-10-22 08:57:29,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3059 states. [2019-10-22 08:57:29,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 4438 transitions. [2019-10-22 08:57:29,566 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 4438 transitions. Word has length 271 [2019-10-22 08:57:29,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:29,566 INFO L462 AbstractCegarLoop]: Abstraction has 3059 states and 4438 transitions. [2019-10-22 08:57:29,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:29,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 4438 transitions. [2019-10-22 08:57:29,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-22 08:57:29,570 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:29,570 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 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, 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-10-22 08:57:29,571 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:29,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:29,571 INFO L82 PathProgramCache]: Analyzing trace with hash 999895398, now seen corresponding path program 1 times [2019-10-22 08:57:29,571 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:29,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395351356] [2019-10-22 08:57:29,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:29,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:29,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:29,692 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-10-22 08:57:29,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395351356] [2019-10-22 08:57:29,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:29,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:29,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020866426] [2019-10-22 08:57:29,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:29,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:29,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:29,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:29,693 INFO L87 Difference]: Start difference. First operand 3059 states and 4438 transitions. Second operand 3 states. [2019-10-22 08:57:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:29,861 INFO L93 Difference]: Finished difference Result 6291 states and 9153 transitions. [2019-10-22 08:57:29,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:29,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-10-22 08:57:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:29,871 INFO L225 Difference]: With dead ends: 6291 [2019-10-22 08:57:29,871 INFO L226 Difference]: Without dead ends: 2043 [2019-10-22 08:57:29,875 INFO L600 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-10-22 08:57:29,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2019-10-22 08:57:29,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2023. [2019-10-22 08:57:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2023 states. [2019-10-22 08:57:29,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 2884 transitions. [2019-10-22 08:57:29,929 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 2884 transitions. Word has length 308 [2019-10-22 08:57:29,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:29,929 INFO L462 AbstractCegarLoop]: Abstraction has 2023 states and 2884 transitions. [2019-10-22 08:57:29,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:29,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2884 transitions. [2019-10-22 08:57:29,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-10-22 08:57:29,932 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:29,933 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:57:29,933 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:29,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:29,933 INFO L82 PathProgramCache]: Analyzing trace with hash -531219143, now seen corresponding path program 1 times [2019-10-22 08:57:29,933 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:29,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65921124] [2019-10-22 08:57:29,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:29,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:29,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:30,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2019-10-22 08:57:30,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65921124] [2019-10-22 08:57:30,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700623181] [2019-10-22 08:57:30,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04112d6d-c6df-46a2-9cdf-2bde7ef3b7dc/bin/uautomizer/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-10-22 08:57:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:30,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:57:30,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2019-10-22 08:57:30,254 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:57:30,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-22 08:57:30,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915852003] [2019-10-22 08:57:30,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:30,255 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:30,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:30,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:30,255 INFO L87 Difference]: Start difference. First operand 2023 states and 2884 transitions. Second operand 3 states. [2019-10-22 08:57:30,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:30,320 INFO L93 Difference]: Finished difference Result 4660 states and 6632 transitions. [2019-10-22 08:57:30,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:30,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2019-10-22 08:57:30,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:30,325 INFO L225 Difference]: With dead ends: 4660 [2019-10-22 08:57:30,325 INFO L226 Difference]: Without dead ends: 2676 [2019-10-22 08:57:30,327 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 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-10-22 08:57:30,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2019-10-22 08:57:30,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2676. [2019-10-22 08:57:30,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2676 states. [2019-10-22 08:57:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 3798 transitions. [2019-10-22 08:57:30,397 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 3798 transitions. Word has length 375 [2019-10-22 08:57:30,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:30,398 INFO L462 AbstractCegarLoop]: Abstraction has 2676 states and 3798 transitions. [2019-10-22 08:57:30,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:30,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 3798 transitions. [2019-10-22 08:57:30,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-10-22 08:57:30,404 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:30,405 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:30,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:30,606 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:30,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:30,606 INFO L82 PathProgramCache]: Analyzing trace with hash 490258226, now seen corresponding path program 1 times [2019-10-22 08:57:30,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:30,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698369567] [2019-10-22 08:57:30,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:30,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:30,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:30,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-10-22 08:57:30,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698369567] [2019-10-22 08:57:30,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699673698] [2019-10-22 08:57:30,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04112d6d-c6df-46a2-9cdf-2bde7ef3b7dc/bin/uautomizer/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-10-22 08:57:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:30,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:57:30,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2019-10-22 08:57:31,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:57:31,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-22 08:57:31,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755300870] [2019-10-22 08:57:31,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:31,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:31,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:31,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:31,068 INFO L87 Difference]: Start difference. First operand 2676 states and 3798 transitions. Second operand 3 states. [2019-10-22 08:57:31,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:31,109 INFO L93 Difference]: Finished difference Result 2736 states and 3882 transitions. [2019-10-22 08:57:31,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:31,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 446 [2019-10-22 08:57:31,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:31,113 INFO L225 Difference]: With dead ends: 2736 [2019-10-22 08:57:31,113 INFO L226 Difference]: Without dead ends: 2143 [2019-10-22 08:57:31,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 446 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-10-22 08:57:31,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2019-10-22 08:57:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 2085. [2019-10-22 08:57:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2085 states. [2019-10-22 08:57:31,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 2968 transitions. [2019-10-22 08:57:31,165 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 2968 transitions. Word has length 446 [2019-10-22 08:57:31,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:31,166 INFO L462 AbstractCegarLoop]: Abstraction has 2085 states and 2968 transitions. [2019-10-22 08:57:31,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:31,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 2968 transitions. [2019-10-22 08:57:31,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-10-22 08:57:31,170 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:31,170 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 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-10-22 08:57:31,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:31,371 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:31,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:31,371 INFO L82 PathProgramCache]: Analyzing trace with hash 567159024, now seen corresponding path program 1 times [2019-10-22 08:57:31,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:31,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128310149] [2019-10-22 08:57:31,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:31,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:31,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:31,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-10-22 08:57:31,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128310149] [2019-10-22 08:57:31,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828065199] [2019-10-22 08:57:31,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04112d6d-c6df-46a2-9cdf-2bde7ef3b7dc/bin/uautomizer/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-10-22 08:57:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:31,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:57:31,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:31,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-10-22 08:57:31,734 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:57:31,735 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 08:57:31,735 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346882427] [2019-10-22 08:57:31,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:31,736 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:31,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:31,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:31,736 INFO L87 Difference]: Start difference. First operand 2085 states and 2968 transitions. Second operand 4 states. [2019-10-22 08:57:31,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:31,968 INFO L93 Difference]: Finished difference Result 4343 states and 6173 transitions. [2019-10-22 08:57:31,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:31,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 446 [2019-10-22 08:57:31,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:31,972 INFO L225 Difference]: With dead ends: 4343 [2019-10-22 08:57:31,972 INFO L226 Difference]: Without dead ends: 2221 [2019-10-22 08:57:31,974 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 448 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-10-22 08:57:31,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2019-10-22 08:57:32,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 1935. [2019-10-22 08:57:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-10-22 08:57:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2648 transitions. [2019-10-22 08:57:32,027 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2648 transitions. Word has length 446 [2019-10-22 08:57:32,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:32,027 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2648 transitions. [2019-10-22 08:57:32,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:32,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2648 transitions. [2019-10-22 08:57:32,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2019-10-22 08:57:32,034 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:32,035 INFO L380 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 24, 24, 23, 23, 22, 22, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:32,235 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:32,236 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:32,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:32,236 INFO L82 PathProgramCache]: Analyzing trace with hash 260585257, now seen corresponding path program 1 times [2019-10-22 08:57:32,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:32,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822131621] [2019-10-22 08:57:32,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:32,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:32,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:32,791 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-10-22 08:57:32,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822131621] [2019-10-22 08:57:32,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288545436] [2019-10-22 08:57:32,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04112d6d-c6df-46a2-9cdf-2bde7ef3b7dc/bin/uautomizer/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-10-22 08:57:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:32,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 1242 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:57:32,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:33,282 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-10-22 08:57:33,282 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:57:33,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 08:57:33,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689349247] [2019-10-22 08:57:33,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:33,284 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:33,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:33,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:33,285 INFO L87 Difference]: Start difference. First operand 1935 states and 2648 transitions. Second operand 4 states. [2019-10-22 08:57:33,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:33,509 INFO L93 Difference]: Finished difference Result 4591 states and 6320 transitions. [2019-10-22 08:57:33,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:57:33,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 847 [2019-10-22 08:57:33,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:33,513 INFO L225 Difference]: With dead ends: 4591 [2019-10-22 08:57:33,513 INFO L226 Difference]: Without dead ends: 2601 [2019-10-22 08:57:33,515 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 849 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-10-22 08:57:33,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2019-10-22 08:57:33,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 1935. [2019-10-22 08:57:33,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-10-22 08:57:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2648 transitions. [2019-10-22 08:57:33,571 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2648 transitions. Word has length 847 [2019-10-22 08:57:33,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:33,571 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2648 transitions. [2019-10-22 08:57:33,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:33,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2648 transitions. [2019-10-22 08:57:33,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1029 [2019-10-22 08:57:33,580 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:33,581 INFO L380 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:33,781 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:33,782 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:33,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:33,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1537607748, now seen corresponding path program 1 times [2019-10-22 08:57:33,782 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:33,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785859341] [2019-10-22 08:57:33,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:33,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:33,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12523 backedges. 5859 proven. 0 refuted. 0 times theorem prover too weak. 6664 trivial. 0 not checked. [2019-10-22 08:57:34,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785859341] [2019-10-22 08:57:34,465 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:34,465 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:34,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801205578] [2019-10-22 08:57:34,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:34,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:34,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:34,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:34,466 INFO L87 Difference]: Start difference. First operand 1935 states and 2648 transitions. Second operand 3 states. [2019-10-22 08:57:34,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:34,604 INFO L93 Difference]: Finished difference Result 3871 states and 5290 transitions. [2019-10-22 08:57:34,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:34,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1028 [2019-10-22 08:57:34,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:34,608 INFO L225 Difference]: With dead ends: 3871 [2019-10-22 08:57:34,608 INFO L226 Difference]: Without dead ends: 1975 [2019-10-22 08:57:34,610 INFO L600 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-10-22 08:57:34,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2019-10-22 08:57:34,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1935. [2019-10-22 08:57:34,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-10-22 08:57:34,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2633 transitions. [2019-10-22 08:57:34,660 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2633 transitions. Word has length 1028 [2019-10-22 08:57:34,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:34,661 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2633 transitions. [2019-10-22 08:57:34,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:34,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2633 transitions. [2019-10-22 08:57:34,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1044 [2019-10-22 08:57:34,669 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:34,669 INFO L380 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-10-22 08:57:34,669 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:34,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:34,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1152424720, now seen corresponding path program 1 times [2019-10-22 08:57:34,670 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:34,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156557484] [2019-10-22 08:57:34,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:34,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:34,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:35,197 INFO L134 CoverageAnalysis]: Checked inductivity of 12731 backedges. 5768 proven. 0 refuted. 0 times theorem prover too weak. 6963 trivial. 0 not checked. [2019-10-22 08:57:35,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156557484] [2019-10-22 08:57:35,200 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:35,200 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:35,200 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840077635] [2019-10-22 08:57:35,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:35,201 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:35,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:35,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:35,201 INFO L87 Difference]: Start difference. First operand 1935 states and 2633 transitions. Second operand 3 states. [2019-10-22 08:57:35,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:35,340 INFO L93 Difference]: Finished difference Result 3831 states and 5212 transitions. [2019-10-22 08:57:35,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:35,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1043 [2019-10-22 08:57:35,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:35,344 INFO L225 Difference]: With dead ends: 3831 [2019-10-22 08:57:35,344 INFO L226 Difference]: Without dead ends: 1935 [2019-10-22 08:57:35,346 INFO L600 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-10-22 08:57:35,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-10-22 08:57:35,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-10-22 08:57:35,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-10-22 08:57:35,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2595 transitions. [2019-10-22 08:57:35,393 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2595 transitions. Word has length 1043 [2019-10-22 08:57:35,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:35,394 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2595 transitions. [2019-10-22 08:57:35,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:35,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2595 transitions. [2019-10-22 08:57:35,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1072 [2019-10-22 08:57:35,403 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:35,403 INFO L380 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:35,403 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:35,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:35,404 INFO L82 PathProgramCache]: Analyzing trace with hash -529516007, now seen corresponding path program 1 times [2019-10-22 08:57:35,404 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:35,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160114784] [2019-10-22 08:57:35,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:35,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:35,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:36,062 INFO L134 CoverageAnalysis]: Checked inductivity of 13413 backedges. 6481 proven. 0 refuted. 0 times theorem prover too weak. 6932 trivial. 0 not checked. [2019-10-22 08:57:36,064 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160114784] [2019-10-22 08:57:36,064 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:36,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:36,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124444208] [2019-10-22 08:57:36,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:36,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:36,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:36,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:36,066 INFO L87 Difference]: Start difference. First operand 1935 states and 2595 transitions. Second operand 3 states. [2019-10-22 08:57:36,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:36,189 INFO L93 Difference]: Finished difference Result 3871 states and 5194 transitions. [2019-10-22 08:57:36,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:36,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1071 [2019-10-22 08:57:36,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:36,192 INFO L225 Difference]: With dead ends: 3871 [2019-10-22 08:57:36,192 INFO L226 Difference]: Without dead ends: 1963 [2019-10-22 08:57:36,194 INFO L600 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-10-22 08:57:36,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2019-10-22 08:57:36,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1963. [2019-10-22 08:57:36,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-10-22 08:57:36,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2623 transitions. [2019-10-22 08:57:36,242 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2623 transitions. Word has length 1071 [2019-10-22 08:57:36,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:36,242 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 2623 transitions. [2019-10-22 08:57:36,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:36,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2623 transitions. [2019-10-22 08:57:36,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1104 [2019-10-22 08:57:36,252 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:36,252 INFO L380 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 36, 36, 36, 36, 36, 36, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-10-22 08:57:36,252 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:36,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:36,253 INFO L82 PathProgramCache]: Analyzing trace with hash -503398519, now seen corresponding path program 1 times [2019-10-22 08:57:36,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:36,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649396491] [2019-10-22 08:57:36,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:36,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:36,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:36,835 INFO L134 CoverageAnalysis]: Checked inductivity of 13929 backedges. 6521 proven. 0 refuted. 0 times theorem prover too weak. 7408 trivial. 0 not checked. [2019-10-22 08:57:36,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649396491] [2019-10-22 08:57:36,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:36,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:36,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063215386] [2019-10-22 08:57:36,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:36,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:36,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:36,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:36,838 INFO L87 Difference]: Start difference. First operand 1963 states and 2623 transitions. Second operand 3 states. [2019-10-22 08:57:36,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:36,940 INFO L93 Difference]: Finished difference Result 2491 states and 3323 transitions. [2019-10-22 08:57:36,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:36,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1103 [2019-10-22 08:57:36,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:36,941 INFO L225 Difference]: With dead ends: 2491 [2019-10-22 08:57:36,941 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:57:36,942 INFO L600 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-10-22 08:57:36,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:57:36,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:57:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:57:36,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:57:36,943 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1103 [2019-10-22 08:57:36,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:36,943 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:36,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:36,943 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:57:36,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:57:36,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:57:37,183 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 128 [2019-10-22 08:57:37,835 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 130 [2019-10-22 08:57:38,175 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-10-22 08:57:38,914 WARN L191 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 85 [2019-10-22 08:57:39,488 WARN L191 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 99 [2019-10-22 08:57:39,836 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 96 [2019-10-22 08:57:40,085 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-10-22 08:57:40,295 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-10-22 08:57:40,496 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-10-22 08:57:40,642 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-10-22 08:57:40,819 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-10-22 08:57:41,045 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-10-22 08:57:41,258 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-10-22 08:57:41,500 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-10-22 08:57:41,782 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-10-22 08:57:41,959 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-10-22 08:57:42,147 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-10-22 08:57:42,435 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2019-10-22 08:57:42,971 WARN L191 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 90 [2019-10-22 08:57:43,163 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2019-10-22 08:57:43,357 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-10-22 08:57:43,559 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-10-22 08:57:43,766 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-10-22 08:57:43,768 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-10-22 08:57:43,768 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 551) no Hoare annotation was computed. [2019-10-22 08:57:43,768 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 562) no Hoare annotation was computed. [2019-10-22 08:57:43,768 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 573) no Hoare annotation was computed. [2019-10-22 08:57:43,768 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 584) no Hoare annotation was computed. [2019-10-22 08:57:43,769 INFO L446 ceAbstractionStarter]: At program point L631(lines 622 633) the Hoare annotation is: true [2019-10-22 08:57:43,769 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-10-22 08:57:43,769 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 238) no Hoare annotation was computed. [2019-10-22 08:57:43,769 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 552) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2019-10-22 08:57:43,769 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 584) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-10-22 08:57:43,769 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 309) no Hoare annotation was computed. [2019-10-22 08:57:43,770 INFO L443 ceAbstractionStarter]: For program point L302-2(lines 302 309) no Hoare annotation was computed. [2019-10-22 08:57:43,770 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 550) no Hoare annotation was computed. [2019-10-22 08:57:43,770 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 561) no Hoare annotation was computed. [2019-10-22 08:57:43,770 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 572) no Hoare annotation was computed. [2019-10-22 08:57:43,770 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 583) no Hoare annotation was computed. [2019-10-22 08:57:43,770 INFO L443 ceAbstractionStarter]: For program point L535(lines 535 541) no Hoare annotation was computed. [2019-10-22 08:57:43,770 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 535 541) no Hoare annotation was computed. [2019-10-22 08:57:43,770 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 361) no Hoare annotation was computed. [2019-10-22 08:57:43,770 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 550) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-10-22 08:57:43,771 INFO L439 ceAbstractionStarter]: At program point L172(lines 168 562) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12))) [2019-10-22 08:57:43,771 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 573) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse13 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse9 .cse10 .cse12 .cse11) .cse13) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse12 .cse11) .cse13))) [2019-10-22 08:57:43,771 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 274) no Hoare annotation was computed. [2019-10-22 08:57:43,771 INFO L443 ceAbstractionStarter]: For program point L272-2(lines 208 547) no Hoare annotation was computed. [2019-10-22 08:57:43,771 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 308) no Hoare annotation was computed. [2019-10-22 08:57:43,771 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 251) no Hoare annotation was computed. [2019-10-22 08:57:43,771 INFO L439 ceAbstractionStarter]: At program point L207(lines 206 550) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-10-22 08:57:43,771 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 560) no Hoare annotation was computed. [2019-10-22 08:57:43,772 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 571) no Hoare annotation was computed. [2019-10-22 08:57:43,772 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 582) no Hoare annotation was computed. [2019-10-22 08:57:43,772 INFO L446 ceAbstractionStarter]: At program point L604(lines 98 605) the Hoare annotation is: true [2019-10-22 08:57:43,772 INFO L443 ceAbstractionStarter]: For program point L538(lines 538 540) no Hoare annotation was computed. [2019-10-22 08:57:43,772 INFO L443 ceAbstractionStarter]: For program point L506(lines 506 509) no Hoare annotation was computed. [2019-10-22 08:57:43,772 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 442) no Hoare annotation was computed. [2019-10-22 08:57:43,772 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-10-22 08:57:43,772 INFO L443 ceAbstractionStarter]: For program point L341-2(lines 341 345) no Hoare annotation was computed. [2019-10-22 08:57:43,772 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 245) no Hoare annotation was computed. [2019-10-22 08:57:43,772 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 407) no Hoare annotation was computed. [2019-10-22 08:57:43,772 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 559) no Hoare annotation was computed. [2019-10-22 08:57:43,773 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 570) no Hoare annotation was computed. [2019-10-22 08:57:43,773 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 581) no Hoare annotation was computed. [2019-10-22 08:57:43,773 INFO L443 ceAbstractionStarter]: For program point L475(lines 475 477) no Hoare annotation was computed. [2019-10-22 08:57:43,773 INFO L443 ceAbstractionStarter]: For program point L475-2(lines 208 547) no Hoare annotation was computed. [2019-10-22 08:57:43,773 INFO L443 ceAbstractionStarter]: For program point L376(lines 376 382) no Hoare annotation was computed. [2019-10-22 08:57:43,773 INFO L439 ceAbstractionStarter]: At program point L211(lines 105 583) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (and .cse0 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:43,773 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 560) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:43,774 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 571) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:43,774 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 452) no Hoare annotation was computed. [2019-10-22 08:57:43,775 INFO L443 ceAbstractionStarter]: For program point L609(lines 609 611) no Hoare annotation was computed. [2019-10-22 08:57:43,775 INFO L443 ceAbstractionStarter]: For program point L609-2(lines 609 611) no Hoare annotation was computed. [2019-10-22 08:57:43,775 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 558) no Hoare annotation was computed. [2019-10-22 08:57:43,775 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 569) no Hoare annotation was computed. [2019-10-22 08:57:43,775 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 580) no Hoare annotation was computed. [2019-10-22 08:57:43,775 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-10-22 08:57:43,775 INFO L446 ceAbstractionStarter]: At program point L612(lines 12 616) the Hoare annotation is: true [2019-10-22 08:57:43,775 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 449) no Hoare annotation was computed. [2019-10-22 08:57:43,776 INFO L443 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2019-10-22 08:57:43,776 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 557) no Hoare annotation was computed. [2019-10-22 08:57:43,776 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 568) no Hoare annotation was computed. [2019-10-22 08:57:43,776 INFO L443 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2019-10-22 08:57:43,776 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 579) no Hoare annotation was computed. [2019-10-22 08:57:43,776 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 520) no Hoare annotation was computed. [2019-10-22 08:57:43,776 INFO L443 ceAbstractionStarter]: For program point L481(lines 481 485) no Hoare annotation was computed. [2019-10-22 08:57:43,776 INFO L443 ceAbstractionStarter]: For program point L481-2(lines 481 485) no Hoare annotation was computed. [2019-10-22 08:57:43,776 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 357) no Hoare annotation was computed. [2019-10-22 08:57:43,776 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 558) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse7 .cse9 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:43,777 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 569) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.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 8576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:43,777 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2019-10-22 08:57:43,777 INFO L443 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2019-10-22 08:57:43,777 INFO L439 ceAbstractionStarter]: At program point L548(lines 99 603) the Hoare annotation is: (let ((.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse13 .cse14) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse14 .cse8) (and (and .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse6 .cse7 .cse9 .cse10 .cse11) .cse0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (and .cse12 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:43,777 INFO L439 ceAbstractionStarter]: At program point L350(lines 325 368) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.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 8576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:43,778 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:57:43,778 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 419) no Hoare annotation was computed. [2019-10-22 08:57:43,778 INFO L439 ceAbstractionStarter]: At program point L384(lines 375 407) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:43,779 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 287) no Hoare annotation was computed. [2019-10-22 08:57:43,779 INFO L443 ceAbstractionStarter]: For program point L285-2(lines 208 547) no Hoare annotation was computed. [2019-10-22 08:57:43,779 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 556) no Hoare annotation was computed. [2019-10-22 08:57:43,779 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 567) no Hoare annotation was computed. [2019-10-22 08:57:43,779 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 578) no Hoare annotation was computed. [2019-10-22 08:57:43,779 INFO L443 ceAbstractionStarter]: For program point L517(lines 517 519) no Hoare annotation was computed. [2019-10-22 08:57:43,779 INFO L439 ceAbstractionStarter]: At program point L517-1(lines 208 547) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2019-10-22 08:57:43,779 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 354) no Hoare annotation was computed. [2019-10-22 08:57:43,779 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 323) no Hoare annotation was computed. [2019-10-22 08:57:43,780 INFO L443 ceAbstractionStarter]: For program point L319-2(lines 208 547) no Hoare annotation was computed. [2019-10-22 08:57:43,780 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 579) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse11 (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse5 .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-10-22 08:57:43,780 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-10-22 08:57:43,780 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 601) no Hoare annotation was computed. [2019-10-22 08:57:43,780 INFO L443 ceAbstractionStarter]: For program point L387(lines 387 405) no Hoare annotation was computed. [2019-10-22 08:57:43,780 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 555) no Hoare annotation was computed. [2019-10-22 08:57:43,780 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 566) no Hoare annotation was computed. [2019-10-22 08:57:43,780 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 577) no Hoare annotation was computed. [2019-10-22 08:57:43,780 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-10-22 08:57:43,780 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 73 615) no Hoare annotation was computed. [2019-10-22 08:57:43,781 INFO L443 ceAbstractionStarter]: For program point L619(line 619) no Hoare annotation was computed. [2019-10-22 08:57:43,781 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 600) no Hoare annotation was computed. [2019-10-22 08:57:43,781 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 394) no Hoare annotation was computed. [2019-10-22 08:57:43,781 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:57:43,781 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 556) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse14 .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:43,781 INFO L439 ceAbstractionStarter]: At program point L157(lines 153 567) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:43,782 INFO L439 ceAbstractionStarter]: At program point L124(lines 123 577) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-10-22 08:57:43,782 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-10-22 08:57:43,782 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 592) no Hoare annotation was computed. [2019-10-22 08:57:43,782 INFO L443 ceAbstractionStarter]: For program point L587-2(lines 586 600) no Hoare annotation was computed. [2019-10-22 08:57:43,783 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 259) no Hoare annotation was computed. [2019-10-22 08:57:43,783 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 295) no Hoare annotation was computed. [2019-10-22 08:57:43,783 INFO L443 ceAbstractionStarter]: For program point L291-2(lines 291 295) no Hoare annotation was computed. [2019-10-22 08:57:43,783 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 554) no Hoare annotation was computed. [2019-10-22 08:57:43,783 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 565) no Hoare annotation was computed. [2019-10-22 08:57:43,783 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 576) no Hoare annotation was computed. [2019-10-22 08:57:43,783 INFO L443 ceAbstractionStarter]: For program point L589(lines 589 591) no Hoare annotation was computed. [2019-10-22 08:57:43,783 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 459) no Hoare annotation was computed. [2019-10-22 08:57:43,783 INFO L443 ceAbstractionStarter]: For program point L226(lines 226 233) no Hoare annotation was computed. [2019-10-22 08:57:43,783 INFO L443 ceAbstractionStarter]: For program point L226-2(lines 226 233) no Hoare annotation was computed. [2019-10-22 08:57:43,783 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:57:43,783 INFO L443 ceAbstractionStarter]: For program point L525(lines 525 529) no Hoare annotation was computed. [2019-10-22 08:57:43,784 INFO L443 ceAbstractionStarter]: For program point L492(lines 492 495) no Hoare annotation was computed. [2019-10-22 08:57:43,784 INFO L443 ceAbstractionStarter]: For program point L525-2(lines 525 529) no Hoare annotation was computed. [2019-10-22 08:57:43,784 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 434) no Hoare annotation was computed. [2019-10-22 08:57:43,784 INFO L443 ceAbstractionStarter]: For program point L426-2(lines 426 434) no Hoare annotation was computed. [2019-10-22 08:57:43,784 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-10-22 08:57:43,784 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 553) no Hoare annotation was computed. [2019-10-22 08:57:43,784 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 564) no Hoare annotation was computed. [2019-10-22 08:57:43,784 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 575) no Hoare annotation was computed. [2019-10-22 08:57:43,784 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 367) no Hoare annotation was computed. [2019-10-22 08:57:43,784 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 554) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 .cse17 .cse18 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse19 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse20 .cse21))) [2019-10-22 08:57:43,785 INFO L439 ceAbstractionStarter]: At program point L163(lines 159 565) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:43,785 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 598) no Hoare annotation was computed. [2019-10-22 08:57:43,785 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 432) no Hoare annotation was computed. [2019-10-22 08:57:43,785 INFO L439 ceAbstractionStarter]: At program point L396(lines 387 405) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:43,785 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 552) no Hoare annotation was computed. [2019-10-22 08:57:43,785 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 563) no Hoare annotation was computed. [2019-10-22 08:57:43,785 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 574) no Hoare annotation was computed. [2019-10-22 08:57:43,786 INFO L439 ceAbstractionStarter]: At program point L99-2(lines 99 603) the Hoare annotation is: (let ((.cse17 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse16 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse0 .cse12 .cse13 .cse14 .cse2 .cse15 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse6 .cse7 .cse9 .cse10 .cse11) (and .cse16 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse17 .cse18) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse18 .cse8) (and (and .cse1 .cse12 .cse13 .cse14 .cse2 .cse15 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse6 .cse7 .cse9 .cse10 .cse11) .cse0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (and .cse16 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse16 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:43,786 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) no Hoare annotation was computed. [2019-10-22 08:57:43,786 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 366) no Hoare annotation was computed. [2019-10-22 08:57:43,787 INFO L443 ceAbstractionStarter]: For program point L331-1(lines 331 366) no Hoare annotation was computed. [2019-10-22 08:57:43,787 INFO L439 ceAbstractionStarter]: At program point L166(lines 165 563) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse13 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse11 .cse12 (not .cse13)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12) (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)))) [2019-10-22 08:57:43,787 INFO L439 ceAbstractionStarter]: At program point L133(lines 126 576) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse11 .cse12 .cse13 .cse14 .cse15)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse12 .cse13 .cse15 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse13 .cse14 .cse15) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-10-22 08:57:43,787 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-22 08:57:43,787 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 499) no Hoare annotation was computed. [2019-10-22 08:57:43,787 INFO L443 ceAbstractionStarter]: For program point L497-2(lines 208 547) no Hoare annotation was computed. [2019-10-22 08:57:43,787 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 363) no Hoare annotation was computed. [2019-10-22 08:57:43,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:57:43 BoogieIcfgContainer [2019-10-22 08:57:43,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:57:43,827 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:43,827 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:43,827 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:43,827 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:22" (3/4) ... [2019-10-22 08:57:43,830 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:57:43,843 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 08:57:43,843 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 08:57:43,927 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_04112d6d-c6df-46a2-9cdf-2bde7ef3b7dc/bin/uautomizer/witness.graphml [2019-10-22 08:57:43,928 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:43,929 INFO L168 Benchmark]: Toolchain (without parser) took 22780.71 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -222.4 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-10-22 08:57:43,929 INFO L168 Benchmark]: CDTParser took 1.44 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:43,929 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:43,929 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.73 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:43,929 INFO L168 Benchmark]: Boogie Preprocessor took 27.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:43,930 INFO L168 Benchmark]: RCFGBuilder took 666.38 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: 61.4 MB). Peak memory consumption was 61.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:43,930 INFO L168 Benchmark]: TraceAbstraction took 21571.02 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -111.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-10-22 08:57:43,930 INFO L168 Benchmark]: Witness Printer took 101.18 ms. Allocated memory is still 2.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:43,932 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.44 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 366.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.73 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 666.38 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: 61.4 MB). Peak memory consumption was 61.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21571.02 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -111.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 101.18 ms. Allocated memory is still 2.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 619]: 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: 12]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((8448 <= s__state && !(s__state == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8545)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || (((((((!(s__state == 8577) && !(s__state == 8641)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag)) || (((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state)) || s__state <= 3) || ((8448 <= s__state && blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((8448 <= s__state && ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((((((((((((((8448 <= s__state && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && 0 == blastFlag) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((8448 <= s__state && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8480)) || ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (8448 <= s__state && ((((((((((((!(s__state == 8528) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (s__state <= 8448 && !(s__state == 8448) && 2 == blastFlag) || ((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8448)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state)) || ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8545)) && !(s__state == 8448)) && 2 == blastFlag) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((8448 <= s__state && !(s__state == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8545)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && 0 == blastFlag) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || (((((((!(s__state == 8577) && !(s__state == 8641)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag)) || (((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state)) || s__state <= 3) || ((8448 <= s__state && blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 3 && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8496)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 12292)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8497)) && !(s__state == 8496)) && (((!(s__state == 8673) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8640)) && !(0 == s__hit)) || (((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8576)) && !(s__state == 8496)) && (((!(s__state == 8673) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8480)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 1 error locations. Result: SAFE, OverallTime: 21.4s, OverallIterations: 40, TraceHistogramMax: 38, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.8s, HoareTripleCheckerStatistics: 6725 SDtfs, 5197 SDslu, 2367 SDs, 0 SdLazy, 3349 SolverSat, 1340 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2211 GetRequests, 2163 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3059occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 40 MinimizatonAttempts, 1298 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 222 NumberOfFragments, 4045 HoareAnnotationTreeSize, 28 FomulaSimplifications, 34973 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 28 FomulaSimplificationsInter, 7512 FormulaSimplificationTreeSizeReductionInter, 5.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 13262 NumberOfCodeBlocks, 13262 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 13218 ConstructedInterpolants, 0 QuantifiedInterpolants, 9177165 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3245 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 44 InterpolantComputations, 38 PerfectInterpolantSequences, 86997/87153 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...