./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bd560b4a-8cd9-42f7-8893-7b44261bad2a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bd560b4a-8cd9-42f7-8893-7b44261bad2a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bd560b4a-8cd9-42f7-8893-7b44261bad2a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bd560b4a-8cd9-42f7-8893-7b44261bad2a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_bd560b4a-8cd9-42f7-8893-7b44261bad2a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bd560b4a-8cd9-42f7-8893-7b44261bad2a/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 96aededabe895f84f71d6d614ed1af512bf7353b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:45:22,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:45:22,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:45:22,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:45:22,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:45:22,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:45:22,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:45:22,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:45:22,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:45:22,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:45:22,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:45:22,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:45:22,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:45:22,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:45:22,965 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:45:22,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:45:22,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:45:22,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:45:22,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:45:22,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:45:22,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:45:22,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:45:22,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:45:22,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:45:22,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:45:22,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:45:22,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:45:22,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:45:22,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:45:22,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:45:22,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:45:22,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:45:22,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:45:22,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:45:22,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:45:22,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:45:22,983 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:45:22,983 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:45:22,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:45:22,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:45:22,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:45:22,986 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bd560b4a-8cd9-42f7-8893-7b44261bad2a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:45:22,998 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:45:22,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:45:22,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:45:23,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:45:23,000 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:45:23,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:45:23,000 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:45:23,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:45:23,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:45:23,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:45:23,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:45:23,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:45:23,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:45:23,002 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:45:23,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:45:23,002 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:45:23,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:45:23,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:45:23,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:45:23,003 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:45:23,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:45:23,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:45:23,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:45:23,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:45:23,004 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:45:23,004 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:45:23,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:45:23,005 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:45:23,005 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_bd560b4a-8cd9-42f7-8893-7b44261bad2a/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 -> 96aededabe895f84f71d6d614ed1af512bf7353b [2019-11-25 08:45:23,140 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:45:23,149 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:45:23,156 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:45:23,157 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:45:23,157 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:45:23,159 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bd560b4a-8cd9-42f7-8893-7b44261bad2a/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-11-25 08:45:23,206 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bd560b4a-8cd9-42f7-8893-7b44261bad2a/bin/uautomizer/data/aff743c0c/fa6fb86c49034871972b8e2a700f7c7b/FLAG765cf232a [2019-11-25 08:45:23,667 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:45:23,669 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bd560b4a-8cd9-42f7-8893-7b44261bad2a/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-11-25 08:45:23,684 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bd560b4a-8cd9-42f7-8893-7b44261bad2a/bin/uautomizer/data/aff743c0c/fa6fb86c49034871972b8e2a700f7c7b/FLAG765cf232a [2019-11-25 08:45:23,994 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bd560b4a-8cd9-42f7-8893-7b44261bad2a/bin/uautomizer/data/aff743c0c/fa6fb86c49034871972b8e2a700f7c7b [2019-11-25 08:45:23,996 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:45:23,997 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:45:23,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:45:23,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:45:24,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:45:24,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:45:23" (1/1) ... [2019-11-25 08:45:24,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7118f9c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24, skipping insertion in model container [2019-11-25 08:45:24,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:45:23" (1/1) ... [2019-11-25 08:45:24,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:45:24,070 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:45:24,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:45:24,370 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:45:24,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:45:24,447 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:45:24,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24 WrapperNode [2019-11-25 08:45:24,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:45:24,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:45:24,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:45:24,448 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:45:24,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,468 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,506 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:45:24,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:45:24,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:45:24,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:45:24,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:45:24,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:45:24,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:45:24,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:45:24,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd560b4a-8cd9-42f7-8893-7b44261bad2a/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-11-25 08:45:24,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:45:24,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:45:24,727 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:45:25,275 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-25 08:45:25,276 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-25 08:45:25,276 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:45:25,277 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:45:25,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:25 BoogieIcfgContainer [2019-11-25 08:45:25,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:45:25,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:45:25,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:45:25,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:45:25,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:45:23" (1/3) ... [2019-11-25 08:45:25,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d902228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:45:25, skipping insertion in model container [2019-11-25 08:45:25,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (2/3) ... [2019-11-25 08:45:25,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d902228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:45:25, skipping insertion in model container [2019-11-25 08:45:25,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:25" (3/3) ... [2019-11-25 08:45:25,285 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a_alt.BV.c.cil.c [2019-11-25 08:45:25,294 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:45:25,300 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:45:25,310 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:45:25,333 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:45:25,333 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:45:25,333 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:45:25,333 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:45:25,334 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:45:25,334 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:45:25,334 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:45:25,334 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:45:25,351 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-11-25 08:45:25,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-25 08:45:25,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:25,363 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:25,363 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:25,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:25,369 INFO L82 PathProgramCache]: Analyzing trace with hash -91608764, now seen corresponding path program 1 times [2019-11-25 08:45:25,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:25,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990565657] [2019-11-25 08:45:25,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:25,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990565657] [2019-11-25 08:45:25,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:25,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:25,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717485162] [2019-11-25 08:45:25,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:25,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:25,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:25,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:25,605 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-11-25 08:45:25,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:25,903 INFO L93 Difference]: Finished difference Result 322 states and 558 transitions. [2019-11-25 08:45:25,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:25,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-25 08:45:25,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:25,925 INFO L225 Difference]: With dead ends: 322 [2019-11-25 08:45:25,926 INFO L226 Difference]: Without dead ends: 170 [2019-11-25 08:45:25,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:25,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-25 08:45:25,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2019-11-25 08:45:26,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-25 08:45:26,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 270 transitions. [2019-11-25 08:45:26,003 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 270 transitions. Word has length 43 [2019-11-25 08:45:26,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:26,004 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 270 transitions. [2019-11-25 08:45:26,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:26,004 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 270 transitions. [2019-11-25 08:45:26,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-25 08:45:26,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:26,019 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:26,019 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:26,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:26,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1448030283, now seen corresponding path program 1 times [2019-11-25 08:45:26,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:26,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616114981] [2019-11-25 08:45:26,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:26,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:26,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616114981] [2019-11-25 08:45:26,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:26,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:26,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796689557] [2019-11-25 08:45:26,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:26,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:26,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:26,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:26,144 INFO L87 Difference]: Start difference. First operand 165 states and 270 transitions. Second operand 3 states. [2019-11-25 08:45:26,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:26,387 INFO L93 Difference]: Finished difference Result 371 states and 615 transitions. [2019-11-25 08:45:26,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:26,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-25 08:45:26,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:26,390 INFO L225 Difference]: With dead ends: 371 [2019-11-25 08:45:26,390 INFO L226 Difference]: Without dead ends: 211 [2019-11-25 08:45:26,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:26,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-25 08:45:26,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-11-25 08:45:26,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-25 08:45:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 347 transitions. [2019-11-25 08:45:26,407 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 347 transitions. Word has length 44 [2019-11-25 08:45:26,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:26,408 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 347 transitions. [2019-11-25 08:45:26,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:26,408 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 347 transitions. [2019-11-25 08:45:26,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:45:26,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:26,411 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:26,411 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:26,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:26,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1359791455, now seen corresponding path program 1 times [2019-11-25 08:45:26,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:26,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861487235] [2019-11-25 08:45:26,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:26,469 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:26,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861487235] [2019-11-25 08:45:26,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:26,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:26,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655187496] [2019-11-25 08:45:26,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:26,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:26,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:26,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:26,472 INFO L87 Difference]: Start difference. First operand 206 states and 347 transitions. Second operand 3 states. [2019-11-25 08:45:26,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:26,682 INFO L93 Difference]: Finished difference Result 436 states and 741 transitions. [2019-11-25 08:45:26,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:26,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-25 08:45:26,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:26,685 INFO L225 Difference]: With dead ends: 436 [2019-11-25 08:45:26,685 INFO L226 Difference]: Without dead ends: 237 [2019-11-25 08:45:26,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:26,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-25 08:45:26,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-11-25 08:45:26,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-25 08:45:26,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 403 transitions. [2019-11-25 08:45:26,703 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 403 transitions. Word has length 71 [2019-11-25 08:45:26,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:26,703 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 403 transitions. [2019-11-25 08:45:26,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 403 transitions. [2019-11-25 08:45:26,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-25 08:45:26,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:26,707 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:26,707 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:26,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:26,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1343129333, now seen corresponding path program 1 times [2019-11-25 08:45:26,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:26,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645017981] [2019-11-25 08:45:26,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-25 08:45:26,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645017981] [2019-11-25 08:45:26,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:26,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:26,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814372971] [2019-11-25 08:45:26,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:26,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:26,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:26,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:26,760 INFO L87 Difference]: Start difference. First operand 237 states and 403 transitions. Second operand 3 states. [2019-11-25 08:45:26,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:26,893 INFO L93 Difference]: Finished difference Result 484 states and 823 transitions. [2019-11-25 08:45:26,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:26,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-25 08:45:26,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:26,896 INFO L225 Difference]: With dead ends: 484 [2019-11-25 08:45:26,896 INFO L226 Difference]: Without dead ends: 254 [2019-11-25 08:45:26,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:26,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-25 08:45:26,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2019-11-25 08:45:26,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-25 08:45:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 426 transitions. [2019-11-25 08:45:26,915 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 426 transitions. Word has length 83 [2019-11-25 08:45:26,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:26,915 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 426 transitions. [2019-11-25 08:45:26,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:26,916 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 426 transitions. [2019-11-25 08:45:26,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-25 08:45:26,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:26,922 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:26,922 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:26,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:26,923 INFO L82 PathProgramCache]: Analyzing trace with hash -2058793378, now seen corresponding path program 1 times [2019-11-25 08:45:26,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:26,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765778564] [2019-11-25 08:45:26,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:27,043 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:27,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765778564] [2019-11-25 08:45:27,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:27,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:27,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859381377] [2019-11-25 08:45:27,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:27,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:27,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:27,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:27,046 INFO L87 Difference]: Start difference. First operand 252 states and 426 transitions. Second operand 3 states. [2019-11-25 08:45:27,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:27,225 INFO L93 Difference]: Finished difference Result 543 states and 922 transitions. [2019-11-25 08:45:27,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:27,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-25 08:45:27,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:27,227 INFO L225 Difference]: With dead ends: 543 [2019-11-25 08:45:27,228 INFO L226 Difference]: Without dead ends: 298 [2019-11-25 08:45:27,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:27,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-25 08:45:27,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2019-11-25 08:45:27,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-25 08:45:27,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 500 transitions. [2019-11-25 08:45:27,248 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 500 transitions. Word has length 83 [2019-11-25 08:45:27,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:27,248 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 500 transitions. [2019-11-25 08:45:27,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:27,249 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 500 transitions. [2019-11-25 08:45:27,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 08:45:27,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:27,250 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:27,251 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:27,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:27,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1582529535, now seen corresponding path program 1 times [2019-11-25 08:45:27,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:27,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794960804] [2019-11-25 08:45:27,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:27,324 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-25 08:45:27,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794960804] [2019-11-25 08:45:27,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:27,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:27,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576591867] [2019-11-25 08:45:27,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:27,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:27,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:27,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:27,327 INFO L87 Difference]: Start difference. First operand 294 states and 500 transitions. Second operand 3 states. [2019-11-25 08:45:27,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:27,451 INFO L93 Difference]: Finished difference Result 583 states and 991 transitions. [2019-11-25 08:45:27,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:27,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-25 08:45:27,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:27,454 INFO L225 Difference]: With dead ends: 583 [2019-11-25 08:45:27,454 INFO L226 Difference]: Without dead ends: 296 [2019-11-25 08:45:27,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:27,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-25 08:45:27,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-11-25 08:45:27,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-25 08:45:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 496 transitions. [2019-11-25 08:45:27,466 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 496 transitions. Word has length 84 [2019-11-25 08:45:27,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:27,466 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 496 transitions. [2019-11-25 08:45:27,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:27,467 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 496 transitions. [2019-11-25 08:45:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 08:45:27,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:27,468 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:27,468 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:27,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:27,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1574610693, now seen corresponding path program 1 times [2019-11-25 08:45:27,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:27,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439111923] [2019-11-25 08:45:27,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:27,514 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:27,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439111923] [2019-11-25 08:45:27,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:27,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:27,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598891248] [2019-11-25 08:45:27,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:27,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:27,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:27,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:27,522 INFO L87 Difference]: Start difference. First operand 294 states and 496 transitions. Second operand 3 states. [2019-11-25 08:45:27,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:27,720 INFO L93 Difference]: Finished difference Result 585 states and 986 transitions. [2019-11-25 08:45:27,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:27,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-25 08:45:27,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:27,723 INFO L225 Difference]: With dead ends: 585 [2019-11-25 08:45:27,723 INFO L226 Difference]: Without dead ends: 296 [2019-11-25 08:45:27,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:27,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-25 08:45:27,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-11-25 08:45:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-25 08:45:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 491 transitions. [2019-11-25 08:45:27,738 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 491 transitions. Word has length 84 [2019-11-25 08:45:27,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:27,740 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 491 transitions. [2019-11-25 08:45:27,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:27,740 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 491 transitions. [2019-11-25 08:45:27,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-25 08:45:27,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:27,742 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] [2019-11-25 08:45:27,743 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:27,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:27,743 INFO L82 PathProgramCache]: Analyzing trace with hash -544543676, now seen corresponding path program 1 times [2019-11-25 08:45:27,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:27,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124124572] [2019-11-25 08:45:27,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-25 08:45:27,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124124572] [2019-11-25 08:45:27,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:27,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:27,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374274587] [2019-11-25 08:45:27,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:27,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:27,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:27,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:27,811 INFO L87 Difference]: Start difference. First operand 292 states and 491 transitions. Second operand 3 states. [2019-11-25 08:45:27,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:27,925 INFO L93 Difference]: Finished difference Result 585 states and 982 transitions. [2019-11-25 08:45:27,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:27,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-25 08:45:27,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:27,928 INFO L225 Difference]: With dead ends: 585 [2019-11-25 08:45:27,928 INFO L226 Difference]: Without dead ends: 300 [2019-11-25 08:45:27,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:27,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-25 08:45:27,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2019-11-25 08:45:27,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-25 08:45:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 496 transitions. [2019-11-25 08:45:27,940 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 496 transitions. Word has length 95 [2019-11-25 08:45:27,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:27,940 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 496 transitions. [2019-11-25 08:45:27,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 496 transitions. [2019-11-25 08:45:27,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-25 08:45:27,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:27,942 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:27,942 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:27,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:27,943 INFO L82 PathProgramCache]: Analyzing trace with hash -394257992, now seen corresponding path program 1 times [2019-11-25 08:45:27,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:27,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65182961] [2019-11-25 08:45:27,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:27,990 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-25 08:45:27,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65182961] [2019-11-25 08:45:27,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:27,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:27,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937635768] [2019-11-25 08:45:27,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:27,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:27,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:27,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:27,997 INFO L87 Difference]: Start difference. First operand 300 states and 496 transitions. Second operand 3 states. [2019-11-25 08:45:28,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:28,153 INFO L93 Difference]: Finished difference Result 624 states and 1034 transitions. [2019-11-25 08:45:28,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:28,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-25 08:45:28,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:28,156 INFO L225 Difference]: With dead ends: 624 [2019-11-25 08:45:28,156 INFO L226 Difference]: Without dead ends: 331 [2019-11-25 08:45:28,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:28,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-11-25 08:45:28,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2019-11-25 08:45:28,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-11-25 08:45:28,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 543 transitions. [2019-11-25 08:45:28,170 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 543 transitions. Word has length 97 [2019-11-25 08:45:28,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:28,170 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 543 transitions. [2019-11-25 08:45:28,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:28,170 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 543 transitions. [2019-11-25 08:45:28,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:45:28,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:28,172 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] [2019-11-25 08:45:28,172 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:28,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,173 INFO L82 PathProgramCache]: Analyzing trace with hash -580298112, now seen corresponding path program 1 times [2019-11-25 08:45:28,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097770692] [2019-11-25 08:45:28,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-25 08:45:28,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097770692] [2019-11-25 08:45:28,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:28,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:28,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678576779] [2019-11-25 08:45:28,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:28,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:28,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:28,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:28,215 INFO L87 Difference]: Start difference. First operand 329 states and 543 transitions. Second operand 3 states. [2019-11-25 08:45:28,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:28,382 INFO L93 Difference]: Finished difference Result 685 states and 1134 transitions. [2019-11-25 08:45:28,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:28,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-25 08:45:28,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:28,385 INFO L225 Difference]: With dead ends: 685 [2019-11-25 08:45:28,385 INFO L226 Difference]: Without dead ends: 363 [2019-11-25 08:45:28,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:28,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-25 08:45:28,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-11-25 08:45:28,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-25 08:45:28,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 585 transitions. [2019-11-25 08:45:28,401 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 585 transitions. Word has length 98 [2019-11-25 08:45:28,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:28,402 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 585 transitions. [2019-11-25 08:45:28,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:28,403 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 585 transitions. [2019-11-25 08:45:28,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:45:28,404 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:28,405 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:28,405 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:28,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1428014628, now seen corresponding path program 1 times [2019-11-25 08:45:28,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592705609] [2019-11-25 08:45:28,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:28,449 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-25 08:45:28,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592705609] [2019-11-25 08:45:28,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:28,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:28,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883996049] [2019-11-25 08:45:28,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:28,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:28,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:28,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:28,451 INFO L87 Difference]: Start difference. First operand 356 states and 585 transitions. Second operand 3 states. [2019-11-25 08:45:28,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:28,599 INFO L93 Difference]: Finished difference Result 707 states and 1161 transitions. [2019-11-25 08:45:28,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:28,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-25 08:45:28,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:28,602 INFO L225 Difference]: With dead ends: 707 [2019-11-25 08:45:28,602 INFO L226 Difference]: Without dead ends: 358 [2019-11-25 08:45:28,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:28,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-25 08:45:28,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-11-25 08:45:28,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-25 08:45:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 581 transitions. [2019-11-25 08:45:28,615 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 581 transitions. Word has length 98 [2019-11-25 08:45:28,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:28,616 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 581 transitions. [2019-11-25 08:45:28,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:28,616 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 581 transitions. [2019-11-25 08:45:28,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-25 08:45:28,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:28,618 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] [2019-11-25 08:45:28,618 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:28,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1781518284, now seen corresponding path program 1 times [2019-11-25 08:45:28,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29362561] [2019-11-25 08:45:28,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-25 08:45:28,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29362561] [2019-11-25 08:45:28,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:28,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:28,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670414315] [2019-11-25 08:45:28,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:28,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:28,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:28,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:28,655 INFO L87 Difference]: Start difference. First operand 356 states and 581 transitions. Second operand 3 states. [2019-11-25 08:45:28,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:28,811 INFO L93 Difference]: Finished difference Result 712 states and 1163 transitions. [2019-11-25 08:45:28,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:28,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-25 08:45:28,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:28,814 INFO L225 Difference]: With dead ends: 712 [2019-11-25 08:45:28,814 INFO L226 Difference]: Without dead ends: 363 [2019-11-25 08:45:28,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:28,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-25 08:45:28,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-11-25 08:45:28,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-25 08:45:28,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 576 transitions. [2019-11-25 08:45:28,828 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 576 transitions. Word has length 99 [2019-11-25 08:45:28,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:28,828 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 576 transitions. [2019-11-25 08:45:28,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:28,829 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 576 transitions. [2019-11-25 08:45:28,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-25 08:45:28,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:28,830 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:28,830 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:28,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,831 INFO L82 PathProgramCache]: Analyzing trace with hash -2059318320, now seen corresponding path program 1 times [2019-11-25 08:45:28,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626349988] [2019-11-25 08:45:28,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:28,865 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-25 08:45:28,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626349988] [2019-11-25 08:45:28,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:28,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:28,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628989860] [2019-11-25 08:45:28,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:28,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:28,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:28,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:28,867 INFO L87 Difference]: Start difference. First operand 356 states and 576 transitions. Second operand 3 states. [2019-11-25 08:45:29,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:29,005 INFO L93 Difference]: Finished difference Result 730 states and 1182 transitions. [2019-11-25 08:45:29,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:29,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-25 08:45:29,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:29,008 INFO L225 Difference]: With dead ends: 730 [2019-11-25 08:45:29,008 INFO L226 Difference]: Without dead ends: 381 [2019-11-25 08:45:29,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:29,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-25 08:45:29,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-25 08:45:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-25 08:45:29,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 605 transitions. [2019-11-25 08:45:29,023 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 605 transitions. Word has length 104 [2019-11-25 08:45:29,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:29,023 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 605 transitions. [2019-11-25 08:45:29,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:29,023 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 605 transitions. [2019-11-25 08:45:29,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-25 08:45:29,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:29,025 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:29,025 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:29,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:29,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1279717276, now seen corresponding path program 1 times [2019-11-25 08:45:29,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:29,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21175831] [2019-11-25 08:45:29,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:29,053 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-25 08:45:29,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21175831] [2019-11-25 08:45:29,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:29,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:29,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006658160] [2019-11-25 08:45:29,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:29,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:29,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:29,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:29,055 INFO L87 Difference]: Start difference. First operand 377 states and 605 transitions. Second operand 3 states. [2019-11-25 08:45:29,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:29,199 INFO L93 Difference]: Finished difference Result 751 states and 1205 transitions. [2019-11-25 08:45:29,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:29,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-25 08:45:29,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:29,202 INFO L225 Difference]: With dead ends: 751 [2019-11-25 08:45:29,202 INFO L226 Difference]: Without dead ends: 381 [2019-11-25 08:45:29,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:29,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-25 08:45:29,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-25 08:45:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-25 08:45:29,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 599 transitions. [2019-11-25 08:45:29,217 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 599 transitions. Word has length 105 [2019-11-25 08:45:29,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:29,217 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 599 transitions. [2019-11-25 08:45:29,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:29,217 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 599 transitions. [2019-11-25 08:45:29,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-25 08:45:29,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:29,219 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:29,219 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:29,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:29,219 INFO L82 PathProgramCache]: Analyzing trace with hash 2114985745, now seen corresponding path program 1 times [2019-11-25 08:45:29,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:29,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952026836] [2019-11-25 08:45:29,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:29,259 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-25 08:45:29,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952026836] [2019-11-25 08:45:29,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:29,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:29,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234096530] [2019-11-25 08:45:29,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:29,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:29,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:29,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:29,261 INFO L87 Difference]: Start difference. First operand 377 states and 599 transitions. Second operand 3 states. [2019-11-25 08:45:29,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:29,305 INFO L93 Difference]: Finished difference Result 747 states and 1187 transitions. [2019-11-25 08:45:29,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:29,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-25 08:45:29,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:29,310 INFO L225 Difference]: With dead ends: 747 [2019-11-25 08:45:29,310 INFO L226 Difference]: Without dead ends: 745 [2019-11-25 08:45:29,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:29,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-11-25 08:45:29,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2019-11-25 08:45:29,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-11-25 08:45:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1185 transitions. [2019-11-25 08:45:29,337 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1185 transitions. Word has length 120 [2019-11-25 08:45:29,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:29,337 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1185 transitions. [2019-11-25 08:45:29,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:29,337 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1185 transitions. [2019-11-25 08:45:29,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-25 08:45:29,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:29,339 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, 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] [2019-11-25 08:45:29,340 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:29,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:29,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1757690989, now seen corresponding path program 1 times [2019-11-25 08:45:29,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:29,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729655656] [2019-11-25 08:45:29,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:29,348 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:45:29,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [448782814] [2019-11-25 08:45:29,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd560b4a-8cd9-42f7-8893-7b44261bad2a/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-11-25 08:45:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:29,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:45:29,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-25 08:45:29,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729655656] [2019-11-25 08:45:29,495 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:45:29,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448782814] [2019-11-25 08:45:29,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:29,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:29,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794818770] [2019-11-25 08:45:29,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:29,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:29,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:29,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:29,499 INFO L87 Difference]: Start difference. First operand 745 states and 1185 transitions. Second operand 3 states. [2019-11-25 08:45:29,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:29,564 INFO L93 Difference]: Finished difference Result 1851 states and 2945 transitions. [2019-11-25 08:45:29,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:29,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-25 08:45:29,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:29,571 INFO L225 Difference]: With dead ends: 1851 [2019-11-25 08:45:29,571 INFO L226 Difference]: Without dead ends: 1113 [2019-11-25 08:45:29,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:29,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-11-25 08:45:29,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2019-11-25 08:45:29,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2019-11-25 08:45:29,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1768 transitions. [2019-11-25 08:45:29,613 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1768 transitions. Word has length 121 [2019-11-25 08:45:29,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:29,614 INFO L462 AbstractCegarLoop]: Abstraction has 1113 states and 1768 transitions. [2019-11-25 08:45:29,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:29,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1768 transitions. [2019-11-25 08:45:29,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-25 08:45:29,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:29,617 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:29,820 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:29,821 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:29,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:29,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1944046772, now seen corresponding path program 1 times [2019-11-25 08:45:29,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:29,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263639808] [2019-11-25 08:45:29,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:29,829 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:45:29,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1286234528] [2019-11-25 08:45:29,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd560b4a-8cd9-42f7-8893-7b44261bad2a/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-11-25 08:45:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:29,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:45:29,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-25 08:45:29,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263639808] [2019-11-25 08:45:29,940 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:45:29,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286234528] [2019-11-25 08:45:29,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:29,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:29,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829424343] [2019-11-25 08:45:29,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:29,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:29,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:29,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:29,943 INFO L87 Difference]: Start difference. First operand 1113 states and 1768 transitions. Second operand 3 states. [2019-11-25 08:45:30,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:30,007 INFO L93 Difference]: Finished difference Result 2219 states and 3528 transitions. [2019-11-25 08:45:30,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:30,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-11-25 08:45:30,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:30,016 INFO L225 Difference]: With dead ends: 2219 [2019-11-25 08:45:30,016 INFO L226 Difference]: Without dead ends: 1481 [2019-11-25 08:45:30,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:30,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-11-25 08:45:30,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2019-11-25 08:45:30,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-11-25 08:45:30,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2352 transitions. [2019-11-25 08:45:30,070 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2352 transitions. Word has length 137 [2019-11-25 08:45:30,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:30,070 INFO L462 AbstractCegarLoop]: Abstraction has 1481 states and 2352 transitions. [2019-11-25 08:45:30,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:30,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2352 transitions. [2019-11-25 08:45:30,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-25 08:45:30,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:30,074 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:30,281 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:30,282 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:30,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:30,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1334074210, now seen corresponding path program 1 times [2019-11-25 08:45:30,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:30,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348745726] [2019-11-25 08:45:30,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-11-25 08:45:30,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348745726] [2019-11-25 08:45:30,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:30,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:30,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092756327] [2019-11-25 08:45:30,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:30,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:30,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:30,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:30,329 INFO L87 Difference]: Start difference. First operand 1481 states and 2352 transitions. Second operand 3 states. [2019-11-25 08:45:30,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:30,514 INFO L93 Difference]: Finished difference Result 3059 states and 4857 transitions. [2019-11-25 08:45:30,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:30,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-25 08:45:30,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:30,524 INFO L225 Difference]: With dead ends: 3059 [2019-11-25 08:45:30,524 INFO L226 Difference]: Without dead ends: 1585 [2019-11-25 08:45:30,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:30,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-11-25 08:45:30,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1573. [2019-11-25 08:45:30,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2019-11-25 08:45:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2464 transitions. [2019-11-25 08:45:30,580 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2464 transitions. Word has length 158 [2019-11-25 08:45:30,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:30,580 INFO L462 AbstractCegarLoop]: Abstraction has 1573 states and 2464 transitions. [2019-11-25 08:45:30,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:30,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2464 transitions. [2019-11-25 08:45:30,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-25 08:45:30,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:30,584 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:30,585 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:30,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:30,585 INFO L82 PathProgramCache]: Analyzing trace with hash -241439008, now seen corresponding path program 1 times [2019-11-25 08:45:30,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:30,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765362700] [2019-11-25 08:45:30,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:30,594 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:45:30,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1333924618] [2019-11-25 08:45:30,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd560b4a-8cd9-42f7-8893-7b44261bad2a/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-11-25 08:45:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:30,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:45:30,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:30,712 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-25 08:45:30,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765362700] [2019-11-25 08:45:30,712 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:45:30,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333924618] [2019-11-25 08:45:30,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:30,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:30,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96466392] [2019-11-25 08:45:30,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:30,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:30,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:30,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:30,715 INFO L87 Difference]: Start difference. First operand 1573 states and 2464 transitions. Second operand 3 states. [2019-11-25 08:45:30,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:30,790 INFO L93 Difference]: Finished difference Result 3139 states and 4920 transitions. [2019-11-25 08:45:30,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:30,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-25 08:45:30,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:30,802 INFO L225 Difference]: With dead ends: 3139 [2019-11-25 08:45:30,802 INFO L226 Difference]: Without dead ends: 1964 [2019-11-25 08:45:30,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:30,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-11-25 08:45:30,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-11-25 08:45:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-11-25 08:45:30,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 3077 transitions. [2019-11-25 08:45:30,918 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 3077 transitions. Word has length 158 [2019-11-25 08:45:30,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:30,918 INFO L462 AbstractCegarLoop]: Abstraction has 1964 states and 3077 transitions. [2019-11-25 08:45:30,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 3077 transitions. [2019-11-25 08:45:30,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-25 08:45:30,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:30,924 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-25 08:45:31,136 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:31,136 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:31,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:31,137 INFO L82 PathProgramCache]: Analyzing trace with hash 332308346, now seen corresponding path program 1 times [2019-11-25 08:45:31,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:31,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706370253] [2019-11-25 08:45:31,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:31,148 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:45:31,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1537515025] [2019-11-25 08:45:31,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd560b4a-8cd9-42f7-8893-7b44261bad2a/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-11-25 08:45:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:31,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:45:31,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:31,313 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-25 08:45:31,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706370253] [2019-11-25 08:45:31,314 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:45:31,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537515025] [2019-11-25 08:45:31,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:31,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:31,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545047600] [2019-11-25 08:45:31,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:31,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:31,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:31,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:31,316 INFO L87 Difference]: Start difference. First operand 1964 states and 3077 transitions. Second operand 3 states. [2019-11-25 08:45:31,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:31,427 INFO L93 Difference]: Finished difference Result 5743 states and 9049 transitions. [2019-11-25 08:45:31,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:31,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-25 08:45:31,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:31,449 INFO L225 Difference]: With dead ends: 5743 [2019-11-25 08:45:31,449 INFO L226 Difference]: Without dead ends: 3786 [2019-11-25 08:45:31,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:31,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-11-25 08:45:31,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-11-25 08:45:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-25 08:45:31,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5967 transitions. [2019-11-25 08:45:31,587 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5967 transitions. Word has length 198 [2019-11-25 08:45:31,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:31,587 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5967 transitions. [2019-11-25 08:45:31,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:31,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5967 transitions. [2019-11-25 08:45:31,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-25 08:45:31,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:31,597 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-25 08:45:31,801 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:31,801 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:31,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:31,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1226220023, now seen corresponding path program 1 times [2019-11-25 08:45:31,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:31,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069844382] [2019-11-25 08:45:31,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:31,815 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:45:31,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [119170533] [2019-11-25 08:45:31,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd560b4a-8cd9-42f7-8893-7b44261bad2a/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-11-25 08:45:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:31,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:45:31,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:31,981 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-25 08:45:31,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069844382] [2019-11-25 08:45:31,982 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:45:31,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119170533] [2019-11-25 08:45:31,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:31,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:31,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459205935] [2019-11-25 08:45:31,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:31,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:31,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:31,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:31,983 INFO L87 Difference]: Start difference. First operand 3784 states and 5967 transitions. Second operand 3 states. [2019-11-25 08:45:32,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:32,290 INFO L93 Difference]: Finished difference Result 7651 states and 12033 transitions. [2019-11-25 08:45:32,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:32,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-25 08:45:32,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:32,312 INFO L225 Difference]: With dead ends: 7651 [2019-11-25 08:45:32,312 INFO L226 Difference]: Without dead ends: 3874 [2019-11-25 08:45:32,317 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:32,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2019-11-25 08:45:32,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3784. [2019-11-25 08:45:32,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-25 08:45:32,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5787 transitions. [2019-11-25 08:45:32,507 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5787 transitions. Word has length 235 [2019-11-25 08:45:32,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:32,508 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5787 transitions. [2019-11-25 08:45:32,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:32,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5787 transitions. [2019-11-25 08:45:32,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-25 08:45:32,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:32,518 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 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, 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] [2019-11-25 08:45:32,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:32,722 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:32,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:32,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1255317410, now seen corresponding path program 1 times [2019-11-25 08:45:32,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:32,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564452741] [2019-11-25 08:45:32,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-11-25 08:45:32,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564452741] [2019-11-25 08:45:32,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:32,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:32,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848982483] [2019-11-25 08:45:32,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:32,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:32,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:32,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:32,814 INFO L87 Difference]: Start difference. First operand 3784 states and 5787 transitions. Second operand 3 states. [2019-11-25 08:45:33,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:33,085 INFO L93 Difference]: Finished difference Result 7683 states and 11706 transitions. [2019-11-25 08:45:33,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:33,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-11-25 08:45:33,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:33,106 INFO L225 Difference]: With dead ends: 7683 [2019-11-25 08:45:33,107 INFO L226 Difference]: Without dead ends: 3906 [2019-11-25 08:45:33,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:33,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2019-11-25 08:45:33,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3784. [2019-11-25 08:45:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-25 08:45:33,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5627 transitions. [2019-11-25 08:45:33,241 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5627 transitions. Word has length 248 [2019-11-25 08:45:33,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:33,241 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5627 transitions. [2019-11-25 08:45:33,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:33,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5627 transitions. [2019-11-25 08:45:33,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-11-25 08:45:33,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:33,252 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-25 08:45:33,252 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:33,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:33,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1963060854, now seen corresponding path program 1 times [2019-11-25 08:45:33,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:33,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427282957] [2019-11-25 08:45:33,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:33,267 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:45:33,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [33600824] [2019-11-25 08:45:33,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd560b4a-8cd9-42f7-8893-7b44261bad2a/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-11-25 08:45:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:33,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:45:33,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-11-25 08:45:33,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427282957] [2019-11-25 08:45:33,437 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:45:33,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33600824] [2019-11-25 08:45:33,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:33,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:33,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461717534] [2019-11-25 08:45:33,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:33,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:33,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:33,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:33,439 INFO L87 Difference]: Start difference. First operand 3784 states and 5627 transitions. Second operand 3 states. [2019-11-25 08:45:33,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:33,694 INFO L93 Difference]: Finished difference Result 7561 states and 11243 transitions. [2019-11-25 08:45:33,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:33,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2019-11-25 08:45:33,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:33,718 INFO L225 Difference]: With dead ends: 7561 [2019-11-25 08:45:33,718 INFO L226 Difference]: Without dead ends: 3784 [2019-11-25 08:45:33,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:33,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2019-11-25 08:45:33,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3784. [2019-11-25 08:45:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-25 08:45:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5517 transitions. [2019-11-25 08:45:33,850 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5517 transitions. Word has length 277 [2019-11-25 08:45:33,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:33,851 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5517 transitions. [2019-11-25 08:45:33,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:33,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5517 transitions. [2019-11-25 08:45:33,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-25 08:45:33,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:33,861 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:34,064 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:34,064 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:34,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:34,065 INFO L82 PathProgramCache]: Analyzing trace with hash 2084683919, now seen corresponding path program 1 times [2019-11-25 08:45:34,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:34,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471954805] [2019-11-25 08:45:34,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:34,082 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:45:34,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1828041996] [2019-11-25 08:45:34,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd560b4a-8cd9-42f7-8893-7b44261bad2a/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-11-25 08:45:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:34,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:45:34,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-11-25 08:45:34,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471954805] [2019-11-25 08:45:34,248 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:45:34,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828041996] [2019-11-25 08:45:34,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:34,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:34,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961701414] [2019-11-25 08:45:34,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:34,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:34,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:34,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:34,251 INFO L87 Difference]: Start difference. First operand 3784 states and 5517 transitions. Second operand 3 states. [2019-11-25 08:45:34,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:34,479 INFO L93 Difference]: Finished difference Result 7951 states and 11633 transitions. [2019-11-25 08:45:34,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:34,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-11-25 08:45:34,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:34,484 INFO L225 Difference]: With dead ends: 7951 [2019-11-25 08:45:34,484 INFO L226 Difference]: Without dead ends: 2307 [2019-11-25 08:45:34,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:34,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-11-25 08:45:34,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2019-11-25 08:45:34,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-11-25 08:45:34,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3307 transitions. [2019-11-25 08:45:34,549 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3307 transitions. Word has length 305 [2019-11-25 08:45:34,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:34,549 INFO L462 AbstractCegarLoop]: Abstraction has 2307 states and 3307 transitions. [2019-11-25 08:45:34,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3307 transitions. [2019-11-25 08:45:34,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-11-25 08:45:34,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:34,557 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:34,768 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:34,768 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:34,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:34,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1859888105, now seen corresponding path program 1 times [2019-11-25 08:45:34,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:34,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163913742] [2019-11-25 08:45:34,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:34,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-11-25 08:45:34,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163913742] [2019-11-25 08:45:34,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:34,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:34,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961414628] [2019-11-25 08:45:34,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:34,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:34,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:34,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:34,897 INFO L87 Difference]: Start difference. First operand 2307 states and 3307 transitions. Second operand 3 states. [2019-11-25 08:45:35,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:35,080 INFO L93 Difference]: Finished difference Result 4829 states and 6951 transitions. [2019-11-25 08:45:35,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:35,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-11-25 08:45:35,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:35,085 INFO L225 Difference]: With dead ends: 4829 [2019-11-25 08:45:35,085 INFO L226 Difference]: Without dead ends: 2529 [2019-11-25 08:45:35,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:35,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2019-11-25 08:45:35,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2457. [2019-11-25 08:45:35,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-11-25 08:45:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3487 transitions. [2019-11-25 08:45:35,179 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3487 transitions. Word has length 326 [2019-11-25 08:45:35,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:35,179 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3487 transitions. [2019-11-25 08:45:35,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3487 transitions. [2019-11-25 08:45:35,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-11-25 08:45:35,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:35,188 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:35,189 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:35,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:35,189 INFO L82 PathProgramCache]: Analyzing trace with hash -743110197, now seen corresponding path program 1 times [2019-11-25 08:45:35,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:35,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326409336] [2019-11-25 08:45:35,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:35,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2019-11-25 08:45:35,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326409336] [2019-11-25 08:45:35,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:35,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:35,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341876356] [2019-11-25 08:45:35,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:35,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:35,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:35,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:35,318 INFO L87 Difference]: Start difference. First operand 2457 states and 3487 transitions. Second operand 3 states. [2019-11-25 08:45:35,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:35,510 INFO L93 Difference]: Finished difference Result 4949 states and 7035 transitions. [2019-11-25 08:45:35,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:35,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2019-11-25 08:45:35,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:35,515 INFO L225 Difference]: With dead ends: 4949 [2019-11-25 08:45:35,515 INFO L226 Difference]: Without dead ends: 2499 [2019-11-25 08:45:35,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:35,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2019-11-25 08:45:35,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2457. [2019-11-25 08:45:35,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-11-25 08:45:35,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3427 transitions. [2019-11-25 08:45:35,576 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3427 transitions. Word has length 352 [2019-11-25 08:45:35,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:35,576 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3427 transitions. [2019-11-25 08:45:35,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:35,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3427 transitions. [2019-11-25 08:45:35,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-11-25 08:45:35,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:35,585 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:35,587 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:35,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:35,587 INFO L82 PathProgramCache]: Analyzing trace with hash -865406346, now seen corresponding path program 1 times [2019-11-25 08:45:35,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:35,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924796844] [2019-11-25 08:45:35,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-25 08:45:35,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924796844] [2019-11-25 08:45:35,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882784459] [2019-11-25 08:45:35,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd560b4a-8cd9-42f7-8893-7b44261bad2a/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-11-25 08:45:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:35,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:45:35,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-25 08:45:35,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:45:35,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:45:35,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105869914] [2019-11-25 08:45:35,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:35,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:35,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:35,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:35,977 INFO L87 Difference]: Start difference. First operand 2457 states and 3427 transitions. Second operand 4 states. [2019-11-25 08:45:36,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:36,363 INFO L93 Difference]: Finished difference Result 7213 states and 10041 transitions. [2019-11-25 08:45:36,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:45:36,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 369 [2019-11-25 08:45:36,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:36,371 INFO L225 Difference]: With dead ends: 7213 [2019-11-25 08:45:36,371 INFO L226 Difference]: Without dead ends: 4617 [2019-11-25 08:45:36,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:36,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4617 states. [2019-11-25 08:45:36,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4617 to 2534. [2019-11-25 08:45:36,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-11-25 08:45:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3492 transitions. [2019-11-25 08:45:36,450 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3492 transitions. Word has length 369 [2019-11-25 08:45:36,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:36,451 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3492 transitions. [2019-11-25 08:45:36,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3492 transitions. [2019-11-25 08:45:36,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-11-25 08:45:36,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:36,463 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:36,666 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:36,667 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:36,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:36,667 INFO L82 PathProgramCache]: Analyzing trace with hash 347179712, now seen corresponding path program 1 times [2019-11-25 08:45:36,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:36,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573745184] [2019-11-25 08:45:36,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:36,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2019-11-25 08:45:36,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573745184] [2019-11-25 08:45:36,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:36,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:36,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236874190] [2019-11-25 08:45:36,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:36,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:36,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:36,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:36,822 INFO L87 Difference]: Start difference. First operand 2534 states and 3492 transitions. Second operand 3 states. [2019-11-25 08:45:37,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:37,015 INFO L93 Difference]: Finished difference Result 5073 states and 6985 transitions. [2019-11-25 08:45:37,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:37,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2019-11-25 08:45:37,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:37,020 INFO L225 Difference]: With dead ends: 5073 [2019-11-25 08:45:37,020 INFO L226 Difference]: Without dead ends: 2546 [2019-11-25 08:45:37,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:37,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2019-11-25 08:45:37,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2534. [2019-11-25 08:45:37,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-11-25 08:45:37,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3432 transitions. [2019-11-25 08:45:37,102 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3432 transitions. Word has length 437 [2019-11-25 08:45:37,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:37,103 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3432 transitions. [2019-11-25 08:45:37,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:37,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3432 transitions. [2019-11-25 08:45:37,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-11-25 08:45:37,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:37,112 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:37,112 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:37,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:37,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1485463445, now seen corresponding path program 1 times [2019-11-25 08:45:37,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:37,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081903466] [2019-11-25 08:45:37,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2019-11-25 08:45:37,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081903466] [2019-11-25 08:45:37,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:37,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:37,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997582282] [2019-11-25 08:45:37,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:37,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:37,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:37,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:37,342 INFO L87 Difference]: Start difference. First operand 2534 states and 3432 transitions. Second operand 3 states. [2019-11-25 08:45:37,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:37,528 INFO L93 Difference]: Finished difference Result 5277 states and 7171 transitions. [2019-11-25 08:45:37,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:37,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2019-11-25 08:45:37,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:37,534 INFO L225 Difference]: With dead ends: 5277 [2019-11-25 08:45:37,534 INFO L226 Difference]: Without dead ends: 2750 [2019-11-25 08:45:37,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:37,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2019-11-25 08:45:37,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2738. [2019-11-25 08:45:37,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2738 states. [2019-11-25 08:45:37,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 3666 transitions. [2019-11-25 08:45:37,601 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 3666 transitions. Word has length 469 [2019-11-25 08:45:37,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:37,602 INFO L462 AbstractCegarLoop]: Abstraction has 2738 states and 3666 transitions. [2019-11-25 08:45:37,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:37,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 3666 transitions. [2019-11-25 08:45:37,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2019-11-25 08:45:37,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:37,609 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:37,610 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:37,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:37,610 INFO L82 PathProgramCache]: Analyzing trace with hash 741321217, now seen corresponding path program 1 times [2019-11-25 08:45:37,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:37,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383592333] [2019-11-25 08:45:37,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:37,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2019-11-25 08:45:37,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383592333] [2019-11-25 08:45:37,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:37,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:37,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71868710] [2019-11-25 08:45:37,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:37,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:37,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:37,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:37,869 INFO L87 Difference]: Start difference. First operand 2738 states and 3666 transitions. Second operand 3 states. [2019-11-25 08:45:38,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:38,069 INFO L93 Difference]: Finished difference Result 5697 states and 7663 transitions. [2019-11-25 08:45:38,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:38,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 531 [2019-11-25 08:45:38,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:38,075 INFO L225 Difference]: With dead ends: 5697 [2019-11-25 08:45:38,075 INFO L226 Difference]: Without dead ends: 2966 [2019-11-25 08:45:38,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:38,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2019-11-25 08:45:38,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2954. [2019-11-25 08:45:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2019-11-25 08:45:38,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3912 transitions. [2019-11-25 08:45:38,146 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3912 transitions. Word has length 531 [2019-11-25 08:45:38,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:38,146 INFO L462 AbstractCegarLoop]: Abstraction has 2954 states and 3912 transitions. [2019-11-25 08:45:38,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:38,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3912 transitions. [2019-11-25 08:45:38,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-11-25 08:45:38,153 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:38,154 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:38,154 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:38,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:38,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1801113525, now seen corresponding path program 1 times [2019-11-25 08:45:38,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:38,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362058540] [2019-11-25 08:45:38,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:38,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-25 08:45:38,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362058540] [2019-11-25 08:45:38,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374476770] [2019-11-25 08:45:38,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd560b4a-8cd9-42f7-8893-7b44261bad2a/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:38,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:45:38,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-25 08:45:38,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:45:38,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:45:38,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896313587] [2019-11-25 08:45:38,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:38,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:38,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:38,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:38,808 INFO L87 Difference]: Start difference. First operand 2954 states and 3912 transitions. Second operand 4 states. [2019-11-25 08:45:39,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:39,010 INFO L93 Difference]: Finished difference Result 4704 states and 6236 transitions. [2019-11-25 08:45:39,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:39,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 597 [2019-11-25 08:45:39,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:39,012 INFO L225 Difference]: With dead ends: 4704 [2019-11-25 08:45:39,012 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:45:39,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:39,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:45:39,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:45:39,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:45:39,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:45:39,016 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 597 [2019-11-25 08:45:39,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:39,017 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:45:39,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:39,017 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:45:39,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:45:39,225 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:39,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:45:39,508 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-11-25 08:45:39,970 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-11-25 08:45:40,245 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-25 08:45:40,395 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 20 [2019-11-25 08:45:40,667 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-25 08:45:40,923 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-11-25 08:45:41,121 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-25 08:45:41,333 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-25 08:45:41,517 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-11-25 08:45:41,724 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-11-25 08:45:41,975 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-25 08:45:42,159 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-25 08:45:42,315 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-25 08:45:42,442 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-25 08:45:42,604 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-25 08:45:42,706 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-11-25 08:45:42,880 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-11-25 08:45:43,030 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-25 08:45:43,263 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-11-25 08:45:43,367 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-11-25 08:45:43,477 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-11-25 08:45:43,479 INFO L444 ceAbstractionStarter]: For program point L630(lines 630 634) no Hoare annotation was computed. [2019-11-25 08:45:43,479 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-11-25 08:45:43,479 INFO L444 ceAbstractionStarter]: For program point L201(lines 201 592) no Hoare annotation was computed. [2019-11-25 08:45:43,479 INFO L444 ceAbstractionStarter]: For program point L168(lines 168 603) no Hoare annotation was computed. [2019-11-25 08:45:43,479 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 614) no Hoare annotation was computed. [2019-11-25 08:45:43,479 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 625) no Hoare annotation was computed. [2019-11-25 08:45:43,479 INFO L444 ceAbstractionStarter]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-11-25 08:45:43,479 INFO L440 ceAbstractionStarter]: At program point L202(lines 198 593) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) [2019-11-25 08:45:43,480 INFO L440 ceAbstractionStarter]: At program point L103(lines 102 625) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-11-25 08:45:43,480 INFO L444 ceAbstractionStarter]: For program point L501(lines 501 505) no Hoare annotation was computed. [2019-11-25 08:45:43,480 INFO L444 ceAbstractionStarter]: For program point L501-2(lines 209 587) no Hoare annotation was computed. [2019-11-25 08:45:43,480 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-11-25 08:45:43,480 INFO L444 ceAbstractionStarter]: For program point L204(lines 204 591) no Hoare annotation was computed. [2019-11-25 08:45:43,480 INFO L444 ceAbstractionStarter]: For program point L171(lines 171 602) no Hoare annotation was computed. [2019-11-25 08:45:43,480 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 613) no Hoare annotation was computed. [2019-11-25 08:45:43,480 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 624) no Hoare annotation was computed. [2019-11-25 08:45:43,480 INFO L440 ceAbstractionStarter]: At program point L205(lines 204 591) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-25 08:45:43,480 INFO L440 ceAbstractionStarter]: At program point L172(lines 168 603) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-25 08:45:43,481 INFO L440 ceAbstractionStarter]: At program point L139(lines 135 614) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6 .cse1))) [2019-11-25 08:45:43,481 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-25 08:45:43,481 INFO L444 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-11-25 08:45:43,481 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-11-25 08:45:43,481 INFO L444 ceAbstractionStarter]: For program point L306-2(lines 209 587) no Hoare annotation was computed. [2019-11-25 08:45:43,481 INFO L444 ceAbstractionStarter]: For program point L174(lines 174 601) no Hoare annotation was computed. [2019-11-25 08:45:43,481 INFO L444 ceAbstractionStarter]: For program point L141(lines 141 612) no Hoare annotation was computed. [2019-11-25 08:45:43,481 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 623) no Hoare annotation was computed. [2019-11-25 08:45:43,481 INFO L444 ceAbstractionStarter]: For program point L571(lines 571 581) no Hoare annotation was computed. [2019-11-25 08:45:43,481 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 581) no Hoare annotation was computed. [2019-11-25 08:45:43,481 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-11-25 08:45:43,481 INFO L440 ceAbstractionStarter]: At program point L208(lines 207 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-25 08:45:43,481 INFO L444 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-25 08:45:43,482 INFO L444 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-25 08:45:43,482 INFO L440 ceAbstractionStarter]: At program point L407(lines 398 418) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.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))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-11-25 08:45:43,482 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-25 08:45:43,482 INFO L444 ceAbstractionStarter]: For program point L341-2(lines 209 587) no Hoare annotation was computed. [2019-11-25 08:45:43,482 INFO L447 ceAbstractionStarter]: At program point L672(lines 64 674) the Hoare annotation is: true [2019-11-25 08:45:43,482 INFO L444 ceAbstractionStarter]: For program point L639(lines 639 645) no Hoare annotation was computed. [2019-11-25 08:45:43,482 INFO L444 ceAbstractionStarter]: For program point L540(lines 540 545) no Hoare annotation was computed. [2019-11-25 08:45:43,482 INFO L444 ceAbstractionStarter]: For program point L177(lines 177 600) no Hoare annotation was computed. [2019-11-25 08:45:43,482 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 611) no Hoare annotation was computed. [2019-11-25 08:45:43,482 INFO L444 ceAbstractionStarter]: For program point L111(lines 111 622) no Hoare annotation was computed. [2019-11-25 08:45:43,482 INFO L447 ceAbstractionStarter]: At program point L673(lines 9 675) the Hoare annotation is: true [2019-11-25 08:45:43,482 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 578) no Hoare annotation was computed. [2019-11-25 08:45:43,482 INFO L444 ceAbstractionStarter]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-11-25 08:45:43,483 INFO L440 ceAbstractionStarter]: At program point L178(lines 174 601) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-25 08:45:43,483 INFO L440 ceAbstractionStarter]: At program point L145(lines 141 612) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-25 08:45:43,483 INFO L444 ceAbstractionStarter]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-11-25 08:45:43,483 INFO L440 ceAbstractionStarter]: At program point L212(lines 105 624) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-25 08:45:43,483 INFO L444 ceAbstractionStarter]: For program point L180(lines 180 599) no Hoare annotation was computed. [2019-11-25 08:45:43,483 INFO L444 ceAbstractionStarter]: For program point L147(lines 147 610) no Hoare annotation was computed. [2019-11-25 08:45:43,483 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 621) no Hoare annotation was computed. [2019-11-25 08:45:43,483 INFO L444 ceAbstractionStarter]: For program point L511(lines 511 515) no Hoare annotation was computed. [2019-11-25 08:45:43,483 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-11-25 08:45:43,484 INFO L444 ceAbstractionStarter]: For program point L511-2(lines 511 515) no Hoare annotation was computed. [2019-11-25 08:45:43,484 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-25 08:45:43,484 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 64 674) no Hoare annotation was computed. [2019-11-25 08:45:43,484 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 598) no Hoare annotation was computed. [2019-11-25 08:45:43,484 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 609) no Hoare annotation was computed. [2019-11-25 08:45:43,484 INFO L444 ceAbstractionStarter]: For program point L117(lines 117 620) no Hoare annotation was computed. [2019-11-25 08:45:43,484 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-25 08:45:43,484 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-11-25 08:45:43,484 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-11-25 08:45:43,484 INFO L444 ceAbstractionStarter]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-11-25 08:45:43,484 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-25 08:45:43,484 INFO L440 ceAbstractionStarter]: At program point L184(lines 180 599) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-25 08:45:43,485 INFO L440 ceAbstractionStarter]: At program point L151(lines 147 610) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-25 08:45:43,485 INFO L444 ceAbstractionStarter]: For program point L217-2(lines 209 587) no Hoare annotation was computed. [2019-11-25 08:45:43,485 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:45:43,485 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 597) no Hoare annotation was computed. [2019-11-25 08:45:43,485 INFO L444 ceAbstractionStarter]: For program point L153(lines 153 608) no Hoare annotation was computed. [2019-11-25 08:45:43,485 INFO L444 ceAbstractionStarter]: For program point L120(lines 120 619) no Hoare annotation was computed. [2019-11-25 08:45:43,485 INFO L444 ceAbstractionStarter]: For program point L550(lines 550 554) no Hoare annotation was computed. [2019-11-25 08:45:43,485 INFO L444 ceAbstractionStarter]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-11-25 08:45:43,486 INFO L444 ceAbstractionStarter]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-11-25 08:45:43,487 INFO L440 ceAbstractionStarter]: At program point L121(lines 117 620) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse5 .cse0 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse1))) [2019-11-25 08:45:43,487 INFO L440 ceAbstractionStarter]: At program point L551(lines 64 674) the Hoare annotation is: false [2019-11-25 08:45:43,487 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-11-25 08:45:43,487 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-11-25 08:45:43,487 INFO L444 ceAbstractionStarter]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-11-25 08:45:43,487 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 596) no Hoare annotation was computed. [2019-11-25 08:45:43,487 INFO L444 ceAbstractionStarter]: For program point L156(lines 156 607) no Hoare annotation was computed. [2019-11-25 08:45:43,487 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 618) no Hoare annotation was computed. [2019-11-25 08:45:43,487 INFO L447 ceAbstractionStarter]: At program point L685(lines 676 687) the Hoare annotation is: true [2019-11-25 08:45:43,487 INFO L444 ceAbstractionStarter]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-11-25 08:45:43,487 INFO L444 ceAbstractionStarter]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-11-25 08:45:43,487 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:45:43,487 INFO L444 ceAbstractionStarter]: For program point L289-2(lines 209 587) no Hoare annotation was computed. [2019-11-25 08:45:43,488 INFO L440 ceAbstractionStarter]: At program point L190(lines 186 597) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-11-25 08:45:43,488 INFO L440 ceAbstractionStarter]: At program point L157(lines 153 608) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.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))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-11-25 08:45:43,488 INFO L440 ceAbstractionStarter]: At program point L124(lines 123 618) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-25 08:45:43,488 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 526) no Hoare annotation was computed. [2019-11-25 08:45:43,488 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-11-25 08:45:43,488 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-11-25 08:45:43,488 INFO L440 ceAbstractionStarter]: At program point L588(lines 99 656) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse3 .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-25 08:45:43,488 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 559) no Hoare annotation was computed. [2019-11-25 08:45:43,489 INFO L444 ceAbstractionStarter]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-11-25 08:45:43,489 INFO L444 ceAbstractionStarter]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-11-25 08:45:43,489 INFO L444 ceAbstractionStarter]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-11-25 08:45:43,489 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 595) no Hoare annotation was computed. [2019-11-25 08:45:43,489 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 606) no Hoare annotation was computed. [2019-11-25 08:45:43,489 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 617) no Hoare annotation was computed. [2019-11-25 08:45:43,489 INFO L444 ceAbstractionStarter]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-11-25 08:45:43,489 INFO L444 ceAbstractionStarter]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-11-25 08:45:43,493 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:45:43,493 INFO L447 ceAbstractionStarter]: At program point L657(lines 98 658) the Hoare annotation is: true [2019-11-25 08:45:43,494 INFO L444 ceAbstractionStarter]: For program point L195(lines 195 594) no Hoare annotation was computed. [2019-11-25 08:45:43,494 INFO L444 ceAbstractionStarter]: For program point L162(lines 162 605) no Hoare annotation was computed. [2019-11-25 08:45:43,494 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 616) no Hoare annotation was computed. [2019-11-25 08:45:43,494 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-11-25 08:45:43,494 INFO L440 ceAbstractionStarter]: At program point L196(lines 192 595) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse5 .cse7 .cse10 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-25 08:45:43,495 INFO L440 ceAbstractionStarter]: At program point L163(lines 159 606) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-25 08:45:43,495 INFO L444 ceAbstractionStarter]: For program point L229-2(lines 209 587) no Hoare annotation was computed. [2019-11-25 08:45:43,495 INFO L444 ceAbstractionStarter]: For program point L626(lines 626 654) no Hoare annotation was computed. [2019-11-25 08:45:43,495 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-11-25 08:45:43,495 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 668) no Hoare annotation was computed. [2019-11-25 08:45:43,495 INFO L444 ceAbstractionStarter]: For program point L627(lines 627 651) no Hoare annotation was computed. [2019-11-25 08:45:43,496 INFO L444 ceAbstractionStarter]: For program point L561(lines 561 565) no Hoare annotation was computed. [2019-11-25 08:45:43,496 INFO L444 ceAbstractionStarter]: For program point L528(lines 528 532) no Hoare annotation was computed. [2019-11-25 08:45:43,496 INFO L444 ceAbstractionStarter]: For program point L561-2(lines 561 565) no Hoare annotation was computed. [2019-11-25 08:45:43,496 INFO L444 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-11-25 08:45:43,496 INFO L444 ceAbstractionStarter]: For program point L528-2(lines 209 587) no Hoare annotation was computed. [2019-11-25 08:45:43,496 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-11-25 08:45:43,497 INFO L440 ceAbstractionStarter]: At program point L363(lines 346 381) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-25 08:45:43,497 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-25 08:45:43,497 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 593) no Hoare annotation was computed. [2019-11-25 08:45:43,497 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 604) no Hoare annotation was computed. [2019-11-25 08:45:43,497 INFO L444 ceAbstractionStarter]: For program point L132(lines 132 615) no Hoare annotation was computed. [2019-11-25 08:45:43,497 INFO L440 ceAbstractionStarter]: At program point L99-2(lines 99 656) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse3 .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-25 08:45:43,498 INFO L444 ceAbstractionStarter]: For program point L661(lines 661 665) no Hoare annotation was computed. [2019-11-25 08:45:43,498 INFO L444 ceAbstractionStarter]: For program point L628(lines 628 637) no Hoare annotation was computed. [2019-11-25 08:45:43,498 INFO L444 ceAbstractionStarter]: For program point L661-2(lines 661 665) no Hoare annotation was computed. [2019-11-25 08:45:43,498 INFO L444 ceAbstractionStarter]: For program point L628-2(lines 627 649) no Hoare annotation was computed. [2019-11-25 08:45:43,498 INFO L440 ceAbstractionStarter]: At program point L397(lines 388 419) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.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))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-11-25 08:45:43,499 INFO L440 ceAbstractionStarter]: At program point L166(lines 165 604) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1) (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-25 08:45:43,499 INFO L440 ceAbstractionStarter]: At program point L133(lines 126 617) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-25 08:45:43,499 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-25 08:45:43,499 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-11-25 08:45:43,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:45:43 BoogieIcfgContainer [2019-11-25 08:45:43,559 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:45:43,560 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:45:43,560 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:45:43,560 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:45:43,560 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:25" (3/4) ... [2019-11-25 08:45:43,563 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:45:43,584 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 08:45:43,585 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:45:43,725 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bd560b4a-8cd9-42f7-8893-7b44261bad2a/bin/uautomizer/witness.graphml [2019-11-25 08:45:43,725 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:45:43,726 INFO L168 Benchmark]: Toolchain (without parser) took 19728.73 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 908.1 MB). Free memory was 948.7 MB in the beginning and 1.5 GB in the end (delta: -542.8 MB). Peak memory consumption was 365.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:43,726 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:45:43,726 INFO L168 Benchmark]: CACSL2BoogieTranslator took 449.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:43,727 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:45:43,727 INFO L168 Benchmark]: Boogie Preprocessor took 37.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:43,727 INFO L168 Benchmark]: RCFGBuilder took 733.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:43,727 INFO L168 Benchmark]: TraceAbstraction took 18280.14 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 766.5 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -450.0 MB). Peak memory consumption was 780.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:43,728 INFO L168 Benchmark]: Witness Printer took 165.18 ms. Allocated memory is still 1.9 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:43,729 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 449.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 733.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18280.14 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 766.5 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -450.0 MB). Peak memory consumption was 780.3 MB. Max. memory is 11.5 GB. * Witness Printer took 165.18 ms. Allocated memory is still 1.9 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 668]: 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: 126]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 676]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state == 8448) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state == 8448)) || ((blastFlag <= 3 && s__state == 8448) && !(0 == s__hit)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((s__state <= 3 || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state)) || ((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state == 8448)) || ((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8497)) && !(s__state == 8480)) && !(s__state == 8545))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 3 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (blastFlag <= 3 && 8672 <= s__state) && !(s__state == 12292) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 8672)) && !(0 == s__hit) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((s__state <= 3 || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state)) || ((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state == 8448)) || ((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8497)) && !(s__state == 8480)) && !(s__state == 8545))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 12292)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 12292)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit)) || (((((((((blastFlag <= 2 && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545)) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) || ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 1 error locations. Result: SAFE, OverallTime: 18.1s, OverallIterations: 31, TraceHistogramMax: 19, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.2s, HoareTripleCheckerStatistics: 5245 SDtfs, 3315 SDslu, 2431 SDs, 0 SdLazy, 2974 SolverSat, 875 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2452 GetRequests, 2417 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3784occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 2507 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 377 NumberOfFragments, 1906 HoareAnnotationTreeSize, 29 FomulaSimplifications, 40806 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 29 FomulaSimplificationsInter, 6404 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 7192 NumberOfCodeBlocks, 7192 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 7159 ConstructedInterpolants, 0 QuantifiedInterpolants, 2978515 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3926 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 33 InterpolantComputations, 29 PerfectInterpolantSequences, 24782/24886 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...