./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c75b10c8-6d5d-40bc-9d61-c4a1391f0451/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c75b10c8-6d5d-40bc-9d61-c4a1391f0451/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c75b10c8-6d5d-40bc-9d61-c4a1391f0451/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c75b10c8-6d5d-40bc-9d61-c4a1391f0451/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c75b10c8-6d5d-40bc-9d61-c4a1391f0451/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c75b10c8-6d5d-40bc-9d61-c4a1391f0451/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 28eb30d9833654ceca3228385af91acd247ea794 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 15:37:25,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:37:25,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:37:25,254 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:37:25,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:37:25,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:37:25,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:37:25,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:37:25,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:37:25,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:37:25,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:37:25,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:37:25,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:37:25,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:37:25,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:37:25,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:37:25,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:37:25,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:37:25,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:37:25,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:37:25,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:37:25,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:37:25,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:37:25,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:37:25,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:37:25,272 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:37:25,272 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:37:25,273 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:37:25,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:37:25,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:37:25,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:37:25,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:37:25,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:37:25,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:37:25,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:37:25,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:37:25,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:37:25,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:37:25,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:37:25,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:37:25,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:37:25,278 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c75b10c8-6d5d-40bc-9d61-c4a1391f0451/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 15:37:25,288 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:37:25,288 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:37:25,289 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 15:37:25,289 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 15:37:25,289 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 15:37:25,289 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:37:25,289 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:37:25,290 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:37:25,290 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:37:25,290 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:37:25,290 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:37:25,290 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:37:25,290 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:37:25,290 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:37:25,291 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:37:25,291 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:37:25,291 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:37:25,291 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:37:25,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 15:37:25,291 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:37:25,291 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:37:25,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:37:25,292 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:37:25,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:37:25,292 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:37:25,292 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 15:37:25,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:37:25,292 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:37:25,292 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:37:25,293 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/run_dir_c75b10c8-6d5d-40bc-9d61-c4a1391f0451/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 -> 28eb30d9833654ceca3228385af91acd247ea794 [2019-12-07 15:37:25,389 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:37:25,397 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:37:25,399 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:37:25,399 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:37:25,400 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:37:25,400 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c75b10c8-6d5d-40bc-9d61-c4a1391f0451/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-1.c [2019-12-07 15:37:25,435 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c75b10c8-6d5d-40bc-9d61-c4a1391f0451/bin/uautomizer/data/5533c9e6f/ed9d755c0e554045817be385a2e3bd04/FLAG1b7e0136f [2019-12-07 15:37:25,799 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:37:25,800 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c75b10c8-6d5d-40bc-9d61-c4a1391f0451/sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-1.c [2019-12-07 15:37:25,807 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c75b10c8-6d5d-40bc-9d61-c4a1391f0451/bin/uautomizer/data/5533c9e6f/ed9d755c0e554045817be385a2e3bd04/FLAG1b7e0136f [2019-12-07 15:37:26,178 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c75b10c8-6d5d-40bc-9d61-c4a1391f0451/bin/uautomizer/data/5533c9e6f/ed9d755c0e554045817be385a2e3bd04 [2019-12-07 15:37:26,180 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:37:26,181 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:37:26,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:37:26,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:37:26,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:37:26,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:37:26" (1/1) ... [2019-12-07 15:37:26,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2af8c72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:37:26, skipping insertion in model container [2019-12-07 15:37:26,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:37:26" (1/1) ... [2019-12-07 15:37:26,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:37:26,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:37:26,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:37:26,392 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:37:26,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:37:26,437 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:37:26,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:37:26 WrapperNode [2019-12-07 15:37:26,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:37:26,437 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:37:26,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:37:26,438 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:37:26,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:37:26" (1/1) ... [2019-12-07 15:37:26,450 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:37:26" (1/1) ... [2019-12-07 15:37:26,474 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:37:26,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:37:26,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:37:26,475 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:37:26,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:37:26" (1/1) ... [2019-12-07 15:37:26,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:37:26" (1/1) ... [2019-12-07 15:37:26,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:37:26" (1/1) ... [2019-12-07 15:37:26,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:37:26" (1/1) ... [2019-12-07 15:37:26,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:37:26" (1/1) ... [2019-12-07 15:37:26,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:37:26" (1/1) ... [2019-12-07 15:37:26,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:37:26" (1/1) ... [2019-12-07 15:37:26,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:37:26,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:37:26,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:37:26,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:37:26,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:37:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c75b10c8-6d5d-40bc-9d61-c4a1391f0451/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-12-07 15:37:26,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:37:26,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:37:26,630 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 15:37:26,942 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-12-07 15:37:26,942 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-12-07 15:37:26,943 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:37:26,943 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 15:37:26,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:37:26 BoogieIcfgContainer [2019-12-07 15:37:26,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:37:26,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:37:26,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:37:26,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:37:26,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:37:26" (1/3) ... [2019-12-07 15:37:26,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d5dfc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:37:26, skipping insertion in model container [2019-12-07 15:37:26,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:37:26" (2/3) ... [2019-12-07 15:37:26,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d5dfc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:37:26, skipping insertion in model container [2019-12-07 15:37:26,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:37:26" (3/3) ... [2019-12-07 15:37:26,949 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil-1.c [2019-12-07 15:37:26,956 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:37:26,961 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 15:37:26,968 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 15:37:26,986 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:37:26,986 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:37:26,986 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:37:26,986 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:37:26,986 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:37:26,986 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:37:26,986 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:37:26,987 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:37:27,000 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-12-07 15:37:27,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 15:37:27,007 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:27,007 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:27,008 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:27,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:27,012 INFO L82 PathProgramCache]: Analyzing trace with hash -91605785, now seen corresponding path program 1 times [2019-12-07 15:37:27,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:27,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118392218] [2019-12-07 15:37:27,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:27,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:37:27,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118392218] [2019-12-07 15:37:27,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:27,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:37:27,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870193795] [2019-12-07 15:37:27,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:27,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:27,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:27,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:27,184 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-12-07 15:37:27,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:27,341 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-12-07 15:37:27,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:27,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-07 15:37:27,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:27,351 INFO L225 Difference]: With dead ends: 327 [2019-12-07 15:37:27,351 INFO L226 Difference]: Without dead ends: 174 [2019-12-07 15:37:27,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:27,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-12-07 15:37:27,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-12-07 15:37:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-07 15:37:27,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-12-07 15:37:27,390 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-12-07 15:37:27,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:27,390 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-12-07 15:37:27,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:27,391 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-12-07 15:37:27,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 15:37:27,392 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:27,393 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:27,393 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:27,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:27,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033262, now seen corresponding path program 1 times [2019-12-07 15:37:27,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:27,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687659999] [2019-12-07 15:37:27,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:37:27,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687659999] [2019-12-07 15:37:27,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:27,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:37:27,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905910298] [2019-12-07 15:37:27,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:27,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:27,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:27,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:27,443 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-12-07 15:37:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:27,576 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-12-07 15:37:27,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:27,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-07 15:37:27,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:27,579 INFO L225 Difference]: With dead ends: 379 [2019-12-07 15:37:27,579 INFO L226 Difference]: Without dead ends: 215 [2019-12-07 15:37:27,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:27,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-12-07 15:37:27,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-12-07 15:37:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-12-07 15:37:27,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-12-07 15:37:27,596 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-12-07 15:37:27,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:27,596 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-12-07 15:37:27,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:27,597 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-12-07 15:37:27,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 15:37:27,599 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:27,600 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:27,600 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:27,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:27,600 INFO L82 PathProgramCache]: Analyzing trace with hash -442897790, now seen corresponding path program 1 times [2019-12-07 15:37:27,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:27,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777641434] [2019-12-07 15:37:27,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:37:27,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777641434] [2019-12-07 15:37:27,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:27,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:37:27,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314719706] [2019-12-07 15:37:27,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:27,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:27,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:27,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:27,657 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-12-07 15:37:27,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:27,777 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-12-07 15:37:27,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:27,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-07 15:37:27,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:27,779 INFO L225 Difference]: With dead ends: 444 [2019-12-07 15:37:27,779 INFO L226 Difference]: Without dead ends: 241 [2019-12-07 15:37:27,781 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:27,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-12-07 15:37:27,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-12-07 15:37:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-12-07 15:37:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-12-07 15:37:27,796 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-12-07 15:37:27,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:27,796 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-12-07 15:37:27,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:27,796 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-12-07 15:37:27,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 15:37:27,798 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:27,798 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:27,798 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:27,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:27,798 INFO L82 PathProgramCache]: Analyzing trace with hash 2002519192, now seen corresponding path program 1 times [2019-12-07 15:37:27,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:27,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841947502] [2019-12-07 15:37:27,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:27,837 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 15:37:27,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841947502] [2019-12-07 15:37:27,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:27,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:37:27,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929469424] [2019-12-07 15:37:27,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:27,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:27,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:27,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:27,840 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-12-07 15:37:27,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:27,937 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-12-07 15:37:27,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:27,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 15:37:27,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:27,939 INFO L225 Difference]: With dead ends: 492 [2019-12-07 15:37:27,939 INFO L226 Difference]: Without dead ends: 258 [2019-12-07 15:37:27,940 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:27,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-12-07 15:37:27,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-12-07 15:37:27,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-12-07 15:37:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-12-07 15:37:27,951 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-12-07 15:37:27,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:27,951 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-12-07 15:37:27,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-12-07 15:37:27,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 15:37:27,953 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:27,953 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:27,953 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:27,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:27,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1780613796, now seen corresponding path program 1 times [2019-12-07 15:37:27,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:27,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984416657] [2019-12-07 15:37:27,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:37:27,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984416657] [2019-12-07 15:37:27,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:27,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:37:27,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831727807] [2019-12-07 15:37:27,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:27,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:27,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:27,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:27,997 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-12-07 15:37:28,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:28,094 INFO L93 Difference]: Finished difference Result 551 states and 930 transitions. [2019-12-07 15:37:28,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:28,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 15:37:28,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:28,096 INFO L225 Difference]: With dead ends: 551 [2019-12-07 15:37:28,096 INFO L226 Difference]: Without dead ends: 302 [2019-12-07 15:37:28,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:28,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-12-07 15:37:28,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-12-07 15:37:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-12-07 15:37:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-12-07 15:37:28,106 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-12-07 15:37:28,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:28,106 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-12-07 15:37:28,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:28,106 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-12-07 15:37:28,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 15:37:28,107 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:28,107 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:28,107 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:28,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:28,107 INFO L82 PathProgramCache]: Analyzing trace with hash -923139676, now seen corresponding path program 1 times [2019-12-07 15:37:28,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:28,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706477798] [2019-12-07 15:37:28,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:28,141 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 15:37:28,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706477798] [2019-12-07 15:37:28,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:28,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:37:28,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633836398] [2019-12-07 15:37:28,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:28,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:28,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:28,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:28,143 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-12-07 15:37:28,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:28,210 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-12-07 15:37:28,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:28,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-07 15:37:28,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:28,212 INFO L225 Difference]: With dead ends: 591 [2019-12-07 15:37:28,212 INFO L226 Difference]: Without dead ends: 300 [2019-12-07 15:37:28,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:28,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-12-07 15:37:28,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-12-07 15:37:28,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-12-07 15:37:28,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-12-07 15:37:28,220 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-12-07 15:37:28,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:28,220 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-12-07 15:37:28,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:28,220 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-12-07 15:37:28,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 15:37:28,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:28,221 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:28,221 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:28,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:28,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1119050571, now seen corresponding path program 1 times [2019-12-07 15:37:28,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:28,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686874291] [2019-12-07 15:37:28,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:37:28,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686874291] [2019-12-07 15:37:28,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:28,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:37:28,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552461546] [2019-12-07 15:37:28,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:28,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:28,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:28,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:28,250 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-12-07 15:37:28,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:28,353 INFO L93 Difference]: Finished difference Result 593 states and 994 transitions. [2019-12-07 15:37:28,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:28,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-07 15:37:28,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:28,355 INFO L225 Difference]: With dead ends: 593 [2019-12-07 15:37:28,355 INFO L226 Difference]: Without dead ends: 300 [2019-12-07 15:37:28,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:28,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-12-07 15:37:28,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2019-12-07 15:37:28,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-12-07 15:37:28,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-12-07 15:37:28,366 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-12-07 15:37:28,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:28,367 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-12-07 15:37:28,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:28,367 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-12-07 15:37:28,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 15:37:28,368 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:28,368 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:28,368 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:28,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:28,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1891855493, now seen corresponding path program 1 times [2019-12-07 15:37:28,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:28,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522810667] [2019-12-07 15:37:28,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:28,399 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 15:37:28,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522810667] [2019-12-07 15:37:28,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:28,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:37:28,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813118344] [2019-12-07 15:37:28,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:28,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:28,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:28,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:28,401 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-12-07 15:37:28,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:28,475 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-12-07 15:37:28,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:28,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-12-07 15:37:28,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:28,477 INFO L225 Difference]: With dead ends: 594 [2019-12-07 15:37:28,477 INFO L226 Difference]: Without dead ends: 305 [2019-12-07 15:37:28,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:28,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-12-07 15:37:28,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-12-07 15:37:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-12-07 15:37:28,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-12-07 15:37:28,484 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-12-07 15:37:28,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:28,484 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-12-07 15:37:28,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:28,484 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-12-07 15:37:28,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 15:37:28,485 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:28,485 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:28,485 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:28,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:28,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1633491035, now seen corresponding path program 1 times [2019-12-07 15:37:28,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:28,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111110148] [2019-12-07 15:37:28,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 15:37:28,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111110148] [2019-12-07 15:37:28,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:28,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:37:28,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333541237] [2019-12-07 15:37:28,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:28,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:28,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:28,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:28,512 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-12-07 15:37:28,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:28,606 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-12-07 15:37:28,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:28,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-12-07 15:37:28,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:28,608 INFO L225 Difference]: With dead ends: 634 [2019-12-07 15:37:28,608 INFO L226 Difference]: Without dead ends: 336 [2019-12-07 15:37:28,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:28,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-12-07 15:37:28,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-12-07 15:37:28,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-12-07 15:37:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-12-07 15:37:28,616 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-12-07 15:37:28,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:28,616 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-12-07 15:37:28,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:28,616 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-12-07 15:37:28,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 15:37:28,617 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:28,617 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:28,617 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:28,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:28,617 INFO L82 PathProgramCache]: Analyzing trace with hash -839203641, now seen corresponding path program 1 times [2019-12-07 15:37:28,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:28,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266792692] [2019-12-07 15:37:28,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:28,638 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 15:37:28,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266792692] [2019-12-07 15:37:28,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:28,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:37:28,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171488234] [2019-12-07 15:37:28,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:28,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:28,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:28,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:28,639 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-12-07 15:37:28,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:28,744 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-12-07 15:37:28,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:28,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 15:37:28,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:28,746 INFO L225 Difference]: With dead ends: 663 [2019-12-07 15:37:28,746 INFO L226 Difference]: Without dead ends: 336 [2019-12-07 15:37:28,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:28,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-12-07 15:37:28,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-12-07 15:37:28,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-12-07 15:37:28,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-12-07 15:37:28,754 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-12-07 15:37:28,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:28,755 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-12-07 15:37:28,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:28,755 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-12-07 15:37:28,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 15:37:28,756 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:28,756 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:28,756 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:28,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:28,756 INFO L82 PathProgramCache]: Analyzing trace with hash -2015586581, now seen corresponding path program 1 times [2019-12-07 15:37:28,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:28,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293146737] [2019-12-07 15:37:28,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:28,778 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 15:37:28,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293146737] [2019-12-07 15:37:28,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:28,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:37:28,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790739255] [2019-12-07 15:37:28,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:28,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:28,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:28,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:28,779 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-12-07 15:37:28,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:28,875 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-12-07 15:37:28,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:28,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-12-07 15:37:28,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:28,877 INFO L225 Difference]: With dead ends: 696 [2019-12-07 15:37:28,877 INFO L226 Difference]: Without dead ends: 369 [2019-12-07 15:37:28,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:28,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-12-07 15:37:28,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-12-07 15:37:28,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-12-07 15:37:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-12-07 15:37:28,885 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-12-07 15:37:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:28,886 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-12-07 15:37:28,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:28,886 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-12-07 15:37:28,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 15:37:28,887 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:28,887 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:28,887 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:28,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:28,887 INFO L82 PathProgramCache]: Analyzing trace with hash -598706249, now seen corresponding path program 1 times [2019-12-07 15:37:28,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:28,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190330344] [2019-12-07 15:37:28,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:28,908 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 15:37:28,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190330344] [2019-12-07 15:37:28,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:28,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:37:28,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086757686] [2019-12-07 15:37:28,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:28,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:28,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:28,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:28,909 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-12-07 15:37:29,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:29,007 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-12-07 15:37:29,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:29,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-12-07 15:37:29,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:29,009 INFO L225 Difference]: With dead ends: 723 [2019-12-07 15:37:29,009 INFO L226 Difference]: Without dead ends: 369 [2019-12-07 15:37:29,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-12-07 15:37:29,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-12-07 15:37:29,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-12-07 15:37:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-12-07 15:37:29,018 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-12-07 15:37:29,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:29,018 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-12-07 15:37:29,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:29,018 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-12-07 15:37:29,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 15:37:29,019 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:29,019 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:29,019 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:29,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:29,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1631731612, now seen corresponding path program 1 times [2019-12-07 15:37:29,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:29,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232496637] [2019-12-07 15:37:29,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:29,040 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 15:37:29,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232496637] [2019-12-07 15:37:29,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:29,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:37:29,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913293367] [2019-12-07 15:37:29,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:29,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:29,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:29,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:29,041 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-12-07 15:37:29,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:29,134 INFO L93 Difference]: Finished difference Result 741 states and 1194 transitions. [2019-12-07 15:37:29,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:29,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-12-07 15:37:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:29,136 INFO L225 Difference]: With dead ends: 741 [2019-12-07 15:37:29,136 INFO L226 Difference]: Without dead ends: 387 [2019-12-07 15:37:29,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:29,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-12-07 15:37:29,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382. [2019-12-07 15:37:29,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-12-07 15:37:29,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-12-07 15:37:29,146 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-12-07 15:37:29,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:29,146 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-12-07 15:37:29,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:29,146 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-12-07 15:37:29,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 15:37:29,147 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:29,147 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:29,147 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:29,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:29,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1883634640, now seen corresponding path program 1 times [2019-12-07 15:37:29,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:29,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514072649] [2019-12-07 15:37:29,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:29,168 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 15:37:29,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514072649] [2019-12-07 15:37:29,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:29,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:37:29,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111805727] [2019-12-07 15:37:29,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:29,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:29,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:29,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:29,169 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-12-07 15:37:29,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:29,262 INFO L93 Difference]: Finished difference Result 762 states and 1217 transitions. [2019-12-07 15:37:29,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:29,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-12-07 15:37:29,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:29,264 INFO L225 Difference]: With dead ends: 762 [2019-12-07 15:37:29,265 INFO L226 Difference]: Without dead ends: 387 [2019-12-07 15:37:29,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:29,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-12-07 15:37:29,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382. [2019-12-07 15:37:29,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-12-07 15:37:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-12-07 15:37:29,274 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-12-07 15:37:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:29,275 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-12-07 15:37:29,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-12-07 15:37:29,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 15:37:29,276 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:29,276 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:29,276 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:29,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:29,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1006288068, now seen corresponding path program 1 times [2019-12-07 15:37:29,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:29,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500510227] [2019-12-07 15:37:29,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 15:37:29,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500510227] [2019-12-07 15:37:29,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:29,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:37:29,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710267866] [2019-12-07 15:37:29,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:29,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:29,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:29,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:29,306 INFO L87 Difference]: Start difference. First operand 382 states and 604 transitions. Second operand 3 states. [2019-12-07 15:37:29,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:29,335 INFO L93 Difference]: Finished difference Result 757 states and 1197 transitions. [2019-12-07 15:37:29,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:29,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-12-07 15:37:29,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:29,339 INFO L225 Difference]: With dead ends: 757 [2019-12-07 15:37:29,339 INFO L226 Difference]: Without dead ends: 755 [2019-12-07 15:37:29,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:29,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-12-07 15:37:29,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-12-07 15:37:29,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-12-07 15:37:29,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1195 transitions. [2019-12-07 15:37:29,358 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1195 transitions. Word has length 120 [2019-12-07 15:37:29,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:29,359 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 1195 transitions. [2019-12-07 15:37:29,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:29,359 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1195 transitions. [2019-12-07 15:37:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 15:37:29,360 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:29,361 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:29,361 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:29,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:29,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1007661097, now seen corresponding path program 1 times [2019-12-07 15:37:29,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:29,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601801444] [2019-12-07 15:37:29,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:29,391 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 15:37:29,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601801444] [2019-12-07 15:37:29,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:29,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:37:29,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184224897] [2019-12-07 15:37:29,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:29,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:29,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:29,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:29,392 INFO L87 Difference]: Start difference. First operand 755 states and 1195 transitions. Second operand 3 states. [2019-12-07 15:37:29,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:29,437 INFO L93 Difference]: Finished difference Result 1871 states and 2963 transitions. [2019-12-07 15:37:29,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:29,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-12-07 15:37:29,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:29,442 INFO L225 Difference]: With dead ends: 1871 [2019-12-07 15:37:29,442 INFO L226 Difference]: Without dead ends: 1123 [2019-12-07 15:37:29,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:29,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-12-07 15:37:29,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2019-12-07 15:37:29,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-12-07 15:37:29,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1776 transitions. [2019-12-07 15:37:29,469 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1776 transitions. Word has length 121 [2019-12-07 15:37:29,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:29,469 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1776 transitions. [2019-12-07 15:37:29,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:29,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1776 transitions. [2019-12-07 15:37:29,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 15:37:29,471 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:29,471 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:29,471 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:29,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:29,471 INFO L82 PathProgramCache]: Analyzing trace with hash 381632917, now seen corresponding path program 1 times [2019-12-07 15:37:29,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:29,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433803694] [2019-12-07 15:37:29,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-12-07 15:37:29,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433803694] [2019-12-07 15:37:29,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:29,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:37:29,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341635455] [2019-12-07 15:37:29,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:29,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:29,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:29,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:29,494 INFO L87 Difference]: Start difference. First operand 1123 states and 1776 transitions. Second operand 3 states. [2019-12-07 15:37:29,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:29,543 INFO L93 Difference]: Finished difference Result 2590 states and 4096 transitions. [2019-12-07 15:37:29,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:29,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-12-07 15:37:29,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:29,551 INFO L225 Difference]: With dead ends: 2590 [2019-12-07 15:37:29,551 INFO L226 Difference]: Without dead ends: 1474 [2019-12-07 15:37:29,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:29,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2019-12-07 15:37:29,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2019-12-07 15:37:29,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2019-12-07 15:37:29,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2327 transitions. [2019-12-07 15:37:29,599 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2327 transitions. Word has length 121 [2019-12-07 15:37:29,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:29,600 INFO L462 AbstractCegarLoop]: Abstraction has 1474 states and 2327 transitions. [2019-12-07 15:37:29,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:29,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2327 transitions. [2019-12-07 15:37:29,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 15:37:29,602 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:29,602 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:29,603 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:29,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:29,603 INFO L82 PathProgramCache]: Analyzing trace with hash -2067443667, now seen corresponding path program 1 times [2019-12-07 15:37:29,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:29,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454600349] [2019-12-07 15:37:29,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:29,631 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-12-07 15:37:29,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454600349] [2019-12-07 15:37:29,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:29,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:37:29,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492127752] [2019-12-07 15:37:29,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:29,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:29,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:29,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:29,633 INFO L87 Difference]: Start difference. First operand 1474 states and 2327 transitions. Second operand 3 states. [2019-12-07 15:37:29,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:29,773 INFO L93 Difference]: Finished difference Result 2981 states and 4691 transitions. [2019-12-07 15:37:29,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:29,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-12-07 15:37:29,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:29,779 INFO L225 Difference]: With dead ends: 2981 [2019-12-07 15:37:29,779 INFO L226 Difference]: Without dead ends: 1514 [2019-12-07 15:37:29,781 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:29,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-12-07 15:37:29,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1474. [2019-12-07 15:37:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2019-12-07 15:37:29,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2183 transitions. [2019-12-07 15:37:29,812 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2183 transitions. Word has length 158 [2019-12-07 15:37:29,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:29,812 INFO L462 AbstractCegarLoop]: Abstraction has 1474 states and 2183 transitions. [2019-12-07 15:37:29,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2183 transitions. [2019-12-07 15:37:29,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 15:37:29,815 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:29,815 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-07 15:37:29,815 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:29,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:29,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1134888427, now seen corresponding path program 1 times [2019-12-07 15:37:29,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:29,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881789450] [2019-12-07 15:37:29,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:29,845 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-12-07 15:37:29,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881789450] [2019-12-07 15:37:29,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:29,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:37:29,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409507795] [2019-12-07 15:37:29,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:29,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:29,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:29,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:29,847 INFO L87 Difference]: Start difference. First operand 1474 states and 2183 transitions. Second operand 3 states. [2019-12-07 15:37:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:29,986 INFO L93 Difference]: Finished difference Result 3137 states and 4655 transitions. [2019-12-07 15:37:29,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:29,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-12-07 15:37:29,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:29,992 INFO L225 Difference]: With dead ends: 3137 [2019-12-07 15:37:29,992 INFO L226 Difference]: Without dead ends: 1670 [2019-12-07 15:37:29,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:29,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2019-12-07 15:37:30,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1554. [2019-12-07 15:37:30,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1554 states. [2019-12-07 15:37:30,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2243 transitions. [2019-12-07 15:37:30,026 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2243 transitions. Word has length 158 [2019-12-07 15:37:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:30,026 INFO L462 AbstractCegarLoop]: Abstraction has 1554 states and 2243 transitions. [2019-12-07 15:37:30,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:30,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2243 transitions. [2019-12-07 15:37:30,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 15:37:30,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:30,029 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-12-07 15:37:30,029 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:30,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:30,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1894065177, now seen corresponding path program 1 times [2019-12-07 15:37:30,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:30,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020449003] [2019-12-07 15:37:30,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-12-07 15:37:30,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020449003] [2019-12-07 15:37:30,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:30,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:37:30,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957726613] [2019-12-07 15:37:30,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:30,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:30,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:30,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:30,068 INFO L87 Difference]: Start difference. First operand 1554 states and 2243 transitions. Second operand 3 states. [2019-12-07 15:37:30,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:30,196 INFO L93 Difference]: Finished difference Result 3157 states and 4541 transitions. [2019-12-07 15:37:30,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:30,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-12-07 15:37:30,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:30,202 INFO L225 Difference]: With dead ends: 3157 [2019-12-07 15:37:30,203 INFO L226 Difference]: Without dead ends: 1610 [2019-12-07 15:37:30,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:30,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2019-12-07 15:37:30,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1554. [2019-12-07 15:37:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1554 states. [2019-12-07 15:37:30,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2181 transitions. [2019-12-07 15:37:30,235 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2181 transitions. Word has length 172 [2019-12-07 15:37:30,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:30,235 INFO L462 AbstractCegarLoop]: Abstraction has 1554 states and 2181 transitions. [2019-12-07 15:37:30,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:30,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2181 transitions. [2019-12-07 15:37:30,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-12-07 15:37:30,238 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:30,238 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12-07 15:37:30,238 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:30,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:30,238 INFO L82 PathProgramCache]: Analyzing trace with hash -313542519, now seen corresponding path program 1 times [2019-12-07 15:37:30,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:30,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302205763] [2019-12-07 15:37:30,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:30,270 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-12-07 15:37:30,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302205763] [2019-12-07 15:37:30,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:30,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:37:30,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53204737] [2019-12-07 15:37:30,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:30,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:30,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:30,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:30,271 INFO L87 Difference]: Start difference. First operand 1554 states and 2181 transitions. Second operand 3 states. [2019-12-07 15:37:30,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:30,378 INFO L93 Difference]: Finished difference Result 3186 states and 4458 transitions. [2019-12-07 15:37:30,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:30,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-12-07 15:37:30,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:30,387 INFO L225 Difference]: With dead ends: 3186 [2019-12-07 15:37:30,387 INFO L226 Difference]: Without dead ends: 1639 [2019-12-07 15:37:30,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:30,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2019-12-07 15:37:30,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1623. [2019-12-07 15:37:30,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-12-07 15:37:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2265 transitions. [2019-12-07 15:37:30,426 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2265 transitions. Word has length 188 [2019-12-07 15:37:30,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:30,426 INFO L462 AbstractCegarLoop]: Abstraction has 1623 states and 2265 transitions. [2019-12-07 15:37:30,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:30,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2265 transitions. [2019-12-07 15:37:30,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-12-07 15:37:30,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:30,429 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 15:37:30,429 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:30,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:30,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1889247393, now seen corresponding path program 1 times [2019-12-07 15:37:30,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:30,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313277573] [2019-12-07 15:37:30,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:30,478 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-12-07 15:37:30,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313277573] [2019-12-07 15:37:30,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:30,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:37:30,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991424895] [2019-12-07 15:37:30,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:30,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:30,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:30,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:30,479 INFO L87 Difference]: Start difference. First operand 1623 states and 2265 transitions. Second operand 3 states. [2019-12-07 15:37:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:30,585 INFO L93 Difference]: Finished difference Result 3391 states and 4735 transitions. [2019-12-07 15:37:30,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:30,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-12-07 15:37:30,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:30,592 INFO L225 Difference]: With dead ends: 3391 [2019-12-07 15:37:30,592 INFO L226 Difference]: Without dead ends: 1775 [2019-12-07 15:37:30,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:30,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2019-12-07 15:37:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1723. [2019-12-07 15:37:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2019-12-07 15:37:30,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2385 transitions. [2019-12-07 15:37:30,627 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2385 transitions. Word has length 209 [2019-12-07 15:37:30,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:30,627 INFO L462 AbstractCegarLoop]: Abstraction has 1723 states and 2385 transitions. [2019-12-07 15:37:30,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:30,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2385 transitions. [2019-12-07 15:37:30,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-12-07 15:37:30,630 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:30,631 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:30,631 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:30,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:30,631 INFO L82 PathProgramCache]: Analyzing trace with hash 627964964, now seen corresponding path program 1 times [2019-12-07 15:37:30,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:30,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431867978] [2019-12-07 15:37:30,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-12-07 15:37:30,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431867978] [2019-12-07 15:37:30,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:30,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:37:30,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806129708] [2019-12-07 15:37:30,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:30,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:30,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:30,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:30,684 INFO L87 Difference]: Start difference. First operand 1723 states and 2385 transitions. Second operand 3 states. [2019-12-07 15:37:30,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:30,843 INFO L93 Difference]: Finished difference Result 3493 states and 4821 transitions. [2019-12-07 15:37:30,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:30,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-12-07 15:37:30,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:30,850 INFO L225 Difference]: With dead ends: 3493 [2019-12-07 15:37:30,850 INFO L226 Difference]: Without dead ends: 1777 [2019-12-07 15:37:30,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:30,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2019-12-07 15:37:30,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1723. [2019-12-07 15:37:30,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2019-12-07 15:37:30,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2377 transitions. [2019-12-07 15:37:30,887 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2377 transitions. Word has length 212 [2019-12-07 15:37:30,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:30,887 INFO L462 AbstractCegarLoop]: Abstraction has 1723 states and 2377 transitions. [2019-12-07 15:37:30,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:30,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2377 transitions. [2019-12-07 15:37:30,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-12-07 15:37:30,891 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:30,891 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:30,891 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:30,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:30,891 INFO L82 PathProgramCache]: Analyzing trace with hash 575806657, now seen corresponding path program 1 times [2019-12-07 15:37:30,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:30,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363925017] [2019-12-07 15:37:30,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-12-07 15:37:30,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363925017] [2019-12-07 15:37:30,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:30,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:37:30,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781681535] [2019-12-07 15:37:30,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:30,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:30,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:30,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:30,944 INFO L87 Difference]: Start difference. First operand 1723 states and 2377 transitions. Second operand 3 states. [2019-12-07 15:37:31,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:31,072 INFO L93 Difference]: Finished difference Result 3635 states and 5035 transitions. [2019-12-07 15:37:31,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:31,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-12-07 15:37:31,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:31,079 INFO L225 Difference]: With dead ends: 3635 [2019-12-07 15:37:31,079 INFO L226 Difference]: Without dead ends: 1819 [2019-12-07 15:37:31,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:31,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2019-12-07 15:37:31,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1779. [2019-12-07 15:37:31,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-12-07 15:37:31,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2421 transitions. [2019-12-07 15:37:31,117 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2421 transitions. Word has length 233 [2019-12-07 15:37:31,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:31,117 INFO L462 AbstractCegarLoop]: Abstraction has 1779 states and 2421 transitions. [2019-12-07 15:37:31,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:31,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2421 transitions. [2019-12-07 15:37:31,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-12-07 15:37:31,120 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:31,121 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:31,121 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:31,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:31,121 INFO L82 PathProgramCache]: Analyzing trace with hash 274134262, now seen corresponding path program 1 times [2019-12-07 15:37:31,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:31,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296011701] [2019-12-07 15:37:31,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-12-07 15:37:31,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296011701] [2019-12-07 15:37:31,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:31,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:37:31,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719828445] [2019-12-07 15:37:31,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:31,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:31,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:31,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:31,168 INFO L87 Difference]: Start difference. First operand 1779 states and 2421 transitions. Second operand 3 states. [2019-12-07 15:37:31,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:31,278 INFO L93 Difference]: Finished difference Result 3583 states and 4883 transitions. [2019-12-07 15:37:31,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:31,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-12-07 15:37:31,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:31,284 INFO L225 Difference]: With dead ends: 3583 [2019-12-07 15:37:31,285 INFO L226 Difference]: Without dead ends: 1811 [2019-12-07 15:37:31,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:31,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2019-12-07 15:37:31,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1779. [2019-12-07 15:37:31,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-12-07 15:37:31,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2401 transitions. [2019-12-07 15:37:31,322 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2401 transitions. Word has length 235 [2019-12-07 15:37:31,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:31,323 INFO L462 AbstractCegarLoop]: Abstraction has 1779 states and 2401 transitions. [2019-12-07 15:37:31,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:31,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2401 transitions. [2019-12-07 15:37:31,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-12-07 15:37:31,326 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:31,326 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:31,326 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:31,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:31,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2133876990, now seen corresponding path program 1 times [2019-12-07 15:37:31,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:31,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370513765] [2019-12-07 15:37:31,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:31,395 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 425 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-12-07 15:37:31,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370513765] [2019-12-07 15:37:31,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122212624] [2019-12-07 15:37:31,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c75b10c8-6d5d-40bc-9d61-c4a1391f0451/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-12-07 15:37:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:31,474 INFO L264 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 15:37:31,485 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:37:31,561 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-12-07 15:37:31,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 15:37:31,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 15:37:31,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301251155] [2019-12-07 15:37:31,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:31,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:31,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:31,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:37:31,562 INFO L87 Difference]: Start difference. First operand 1779 states and 2401 transitions. Second operand 3 states. [2019-12-07 15:37:31,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:31,629 INFO L93 Difference]: Finished difference Result 3573 states and 4829 transitions. [2019-12-07 15:37:31,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:31,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-12-07 15:37:31,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:31,640 INFO L225 Difference]: With dead ends: 3573 [2019-12-07 15:37:31,641 INFO L226 Difference]: Without dead ends: 2234 [2019-12-07 15:37:31,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 245 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-12-07 15:37:31,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2019-12-07 15:37:31,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2234. [2019-12-07 15:37:31,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2019-12-07 15:37:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 3016 transitions. [2019-12-07 15:37:31,715 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 3016 transitions. Word has length 245 [2019-12-07 15:37:31,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:31,715 INFO L462 AbstractCegarLoop]: Abstraction has 2234 states and 3016 transitions. [2019-12-07 15:37:31,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:31,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 3016 transitions. [2019-12-07 15:37:31,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-12-07 15:37:31,720 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:31,720 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:31,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:37:31,921 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:31,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:31,921 INFO L82 PathProgramCache]: Analyzing trace with hash -207038505, now seen corresponding path program 1 times [2019-12-07 15:37:31,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:31,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496058943] [2019-12-07 15:37:31,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:31,980 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-12-07 15:37:31,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496058943] [2019-12-07 15:37:31,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655492493] [2019-12-07 15:37:31,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c75b10c8-6d5d-40bc-9d61-c4a1391f0451/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-12-07 15:37:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:32,045 INFO L264 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 15:37:32,051 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:37:32,096 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-12-07 15:37:32,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:37:32,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 15:37:32,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763719324] [2019-12-07 15:37:32,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:37:32,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:32,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:37:32,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:37:32,098 INFO L87 Difference]: Start difference. First operand 2234 states and 3016 transitions. Second operand 4 states. [2019-12-07 15:37:32,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:32,428 INFO L93 Difference]: Finished difference Result 7148 states and 9660 transitions. [2019-12-07 15:37:32,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:37:32,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-12-07 15:37:32,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:32,447 INFO L225 Difference]: With dead ends: 7148 [2019-12-07 15:37:32,447 INFO L226 Difference]: Without dead ends: 4921 [2019-12-07 15:37:32,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:37:32,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4921 states. [2019-12-07 15:37:32,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4921 to 2779. [2019-12-07 15:37:32,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2779 states. [2019-12-07 15:37:32,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 3666 transitions. [2019-12-07 15:37:32,536 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 3666 transitions. Word has length 252 [2019-12-07 15:37:32,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:32,536 INFO L462 AbstractCegarLoop]: Abstraction has 2779 states and 3666 transitions. [2019-12-07 15:37:32,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:37:32,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 3666 transitions. [2019-12-07 15:37:32,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-12-07 15:37:32,541 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:32,541 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:32,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:37:32,742 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:32,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:32,742 INFO L82 PathProgramCache]: Analyzing trace with hash 81780885, now seen corresponding path program 1 times [2019-12-07 15:37:32,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:32,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170700689] [2019-12-07 15:37:32,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:32,813 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-12-07 15:37:32,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170700689] [2019-12-07 15:37:32,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:32,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:37:32,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037588578] [2019-12-07 15:37:32,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:32,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:32,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:32,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:32,815 INFO L87 Difference]: Start difference. First operand 2779 states and 3666 transitions. Second operand 3 states. [2019-12-07 15:37:32,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:32,886 INFO L93 Difference]: Finished difference Result 7808 states and 10356 transitions. [2019-12-07 15:37:32,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:32,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-12-07 15:37:32,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:32,892 INFO L225 Difference]: With dead ends: 7808 [2019-12-07 15:37:32,892 INFO L226 Difference]: Without dead ends: 5036 [2019-12-07 15:37:32,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5036 states. [2019-12-07 15:37:32,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5036 to 5034. [2019-12-07 15:37:32,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5034 states. [2019-12-07 15:37:32,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5034 states to 5034 states and 6686 transitions. [2019-12-07 15:37:32,986 INFO L78 Accepts]: Start accepts. Automaton has 5034 states and 6686 transitions. Word has length 252 [2019-12-07 15:37:32,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:32,987 INFO L462 AbstractCegarLoop]: Abstraction has 5034 states and 6686 transitions. [2019-12-07 15:37:32,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:32,987 INFO L276 IsEmpty]: Start isEmpty. Operand 5034 states and 6686 transitions. [2019-12-07 15:37:32,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-12-07 15:37:32,993 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:32,993 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:32,993 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:32,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:32,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1389751562, now seen corresponding path program 1 times [2019-12-07 15:37:32,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:32,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034024498] [2019-12-07 15:37:32,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:33,043 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-12-07 15:37:33,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034024498] [2019-12-07 15:37:33,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:33,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:37:33,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427809436] [2019-12-07 15:37:33,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:33,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:33,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:33,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:33,045 INFO L87 Difference]: Start difference. First operand 5034 states and 6686 transitions. Second operand 3 states. [2019-12-07 15:37:33,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:33,228 INFO L93 Difference]: Finished difference Result 10161 states and 13481 transitions. [2019-12-07 15:37:33,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:33,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-12-07 15:37:33,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:33,235 INFO L225 Difference]: With dead ends: 10161 [2019-12-07 15:37:33,235 INFO L226 Difference]: Without dead ends: 5134 [2019-12-07 15:37:33,240 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:33,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5134 states. [2019-12-07 15:37:33,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5134 to 5034. [2019-12-07 15:37:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5034 states. [2019-12-07 15:37:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5034 states to 5034 states and 6600 transitions. [2019-12-07 15:37:33,321 INFO L78 Accepts]: Start accepts. Automaton has 5034 states and 6600 transitions. Word has length 255 [2019-12-07 15:37:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:33,322 INFO L462 AbstractCegarLoop]: Abstraction has 5034 states and 6600 transitions. [2019-12-07 15:37:33,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 5034 states and 6600 transitions. [2019-12-07 15:37:33,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-12-07 15:37:33,351 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:33,351 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:33,352 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:33,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:33,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1038896286, now seen corresponding path program 1 times [2019-12-07 15:37:33,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:33,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620892017] [2019-12-07 15:37:33,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:33,422 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-12-07 15:37:33,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620892017] [2019-12-07 15:37:33,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259504948] [2019-12-07 15:37:33,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c75b10c8-6d5d-40bc-9d61-c4a1391f0451/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-12-07 15:37:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:33,495 INFO L264 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 15:37:33,500 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:37:33,542 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2019-12-07 15:37:33,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 15:37:33,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 15:37:33,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378465234] [2019-12-07 15:37:33,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:33,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:33,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:33,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:37:33,543 INFO L87 Difference]: Start difference. First operand 5034 states and 6600 transitions. Second operand 3 states. [2019-12-07 15:37:33,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:33,712 INFO L93 Difference]: Finished difference Result 10081 states and 13209 transitions. [2019-12-07 15:37:33,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:33,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 281 [2019-12-07 15:37:33,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:33,718 INFO L225 Difference]: With dead ends: 10081 [2019-12-07 15:37:33,718 INFO L226 Difference]: Without dead ends: 5054 [2019-12-07 15:37:33,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:37:33,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5054 states. [2019-12-07 15:37:33,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5054 to 5034. [2019-12-07 15:37:33,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5034 states. [2019-12-07 15:37:33,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5034 states to 5034 states and 6590 transitions. [2019-12-07 15:37:33,803 INFO L78 Accepts]: Start accepts. Automaton has 5034 states and 6590 transitions. Word has length 281 [2019-12-07 15:37:33,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:33,804 INFO L462 AbstractCegarLoop]: Abstraction has 5034 states and 6590 transitions. [2019-12-07 15:37:33,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 5034 states and 6590 transitions. [2019-12-07 15:37:33,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-12-07 15:37:33,809 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:33,809 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 15:37:34,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:37:34,010 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:34,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:34,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1898466533, now seen corresponding path program 1 times [2019-12-07 15:37:34,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:34,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223224335] [2019-12-07 15:37:34,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:34,142 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-12-07 15:37:34,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223224335] [2019-12-07 15:37:34,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915126092] [2019-12-07 15:37:34,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c75b10c8-6d5d-40bc-9d61-c4a1391f0451/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-12-07 15:37:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:34,220 INFO L264 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 15:37:34,224 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:37:34,304 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-12-07 15:37:34,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 15:37:34,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 15:37:34,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265169213] [2019-12-07 15:37:34,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:34,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:34,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:34,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:37:34,306 INFO L87 Difference]: Start difference. First operand 5034 states and 6590 transitions. Second operand 3 states. [2019-12-07 15:37:34,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:34,445 INFO L93 Difference]: Finished difference Result 10061 states and 13169 transitions. [2019-12-07 15:37:34,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:34,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2019-12-07 15:37:34,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:34,451 INFO L225 Difference]: With dead ends: 10061 [2019-12-07 15:37:34,451 INFO L226 Difference]: Without dead ends: 5034 [2019-12-07 15:37:34,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:37:34,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5034 states. [2019-12-07 15:37:34,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5034 to 5034. [2019-12-07 15:37:34,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5034 states. [2019-12-07 15:37:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5034 states to 5034 states and 6580 transitions. [2019-12-07 15:37:34,530 INFO L78 Accepts]: Start accepts. Automaton has 5034 states and 6580 transitions. Word has length 282 [2019-12-07 15:37:34,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:34,530 INFO L462 AbstractCegarLoop]: Abstraction has 5034 states and 6580 transitions. [2019-12-07 15:37:34,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:34,531 INFO L276 IsEmpty]: Start isEmpty. Operand 5034 states and 6580 transitions. [2019-12-07 15:37:34,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-12-07 15:37:34,535 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:34,535 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:34,736 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:37:34,736 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:34,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:34,736 INFO L82 PathProgramCache]: Analyzing trace with hash 89999279, now seen corresponding path program 1 times [2019-12-07 15:37:34,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:34,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980656905] [2019-12-07 15:37:34,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-12-07 15:37:34,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980656905] [2019-12-07 15:37:34,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501695977] [2019-12-07 15:37:34,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c75b10c8-6d5d-40bc-9d61-c4a1391f0451/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:37:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:34,932 INFO L264 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 15:37:34,934 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:37:34,970 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-12-07 15:37:34,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:37:34,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 15:37:34,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66598467] [2019-12-07 15:37:34,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:37:34,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:34,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:37:34,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:37:34,972 INFO L87 Difference]: Start difference. First operand 5034 states and 6580 transitions. Second operand 4 states. [2019-12-07 15:37:35,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:35,264 INFO L93 Difference]: Finished difference Result 11805 states and 15365 transitions. [2019-12-07 15:37:35,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:37:35,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 282 [2019-12-07 15:37:35,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:35,271 INFO L225 Difference]: With dead ends: 11805 [2019-12-07 15:37:35,271 INFO L226 Difference]: Without dead ends: 6712 [2019-12-07 15:37:35,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 284 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-12-07 15:37:35,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6712 states. [2019-12-07 15:37:35,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6712 to 4418. [2019-12-07 15:37:35,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4418 states. [2019-12-07 15:37:35,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 4418 states and 5699 transitions. [2019-12-07 15:37:35,353 INFO L78 Accepts]: Start accepts. Automaton has 4418 states and 5699 transitions. Word has length 282 [2019-12-07 15:37:35,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:35,353 INFO L462 AbstractCegarLoop]: Abstraction has 4418 states and 5699 transitions. [2019-12-07 15:37:35,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:37:35,353 INFO L276 IsEmpty]: Start isEmpty. Operand 4418 states and 5699 transitions. [2019-12-07 15:37:35,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-12-07 15:37:35,357 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:35,358 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:35,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:37:35,559 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:35,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:35,559 INFO L82 PathProgramCache]: Analyzing trace with hash -68994562, now seen corresponding path program 1 times [2019-12-07 15:37:35,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:35,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691521568] [2019-12-07 15:37:35,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-12-07 15:37:35,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691521568] [2019-12-07 15:37:35,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:35,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:37:35,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451591352] [2019-12-07 15:37:35,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:35,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:35,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:35,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:35,638 INFO L87 Difference]: Start difference. First operand 4418 states and 5699 transitions. Second operand 3 states. [2019-12-07 15:37:35,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:35,752 INFO L93 Difference]: Finished difference Result 7454 states and 9509 transitions. [2019-12-07 15:37:35,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:35,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-12-07 15:37:35,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:35,755 INFO L225 Difference]: With dead ends: 7454 [2019-12-07 15:37:35,755 INFO L226 Difference]: Without dead ends: 2235 [2019-12-07 15:37:35,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:35,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2235 states. [2019-12-07 15:37:35,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2235 to 2235. [2019-12-07 15:37:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2019-12-07 15:37:35,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 2837 transitions. [2019-12-07 15:37:35,807 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 2837 transitions. Word has length 320 [2019-12-07 15:37:35,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:35,807 INFO L462 AbstractCegarLoop]: Abstraction has 2235 states and 2837 transitions. [2019-12-07 15:37:35,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:35,807 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 2837 transitions. [2019-12-07 15:37:35,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-12-07 15:37:35,810 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:35,810 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:35,810 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:35,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:35,811 INFO L82 PathProgramCache]: Analyzing trace with hash 439442017, now seen corresponding path program 1 times [2019-12-07 15:37:35,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:35,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935684227] [2019-12-07 15:37:35,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:35,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-12-07 15:37:35,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935684227] [2019-12-07 15:37:35,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:35,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:37:35,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041305023] [2019-12-07 15:37:35,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:35,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:35,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:35,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:35,890 INFO L87 Difference]: Start difference. First operand 2235 states and 2837 transitions. Second operand 3 states. [2019-12-07 15:37:36,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:36,008 INFO L93 Difference]: Finished difference Result 4473 states and 5673 transitions. [2019-12-07 15:37:36,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:36,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 359 [2019-12-07 15:37:36,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:36,012 INFO L225 Difference]: With dead ends: 4473 [2019-12-07 15:37:36,012 INFO L226 Difference]: Without dead ends: 2245 [2019-12-07 15:37:36,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:36,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2019-12-07 15:37:36,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2235. [2019-12-07 15:37:36,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2019-12-07 15:37:36,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 2812 transitions. [2019-12-07 15:37:36,047 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 2812 transitions. Word has length 359 [2019-12-07 15:37:36,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:36,047 INFO L462 AbstractCegarLoop]: Abstraction has 2235 states and 2812 transitions. [2019-12-07 15:37:36,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:36,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 2812 transitions. [2019-12-07 15:37:36,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-12-07 15:37:36,050 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:36,050 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:37:36,051 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:36,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:36,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1924130447, now seen corresponding path program 1 times [2019-12-07 15:37:36,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:36,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207659888] [2019-12-07 15:37:36,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:36,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-12-07 15:37:36,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207659888] [2019-12-07 15:37:36,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549525182] [2019-12-07 15:37:36,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c75b10c8-6d5d-40bc-9d61-c4a1391f0451/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:37:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:36,235 INFO L264 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 15:37:36,240 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:37:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-12-07 15:37:36,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 15:37:36,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 15:37:36,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851579642] [2019-12-07 15:37:36,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:36,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:36,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:36,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:37:36,396 INFO L87 Difference]: Start difference. First operand 2235 states and 2812 transitions. Second operand 3 states. [2019-12-07 15:37:36,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:36,431 INFO L93 Difference]: Finished difference Result 2854 states and 3617 transitions. [2019-12-07 15:37:36,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:36,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-12-07 15:37:36,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:36,435 INFO L225 Difference]: With dead ends: 2854 [2019-12-07 15:37:36,435 INFO L226 Difference]: Without dead ends: 2762 [2019-12-07 15:37:36,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:37:36,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2019-12-07 15:37:36,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2145. [2019-12-07 15:37:36,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2145 states. [2019-12-07 15:37:36,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 2711 transitions. [2019-12-07 15:37:36,471 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 2711 transitions. Word has length 392 [2019-12-07 15:37:36,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:36,471 INFO L462 AbstractCegarLoop]: Abstraction has 2145 states and 2711 transitions. [2019-12-07 15:37:36,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:36,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 2711 transitions. [2019-12-07 15:37:36,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-12-07 15:37:36,475 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:36,475 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-07 15:37:36,675 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:37:36,676 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:36,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:36,676 INFO L82 PathProgramCache]: Analyzing trace with hash -820757555, now seen corresponding path program 1 times [2019-12-07 15:37:36,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:36,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938407982] [2019-12-07 15:37:36,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2019-12-07 15:37:36,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938407982] [2019-12-07 15:37:36,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536201123] [2019-12-07 15:37:36,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c75b10c8-6d5d-40bc-9d61-c4a1391f0451/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:37:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:36,976 INFO L264 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 15:37:36,979 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:37:37,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2019-12-07 15:37:37,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:37:37,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 15:37:37,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081974329] [2019-12-07 15:37:37,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:37:37,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:37,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:37:37,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:37:37,115 INFO L87 Difference]: Start difference. First operand 2145 states and 2711 transitions. Second operand 4 states. [2019-12-07 15:37:37,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:37,330 INFO L93 Difference]: Finished difference Result 5211 states and 6595 transitions. [2019-12-07 15:37:37,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:37:37,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 532 [2019-12-07 15:37:37,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:37,334 INFO L225 Difference]: With dead ends: 5211 [2019-12-07 15:37:37,334 INFO L226 Difference]: Without dead ends: 3031 [2019-12-07 15:37:37,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 534 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-12-07 15:37:37,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3031 states. [2019-12-07 15:37:37,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3031 to 2205. [2019-12-07 15:37:37,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2205 states. [2019-12-07 15:37:37,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 2791 transitions. [2019-12-07 15:37:37,378 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 2791 transitions. Word has length 532 [2019-12-07 15:37:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:37,378 INFO L462 AbstractCegarLoop]: Abstraction has 2205 states and 2791 transitions. [2019-12-07 15:37:37,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:37:37,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 2791 transitions. [2019-12-07 15:37:37,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2019-12-07 15:37:37,381 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:37,382 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 11, 11, 8, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-07 15:37:37,582 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:37:37,583 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:37,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:37,583 INFO L82 PathProgramCache]: Analyzing trace with hash -751360217, now seen corresponding path program 1 times [2019-12-07 15:37:37,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:37,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523656374] [2019-12-07 15:37:37,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:37,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 2066 proven. 0 refuted. 0 times theorem prover too weak. 1910 trivial. 0 not checked. [2019-12-07 15:37:37,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523656374] [2019-12-07 15:37:37,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:37,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:37:37,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079189228] [2019-12-07 15:37:37,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:37,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:37,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:37,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:37,762 INFO L87 Difference]: Start difference. First operand 2205 states and 2791 transitions. Second operand 3 states. [2019-12-07 15:37:37,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:37,893 INFO L93 Difference]: Finished difference Result 4583 states and 5811 transitions. [2019-12-07 15:37:37,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:37,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 594 [2019-12-07 15:37:37,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:37,895 INFO L225 Difference]: With dead ends: 4583 [2019-12-07 15:37:37,896 INFO L226 Difference]: Without dead ends: 2385 [2019-12-07 15:37:37,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:37,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2019-12-07 15:37:37,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2375. [2019-12-07 15:37:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2375 states. [2019-12-07 15:37:37,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 2986 transitions. [2019-12-07 15:37:37,946 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 2986 transitions. Word has length 594 [2019-12-07 15:37:37,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:37,946 INFO L462 AbstractCegarLoop]: Abstraction has 2375 states and 2986 transitions. [2019-12-07 15:37:37,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:37,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 2986 transitions. [2019-12-07 15:37:37,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2019-12-07 15:37:37,953 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:37,953 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 10, 8, 8, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-07 15:37:37,954 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:37,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:37,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1835833869, now seen corresponding path program 1 times [2019-12-07 15:37:37,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:37,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925893022] [2019-12-07 15:37:37,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4945 backedges. 2605 proven. 0 refuted. 0 times theorem prover too weak. 2340 trivial. 0 not checked. [2019-12-07 15:37:38,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925893022] [2019-12-07 15:37:38,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:37:38,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:37:38,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909807051] [2019-12-07 15:37:38,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:37:38,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:38,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:37:38,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:38,227 INFO L87 Difference]: Start difference. First operand 2375 states and 2986 transitions. Second operand 3 states. [2019-12-07 15:37:38,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:38,333 INFO L93 Difference]: Finished difference Result 4738 states and 5951 transitions. [2019-12-07 15:37:38,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:37:38,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 656 [2019-12-07 15:37:38,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:38,335 INFO L225 Difference]: With dead ends: 4738 [2019-12-07 15:37:38,335 INFO L226 Difference]: Without dead ends: 2370 [2019-12-07 15:37:38,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:37:38,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2019-12-07 15:37:38,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 2370. [2019-12-07 15:37:38,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2370 states. [2019-12-07 15:37:38,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 2931 transitions. [2019-12-07 15:37:38,369 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 2931 transitions. Word has length 656 [2019-12-07 15:37:38,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:38,369 INFO L462 AbstractCegarLoop]: Abstraction has 2370 states and 2931 transitions. [2019-12-07 15:37:38,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:37:38,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 2931 transitions. [2019-12-07 15:37:38,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2019-12-07 15:37:38,373 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:37:38,374 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 21, 21, 19, 19, 17, 17, 15, 15, 15, 15, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-07 15:37:38,374 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:37:38,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:37:38,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1388787143, now seen corresponding path program 1 times [2019-12-07 15:37:38,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:37:38,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581088159] [2019-12-07 15:37:38,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:37:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2019-12-07 15:37:38,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581088159] [2019-12-07 15:37:38,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219150024] [2019-12-07 15:37:38,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c75b10c8-6d5d-40bc-9d61-c4a1391f0451/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:37:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:37:38,740 INFO L264 TraceCheckSpWp]: Trace formula consists of 1073 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 15:37:38,746 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:37:38,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2019-12-07 15:37:38,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:37:38,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 15:37:38,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923175338] [2019-12-07 15:37:38,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:37:38,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:37:38,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:37:38,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:37:38,966 INFO L87 Difference]: Start difference. First operand 2370 states and 2931 transitions. Second operand 4 states. [2019-12-07 15:37:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:37:39,094 INFO L93 Difference]: Finished difference Result 4080 states and 5087 transitions. [2019-12-07 15:37:39,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:37:39,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 722 [2019-12-07 15:37:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:37:39,095 INFO L225 Difference]: With dead ends: 4080 [2019-12-07 15:37:39,095 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 15:37:39,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 724 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-12-07 15:37:39,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 15:37:39,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 15:37:39,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 15:37:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 15:37:39,097 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 722 [2019-12-07 15:37:39,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:37:39,097 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 15:37:39,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:37:39,097 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 15:37:39,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 15:37:39,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:37:39,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 15:37:40,071 WARN L192 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 436 DAG size of output: 256 [2019-12-07 15:37:40,664 WARN L192 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 436 DAG size of output: 256 [2019-12-07 15:37:40,979 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 33 [2019-12-07 15:37:41,224 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 33 [2019-12-07 15:37:41,470 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 34 [2019-12-07 15:37:42,001 WARN L192 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 49 [2019-12-07 15:37:42,207 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 29 [2019-12-07 15:37:42,719 WARN L192 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 44 [2019-12-07 15:37:47,930 WARN L192 SmtUtils]: Spent 5.21 s on a formula simplification. DAG size of input: 212 DAG size of output: 110 [2019-12-07 15:37:48,166 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 34 [2019-12-07 15:37:48,359 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-12-07 15:37:48,514 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-12-07 15:37:48,706 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 31 [2019-12-07 15:37:48,914 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 27 [2019-12-07 15:37:49,153 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 27 [2019-12-07 15:37:49,391 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 29 [2019-12-07 15:37:49,613 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2019-12-07 15:37:49,836 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 27 [2019-12-07 15:37:50,125 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 24 [2019-12-07 15:37:54,183 WARN L192 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 212 DAG size of output: 110 [2019-12-07 15:37:54,443 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 33 [2019-12-07 15:37:54,656 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 19 [2019-12-07 15:37:54,963 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2019-12-07 15:37:54,966 INFO L246 CegarLoopResult]: For program point L432(lines 432 435) no Hoare annotation was computed. [2019-12-07 15:37:54,966 INFO L246 CegarLoopResult]: For program point L333(lines 333 371) no Hoare annotation was computed. [2019-12-07 15:37:54,966 INFO L242 CegarLoopResult]: At program point L201(lines 197 546) the Hoare annotation is: (let ((.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (and .cse0 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse2 .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse4 .cse0 .cse1 .cse2 .cse3))) [2019-12-07 15:37:54,966 INFO L242 CegarLoopResult]: At program point L102(lines 101 578) the Hoare annotation is: false [2019-12-07 15:37:54,966 INFO L249 CegarLoopResult]: At program point L598(lines 97 599) the Hoare annotation is: true [2019-12-07 15:37:54,966 INFO L246 CegarLoopResult]: For program point L532(lines 532 534) no Hoare annotation was computed. [2019-12-07 15:37:54,966 INFO L242 CegarLoopResult]: At program point L400(lines 391 409) the Hoare annotation is: (let ((.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3) (and .cse0 .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-12-07 15:37:54,967 INFO L246 CegarLoopResult]: For program point L203(lines 203 544) no Hoare annotation was computed. [2019-12-07 15:37:54,967 INFO L246 CegarLoopResult]: For program point L170(lines 170 555) no Hoare annotation was computed. [2019-12-07 15:37:54,967 INFO L246 CegarLoopResult]: For program point L137(lines 137 566) no Hoare annotation was computed. [2019-12-07 15:37:54,967 INFO L246 CegarLoopResult]: For program point L104(lines 104 577) no Hoare annotation was computed. [2019-12-07 15:37:54,967 INFO L246 CegarLoopResult]: For program point L336(lines 336 370) no Hoare annotation was computed. [2019-12-07 15:37:54,967 INFO L246 CegarLoopResult]: For program point L336-1(lines 336 370) no Hoare annotation was computed. [2019-12-07 15:37:54,967 INFO L242 CegarLoopResult]: At program point L204(lines 203 544) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-12-07 15:37:54,967 INFO L242 CegarLoopResult]: At program point L171(lines 167 556) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-12-07 15:37:54,967 INFO L242 CegarLoopResult]: At program point L138(lines 134 567) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-12-07 15:37:54,967 INFO L246 CegarLoopResult]: For program point L469(lines 469 471) no Hoare annotation was computed. [2019-12-07 15:37:54,967 INFO L246 CegarLoopResult]: For program point L403(lines 403 405) no Hoare annotation was computed. [2019-12-07 15:37:54,968 INFO L246 CegarLoopResult]: For program point L337(lines 337 367) no Hoare annotation was computed. [2019-12-07 15:37:54,968 INFO L242 CegarLoopResult]: At program point L206(lines 205 544) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-12-07 15:37:54,968 INFO L246 CegarLoopResult]: For program point L173(lines 173 554) no Hoare annotation was computed. [2019-12-07 15:37:54,968 INFO L246 CegarLoopResult]: For program point L140(lines 140 565) no Hoare annotation was computed. [2019-12-07 15:37:54,968 INFO L246 CegarLoopResult]: For program point L107(lines 107 576) no Hoare annotation was computed. [2019-12-07 15:37:54,968 INFO L246 CegarLoopResult]: For program point L603(lines 603 605) no Hoare annotation was computed. [2019-12-07 15:37:54,968 INFO L246 CegarLoopResult]: For program point L603-2(lines 603 605) no Hoare annotation was computed. [2019-12-07 15:37:54,968 INFO L246 CegarLoopResult]: For program point L504(lines 504 507) no Hoare annotation was computed. [2019-12-07 15:37:54,968 INFO L246 CegarLoopResult]: For program point L273(lines 273 275) no Hoare annotation was computed. [2019-12-07 15:37:54,968 INFO L246 CegarLoopResult]: For program point L273-2(lines 207 541) no Hoare annotation was computed. [2019-12-07 15:37:54,968 INFO L246 CegarLoopResult]: For program point L307(lines 307 314) no Hoare annotation was computed. [2019-12-07 15:37:54,968 INFO L246 CegarLoopResult]: For program point L307-2(lines 307 314) no Hoare annotation was computed. [2019-12-07 15:37:54,968 INFO L246 CegarLoopResult]: For program point L242(lines 242 252) no Hoare annotation was computed. [2019-12-07 15:37:54,968 INFO L246 CegarLoopResult]: For program point L176(lines 176 553) no Hoare annotation was computed. [2019-12-07 15:37:54,968 INFO L246 CegarLoopResult]: For program point L143(lines 143 564) no Hoare annotation was computed. [2019-12-07 15:37:54,968 INFO L246 CegarLoopResult]: For program point L110(lines 110 575) no Hoare annotation was computed. [2019-12-07 15:37:54,969 INFO L246 CegarLoopResult]: For program point L342(lines 342 365) no Hoare annotation was computed. [2019-12-07 15:37:54,969 INFO L246 CegarLoopResult]: For program point L243(lines 243 246) no Hoare annotation was computed. [2019-12-07 15:37:54,969 INFO L242 CegarLoopResult]: At program point L210(lines 104 577) the Hoare annotation is: (let ((.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse6 .cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9))) [2019-12-07 15:37:54,969 INFO L242 CegarLoopResult]: At program point L177(lines 173 554) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-12-07 15:37:54,969 INFO L242 CegarLoopResult]: At program point L144(lines 140 565) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5))) [2019-12-07 15:37:54,969 INFO L249 CegarLoopResult]: At program point L608(lines 10 610) the Hoare annotation is: true [2019-12-07 15:37:54,969 INFO L242 CegarLoopResult]: At program point L542(lines 98 597) the Hoare annotation is: (let ((.cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse29 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (let ((.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse11 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse21 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse20 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse7 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse0 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not .cse29)) (.cse23 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse2 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse16 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse19 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (not .cse10))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse9 .cse10) (and .cse3 .cse11 .cse12) (and .cse13 .cse14) (and .cse3 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse15 .cse11 .cse18 .cse19) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse10) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse20 .cse14 .cse21 .cse22) (and .cse5 .cse6 .cse0 .cse8 .cse1 .cse23 .cse9) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse10) (and .cse15 .cse0 .cse18 .cse19) (and .cse3 .cse0 .cse12) (and .cse5 .cse6 .cse11 .cse1 .cse23 .cse9) (and .cse4 .cse3 .cse1 .cse2) (and .cse4 .cse13) (and .cse5 .cse6 .cse7 .cse11 .cse1 .cse9) (and .cse5 .cse11 .cse24 .cse25 .cse26 .cse20 .cse12 .cse27 .cse9) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544) .cse10) (and .cse4 .cse3 .cse28 .cse19) (and .cse4 .cse1 .cse2 .cse22) (and .cse11 .cse1 .cse2) (and .cse16 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse20 .cse21 .cse10) (and .cse5 .cse24 .cse25 .cse0 .cse26 .cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) .cse12 .cse27 .cse9) (and .cse16 .cse28 .cse14 .cse19 .cse22) (and .cse5 .cse6 .cse7 .cse0 .cse8 .cse1 .cse9) (and .cse3 .cse4 .cse5 .cse6 .cse8 .cse1 .cse23 .cse9 .cse10) (and .cse14 .cse1 .cse2 .cse22) (and .cse4 .cse29 .cse10) (and .cse4 .cse3 .cse12 .cse10) (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse22) (and .cse4 .cse28 .cse19 .cse22)))) [2019-12-07 15:37:54,970 INFO L246 CegarLoopResult]: For program point L443(lines 443 445) no Hoare annotation was computed. [2019-12-07 15:37:54,970 INFO L246 CegarLoopResult]: For program point L311(lines 311 313) no Hoare annotation was computed. [2019-12-07 15:37:54,970 INFO L246 CegarLoopResult]: For program point L179(lines 179 552) no Hoare annotation was computed. [2019-12-07 15:37:54,970 INFO L246 CegarLoopResult]: For program point L146(lines 146 563) no Hoare annotation was computed. [2019-12-07 15:37:54,970 INFO L246 CegarLoopResult]: For program point L113(lines 113 574) no Hoare annotation was computed. [2019-12-07 15:37:54,970 INFO L246 CegarLoopResult]: For program point L345(lines 345 349) no Hoare annotation was computed. [2019-12-07 15:37:54,970 INFO L246 CegarLoopResult]: For program point L345-2(lines 345 349) no Hoare annotation was computed. [2019-12-07 15:37:54,970 INFO L246 CegarLoopResult]: For program point L81(lines 81 87) no Hoare annotation was computed. [2019-12-07 15:37:54,970 INFO L246 CegarLoopResult]: For program point L478(lines 478 480) no Hoare annotation was computed. [2019-12-07 15:37:54,970 INFO L246 CegarLoopResult]: For program point L379(lines 379 411) no Hoare annotation was computed. [2019-12-07 15:37:54,970 INFO L246 CegarLoopResult]: For program point L512(lines 512 514) no Hoare annotation was computed. [2019-12-07 15:37:54,970 INFO L246 CegarLoopResult]: For program point L446(lines 446 455) no Hoare annotation was computed. [2019-12-07 15:37:54,970 INFO L246 CegarLoopResult]: For program point L380(lines 380 386) no Hoare annotation was computed. [2019-12-07 15:37:54,970 INFO L246 CegarLoopResult]: For program point L215(lines 215 217) no Hoare annotation was computed. [2019-12-07 15:37:54,970 INFO L246 CegarLoopResult]: For program point L182(lines 182 551) no Hoare annotation was computed. [2019-12-07 15:37:54,970 INFO L246 CegarLoopResult]: For program point L149(lines 149 562) no Hoare annotation was computed. [2019-12-07 15:37:54,971 INFO L246 CegarLoopResult]: For program point L215-2(lines 215 217) no Hoare annotation was computed. [2019-12-07 15:37:54,971 INFO L246 CegarLoopResult]: For program point L116(lines 116 573) no Hoare annotation was computed. [2019-12-07 15:37:54,971 INFO L246 CegarLoopResult]: For program point L579(lines 579 595) no Hoare annotation was computed. [2019-12-07 15:37:54,971 INFO L242 CegarLoopResult]: At program point L513(lines 71 609) the Hoare annotation is: false [2019-12-07 15:37:54,971 INFO L242 CegarLoopResult]: At program point L183(lines 179 552) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (or (and (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-12-07 15:37:54,971 INFO L242 CegarLoopResult]: At program point L150(lines 146 563) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5))) [2019-12-07 15:37:54,971 INFO L246 CegarLoopResult]: For program point L84(lines 84 86) no Hoare annotation was computed. [2019-12-07 15:37:54,971 INFO L246 CegarLoopResult]: For program point L84-2(lines 81 87) no Hoare annotation was computed. [2019-12-07 15:37:54,971 INFO L246 CegarLoopResult]: For program point L580(lines 580 594) no Hoare annotation was computed. [2019-12-07 15:37:54,971 INFO L246 CegarLoopResult]: For program point L481(lines 481 485) no Hoare annotation was computed. [2019-12-07 15:37:54,971 INFO L246 CegarLoopResult]: For program point L481-2(lines 481 485) no Hoare annotation was computed. [2019-12-07 15:37:54,971 INFO L246 CegarLoopResult]: For program point L581(lines 581 586) no Hoare annotation was computed. [2019-12-07 15:37:54,972 INFO L246 CegarLoopResult]: For program point L515(lines 515 517) no Hoare annotation was computed. [2019-12-07 15:37:54,972 INFO L246 CegarLoopResult]: For program point L581-2(lines 580 594) no Hoare annotation was computed. [2019-12-07 15:37:54,972 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 15:37:54,972 INFO L246 CegarLoopResult]: For program point L185(lines 185 550) no Hoare annotation was computed. [2019-12-07 15:37:54,972 INFO L246 CegarLoopResult]: For program point L152(lines 152 561) no Hoare annotation was computed. [2019-12-07 15:37:54,972 INFO L246 CegarLoopResult]: For program point L119(lines 119 572) no Hoare annotation was computed. [2019-12-07 15:37:54,972 INFO L246 CegarLoopResult]: For program point L450(lines 450 452) no Hoare annotation was computed. [2019-12-07 15:37:54,972 INFO L242 CegarLoopResult]: At program point L120(lines 116 573) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-12-07 15:37:54,972 INFO L246 CegarLoopResult]: For program point L583(lines 583 585) no Hoare annotation was computed. [2019-12-07 15:37:54,972 INFO L246 CegarLoopResult]: For program point L286(lines 286 292) no Hoare annotation was computed. [2019-12-07 15:37:54,972 INFO L246 CegarLoopResult]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-12-07 15:37:54,972 INFO L246 CegarLoopResult]: For program point L353(lines 353 361) no Hoare annotation was computed. [2019-12-07 15:37:54,972 INFO L246 CegarLoopResult]: For program point L188(lines 188 549) no Hoare annotation was computed. [2019-12-07 15:37:54,972 INFO L246 CegarLoopResult]: For program point L155(lines 155 560) no Hoare annotation was computed. [2019-12-07 15:37:54,972 INFO L246 CegarLoopResult]: For program point L122(lines 122 571) no Hoare annotation was computed. [2019-12-07 15:37:54,973 INFO L246 CegarLoopResult]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-12-07 15:37:54,973 INFO L246 CegarLoopResult]: For program point L89-1(lines 71 609) no Hoare annotation was computed. [2019-12-07 15:37:54,973 INFO L246 CegarLoopResult]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-12-07 15:37:54,973 INFO L246 CegarLoopResult]: For program point L519-2(lines 519 523) no Hoare annotation was computed. [2019-12-07 15:37:54,973 INFO L242 CegarLoopResult]: At program point L354(lines 330 372) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5))) [2019-12-07 15:37:54,973 INFO L242 CegarLoopResult]: At program point L189(lines 185 550) the Hoare annotation is: (let ((.cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse1 .cse2) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1) (and (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1))) [2019-12-07 15:37:54,973 INFO L242 CegarLoopResult]: At program point L156(lines 152 561) the Hoare annotation is: (let ((.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3) (and .cse0 .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-12-07 15:37:54,973 INFO L242 CegarLoopResult]: At program point L123(lines 122 571) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse6 .cse7 .cse8 .cse9 .cse10) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-12-07 15:37:54,973 INFO L246 CegarLoopResult]: For program point L90(lines 90 92) no Hoare annotation was computed. [2019-12-07 15:37:54,973 INFO L246 CegarLoopResult]: For program point L421(lines 421 423) no Hoare annotation was computed. [2019-12-07 15:37:54,973 INFO L242 CegarLoopResult]: At program point L388(lines 379 411) the Hoare annotation is: (let ((.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3) (and .cse0 .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-12-07 15:37:54,974 INFO L246 CegarLoopResult]: For program point L289(lines 289 291) no Hoare annotation was computed. [2019-12-07 15:37:54,974 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 15:37:54,974 INFO L246 CegarLoopResult]: For program point L289-2(lines 207 541) no Hoare annotation was computed. [2019-12-07 15:37:54,974 INFO L249 CegarLoopResult]: At program point L620(lines 611 622) the Hoare annotation is: true [2019-12-07 15:37:54,974 INFO L246 CegarLoopResult]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-12-07 15:37:54,974 INFO L246 CegarLoopResult]: For program point L191(lines 191 548) no Hoare annotation was computed. [2019-12-07 15:37:54,974 INFO L246 CegarLoopResult]: For program point L158(lines 158 559) no Hoare annotation was computed. [2019-12-07 15:37:54,974 INFO L246 CegarLoopResult]: For program point L125(lines 125 570) no Hoare annotation was computed. [2019-12-07 15:37:54,974 INFO L246 CegarLoopResult]: For program point L588(lines 588 592) no Hoare annotation was computed. [2019-12-07 15:37:54,974 INFO L246 CegarLoopResult]: For program point L324(lines 324 328) no Hoare annotation was computed. [2019-12-07 15:37:54,974 INFO L246 CegarLoopResult]: For program point L258(lines 258 260) no Hoare annotation was computed. [2019-12-07 15:37:54,974 INFO L246 CegarLoopResult]: For program point L324-2(lines 207 541) no Hoare annotation was computed. [2019-12-07 15:37:54,974 INFO L246 CegarLoopResult]: For program point L225(lines 225 236) no Hoare annotation was computed. [2019-12-07 15:37:54,974 INFO L246 CegarLoopResult]: For program point L225-2(lines 207 541) no Hoare annotation was computed. [2019-12-07 15:37:54,974 INFO L246 CegarLoopResult]: For program point L391(lines 391 409) no Hoare annotation was computed. [2019-12-07 15:37:54,974 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 15:37:54,975 INFO L246 CegarLoopResult]: For program point L491(lines 491 494) no Hoare annotation was computed. [2019-12-07 15:37:54,975 INFO L246 CegarLoopResult]: For program point L392(lines 392 398) no Hoare annotation was computed. [2019-12-07 15:37:54,975 INFO L246 CegarLoopResult]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-12-07 15:37:54,975 INFO L246 CegarLoopResult]: For program point L194(lines 194 547) no Hoare annotation was computed. [2019-12-07 15:37:54,975 INFO L246 CegarLoopResult]: For program point L161(lines 161 558) no Hoare annotation was computed. [2019-12-07 15:37:54,975 INFO L246 CegarLoopResult]: For program point L128(lines 128 569) no Hoare annotation was computed. [2019-12-07 15:37:54,975 INFO L242 CegarLoopResult]: At program point L195(lines 191 548) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3) (and .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2 .cse3) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse3 .cse4))) [2019-12-07 15:37:54,975 INFO L242 CegarLoopResult]: At program point L162(lines 158 559) the Hoare annotation is: (let ((.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3))) [2019-12-07 15:37:54,975 INFO L246 CegarLoopResult]: For program point L460(lines 460 462) no Hoare annotation was computed. [2019-12-07 15:37:54,975 INFO L246 CegarLoopResult]: For program point L296(lines 296 300) no Hoare annotation was computed. [2019-12-07 15:37:54,975 INFO L246 CegarLoopResult]: For program point L296-2(lines 296 300) no Hoare annotation was computed. [2019-12-07 15:37:54,975 INFO L246 CegarLoopResult]: For program point L197(lines 197 546) no Hoare annotation was computed. [2019-12-07 15:37:54,975 INFO L246 CegarLoopResult]: For program point L164(lines 164 557) no Hoare annotation was computed. [2019-12-07 15:37:54,976 INFO L246 CegarLoopResult]: For program point L131(lines 131 568) no Hoare annotation was computed. [2019-12-07 15:37:54,976 INFO L242 CegarLoopResult]: At program point L98-2(lines 98 597) the Hoare annotation is: (let ((.cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse29 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (let ((.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse11 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse21 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse20 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse7 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse0 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not .cse29)) (.cse23 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse2 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse16 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse19 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (not .cse10))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse9 .cse10) (and .cse3 .cse11 .cse12) (and .cse13 .cse14) (and .cse3 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse15 .cse11 .cse18 .cse19) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse10) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse20 .cse14 .cse21 .cse22) (and .cse5 .cse6 .cse0 .cse8 .cse1 .cse23 .cse9) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse10) (and .cse15 .cse0 .cse18 .cse19) (and .cse3 .cse0 .cse12) (and .cse5 .cse6 .cse11 .cse1 .cse23 .cse9) (and .cse4 .cse3 .cse1 .cse2) (and .cse4 .cse13) (and .cse5 .cse6 .cse7 .cse11 .cse1 .cse9) (and .cse5 .cse11 .cse24 .cse25 .cse26 .cse20 .cse12 .cse27 .cse9) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544) .cse10) (and .cse4 .cse3 .cse28 .cse19) (and .cse4 .cse1 .cse2 .cse22) (and .cse11 .cse1 .cse2) (and .cse16 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse20 .cse21 .cse10) (and .cse5 .cse24 .cse25 .cse0 .cse26 .cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) .cse12 .cse27 .cse9) (and .cse16 .cse28 .cse14 .cse19 .cse22) (and .cse5 .cse6 .cse7 .cse0 .cse8 .cse1 .cse9) (and .cse3 .cse4 .cse5 .cse6 .cse8 .cse1 .cse23 .cse9 .cse10) (and .cse14 .cse1 .cse2 .cse22) (and .cse4 .cse29 .cse10) (and .cse4 .cse3 .cse12 .cse10) (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse22) (and .cse4 .cse28 .cse19 .cse22)))) [2019-12-07 15:37:54,976 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 607) no Hoare annotation was computed. [2019-12-07 15:37:54,976 INFO L246 CegarLoopResult]: For program point L429-1(lines 429 437) no Hoare annotation was computed. [2019-12-07 15:37:54,976 INFO L246 CegarLoopResult]: For program point L231(lines 231 234) no Hoare annotation was computed. [2019-12-07 15:37:54,976 INFO L242 CegarLoopResult]: At program point L165(lines 164 557) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3) (and .cse0 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2 .cse3) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse2 (not .cse3)))) [2019-12-07 15:37:54,976 INFO L242 CegarLoopResult]: At program point L132(lines 125 570) the Hoare annotation is: (let ((.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2) (and .cse3 .cse4 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2))) [2019-12-07 15:37:54,976 INFO L246 CegarLoopResult]: For program point L99(line 99) no Hoare annotation was computed. [2019-12-07 15:37:54,977 INFO L246 CegarLoopResult]: For program point L529(lines 529 535) no Hoare annotation was computed. [2019-12-07 15:37:54,977 INFO L246 CegarLoopResult]: For program point L496(lines 496 498) no Hoare annotation was computed. [2019-12-07 15:37:54,977 INFO L246 CegarLoopResult]: For program point L529-1(lines 529 535) no Hoare annotation was computed. [2019-12-07 15:37:54,977 INFO L246 CegarLoopResult]: For program point L496-2(lines 207 541) no Hoare annotation was computed. [2019-12-07 15:37:54,977 INFO L246 CegarLoopResult]: For program point L200(lines 200 545) no Hoare annotation was computed. [2019-12-07 15:37:54,977 INFO L246 CegarLoopResult]: For program point L167(lines 167 556) no Hoare annotation was computed. [2019-12-07 15:37:54,977 INFO L246 CegarLoopResult]: For program point L134(lines 134 567) no Hoare annotation was computed. [2019-12-07 15:37:54,977 INFO L246 CegarLoopResult]: For program point L101(lines 101 578) no Hoare annotation was computed. [2019-12-07 15:37:55,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:37:55 BoogieIcfgContainer [2019-12-07 15:37:55,010 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:37:55,010 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:37:55,010 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:37:55,010 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:37:55,011 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:37:26" (3/4) ... [2019-12-07 15:37:55,013 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 15:37:55,025 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 15:37:55,026 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 15:37:55,103 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c75b10c8-6d5d-40bc-9d61-c4a1391f0451/bin/uautomizer/witness.graphml [2019-12-07 15:37:55,104 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:37:55,104 INFO L168 Benchmark]: Toolchain (without parser) took 28923.97 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 942.0 MB in the beginning and 1.4 GB in the end (delta: -422.1 MB). Peak memory consumption was 762.8 MB. Max. memory is 11.5 GB. [2019-12-07 15:37:55,104 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:37:55,105 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -150.4 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2019-12-07 15:37:55,105 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:37:55,105 INFO L168 Benchmark]: Boogie Preprocessor took 25.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-12-07 15:37:55,105 INFO L168 Benchmark]: RCFGBuilder took 444.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.9 MB). Peak memory consumption was 66.9 MB. Max. memory is 11.5 GB. [2019-12-07 15:37:55,106 INFO L168 Benchmark]: TraceAbstraction took 28064.98 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -355.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 15:37:55,106 INFO L168 Benchmark]: Witness Printer took 93.39 ms. Allocated memory is still 2.2 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-12-07 15:37:55,107 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 255.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -150.4 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 444.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.9 MB). Peak memory consumption was 66.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28064.98 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -355.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 93.39 ms. Allocated memory is still 2.2 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 607]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8545)) && 0 == s__hit) || ((((((!(s__state == 8561) && 8512 <= s__state) && !(s__state == 8544)) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8545))) || ((((((!(s__state == 8561) && 8512 <= s__state) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8545)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 330]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8545)) && 0 == s__hit) || ((((((!(s__state == 8561) && 8512 <= s__state) && !(s__state == 8544)) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8545))) || ((((((!(s__state == 8561) && 8512 <= s__state) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8545)) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: (((((((!(s__state == 8561) && 8512 <= s__state) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8545)) || ((((((!(s__state == 8561) && 8512 <= s__state) && !(s__state == 8544)) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8545))) || ((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8545)) && 0 == s__hit) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) || (((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || ((((((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8656) && 0 == blastFlag) && !(s__state == 8657)) && 8656 <= s__state) && !(s__state == 12292)) || (((((blastFlag <= 3 && !(s__state == 8656)) && !(s__state == 8657)) && 8656 <= s__state) && !(s__state == 12292)) && !(0 == s__hit))) || ((((1 == blastFlag && !(s__state == 8656)) && !(s__state == 8657)) && 8656 <= s__state) && !(s__state == 12292))) || (((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && !(s__state == 8656)) && !(s__state == 8657)) && 8656 <= s__state) && !(s__state == 12292)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit) || ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((0 == blastFlag && s__state <= 8640) && 8640 <= s__state) || ((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && !(s__state == 8561)) && 8512 <= s__state) && s__state == 8592) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8545)) && 0 == s__hit)) || ((s__s3__tmp__next_state___0 <= 8576 && 1 == blastFlag) && s__state <= 8576)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || (((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && blastFlag <= 3) && !(s__state == 8656)) && !(s__state == 8657)) && 8656 <= s__state)) || (((s__state <= 8672 && 1 == blastFlag) && !(s__state == 8657)) && 8656 <= s__state)) || ((blastFlag <= 2 && s__state == 8512) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit))) || ((((((!(s__state == 8561) && 8512 <= s__state) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8545))) || ((blastFlag <= 2 && s__state == 8528) && 0 == s__hit)) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8657)) && 8656 <= s__state)) || ((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && s__state <= 8576)) || (((((!(s__state == 8561) && 8512 <= s__state) && 1 == blastFlag) && s__state <= 8640) && s__state == 8608) && !(s__state == 8545))) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8640) && 8640 <= s__state)) || (blastFlag <= 2 && s__state <= 3)) || (((((!(s__state == 8561) && 8512 <= s__state) && s__state == 8592) && 1 == blastFlag) && s__state <= 8640) && !(s__state == 8545))) || ((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || ((blastFlag <= 2 && s__state == 8544) && 0 == s__hit)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8656) && 8656 <= s__state)) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || ((1 == blastFlag && s__state <= 8640) && 8640 <= s__state)) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || ((((blastFlag <= 3 && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8640) && 8656 <= s__state) && !(0 == s__hit))) || ((((((!(s__state == 8561) && 8512 <= s__state) && s__state == 8592) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8545))) || ((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8560)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8545)) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || ((blastFlag <= 2 && s__state == 8560) && 0 == s__hit)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && 0 == s__hit)) || (((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8656)) && !(s__state == 8657)) && 8656 <= s__state) && !(0 == s__hit))) || (((blastFlag <= 2 && s__state <= 8656) && 8656 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: (((((((!(s__state == 8561) && 8512 <= s__state) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8545)) || ((((((!(s__state == 8561) && 8512 <= s__state) && !(s__state == 8544)) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8545))) || ((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8545)) && 0 == s__hit) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((8512 <= s__state && !(s__state == 8544)) && 1 == blastFlag) && s__state <= 8576) && !(s__state == 8545)) || (((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8576) && !(s__state == 8545)) && 0 == s__hit)) || ((((8512 <= s__state && !(s__state == 8544)) && 0 == blastFlag) && s__state <= 8576) && !(s__state == 8545)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545)) || ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545))) || (((((((((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545)) && 0 == s__hit) - InvariantResult [Line: 391]: Loop Invariant Derived loop invariant: (((((8512 <= s__state && !(s__state == 8561)) && 1 == blastFlag) && !(s__state == 8560)) && s__state <= 8576) || ((((8512 <= s__state && !(s__state == 8561)) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8576)) || (((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8561)) && !(s__state == 8560)) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8672)) && 8656 <= s__state) && !(0 == s__hit)) || (((s__state <= 8672 && 1 == blastFlag) && !(s__state == 8672)) && 8656 <= s__state)) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8672)) && 8656 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && s__state <= 8672) && !(s__state == 8672)) && 8656 <= s__state)) || (((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8672)) && s__s3__tmp__next_state___0 <= 8640) && 8656 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: (((((8512 <= s__state && !(s__state == 8561)) && 1 == blastFlag) && !(s__state == 8560)) && s__state <= 8576) || ((((8512 <= s__state && !(s__state == 8561)) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8576)) || (((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8561)) && !(s__state == 8560)) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((((s__s3__tmp__next_state___0 <= 8576 && 1 == blastFlag) && 8448 <= s__state) && s__state <= 8448) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && 8448 <= s__state) && s__state <= 8448)) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit)) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) || (((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((8512 <= s__state && !(s__state == 8561)) && 1 == blastFlag) && !(s__state == 8560)) && s__state <= 8576) || ((((8512 <= s__state && !(s__state == 8561)) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8576)) || (((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8561)) && !(s__state == 8560)) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((((0 == blastFlag && s__state <= 8640) && 8640 <= s__state) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8640) && 8640 <= s__state)) || ((1 == blastFlag && s__state <= 8640) && 8640 <= s__state) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((0 == blastFlag && s__state <= 8640) && 8640 <= s__state) || ((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && !(s__state == 8561)) && 8512 <= s__state) && s__state == 8592) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8545)) && 0 == s__hit)) || ((s__s3__tmp__next_state___0 <= 8576 && 1 == blastFlag) && s__state <= 8576)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || (((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && blastFlag <= 3) && !(s__state == 8656)) && !(s__state == 8657)) && 8656 <= s__state)) || (((s__state <= 8672 && 1 == blastFlag) && !(s__state == 8657)) && 8656 <= s__state)) || ((blastFlag <= 2 && s__state == 8512) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit))) || ((((((!(s__state == 8561) && 8512 <= s__state) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8545))) || ((blastFlag <= 2 && s__state == 8528) && 0 == s__hit)) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8657)) && 8656 <= s__state)) || ((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && s__state <= 8576)) || (((((!(s__state == 8561) && 8512 <= s__state) && 1 == blastFlag) && s__state <= 8640) && s__state == 8608) && !(s__state == 8545))) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8640) && 8640 <= s__state)) || (blastFlag <= 2 && s__state <= 3)) || (((((!(s__state == 8561) && 8512 <= s__state) && s__state == 8592) && 1 == blastFlag) && s__state <= 8640) && !(s__state == 8545))) || ((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || ((blastFlag <= 2 && s__state == 8544) && 0 == s__hit)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8656) && 8656 <= s__state)) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || ((1 == blastFlag && s__state <= 8640) && 8640 <= s__state)) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || ((((blastFlag <= 3 && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8640) && 8656 <= s__state) && !(0 == s__hit))) || ((((((!(s__state == 8561) && 8512 <= s__state) && s__state == 8592) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8545))) || ((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8560)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8545)) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || ((blastFlag <= 2 && s__state == 8560) && 0 == s__hit)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && 0 == s__hit)) || (((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8656)) && !(s__state == 8657)) && 8656 <= s__state) && !(0 == s__hit))) || (((blastFlag <= 2 && s__state <= 8656) && 8656 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8545)) && 0 == s__hit) || ((((((!(s__state == 8561) && 8512 <= s__state) && !(s__state == 8544)) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8545))) || ((((((!(s__state == 8561) && 8512 <= s__state) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8545)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((1 == blastFlag && s__state == 8608) || (0 == blastFlag && s__state == 8608)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && s__state == 8608) && 0 == s__hit) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. Result: SAFE, OverallTime: 12.3s, OverallIterations: 39, TraceHistogramMax: 24, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.6s, HoareTripleCheckerStatistics: 7340 SDtfs, 4454 SDslu, 3443 SDs, 0 SdLazy, 3925 SolverSat, 1034 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3099 GetRequests, 3043 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5034occurred in iteration=28, 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, 39 MinimizatonAttempts, 6479 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 260 NumberOfFragments, 2673 HoareAnnotationTreeSize, 28 FomulaSimplifications, 260465 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 28 FomulaSimplificationsInter, 105781 FormulaSimplificationTreeSizeReductionInter, 14.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 11530 NumberOfCodeBlocks, 11530 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 11483 ConstructedInterpolants, 0 QuantifiedInterpolants, 5269159 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4812 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 47 InterpolantComputations, 35 PerfectInterpolantSequences, 44574/44754 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...