./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1b789dd3-f147-40cb-b788-08e7209a0be7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1b789dd3-f147-40cb-b788-08e7209a0be7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1b789dd3-f147-40cb-b788-08e7209a0be7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1b789dd3-f147-40cb-b788-08e7209a0be7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_3.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1b789dd3-f147-40cb-b788-08e7209a0be7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1b789dd3-f147-40cb-b788-08e7209a0be7/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 04e0282fb07d3e422f01aa279aee523182698ba7 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 04:33:08,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 04:33:08,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 04:33:08,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 04:33:08,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 04:33:08,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 04:33:08,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 04:33:08,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 04:33:08,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 04:33:08,273 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 04:33:08,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 04:33:08,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 04:33:08,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 04:33:08,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 04:33:08,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 04:33:08,284 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 04:33:08,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 04:33:08,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 04:33:08,293 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 04:33:08,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 04:33:08,302 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 04:33:08,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 04:33:08,309 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 04:33:08,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 04:33:08,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 04:33:08,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 04:33:08,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 04:33:08,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 04:33:08,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 04:33:08,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 04:33:08,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 04:33:08,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 04:33:08,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 04:33:08,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 04:33:08,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 04:33:08,321 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 04:33:08,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 04:33:08,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 04:33:08,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 04:33:08,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 04:33:08,325 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 04:33:08,326 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1b789dd3-f147-40cb-b788-08e7209a0be7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 04:33:08,357 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 04:33:08,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 04:33:08,360 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 04:33:08,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 04:33:08,361 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 04:33:08,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 04:33:08,361 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 04:33:08,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 04:33:08,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 04:33:08,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 04:33:08,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 04:33:08,364 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 04:33:08,364 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 04:33:08,364 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 04:33:08,365 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 04:33:08,365 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 04:33:08,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 04:33:08,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 04:33:08,366 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 04:33:08,366 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 04:33:08,366 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 04:33:08,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:33:08,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 04:33:08,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 04:33:08,367 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 04:33:08,368 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 04:33:08,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 04:33:08,368 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 04:33:08,368 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_1b789dd3-f147-40cb-b788-08e7209a0be7/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 -> 04e0282fb07d3e422f01aa279aee523182698ba7 [2019-11-20 04:33:08,595 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 04:33:08,615 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 04:33:08,619 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 04:33:08,621 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 04:33:08,621 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 04:33:08,622 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1b789dd3-f147-40cb-b788-08e7209a0be7/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_3.cil.c [2019-11-20 04:33:08,700 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1b789dd3-f147-40cb-b788-08e7209a0be7/bin/uautomizer/data/780320a66/26a31b8c906a435b807911135a629609/FLAGb9ca2a8df [2019-11-20 04:33:09,252 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 04:33:09,253 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1b789dd3-f147-40cb-b788-08e7209a0be7/sv-benchmarks/c/ssh-simplified/s3_srvr_3.cil.c [2019-11-20 04:33:09,285 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1b789dd3-f147-40cb-b788-08e7209a0be7/bin/uautomizer/data/780320a66/26a31b8c906a435b807911135a629609/FLAGb9ca2a8df [2019-11-20 04:33:09,520 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1b789dd3-f147-40cb-b788-08e7209a0be7/bin/uautomizer/data/780320a66/26a31b8c906a435b807911135a629609 [2019-11-20 04:33:09,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 04:33:09,526 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 04:33:09,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 04:33:09,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 04:33:09,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 04:33:09,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:33:09" (1/1) ... [2019-11-20 04:33:09,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2141aa35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:09, skipping insertion in model container [2019-11-20 04:33:09,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:33:09" (1/1) ... [2019-11-20 04:33:09,544 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 04:33:09,591 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 04:33:09,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:33:09,963 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 04:33:10,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:33:10,077 INFO L192 MainTranslator]: Completed translation [2019-11-20 04:33:10,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:10 WrapperNode [2019-11-20 04:33:10,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 04:33:10,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 04:33:10,089 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 04:33:10,089 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 04:33:10,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:10" (1/1) ... [2019-11-20 04:33:10,106 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:10" (1/1) ... [2019-11-20 04:33:10,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 04:33:10,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 04:33:10,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 04:33:10,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 04:33:10,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:10" (1/1) ... [2019-11-20 04:33:10,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:10" (1/1) ... [2019-11-20 04:33:10,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:10" (1/1) ... [2019-11-20 04:33:10,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:10" (1/1) ... [2019-11-20 04:33:10,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:10" (1/1) ... [2019-11-20 04:33:10,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:10" (1/1) ... [2019-11-20 04:33:10,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:10" (1/1) ... [2019-11-20 04:33:10,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 04:33:10,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 04:33:10,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 04:33:10,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 04:33:10,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b789dd3-f147-40cb-b788-08e7209a0be7/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-20 04:33:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 04:33:10,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 04:33:10,585 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 04:33:11,327 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-20 04:33:11,327 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-20 04:33:11,329 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 04:33:11,329 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 04:33:11,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:33:11 BoogieIcfgContainer [2019-11-20 04:33:11,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 04:33:11,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 04:33:11,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 04:33:11,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 04:33:11,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:33:09" (1/3) ... [2019-11-20 04:33:11,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64edca87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:33:11, skipping insertion in model container [2019-11-20 04:33:11,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:10" (2/3) ... [2019-11-20 04:33:11,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64edca87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:33:11, skipping insertion in model container [2019-11-20 04:33:11,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:33:11" (3/3) ... [2019-11-20 04:33:11,346 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c [2019-11-20 04:33:11,358 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 04:33:11,368 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 04:33:11,381 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 04:33:11,408 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 04:33:11,408 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 04:33:11,408 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 04:33:11,409 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 04:33:11,409 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 04:33:11,409 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 04:33:11,409 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 04:33:11,409 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 04:33:11,430 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-11-20 04:33:11,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 04:33:11,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:11,442 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-20 04:33:11,442 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:11,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:11,449 INFO L82 PathProgramCache]: Analyzing trace with hash -91604792, now seen corresponding path program 1 times [2019-11-20 04:33:11,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:11,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546003782] [2019-11-20 04:33:11,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:11,723 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-20 04:33:11,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546003782] [2019-11-20 04:33:11,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:11,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:11,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461778776] [2019-11-20 04:33:11,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:11,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:11,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:11,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:11,746 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-11-20 04:33:12,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:12,168 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-11-20 04:33:12,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:12,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-20 04:33:12,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:12,192 INFO L225 Difference]: With dead ends: 327 [2019-11-20 04:33:12,192 INFO L226 Difference]: Without dead ends: 174 [2019-11-20 04:33:12,200 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-20 04:33:12,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-20 04:33:12,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-11-20 04:33:12,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-20 04:33:12,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-11-20 04:33:12,257 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-11-20 04:33:12,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:12,258 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-11-20 04:33:12,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:12,258 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-11-20 04:33:12,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 04:33:12,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:12,261 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-20 04:33:12,261 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:12,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:12,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1448034255, now seen corresponding path program 1 times [2019-11-20 04:33:12,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:12,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761432860] [2019-11-20 04:33:12,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:12,353 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-20 04:33:12,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761432860] [2019-11-20 04:33:12,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:12,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:12,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794293243] [2019-11-20 04:33:12,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:12,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:12,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:12,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:12,357 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-11-20 04:33:12,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:12,625 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-11-20 04:33:12,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:12,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-20 04:33:12,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:12,629 INFO L225 Difference]: With dead ends: 379 [2019-11-20 04:33:12,629 INFO L226 Difference]: Without dead ends: 215 [2019-11-20 04:33:12,631 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-20 04:33:12,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-20 04:33:12,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-11-20 04:33:12,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-20 04:33:12,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-11-20 04:33:12,671 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-11-20 04:33:12,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:12,672 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-11-20 04:33:12,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:12,672 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-11-20 04:33:12,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 04:33:12,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:12,684 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-20 04:33:12,685 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:12,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:12,685 INFO L82 PathProgramCache]: Analyzing trace with hash 564000227, now seen corresponding path program 1 times [2019-11-20 04:33:12,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:12,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232089068] [2019-11-20 04:33:12,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:12,793 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-20 04:33:12,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232089068] [2019-11-20 04:33:12,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:12,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:12,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552047104] [2019-11-20 04:33:12,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:12,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:12,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:12,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:12,797 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-11-20 04:33:13,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:13,006 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-11-20 04:33:13,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:13,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-20 04:33:13,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:13,011 INFO L225 Difference]: With dead ends: 444 [2019-11-20 04:33:13,011 INFO L226 Difference]: Without dead ends: 241 [2019-11-20 04:33:13,012 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-20 04:33:13,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-20 04:33:13,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-11-20 04:33:13,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-20 04:33:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-11-20 04:33:13,040 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-11-20 04:33:13,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:13,041 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-11-20 04:33:13,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:13,041 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-11-20 04:33:13,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 04:33:13,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:13,045 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-20 04:33:13,045 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:13,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:13,046 INFO L82 PathProgramCache]: Analyzing trace with hash 730826777, now seen corresponding path program 1 times [2019-11-20 04:33:13,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:13,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041987415] [2019-11-20 04:33:13,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:13,104 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-20 04:33:13,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041987415] [2019-11-20 04:33:13,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:13,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:13,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532281530] [2019-11-20 04:33:13,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:13,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:13,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:13,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:13,107 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-11-20 04:33:13,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:13,246 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-11-20 04:33:13,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:13,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 04:33:13,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:13,248 INFO L225 Difference]: With dead ends: 492 [2019-11-20 04:33:13,248 INFO L226 Difference]: Without dead ends: 258 [2019-11-20 04:33:13,249 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-20 04:33:13,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-20 04:33:13,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-11-20 04:33:13,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-20 04:33:13,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-11-20 04:33:13,274 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-11-20 04:33:13,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:13,275 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-11-20 04:33:13,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-11-20 04:33:13,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 04:33:13,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:13,279 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-20 04:33:13,280 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:13,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:13,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1628760422, now seen corresponding path program 1 times [2019-11-20 04:33:13,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:13,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059746053] [2019-11-20 04:33:13,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:13,361 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-20 04:33:13,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059746053] [2019-11-20 04:33:13,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:13,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:13,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326001873] [2019-11-20 04:33:13,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:13,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:13,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:13,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:13,363 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-11-20 04:33:13,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:13,589 INFO L93 Difference]: Finished difference Result 551 states and 930 transitions. [2019-11-20 04:33:13,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:13,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 04:33:13,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:13,593 INFO L225 Difference]: With dead ends: 551 [2019-11-20 04:33:13,593 INFO L226 Difference]: Without dead ends: 302 [2019-11-20 04:33:13,594 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-20 04:33:13,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-20 04:33:13,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-11-20 04:33:13,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-20 04:33:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-11-20 04:33:13,609 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-11-20 04:33:13,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:13,609 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-11-20 04:33:13,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-11-20 04:33:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 04:33:13,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:13,612 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-20 04:33:13,612 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:13,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:13,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2100135205, now seen corresponding path program 1 times [2019-11-20 04:33:13,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:13,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358259636] [2019-11-20 04:33:13,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:13,671 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-20 04:33:13,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358259636] [2019-11-20 04:33:13,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:13,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:13,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91574229] [2019-11-20 04:33:13,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:13,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:13,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:13,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:13,675 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-11-20 04:33:13,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:13,843 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-11-20 04:33:13,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:13,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-20 04:33:13,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:13,846 INFO L225 Difference]: With dead ends: 591 [2019-11-20 04:33:13,846 INFO L226 Difference]: Without dead ends: 300 [2019-11-20 04:33:13,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-20 04:33:13,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-11-20 04:33:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-20 04:33:13,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-11-20 04:33:13,860 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-11-20 04:33:13,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:13,861 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-11-20 04:33:13,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:13,861 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-11-20 04:33:13,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 04:33:13,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:13,862 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-20 04:33:13,863 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:13,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:13,863 INFO L82 PathProgramCache]: Analyzing trace with hash 967197197, now seen corresponding path program 1 times [2019-11-20 04:33:13,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:13,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015454332] [2019-11-20 04:33:13,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:13,941 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-20 04:33:13,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015454332] [2019-11-20 04:33:13,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:13,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:13,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186536267] [2019-11-20 04:33:13,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:13,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:13,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:13,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:13,948 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-11-20 04:33:14,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:14,137 INFO L93 Difference]: Finished difference Result 593 states and 994 transitions. [2019-11-20 04:33:14,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:14,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-20 04:33:14,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:14,140 INFO L225 Difference]: With dead ends: 593 [2019-11-20 04:33:14,140 INFO L226 Difference]: Without dead ends: 300 [2019-11-20 04:33:14,141 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-20 04:33:14,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-20 04:33:14,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2019-11-20 04:33:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-20 04:33:14,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-11-20 04:33:14,153 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-11-20 04:33:14,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:14,153 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-11-20 04:33:14,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:14,154 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-11-20 04:33:14,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 04:33:14,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:14,155 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:33:14,155 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:14,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:14,156 INFO L82 PathProgramCache]: Analyzing trace with hash 169031718, now seen corresponding path program 1 times [2019-11-20 04:33:14,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:14,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138853858] [2019-11-20 04:33:14,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:14,191 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-20 04:33:14,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138853858] [2019-11-20 04:33:14,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:14,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:14,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438368779] [2019-11-20 04:33:14,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:14,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:14,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:14,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:14,194 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-11-20 04:33:14,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:14,316 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-11-20 04:33:14,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:14,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-20 04:33:14,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:14,318 INFO L225 Difference]: With dead ends: 594 [2019-11-20 04:33:14,319 INFO L226 Difference]: Without dead ends: 305 [2019-11-20 04:33:14,319 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-20 04:33:14,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-20 04:33:14,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-11-20 04:33:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-20 04:33:14,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-11-20 04:33:14,331 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-11-20 04:33:14,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:14,331 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-11-20 04:33:14,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:14,331 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-11-20 04:33:14,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 04:33:14,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:14,333 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-20 04:33:14,333 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:14,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:14,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1117186876, now seen corresponding path program 1 times [2019-11-20 04:33:14,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:14,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099930473] [2019-11-20 04:33:14,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:14,377 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-20 04:33:14,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099930473] [2019-11-20 04:33:14,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:14,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:14,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586691912] [2019-11-20 04:33:14,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:14,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:14,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:14,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:14,379 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-11-20 04:33:14,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:14,539 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-11-20 04:33:14,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:14,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-20 04:33:14,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:14,542 INFO L225 Difference]: With dead ends: 634 [2019-11-20 04:33:14,542 INFO L226 Difference]: Without dead ends: 336 [2019-11-20 04:33:14,543 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-20 04:33:14,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-20 04:33:14,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-20 04:33:14,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-20 04:33:14,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-11-20 04:33:14,556 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-11-20 04:33:14,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:14,556 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-11-20 04:33:14,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:14,557 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-11-20 04:33:14,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 04:33:14,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:14,558 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-20 04:33:14,558 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:14,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:14,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1355507800, now seen corresponding path program 1 times [2019-11-20 04:33:14,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:14,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696657497] [2019-11-20 04:33:14,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:14,593 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-20 04:33:14,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696657497] [2019-11-20 04:33:14,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:14,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:14,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558268435] [2019-11-20 04:33:14,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:14,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:14,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:14,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:14,595 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-11-20 04:33:14,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:14,776 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-11-20 04:33:14,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:14,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-20 04:33:14,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:14,779 INFO L225 Difference]: With dead ends: 663 [2019-11-20 04:33:14,779 INFO L226 Difference]: Without dead ends: 336 [2019-11-20 04:33:14,780 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-20 04:33:14,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-20 04:33:14,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-20 04:33:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-20 04:33:14,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-11-20 04:33:14,800 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-11-20 04:33:14,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:14,801 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-11-20 04:33:14,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:14,801 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-11-20 04:33:14,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 04:33:14,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:14,803 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:33:14,804 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:14,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:14,804 INFO L82 PathProgramCache]: Analyzing trace with hash 106299532, now seen corresponding path program 1 times [2019-11-20 04:33:14,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:14,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591096470] [2019-11-20 04:33:14,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:14,856 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-20 04:33:14,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591096470] [2019-11-20 04:33:14,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:14,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:14,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544147536] [2019-11-20 04:33:14,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:14,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:14,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:14,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:14,859 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-11-20 04:33:15,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:15,059 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-11-20 04:33:15,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:15,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-20 04:33:15,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:15,062 INFO L225 Difference]: With dead ends: 696 [2019-11-20 04:33:15,062 INFO L226 Difference]: Without dead ends: 369 [2019-11-20 04:33:15,063 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-20 04:33:15,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-20 04:33:15,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-20 04:33:15,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-20 04:33:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-11-20 04:33:15,078 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-11-20 04:33:15,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:15,079 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-11-20 04:33:15,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:15,079 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-11-20 04:33:15,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 04:33:15,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:15,081 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:33:15,081 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:15,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:15,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1523179864, now seen corresponding path program 1 times [2019-11-20 04:33:15,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:15,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910650757] [2019-11-20 04:33:15,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:15,125 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-20 04:33:15,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910650757] [2019-11-20 04:33:15,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:15,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:15,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849610758] [2019-11-20 04:33:15,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:15,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:15,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:15,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:15,128 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-11-20 04:33:15,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:15,305 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-11-20 04:33:15,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:15,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-20 04:33:15,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:15,309 INFO L225 Difference]: With dead ends: 723 [2019-11-20 04:33:15,309 INFO L226 Difference]: Without dead ends: 369 [2019-11-20 04:33:15,310 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-20 04:33:15,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-20 04:33:15,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-20 04:33:15,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-20 04:33:15,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-11-20 04:33:15,329 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-11-20 04:33:15,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:15,329 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-11-20 04:33:15,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:15,329 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-11-20 04:33:15,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 04:33:15,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:15,331 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-20 04:33:15,332 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:15,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:15,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1408209639, now seen corresponding path program 1 times [2019-11-20 04:33:15,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:15,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459045019] [2019-11-20 04:33:15,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:15,382 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-20 04:33:15,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459045019] [2019-11-20 04:33:15,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:15,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:15,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756966715] [2019-11-20 04:33:15,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:15,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:15,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:15,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:15,385 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-11-20 04:33:15,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:15,573 INFO L93 Difference]: Finished difference Result 740 states and 1192 transitions. [2019-11-20 04:33:15,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:15,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-20 04:33:15,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:15,577 INFO L225 Difference]: With dead ends: 740 [2019-11-20 04:33:15,578 INFO L226 Difference]: Without dead ends: 386 [2019-11-20 04:33:15,579 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-20 04:33:15,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-11-20 04:33:15,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-11-20 04:33:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-20 04:33:15,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-11-20 04:33:15,599 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-11-20 04:33:15,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:15,600 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-11-20 04:33:15,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:15,600 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-11-20 04:33:15,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 04:33:15,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:15,602 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-20 04:33:15,602 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:15,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:15,603 INFO L82 PathProgramCache]: Analyzing trace with hash -628608595, now seen corresponding path program 1 times [2019-11-20 04:33:15,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:15,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186225987] [2019-11-20 04:33:15,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:15,661 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-20 04:33:15,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186225987] [2019-11-20 04:33:15,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:15,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:15,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321866397] [2019-11-20 04:33:15,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:15,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:15,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:15,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:15,664 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-11-20 04:33:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:15,870 INFO L93 Difference]: Finished difference Result 761 states and 1215 transitions. [2019-11-20 04:33:15,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:15,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-20 04:33:15,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:15,874 INFO L225 Difference]: With dead ends: 761 [2019-11-20 04:33:15,874 INFO L226 Difference]: Without dead ends: 386 [2019-11-20 04:33:15,876 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-20 04:33:15,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-11-20 04:33:15,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-11-20 04:33:15,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-20 04:33:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-11-20 04:33:15,894 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-11-20 04:33:15,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:15,895 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-11-20 04:33:15,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:15,895 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-11-20 04:33:15,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 04:33:15,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:15,897 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-20 04:33:15,898 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:15,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:15,898 INFO L82 PathProgramCache]: Analyzing trace with hash 543915161, now seen corresponding path program 1 times [2019-11-20 04:33:15,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:15,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542002096] [2019-11-20 04:33:15,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:15,962 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-20 04:33:15,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542002096] [2019-11-20 04:33:15,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:15,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:33:15,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372439659] [2019-11-20 04:33:15,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:15,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:15,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:15,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:15,965 INFO L87 Difference]: Start difference. First operand 382 states and 604 transitions. Second operand 3 states. [2019-11-20 04:33:16,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:16,028 INFO L93 Difference]: Finished difference Result 757 states and 1197 transitions. [2019-11-20 04:33:16,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:16,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-20 04:33:16,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:16,035 INFO L225 Difference]: With dead ends: 757 [2019-11-20 04:33:16,035 INFO L226 Difference]: Without dead ends: 755 [2019-11-20 04:33:16,036 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-20 04:33:16,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-11-20 04:33:16,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-11-20 04:33:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-11-20 04:33:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1195 transitions. [2019-11-20 04:33:16,077 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1195 transitions. Word has length 120 [2019-11-20 04:33:16,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:16,077 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 1195 transitions. [2019-11-20 04:33:16,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:16,078 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1195 transitions. [2019-11-20 04:33:16,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 04:33:16,080 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:16,081 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-20 04:33:16,081 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:16,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:16,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1286959367, now seen corresponding path program 1 times [2019-11-20 04:33:16,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:16,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873134546] [2019-11-20 04:33:16,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:16,138 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-20 04:33:16,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873134546] [2019-11-20 04:33:16,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:16,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:16,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392630418] [2019-11-20 04:33:16,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:16,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:16,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:16,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:16,143 INFO L87 Difference]: Start difference. First operand 755 states and 1195 transitions. Second operand 3 states. [2019-11-20 04:33:16,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:16,343 INFO L93 Difference]: Finished difference Result 1587 states and 2515 transitions. [2019-11-20 04:33:16,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:16,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-20 04:33:16,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:16,348 INFO L225 Difference]: With dead ends: 1587 [2019-11-20 04:33:16,348 INFO L226 Difference]: Without dead ends: 839 [2019-11-20 04:33:16,350 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-20 04:33:16,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-11-20 04:33:16,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 831. [2019-11-20 04:33:16,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-11-20 04:33:16,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1313 transitions. [2019-11-20 04:33:16,383 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1313 transitions. Word has length 121 [2019-11-20 04:33:16,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:16,383 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1313 transitions. [2019-11-20 04:33:16,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:16,383 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1313 transitions. [2019-11-20 04:33:16,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 04:33:16,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:16,386 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, 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] [2019-11-20 04:33:16,386 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:16,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:16,386 INFO L82 PathProgramCache]: Analyzing trace with hash 203437824, now seen corresponding path program 1 times [2019-11-20 04:33:16,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:16,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683719960] [2019-11-20 04:33:16,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:16,422 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-20 04:33:16,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683719960] [2019-11-20 04:33:16,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:16,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:16,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405997810] [2019-11-20 04:33:16,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:16,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:16,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:16,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:16,424 INFO L87 Difference]: Start difference. First operand 831 states and 1313 transitions. Second operand 3 states. [2019-11-20 04:33:16,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:16,618 INFO L93 Difference]: Finished difference Result 1663 states and 2627 transitions. [2019-11-20 04:33:16,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:16,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-20 04:33:16,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:16,623 INFO L225 Difference]: With dead ends: 1663 [2019-11-20 04:33:16,623 INFO L226 Difference]: Without dead ends: 835 [2019-11-20 04:33:16,625 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-20 04:33:16,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-11-20 04:33:16,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 827. [2019-11-20 04:33:16,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-11-20 04:33:16,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1301 transitions. [2019-11-20 04:33:16,660 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1301 transitions. Word has length 122 [2019-11-20 04:33:16,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:16,660 INFO L462 AbstractCegarLoop]: Abstraction has 827 states and 1301 transitions. [2019-11-20 04:33:16,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:16,661 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1301 transitions. [2019-11-20 04:33:16,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-20 04:33:16,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:16,663 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:33:16,664 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:16,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:16,664 INFO L82 PathProgramCache]: Analyzing trace with hash -431636595, now seen corresponding path program 1 times [2019-11-20 04:33:16,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:16,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449846663] [2019-11-20 04:33:16,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:16,708 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-20 04:33:16,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449846663] [2019-11-20 04:33:16,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:16,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:16,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691236677] [2019-11-20 04:33:16,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:16,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:16,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:16,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:16,714 INFO L87 Difference]: Start difference. First operand 827 states and 1301 transitions. Second operand 3 states. [2019-11-20 04:33:16,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:16,889 INFO L93 Difference]: Finished difference Result 1723 states and 2711 transitions. [2019-11-20 04:33:16,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:16,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-20 04:33:16,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:16,895 INFO L225 Difference]: With dead ends: 1723 [2019-11-20 04:33:16,895 INFO L226 Difference]: Without dead ends: 903 [2019-11-20 04:33:16,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-20 04:33:16,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-11-20 04:33:16,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 899. [2019-11-20 04:33:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-11-20 04:33:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1409 transitions. [2019-11-20 04:33:16,930 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1409 transitions. Word has length 154 [2019-11-20 04:33:16,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:16,931 INFO L462 AbstractCegarLoop]: Abstraction has 899 states and 1409 transitions. [2019-11-20 04:33:16,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:16,931 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1409 transitions. [2019-11-20 04:33:16,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-20 04:33:16,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:16,934 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:33:16,934 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:16,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:16,934 INFO L82 PathProgramCache]: Analyzing trace with hash 579021766, now seen corresponding path program 1 times [2019-11-20 04:33:16,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:16,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072788835] [2019-11-20 04:33:16,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:16,979 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-20 04:33:16,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072788835] [2019-11-20 04:33:16,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:16,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:16,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808940868] [2019-11-20 04:33:16,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:16,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:16,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:16,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:16,981 INFO L87 Difference]: Start difference. First operand 899 states and 1409 transitions. Second operand 3 states. [2019-11-20 04:33:17,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:17,155 INFO L93 Difference]: Finished difference Result 1795 states and 2811 transitions. [2019-11-20 04:33:17,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:17,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-20 04:33:17,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:17,161 INFO L225 Difference]: With dead ends: 1795 [2019-11-20 04:33:17,161 INFO L226 Difference]: Without dead ends: 899 [2019-11-20 04:33:17,163 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-20 04:33:17,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-11-20 04:33:17,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 895. [2019-11-20 04:33:17,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-11-20 04:33:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1395 transitions. [2019-11-20 04:33:17,206 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1395 transitions. Word has length 155 [2019-11-20 04:33:17,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:17,206 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1395 transitions. [2019-11-20 04:33:17,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:17,206 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1395 transitions. [2019-11-20 04:33:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-20 04:33:17,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:17,210 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:33:17,211 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:17,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:17,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1624823262, now seen corresponding path program 1 times [2019-11-20 04:33:17,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:17,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969258893] [2019-11-20 04:33:17,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:17,292 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-20 04:33:17,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969258893] [2019-11-20 04:33:17,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:17,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:17,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5356016] [2019-11-20 04:33:17,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:17,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:17,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:17,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:17,295 INFO L87 Difference]: Start difference. First operand 895 states and 1395 transitions. Second operand 3 states. [2019-11-20 04:33:17,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:17,503 INFO L93 Difference]: Finished difference Result 1855 states and 2891 transitions. [2019-11-20 04:33:17,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:17,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-20 04:33:17,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:17,509 INFO L225 Difference]: With dead ends: 1855 [2019-11-20 04:33:17,509 INFO L226 Difference]: Without dead ends: 967 [2019-11-20 04:33:17,511 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-20 04:33:17,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2019-11-20 04:33:17,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 963. [2019-11-20 04:33:17,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-11-20 04:33:17,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1493 transitions. [2019-11-20 04:33:17,552 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1493 transitions. Word has length 185 [2019-11-20 04:33:17,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:17,552 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1493 transitions. [2019-11-20 04:33:17,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:17,552 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1493 transitions. [2019-11-20 04:33:17,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-20 04:33:17,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:17,556 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:33:17,556 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:17,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:17,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1103681317, now seen corresponding path program 1 times [2019-11-20 04:33:17,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:17,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667948064] [2019-11-20 04:33:17,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-20 04:33:17,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667948064] [2019-11-20 04:33:17,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:17,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:17,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114477039] [2019-11-20 04:33:17,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:17,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:17,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:17,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:17,616 INFO L87 Difference]: Start difference. First operand 963 states and 1493 transitions. Second operand 3 states. [2019-11-20 04:33:17,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:17,803 INFO L93 Difference]: Finished difference Result 1923 states and 2979 transitions. [2019-11-20 04:33:17,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:17,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-20 04:33:17,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:17,808 INFO L225 Difference]: With dead ends: 1923 [2019-11-20 04:33:17,809 INFO L226 Difference]: Without dead ends: 963 [2019-11-20 04:33:17,810 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-20 04:33:17,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-11-20 04:33:17,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 959. [2019-11-20 04:33:17,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-11-20 04:33:17,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1477 transitions. [2019-11-20 04:33:17,848 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1477 transitions. Word has length 186 [2019-11-20 04:33:17,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:17,849 INFO L462 AbstractCegarLoop]: Abstraction has 959 states and 1477 transitions. [2019-11-20 04:33:17,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:17,849 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1477 transitions. [2019-11-20 04:33:17,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-20 04:33:17,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:17,853 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:33:17,853 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:17,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:17,853 INFO L82 PathProgramCache]: Analyzing trace with hash 550080402, now seen corresponding path program 1 times [2019-11-20 04:33:17,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:17,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621704999] [2019-11-20 04:33:17,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:17,932 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-20 04:33:17,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621704999] [2019-11-20 04:33:17,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:17,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:17,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417523333] [2019-11-20 04:33:17,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:17,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:17,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:17,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:17,935 INFO L87 Difference]: Start difference. First operand 959 states and 1477 transitions. Second operand 3 states. [2019-11-20 04:33:18,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:18,118 INFO L93 Difference]: Finished difference Result 1987 states and 3067 transitions. [2019-11-20 04:33:18,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:18,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-11-20 04:33:18,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:18,126 INFO L225 Difference]: With dead ends: 1987 [2019-11-20 04:33:18,126 INFO L226 Difference]: Without dead ends: 1035 [2019-11-20 04:33:18,128 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-20 04:33:18,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-11-20 04:33:18,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1009. [2019-11-20 04:33:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-11-20 04:33:18,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1541 transitions. [2019-11-20 04:33:18,177 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1541 transitions. Word has length 203 [2019-11-20 04:33:18,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:18,177 INFO L462 AbstractCegarLoop]: Abstraction has 1009 states and 1541 transitions. [2019-11-20 04:33:18,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:18,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1541 transitions. [2019-11-20 04:33:18,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-20 04:33:18,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:18,182 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:33:18,182 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:18,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:18,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1613413310, now seen corresponding path program 1 times [2019-11-20 04:33:18,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:18,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783007807] [2019-11-20 04:33:18,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-20 04:33:18,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783007807] [2019-11-20 04:33:18,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:18,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:18,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113418068] [2019-11-20 04:33:18,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:18,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:18,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:18,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:18,243 INFO L87 Difference]: Start difference. First operand 1009 states and 1541 transitions. Second operand 3 states. [2019-11-20 04:33:18,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:18,414 INFO L93 Difference]: Finished difference Result 2037 states and 3113 transitions. [2019-11-20 04:33:18,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:18,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-11-20 04:33:18,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:18,420 INFO L225 Difference]: With dead ends: 2037 [2019-11-20 04:33:18,420 INFO L226 Difference]: Without dead ends: 1035 [2019-11-20 04:33:18,422 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-20 04:33:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-11-20 04:33:18,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1009. [2019-11-20 04:33:18,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-11-20 04:33:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1523 transitions. [2019-11-20 04:33:18,459 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1523 transitions. Word has length 204 [2019-11-20 04:33:18,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:18,459 INFO L462 AbstractCegarLoop]: Abstraction has 1009 states and 1523 transitions. [2019-11-20 04:33:18,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:18,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1523 transitions. [2019-11-20 04:33:18,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-20 04:33:18,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:18,464 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:33:18,464 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:18,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:18,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1583018131, now seen corresponding path program 1 times [2019-11-20 04:33:18,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:18,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018524943] [2019-11-20 04:33:18,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:18,523 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-20 04:33:18,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018524943] [2019-11-20 04:33:18,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:18,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:18,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035165816] [2019-11-20 04:33:18,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:18,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:18,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:18,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:18,525 INFO L87 Difference]: Start difference. First operand 1009 states and 1523 transitions. Second operand 3 states. [2019-11-20 04:33:18,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:18,686 INFO L93 Difference]: Finished difference Result 2019 states and 3045 transitions. [2019-11-20 04:33:18,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:18,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-11-20 04:33:18,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:18,692 INFO L225 Difference]: With dead ends: 2019 [2019-11-20 04:33:18,692 INFO L226 Difference]: Without dead ends: 1017 [2019-11-20 04:33:18,694 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-20 04:33:18,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2019-11-20 04:33:18,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1009. [2019-11-20 04:33:18,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-11-20 04:33:18,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1511 transitions. [2019-11-20 04:33:18,746 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1511 transitions. Word has length 216 [2019-11-20 04:33:18,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:18,746 INFO L462 AbstractCegarLoop]: Abstraction has 1009 states and 1511 transitions. [2019-11-20 04:33:18,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:18,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1511 transitions. [2019-11-20 04:33:18,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 04:33:18,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:18,750 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:33:18,750 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:18,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:18,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1099234138, now seen corresponding path program 1 times [2019-11-20 04:33:18,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:18,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183397961] [2019-11-20 04:33:18,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-20 04:33:18,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183397961] [2019-11-20 04:33:18,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:18,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:18,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100400563] [2019-11-20 04:33:18,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:18,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:18,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:18,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:18,811 INFO L87 Difference]: Start difference. First operand 1009 states and 1511 transitions. Second operand 3 states. [2019-11-20 04:33:18,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:18,963 INFO L93 Difference]: Finished difference Result 2019 states and 3021 transitions. [2019-11-20 04:33:18,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:18,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-20 04:33:18,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:18,969 INFO L225 Difference]: With dead ends: 2019 [2019-11-20 04:33:18,969 INFO L226 Difference]: Without dead ends: 999 [2019-11-20 04:33:18,971 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-20 04:33:18,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-11-20 04:33:19,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 991. [2019-11-20 04:33:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-11-20 04:33:19,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1473 transitions. [2019-11-20 04:33:19,006 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1473 transitions. Word has length 217 [2019-11-20 04:33:19,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:19,007 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1473 transitions. [2019-11-20 04:33:19,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:19,007 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1473 transitions. [2019-11-20 04:33:19,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-20 04:33:19,010 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:19,010 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:33:19,011 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:19,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:19,011 INFO L82 PathProgramCache]: Analyzing trace with hash -30789295, now seen corresponding path program 1 times [2019-11-20 04:33:19,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:19,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219997771] [2019-11-20 04:33:19,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:19,070 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-20 04:33:19,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219997771] [2019-11-20 04:33:19,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:19,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:19,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133269419] [2019-11-20 04:33:19,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:19,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:19,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:19,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:19,072 INFO L87 Difference]: Start difference. First operand 991 states and 1473 transitions. Second operand 3 states. [2019-11-20 04:33:19,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:19,214 INFO L93 Difference]: Finished difference Result 2029 states and 3019 transitions. [2019-11-20 04:33:19,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:19,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-11-20 04:33:19,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:19,220 INFO L225 Difference]: With dead ends: 2029 [2019-11-20 04:33:19,221 INFO L226 Difference]: Without dead ends: 1045 [2019-11-20 04:33:19,222 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-20 04:33:19,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-11-20 04:33:19,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1037. [2019-11-20 04:33:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2019-11-20 04:33:19,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1527 transitions. [2019-11-20 04:33:19,258 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1527 transitions. Word has length 224 [2019-11-20 04:33:19,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:19,258 INFO L462 AbstractCegarLoop]: Abstraction has 1037 states and 1527 transitions. [2019-11-20 04:33:19,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:19,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1527 transitions. [2019-11-20 04:33:19,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-11-20 04:33:19,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:19,262 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:33:19,263 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:19,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:19,263 INFO L82 PathProgramCache]: Analyzing trace with hash 812836165, now seen corresponding path program 1 times [2019-11-20 04:33:19,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:19,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118109591] [2019-11-20 04:33:19,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-20 04:33:19,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118109591] [2019-11-20 04:33:19,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:19,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:33:19,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500410905] [2019-11-20 04:33:19,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:19,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:19,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:19,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:19,323 INFO L87 Difference]: Start difference. First operand 1037 states and 1527 transitions. Second operand 3 states. [2019-11-20 04:33:19,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:19,479 INFO L93 Difference]: Finished difference Result 2075 states and 3053 transitions. [2019-11-20 04:33:19,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:19,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-11-20 04:33:19,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:19,485 INFO L225 Difference]: With dead ends: 2075 [2019-11-20 04:33:19,485 INFO L226 Difference]: Without dead ends: 1037 [2019-11-20 04:33:19,487 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-20 04:33:19,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2019-11-20 04:33:19,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1029. [2019-11-20 04:33:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-11-20 04:33:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1495 transitions. [2019-11-20 04:33:19,526 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1495 transitions. Word has length 225 [2019-11-20 04:33:19,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:19,526 INFO L462 AbstractCegarLoop]: Abstraction has 1029 states and 1495 transitions. [2019-11-20 04:33:19,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:19,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1495 transitions. [2019-11-20 04:33:19,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-11-20 04:33:19,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:19,530 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:33:19,531 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:19,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:19,531 INFO L82 PathProgramCache]: Analyzing trace with hash 497301888, now seen corresponding path program 1 times [2019-11-20 04:33:19,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:19,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828377656] [2019-11-20 04:33:19,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:19,625 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-11-20 04:33:19,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828377656] [2019-11-20 04:33:19,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895236975] [2019-11-20 04:33:19,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b789dd3-f147-40cb-b788-08e7209a0be7/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-20 04:33:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:19,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 04:33:19,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:33:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-20 04:33:19,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 04:33:19,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 04:33:19,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826548025] [2019-11-20 04:33:19,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:19,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:19,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:19,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:33:19,917 INFO L87 Difference]: Start difference. First operand 1029 states and 1495 transitions. Second operand 3 states. [2019-11-20 04:33:20,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:20,004 INFO L93 Difference]: Finished difference Result 2561 states and 3720 transitions. [2019-11-20 04:33:20,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:20,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-11-20 04:33:20,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:20,013 INFO L225 Difference]: With dead ends: 2561 [2019-11-20 04:33:20,013 INFO L226 Difference]: Without dead ends: 1539 [2019-11-20 04:33:20,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:33:20,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2019-11-20 04:33:20,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1539. [2019-11-20 04:33:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1539 states. [2019-11-20 04:33:20,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 2235 transitions. [2019-11-20 04:33:20,076 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 2235 transitions. Word has length 261 [2019-11-20 04:33:20,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:20,076 INFO L462 AbstractCegarLoop]: Abstraction has 1539 states and 2235 transitions. [2019-11-20 04:33:20,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:20,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 2235 transitions. [2019-11-20 04:33:20,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-20 04:33:20,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:20,082 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:33:20,285 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:33:20,286 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:20,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:20,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1933393930, now seen corresponding path program 1 times [2019-11-20 04:33:20,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:20,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101971369] [2019-11-20 04:33:20,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:20,418 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-11-20 04:33:20,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101971369] [2019-11-20 04:33:20,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:20,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:33:20,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519293664] [2019-11-20 04:33:20,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:20,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:20,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:20,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:20,420 INFO L87 Difference]: Start difference. First operand 1539 states and 2235 transitions. Second operand 3 states. [2019-11-20 04:33:20,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:20,520 INFO L93 Difference]: Finished difference Result 4522 states and 6563 transitions. [2019-11-20 04:33:20,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:20,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-11-20 04:33:20,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:20,538 INFO L225 Difference]: With dead ends: 4522 [2019-11-20 04:33:20,538 INFO L226 Difference]: Without dead ends: 2990 [2019-11-20 04:33:20,541 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-20 04:33:20,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2019-11-20 04:33:20,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 2988. [2019-11-20 04:33:20,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2988 states. [2019-11-20 04:33:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 4329 transitions. [2019-11-20 04:33:20,661 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 4329 transitions. Word has length 268 [2019-11-20 04:33:20,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:20,662 INFO L462 AbstractCegarLoop]: Abstraction has 2988 states and 4329 transitions. [2019-11-20 04:33:20,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:20,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 4329 transitions. [2019-11-20 04:33:20,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-20 04:33:20,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:20,670 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-20 04:33:20,670 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:20,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:20,670 INFO L82 PathProgramCache]: Analyzing trace with hash -333999477, now seen corresponding path program 1 times [2019-11-20 04:33:20,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:20,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472169297] [2019-11-20 04:33:20,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:20,782 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-20 04:33:20,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472169297] [2019-11-20 04:33:20,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:20,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:33:20,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027250605] [2019-11-20 04:33:20,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:20,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:20,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:20,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:20,784 INFO L87 Difference]: Start difference. First operand 2988 states and 4329 transitions. Second operand 3 states. [2019-11-20 04:33:21,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:21,016 INFO L93 Difference]: Finished difference Result 6089 states and 8839 transitions. [2019-11-20 04:33:21,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:21,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-11-20 04:33:21,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:21,028 INFO L225 Difference]: With dead ends: 6089 [2019-11-20 04:33:21,028 INFO L226 Difference]: Without dead ends: 1991 [2019-11-20 04:33:21,034 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-20 04:33:21,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-11-20 04:33:21,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1971. [2019-11-20 04:33:21,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-11-20 04:33:21,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 2807 transitions. [2019-11-20 04:33:21,110 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 2807 transitions. Word has length 305 [2019-11-20 04:33:21,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:21,110 INFO L462 AbstractCegarLoop]: Abstraction has 1971 states and 2807 transitions. [2019-11-20 04:33:21,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:21,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2807 transitions. [2019-11-20 04:33:21,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-11-20 04:33:21,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:21,118 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, 1, 1] [2019-11-20 04:33:21,118 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:21,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:21,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1127702344, now seen corresponding path program 1 times [2019-11-20 04:33:21,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:21,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130067494] [2019-11-20 04:33:21,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:21,293 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-20 04:33:21,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130067494] [2019-11-20 04:33:21,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038751369] [2019-11-20 04:33:21,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b789dd3-f147-40cb-b788-08e7209a0be7/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-20 04:33:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:21,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 04:33:21,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:33:21,545 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-20 04:33:21,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:33:21,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 04:33:21,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209742699] [2019-11-20 04:33:21,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:33:21,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:21,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:33:21,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:33:21,547 INFO L87 Difference]: Start difference. First operand 1971 states and 2807 transitions. Second operand 4 states. [2019-11-20 04:33:21,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:21,879 INFO L93 Difference]: Finished difference Result 4561 states and 6484 transitions. [2019-11-20 04:33:21,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 04:33:21,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 371 [2019-11-20 04:33:21,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:21,902 INFO L225 Difference]: With dead ends: 4561 [2019-11-20 04:33:21,908 INFO L226 Difference]: Without dead ends: 2553 [2019-11-20 04:33:21,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 373 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-20 04:33:21,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2019-11-20 04:33:21,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 1942. [2019-11-20 04:33:21,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-11-20 04:33:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2683 transitions. [2019-11-20 04:33:21,997 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2683 transitions. Word has length 371 [2019-11-20 04:33:21,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:21,998 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 2683 transitions. [2019-11-20 04:33:21,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:33:21,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2683 transitions. [2019-11-20 04:33:22,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2019-11-20 04:33:22,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:22,012 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:33:22,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:33:22,217 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:22,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:22,218 INFO L82 PathProgramCache]: Analyzing trace with hash -722402039, now seen corresponding path program 1 times [2019-11-20 04:33:22,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:22,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945282738] [2019-11-20 04:33:22,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:22,647 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-20 04:33:22,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945282738] [2019-11-20 04:33:22,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880397492] [2019-11-20 04:33:22,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b789dd3-f147-40cb-b788-08e7209a0be7/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-20 04:33:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:22,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 04:33:22,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:33:23,032 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-20 04:33:23,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:33:23,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 04:33:23,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129095172] [2019-11-20 04:33:23,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:33:23,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:23,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:33:23,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:33:23,035 INFO L87 Difference]: Start difference. First operand 1942 states and 2683 transitions. Second operand 4 states. [2019-11-20 04:33:23,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:23,333 INFO L93 Difference]: Finished difference Result 4797 states and 6654 transitions. [2019-11-20 04:33:23,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:33:23,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 599 [2019-11-20 04:33:23,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:23,339 INFO L225 Difference]: With dead ends: 4797 [2019-11-20 04:33:23,339 INFO L226 Difference]: Without dead ends: 2724 [2019-11-20 04:33:23,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 601 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-20 04:33:23,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2724 states. [2019-11-20 04:33:23,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2724 to 1942. [2019-11-20 04:33:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-11-20 04:33:23,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2683 transitions. [2019-11-20 04:33:23,420 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2683 transitions. Word has length 599 [2019-11-20 04:33:23,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:23,421 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 2683 transitions. [2019-11-20 04:33:23,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:33:23,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2683 transitions. [2019-11-20 04:33:23,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2019-11-20 04:33:23,435 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:23,437 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-20 04:33:23,649 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:33:23,649 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:23,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:23,650 INFO L82 PathProgramCache]: Analyzing trace with hash 914135564, now seen corresponding path program 1 times [2019-11-20 04:33:23,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:23,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231789504] [2019-11-20 04:33:23,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:24,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5249 backedges. 2922 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2019-11-20 04:33:24,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231789504] [2019-11-20 04:33:24,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:24,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:33:24,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310781598] [2019-11-20 04:33:24,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:24,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:24,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:24,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:24,039 INFO L87 Difference]: Start difference. First operand 1942 states and 2683 transitions. Second operand 3 states. [2019-11-20 04:33:24,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:24,247 INFO L93 Difference]: Finished difference Result 3917 states and 5403 transitions. [2019-11-20 04:33:24,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:24,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 669 [2019-11-20 04:33:24,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:24,251 INFO L225 Difference]: With dead ends: 3917 [2019-11-20 04:33:24,252 INFO L226 Difference]: Without dead ends: 1982 [2019-11-20 04:33:24,254 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-20 04:33:24,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2019-11-20 04:33:24,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1942. [2019-11-20 04:33:24,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-11-20 04:33:24,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2663 transitions. [2019-11-20 04:33:24,322 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2663 transitions. Word has length 669 [2019-11-20 04:33:24,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:24,323 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 2663 transitions. [2019-11-20 04:33:24,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:24,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2663 transitions. [2019-11-20 04:33:24,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2019-11-20 04:33:24,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:24,341 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:33:24,341 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:24,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:24,342 INFO L82 PathProgramCache]: Analyzing trace with hash 551234930, now seen corresponding path program 1 times [2019-11-20 04:33:24,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:24,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047156267] [2019-11-20 04:33:24,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 5385 backedges. 2915 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2019-11-20 04:33:24,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047156267] [2019-11-20 04:33:24,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:24,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:33:24,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747548375] [2019-11-20 04:33:24,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:24,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:24,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:24,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:24,758 INFO L87 Difference]: Start difference. First operand 1942 states and 2663 transitions. Second operand 3 states. [2019-11-20 04:33:24,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:24,973 INFO L93 Difference]: Finished difference Result 3892 states and 5332 transitions. [2019-11-20 04:33:24,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:24,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 683 [2019-11-20 04:33:24,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:24,978 INFO L225 Difference]: With dead ends: 3892 [2019-11-20 04:33:24,978 INFO L226 Difference]: Without dead ends: 1957 [2019-11-20 04:33:24,980 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-20 04:33:24,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2019-11-20 04:33:25,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1929. [2019-11-20 04:33:25,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1929 states. [2019-11-20 04:33:25,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2604 transitions. [2019-11-20 04:33:25,047 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2604 transitions. Word has length 683 [2019-11-20 04:33:25,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:25,048 INFO L462 AbstractCegarLoop]: Abstraction has 1929 states and 2604 transitions. [2019-11-20 04:33:25,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:25,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2604 transitions. [2019-11-20 04:33:25,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2019-11-20 04:33:25,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:25,070 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 22, 22, 22, 20, 20, 18, 18, 16, 16, 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, 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-20 04:33:25,070 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:25,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:25,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1986025501, now seen corresponding path program 1 times [2019-11-20 04:33:25,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:25,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432977615] [2019-11-20 04:33:25,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5826 backedges. 3231 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2019-11-20 04:33:25,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432977615] [2019-11-20 04:33:25,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:25,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:33:25,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762066141] [2019-11-20 04:33:25,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:25,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:25,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:25,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:25,453 INFO L87 Difference]: Start difference. First operand 1929 states and 2604 transitions. Second operand 3 states. [2019-11-20 04:33:25,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:25,644 INFO L93 Difference]: Finished difference Result 3921 states and 5296 transitions. [2019-11-20 04:33:25,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:25,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 711 [2019-11-20 04:33:25,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:25,648 INFO L225 Difference]: With dead ends: 3921 [2019-11-20 04:33:25,649 INFO L226 Difference]: Without dead ends: 1981 [2019-11-20 04:33:25,651 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-20 04:33:25,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-11-20 04:33:25,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1971. [2019-11-20 04:33:25,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-11-20 04:33:25,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 2649 transitions. [2019-11-20 04:33:25,714 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 2649 transitions. Word has length 711 [2019-11-20 04:33:25,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:25,715 INFO L462 AbstractCegarLoop]: Abstraction has 1971 states and 2649 transitions. [2019-11-20 04:33:25,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:25,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2649 transitions. [2019-11-20 04:33:25,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2019-11-20 04:33:25,722 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:33:25,723 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 20, 20, 18, 18, 16, 16, 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, 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] [2019-11-20 04:33:25,723 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:33:25,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:33:25,724 INFO L82 PathProgramCache]: Analyzing trace with hash -120199639, now seen corresponding path program 1 times [2019-11-20 04:33:25,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:33:25,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671830525] [2019-11-20 04:33:25,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:33:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:33:26,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5992 backedges. 3254 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2019-11-20 04:33:26,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671830525] [2019-11-20 04:33:26,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:33:26,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:33:26,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855802595] [2019-11-20 04:33:26,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:33:26,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:33:26,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:33:26,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:33:26,084 INFO L87 Difference]: Start difference. First operand 1971 states and 2649 transitions. Second operand 3 states. [2019-11-20 04:33:26,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:33:26,227 INFO L93 Difference]: Finished difference Result 2519 states and 3369 transitions. [2019-11-20 04:33:26,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:33:26,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 726 [2019-11-20 04:33:26,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:33:26,229 INFO L225 Difference]: With dead ends: 2519 [2019-11-20 04:33:26,229 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 04:33:26,232 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-20 04:33:26,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 04:33:26,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 04:33:26,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 04:33:26,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 04:33:26,233 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 726 [2019-11-20 04:33:26,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:33:26,233 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 04:33:26,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:33:26,234 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 04:33:26,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 04:33:26,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 04:33:26,833 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 126 [2019-11-20 04:33:27,243 WARN L191 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 126 [2019-11-20 04:33:28,192 WARN L191 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-20 04:33:28,759 WARN L191 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-20 04:33:29,194 WARN L191 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-20 04:33:29,572 WARN L191 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-11-20 04:33:29,911 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-11-20 04:33:30,381 WARN L191 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-20 04:33:31,189 WARN L191 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-11-20 04:33:31,577 WARN L191 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2019-11-20 04:33:32,390 WARN L191 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-11-20 04:33:32,783 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-20 04:33:33,155 WARN L191 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 89 [2019-11-20 04:33:33,596 WARN L191 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-20 04:33:34,052 WARN L191 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 96 [2019-11-20 04:33:34,524 WARN L191 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-20 04:33:34,927 WARN L191 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-11-20 04:33:35,318 WARN L191 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-20 04:33:35,806 WARN L191 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-20 04:33:36,249 WARN L191 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-20 04:33:36,672 WARN L191 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-20 04:33:37,071 WARN L191 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2019-11-20 04:33:37,075 INFO L447 ceAbstractionStarter]: At program point L597(lines 97 598) the Hoare annotation is: true [2019-11-20 04:33:37,075 INFO L444 ceAbstractionStarter]: For program point L531(lines 531 533) no Hoare annotation was computed. [2019-11-20 04:33:37,075 INFO L444 ceAbstractionStarter]: For program point L465(lines 465 467) no Hoare annotation was computed. [2019-11-20 04:33:37,075 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-11-20 04:33:37,075 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 363) no Hoare annotation was computed. [2019-11-20 04:33:37,075 INFO L440 ceAbstractionStarter]: At program point L201(lines 197 545) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2019-11-20 04:33:37,076 INFO L440 ceAbstractionStarter]: At program point L102(lines 101 577) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-11-20 04:33:37,076 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 543) no Hoare annotation was computed. [2019-11-20 04:33:37,076 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 554) no Hoare annotation was computed. [2019-11-20 04:33:37,076 INFO L444 ceAbstractionStarter]: For program point L137(lines 137 565) no Hoare annotation was computed. [2019-11-20 04:33:37,076 INFO L444 ceAbstractionStarter]: For program point L104(lines 104 576) no Hoare annotation was computed. [2019-11-20 04:33:37,076 INFO L444 ceAbstractionStarter]: For program point L303(lines 303 310) no Hoare annotation was computed. [2019-11-20 04:33:37,076 INFO L444 ceAbstractionStarter]: For program point L303-2(lines 303 310) no Hoare annotation was computed. [2019-11-20 04:33:37,076 INFO L440 ceAbstractionStarter]: At program point L204(lines 203 543) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-20 04:33:37,077 INFO L440 ceAbstractionStarter]: At program point L171(lines 167 555) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 .cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12))) [2019-11-20 04:33:37,077 INFO L440 ceAbstractionStarter]: At program point L138(lines 134 566) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (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)))) [2019-11-20 04:33:37,077 INFO L444 ceAbstractionStarter]: For program point L602(lines 602 604) no Hoare annotation was computed. [2019-11-20 04:33:37,077 INFO L444 ceAbstractionStarter]: For program point L602-2(lines 602 604) no Hoare annotation was computed. [2019-11-20 04:33:37,077 INFO L444 ceAbstractionStarter]: For program point L503(lines 503 506) no Hoare annotation was computed. [2019-11-20 04:33:37,077 INFO L444 ceAbstractionStarter]: For program point L338(lines 338 361) no Hoare annotation was computed. [2019-11-20 04:33:37,078 INFO L440 ceAbstractionStarter]: At program point L206(lines 205 543) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-20 04:33:37,078 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 553) no Hoare annotation was computed. [2019-11-20 04:33:37,078 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 564) no Hoare annotation was computed. [2019-11-20 04:33:37,078 INFO L444 ceAbstractionStarter]: For program point L107(lines 107 575) no Hoare annotation was computed. [2019-11-20 04:33:37,078 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 275) no Hoare annotation was computed. [2019-11-20 04:33:37,078 INFO L444 ceAbstractionStarter]: For program point L273-2(lines 207 540) no Hoare annotation was computed. [2019-11-20 04:33:37,078 INFO L444 ceAbstractionStarter]: For program point L439(lines 439 441) no Hoare annotation was computed. [2019-11-20 04:33:37,078 INFO L444 ceAbstractionStarter]: For program point L307(lines 307 309) no Hoare annotation was computed. [2019-11-20 04:33:37,078 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-20 04:33:37,078 INFO L444 ceAbstractionStarter]: For program point L341-2(lines 341 345) no Hoare annotation was computed. [2019-11-20 04:33:37,079 INFO L444 ceAbstractionStarter]: For program point L242(lines 242 252) no Hoare annotation was computed. [2019-11-20 04:33:37,079 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 552) no Hoare annotation was computed. [2019-11-20 04:33:37,079 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 563) no Hoare annotation was computed. [2019-11-20 04:33:37,079 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 574) no Hoare annotation was computed. [2019-11-20 04:33:37,079 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 476) no Hoare annotation was computed. [2019-11-20 04:33:37,079 INFO L444 ceAbstractionStarter]: For program point L474-2(lines 207 540) no Hoare annotation was computed. [2019-11-20 04:33:37,079 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 407) no Hoare annotation was computed. [2019-11-20 04:33:37,079 INFO L444 ceAbstractionStarter]: For program point L243(lines 243 246) no Hoare annotation was computed. [2019-11-20 04:33:37,079 INFO L440 ceAbstractionStarter]: At program point L210(lines 104 576) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 04:33:37,080 INFO L440 ceAbstractionStarter]: At program point L177(lines 173 553) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 04:33:37,080 INFO L440 ceAbstractionStarter]: At program point L144(lines 140 564) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (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) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 04:33:37,080 INFO L447 ceAbstractionStarter]: At program point L607(lines 10 609) the Hoare annotation is: true [2019-11-20 04:33:37,081 INFO L440 ceAbstractionStarter]: At program point L541(lines 98 596) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse2) (and (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) .cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (and .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 04:33:37,081 INFO L444 ceAbstractionStarter]: For program point L442(lines 442 451) no Hoare annotation was computed. [2019-11-20 04:33:37,081 INFO L444 ceAbstractionStarter]: For program point L376(lines 376 382) no Hoare annotation was computed. [2019-11-20 04:33:37,081 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 551) no Hoare annotation was computed. [2019-11-20 04:33:37,081 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 562) no Hoare annotation was computed. [2019-11-20 04:33:37,081 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 573) no Hoare annotation was computed. [2019-11-20 04:33:37,081 INFO L444 ceAbstractionStarter]: For program point L81(lines 81 87) no Hoare annotation was computed. [2019-11-20 04:33:37,081 INFO L444 ceAbstractionStarter]: For program point L511(lines 511 513) no Hoare annotation was computed. [2019-11-20 04:33:37,081 INFO L444 ceAbstractionStarter]: For program point L578(lines 578 594) no Hoare annotation was computed. [2019-11-20 04:33:37,081 INFO L440 ceAbstractionStarter]: At program point L512(lines 71 608) the Hoare annotation is: false [2019-11-20 04:33:37,085 INFO L444 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-11-20 04:33:37,085 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 217) no Hoare annotation was computed. [2019-11-20 04:33:37,085 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 550) no Hoare annotation was computed. [2019-11-20 04:33:37,085 INFO L444 ceAbstractionStarter]: For program point L149(lines 149 561) no Hoare annotation was computed. [2019-11-20 04:33:37,085 INFO L444 ceAbstractionStarter]: For program point L215-2(lines 215 217) no Hoare annotation was computed. [2019-11-20 04:33:37,086 INFO L444 ceAbstractionStarter]: For program point L116(lines 116 572) no Hoare annotation was computed. [2019-11-20 04:33:37,086 INFO L444 ceAbstractionStarter]: For program point L579(lines 579 593) no Hoare annotation was computed. [2019-11-20 04:33:37,086 INFO L444 ceAbstractionStarter]: For program point L480(lines 480 484) no Hoare annotation was computed. [2019-11-20 04:33:37,086 INFO L444 ceAbstractionStarter]: For program point L480-2(lines 480 484) no Hoare annotation was computed. [2019-11-20 04:33:37,087 INFO L440 ceAbstractionStarter]: At program point L183(lines 179 551) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 04:33:37,087 INFO L440 ceAbstractionStarter]: At program point L150(lines 146 562) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and (<= 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) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 04:33:37,087 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 86) no Hoare annotation was computed. [2019-11-20 04:33:37,088 INFO L444 ceAbstractionStarter]: For program point L84-2(lines 81 87) no Hoare annotation was computed. [2019-11-20 04:33:37,088 INFO L444 ceAbstractionStarter]: For program point L580(lines 580 585) no Hoare annotation was computed. [2019-11-20 04:33:37,088 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2019-11-20 04:33:37,089 INFO L444 ceAbstractionStarter]: For program point L580-2(lines 579 593) no Hoare annotation was computed. [2019-11-20 04:33:37,089 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 357) no Hoare annotation was computed. [2019-11-20 04:33:37,090 INFO L440 ceAbstractionStarter]: At program point L350(lines 326 368) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and (<= 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) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 04:33:37,090 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 04:33:37,091 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 549) no Hoare annotation was computed. [2019-11-20 04:33:37,091 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 560) no Hoare annotation was computed. [2019-11-20 04:33:37,091 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 571) no Hoare annotation was computed. [2019-11-20 04:33:37,091 INFO L444 ceAbstractionStarter]: For program point L582(lines 582 584) no Hoare annotation was computed. [2019-11-20 04:33:37,091 INFO L444 ceAbstractionStarter]: For program point L417(lines 417 419) no Hoare annotation was computed. [2019-11-20 04:33:37,091 INFO L440 ceAbstractionStarter]: At program point L384(lines 375 407) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and (<= 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) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 04:33:37,092 INFO L440 ceAbstractionStarter]: At program point L120(lines 116 572) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 .cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-20 04:33:37,092 INFO L444 ceAbstractionStarter]: For program point L352(lines 352 354) no Hoare annotation was computed. [2019-11-20 04:33:37,092 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 288) no Hoare annotation was computed. [2019-11-20 04:33:37,092 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-11-20 04:33:37,093 INFO L444 ceAbstractionStarter]: For program point L286-2(lines 207 540) no Hoare annotation was computed. [2019-11-20 04:33:37,093 INFO L444 ceAbstractionStarter]: For program point L518(lines 518 522) no Hoare annotation was computed. [2019-11-20 04:33:37,093 INFO L444 ceAbstractionStarter]: For program point L518-2(lines 518 522) no Hoare annotation was computed. [2019-11-20 04:33:37,093 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-11-20 04:33:37,093 INFO L444 ceAbstractionStarter]: For program point L320-2(lines 207 540) no Hoare annotation was computed. [2019-11-20 04:33:37,093 INFO L444 ceAbstractionStarter]: For program point L188(lines 188 548) no Hoare annotation was computed. [2019-11-20 04:33:37,093 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 559) no Hoare annotation was computed. [2019-11-20 04:33:37,094 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 570) no Hoare annotation was computed. [2019-11-20 04:33:37,094 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-11-20 04:33:37,094 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 71 608) no Hoare annotation was computed. [2019-11-20 04:33:37,094 INFO L444 ceAbstractionStarter]: For program point L387(lines 387 405) no Hoare annotation was computed. [2019-11-20 04:33:37,094 INFO L440 ceAbstractionStarter]: At program point L189(lines 185 549) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse14 .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 04:33:37,095 INFO L440 ceAbstractionStarter]: At program point L156(lines 152 560) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and (<= 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) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 04:33:37,095 INFO L440 ceAbstractionStarter]: At program point L123(lines 122 570) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-20 04:33:37,095 INFO L444 ceAbstractionStarter]: For program point L90(lines 90 92) no Hoare annotation was computed. [2019-11-20 04:33:37,095 INFO L447 ceAbstractionStarter]: At program point L619(lines 610 621) the Hoare annotation is: true [2019-11-20 04:33:37,096 INFO L444 ceAbstractionStarter]: For program point L388(lines 388 394) no Hoare annotation was computed. [2019-11-20 04:33:37,096 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 04:33:37,096 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 591) no Hoare annotation was computed. [2019-11-20 04:33:37,096 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 547) no Hoare annotation was computed. [2019-11-20 04:33:37,096 INFO L444 ceAbstractionStarter]: For program point L158(lines 158 558) no Hoare annotation was computed. [2019-11-20 04:33:37,096 INFO L444 ceAbstractionStarter]: For program point L125(lines 125 569) no Hoare annotation was computed. [2019-11-20 04:33:37,096 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 458) no Hoare annotation was computed. [2019-11-20 04:33:37,097 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 260) no Hoare annotation was computed. [2019-11-20 04:33:37,097 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 236) no Hoare annotation was computed. [2019-11-20 04:33:37,097 INFO L444 ceAbstractionStarter]: For program point L225-2(lines 207 540) no Hoare annotation was computed. [2019-11-20 04:33:37,097 INFO L444 ceAbstractionStarter]: For program point L490(lines 490 493) no Hoare annotation was computed. [2019-11-20 04:33:37,097 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 296) no Hoare annotation was computed. [2019-11-20 04:33:37,097 INFO L444 ceAbstractionStarter]: For program point L292-2(lines 292 296) no Hoare annotation was computed. [2019-11-20 04:33:37,097 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 04:33:37,098 INFO L444 ceAbstractionStarter]: For program point L425-1(lines 425 433) no Hoare annotation was computed. [2019-11-20 04:33:37,098 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-11-20 04:33:37,098 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 546) no Hoare annotation was computed. [2019-11-20 04:33:37,098 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 557) no Hoare annotation was computed. [2019-11-20 04:33:37,098 INFO L444 ceAbstractionStarter]: For program point L128(lines 128 568) no Hoare annotation was computed. [2019-11-20 04:33:37,099 INFO L440 ceAbstractionStarter]: At program point L195(lines 191 547) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 .cse17 .cse18 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse19 .cse20 .cse21))) [2019-11-20 04:33:37,099 INFO L440 ceAbstractionStarter]: At program point L162(lines 158 558) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (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) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) [2019-11-20 04:33:37,099 INFO L444 ceAbstractionStarter]: For program point L428(lines 428 431) no Hoare annotation was computed. [2019-11-20 04:33:37,099 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 367) no Hoare annotation was computed. [2019-11-20 04:33:37,099 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 545) no Hoare annotation was computed. [2019-11-20 04:33:37,100 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 556) no Hoare annotation was computed. [2019-11-20 04:33:37,100 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 567) no Hoare annotation was computed. [2019-11-20 04:33:37,100 INFO L440 ceAbstractionStarter]: At program point L98-2(lines 98 596) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse2) (and (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) .cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (and .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 04:33:37,100 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 606) no Hoare annotation was computed. [2019-11-20 04:33:37,100 INFO L444 ceAbstractionStarter]: For program point L528(lines 528 534) no Hoare annotation was computed. [2019-11-20 04:33:37,100 INFO L444 ceAbstractionStarter]: For program point L495(lines 495 497) no Hoare annotation was computed. [2019-11-20 04:33:37,101 INFO L444 ceAbstractionStarter]: For program point L528-1(lines 528 534) no Hoare annotation was computed. [2019-11-20 04:33:37,101 INFO L444 ceAbstractionStarter]: For program point L495-2(lines 207 540) no Hoare annotation was computed. [2019-11-20 04:33:37,101 INFO L440 ceAbstractionStarter]: At program point L396(lines 387 405) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and (<= 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) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 04:33:37,101 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 234) no Hoare annotation was computed. [2019-11-20 04:33:37,102 INFO L440 ceAbstractionStarter]: At program point L165(lines 164 556) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2019-11-20 04:33:37,102 INFO L440 ceAbstractionStarter]: At program point L132(lines 125 569) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse13) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse11 .cse12 .cse13 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 04:33:37,102 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-20 04:33:37,102 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 366) no Hoare annotation was computed. [2019-11-20 04:33:37,103 INFO L444 ceAbstractionStarter]: For program point L332-1(lines 332 366) no Hoare annotation was computed. [2019-11-20 04:33:37,103 INFO L444 ceAbstractionStarter]: For program point L200(lines 200 544) no Hoare annotation was computed. [2019-11-20 04:33:37,104 INFO L444 ceAbstractionStarter]: For program point L167(lines 167 555) no Hoare annotation was computed. [2019-11-20 04:33:37,104 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 566) no Hoare annotation was computed. [2019-11-20 04:33:37,104 INFO L444 ceAbstractionStarter]: For program point L101(lines 101 577) no Hoare annotation was computed. [2019-11-20 04:33:37,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:33:37 BoogieIcfgContainer [2019-11-20 04:33:37,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 04:33:37,183 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 04:33:37,183 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 04:33:37,184 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 04:33:37,184 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:33:11" (3/4) ... [2019-11-20 04:33:37,188 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 04:33:37,216 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 04:33:37,217 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 04:33:37,434 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1b789dd3-f147-40cb-b788-08e7209a0be7/bin/uautomizer/witness.graphml [2019-11-20 04:33:37,434 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 04:33:37,435 INFO L168 Benchmark]: Toolchain (without parser) took 27909.63 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 950.1 MB in the beginning and 1.8 GB in the end (delta: -867.9 MB). Peak memory consumption was 342.6 MB. Max. memory is 11.5 GB. [2019-11-20 04:33:37,436 INFO L168 Benchmark]: CDTParser took 0.67 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-20 04:33:37,436 INFO L168 Benchmark]: CACSL2BoogieTranslator took 561.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-11-20 04:33:37,437 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-20 04:33:37,437 INFO L168 Benchmark]: Boogie Preprocessor took 77.29 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-20 04:33:37,438 INFO L168 Benchmark]: RCFGBuilder took 1096.40 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: 62.0 MB). Peak memory consumption was 62.0 MB. Max. memory is 11.5 GB. [2019-11-20 04:33:37,438 INFO L168 Benchmark]: TraceAbstraction took 25850.98 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -769.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-20 04:33:37,439 INFO L168 Benchmark]: Witness Printer took 250.80 ms. Allocated memory is still 2.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2019-11-20 04:33:37,441 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.67 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 561.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1096.40 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: 62.0 MB). Peak memory consumption was 62.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25850.98 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -769.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 250.80 ms. Allocated memory is still 2.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 606]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((blastFlag <= 2 && !(s__state == 8448)) && s__state <= 8448) || ((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 610]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8545)) && !(s__state == 8448)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8641)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && s__s3__tmp__next_state___0 <= 8576) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || s__state <= 3) || (((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 3 && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8496)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8641)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && s__s3__tmp__next_state___0 <= 8576) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || s__state <= 3) || (((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 12292)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(0 == s__hit)) || (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((blastFlag <= 2 && 8448 <= s__state) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. Result: SAFE, OverallTime: 25.6s, OverallIterations: 36, TraceHistogramMax: 25, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.8s, HoareTripleCheckerStatistics: 5516 SDtfs, 4845 SDslu, 1841 SDs, 0 SdLazy, 3378 SolverSat, 1372 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1317 GetRequests, 1275 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2988occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 36 MinimizatonAttempts, 1659 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 207 NumberOfFragments, 3523 HoareAnnotationTreeSize, 28 FomulaSimplifications, 29289 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 28 FomulaSimplificationsInter, 7804 FormulaSimplificationTreeSizeReductionInter, 9.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 9347 NumberOfCodeBlocks, 9347 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 9308 ConstructedInterpolants, 0 QuantifiedInterpolants, 4566453 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1935 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 39 InterpolantComputations, 34 PerfectInterpolantSequences, 40483/40613 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...